{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s175255742", "group_id": "codeNet:p02269", "input_text": "fun main(args: Array){\n val n = readLine()!!.toInt()\n val dict = Dict()\n repeat(n){\n val (query, s) = readLine()!!.split(' ')\n if(query == \"insert\"){dict.insert(s)}\n else if(query == \"find\") println(if (dict.find(s)) \"yes\" else \"no\")\n }\n}\n\nclass Dict{\n private val arr = IntArray(30000000){ -1 }\n fun insert(element: String){\n arr[hash(element)] = 1\n }\n fun find(element: String): Boolean{\n return arr[hash(element)] == 1\n }\n}\n\nfun Int.pow(n: Int): Int = if(n == 0) 1 else this*this.pow(n-1)\n\nfun hash(s: String): Int{\n var ret = 0\n for(i in 0 until s.length){\n val digit = when(s[i]){\n 'A' -> 1\n 'C' -> 2\n 'G' -> 3\n 'T' -> 4\n else -> 0\n }\n ret += 5.pow(i) * digit\n }\n return ret\n}\n", "language": "Kotlin", "metadata": {"date": 1563774440, "filename_ext": "kt", "original_language": "Kotlin", "problem_description_relpath": "problem_descriptions/p02269.html", "problem_id": "p02269", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02269/input.txt", "sample_output_relpath": "derived/input_output/data/p02269/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02269/Kotlin/s175255742.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s175255742", "user_id": "u582901257"}, "prompt_components": {"gold_output": "no\nyes\n", "input_to_evaluate": "fun main(args: Array){\n val n = readLine()!!.toInt()\n val dict = Dict()\n repeat(n){\n val (query, s) = readLine()!!.split(' ')\n if(query == \"insert\"){dict.insert(s)}\n else if(query == \"find\") println(if (dict.find(s)) \"yes\" else \"no\")\n }\n}\n\nclass Dict{\n private val arr = IntArray(30000000){ -1 }\n fun insert(element: String){\n arr[hash(element)] = 1\n }\n fun find(element: String): Boolean{\n return arr[hash(element)] == 1\n }\n}\n\nfun Int.pow(n: Int): Int = if(n == 0) 1 else this*this.pow(n-1)\n\nfun hash(s: String): Int{\n var ret = 0\n for(i in 0 until s.length){\n val digit = when(s[i]){\n 'A' -> 1\n 'C' -> 2\n 'G' -> 3\n 'T' -> 4\n else -> 0\n }\n ret += 5.pow(i) * digit\n }\n return ret\n}\n", "problem_context": "Search III\n\nYour task is to write a program of a simple dictionary which implements the following instructions:\n\ninsert str: insert a string str in to the dictionary\n\nfind str: if the distionary contains str, then print 'yes', otherwise print 'no'\n\nInput\n\nIn the first line n, the number of instructions is given. In the following n lines, n instructions are given in the above mentioned format.\n\nOutput\n\nPrint yes or no for each find instruction in a line.\n\nConstraints\n\nA string consists of 'A', 'C', 'G', or 'T'\n\n1 ≤ length of a string ≤ 12\n\nn ≤ 1000000\n\nSample Input 1\n\n5\ninsert A\ninsert T\ninsert C\nfind G\nfind A\n\nSample Output 1\n\nno\nyes\n\nSample Input 2\n\n13\ninsert AAA\ninsert AAC\ninsert AGA\ninsert AGG\ninsert TTT\nfind AAA\nfind CCC\nfind CCC\ninsert CCC\nfind CCC\ninsert T\nfind TTT\nfind T\n\nSample Output 2\n\nyes\nno\nno\nyes\nyes\nyes\n\nNotes\n\nTemplate in C", "sample_input": "5\ninsert A\ninsert T\ninsert C\nfind G\nfind A\n"}, "reference_outputs": ["no\nyes\n"], "source_document_id": "p02269", "source_text": "Search III\n\nYour task is to write a program of a simple dictionary which implements the following instructions:\n\ninsert str: insert a string str in to the dictionary\n\nfind str: if the distionary contains str, then print 'yes', otherwise print 'no'\n\nInput\n\nIn the first line n, the number of instructions is given. In the following n lines, n instructions are given in the above mentioned format.\n\nOutput\n\nPrint yes or no for each find instruction in a line.\n\nConstraints\n\nA string consists of 'A', 'C', 'G', or 'T'\n\n1 ≤ length of a string ≤ 12\n\nn ≤ 1000000\n\nSample Input 1\n\n5\ninsert A\ninsert T\ninsert C\nfind G\nfind A\n\nSample Output 1\n\nno\nyes\n\nSample Input 2\n\n13\ninsert AAA\ninsert AAC\ninsert AGA\ninsert AGG\ninsert TTT\nfind AAA\nfind CCC\nfind CCC\ninsert CCC\nfind CCC\ninsert T\nfind TTT\nfind T\n\nSample Output 2\n\nyes\nno\nno\nyes\nyes\nyes\n\nNotes\n\nTemplate in C", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 840, "cpu_time_ms": 2230, "memory_kb": 284068}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s997756573", "group_id": "codeNet:p02572", "input_text": "import kotlin.math.pow\n\nfun main(args: Array) {\n\treadLine()\n\tval aList = readLine()?.split(\" \")?.map {it.toLong()} ?: return\n\t\n\tvar sum: Long = 0\n\tvar tempSum: Long = 0\n\tfor (i in aList.indices) {\n\t\tfor (j in (i+1) until aList.size) {\n\t\t\ttempSum += aList[j]\n\t\t}\n\t\ttempSum %= (10.0.pow(9)+7).toLong()\n\t\tsum = (sum + (aList[i] * tempSum)) % ((10.0.pow(9)+7).toLong())\n\t\ttempSum = 0\n\t}\n\t\n\tprintln(sum)\n}", "language": "Kotlin", "metadata": {"date": 1599727493, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s997756573.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s997756573", "user_id": "u815731054"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "import kotlin.math.pow\n\nfun main(args: Array) {\n\treadLine()\n\tval aList = readLine()?.split(\" \")?.map {it.toLong()} ?: return\n\t\n\tvar sum: Long = 0\n\tvar tempSum: Long = 0\n\tfor (i in aList.indices) {\n\t\tfor (j in (i+1) until aList.size) {\n\t\t\ttempSum += aList[j]\n\t\t}\n\t\ttempSum %= (10.0.pow(9)+7).toLong()\n\t\tsum = (sum + (aList[i] * tempSum)) % ((10.0.pow(9)+7).toLong())\n\t\ttempSum = 0\n\t}\n\t\n\tprintln(sum)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 408, "cpu_time_ms": 2208, "memory_kb": 65620}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s516924242", "group_id": "codeNet:p02572", "input_text": "fun main(){\n val n = readLine()!!.split(\" \")[0].toInt()\n val a = readLine()!!.split(\" \").map { it.toDouble() }\n var total = 0.toDouble()\n for (i in 0 until n){\n total += a[i]\n }\n var ans = 0.toDouble()\n for (i in 0 until n){\n total -= a[i]\n ans += ((total % 1000000007) * a[i]) % 1000000007\n }\n println(ans.toInt() % 1000000007)\n}", "language": "Kotlin", "metadata": {"date": 1599582457, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s516924242.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s516924242", "user_id": "u385678999"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "fun main(){\n val n = readLine()!!.split(\" \")[0].toInt()\n val a = readLine()!!.split(\" \").map { it.toDouble() }\n var total = 0.toDouble()\n for (i in 0 until n){\n total += a[i]\n }\n var ans = 0.toDouble()\n for (i in 0 until n){\n total -= a[i]\n ans += ((total % 1000000007) * a[i]) % 1000000007\n }\n println(ans.toInt() % 1000000007)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 378, "cpu_time_ms": 447, "memory_kb": 74592}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s359091073", "group_id": "codeNet:p02572", "input_text": "fun main(args: Array) {\n Program().solve()\n}\n\nclass Program {\n fun solve() {\n val sc = MyScanner()\n val n = sc.nextInt()\n val a = sc.intList()\n\n var sum = ModInt(0)\n var sum2 = ModInt(0)\n\n for (i in 0 until n) {\n sum += a[i];\n sum2 += a[i].toLong() * a[i]\n }\n\n val t = sum * sum - sum2\n println(t / 2)\n }\n}\n\nclass ModInt(_num: Number) : Number() {\n companion object {\n const val mod: Long = 1000000007L\n }\n\n private val num: Long = if (_num.toLong() < 0) (_num.toLong() % mod) + mod else _num.toLong() % mod\n operator fun plus(right: Number) = ModInt(num + (right.toLong() % mod))\n operator fun minus(right: Number) = ModInt(num - (right.toLong() % mod))\n operator fun times(right: Number) = ModInt(num * (right.toLong() % mod))\n\n // modが素数の時のみ\n operator fun div(right: Number) = this * ModInt(right).inverse()\n\n fun power(n: Number): ModInt {\n var a = this\n var result = ModInt(1)\n var tmp = n.toLong()\n while (tmp > 0) {\n if (tmp % 2 == 1L) {\n result *= a\n }\n tmp /= 2\n a *= a\n }\n return result\n }\n\n // modが素数のときのみ 逆元\n fun inverse(): ModInt {\n return power(mod - 2L)\n }\n\n override fun toString() = num.toString()\n override fun toInt() = num.toInt()\n override fun toLong() = num\n override fun toByte() = num.toByte()\n override fun toChar() = num.toChar()\n override fun toDouble() = num.toDouble()\n override fun toFloat() = num.toFloat()\n override fun toShort() = num.toShort()\n}\n\nclass MyScanner {\n private var ptr = 0\n private var l = listOf()\n\n fun next(): String {\n while (l.size <= ptr) {\n l = readLine()!!.split(' ')\n ptr = 0\n }\n return l[ptr++]\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextDouble() = next().toDouble()\n fun nextCharArray() = next().toCharArray()\n fun nextChar() = next()[0]\n\n fun list(): List {\n ptr = l.size\n return readLine()!!.split(' ')\n }\n\n fun intList() = list().map { s -> s.toInt() }\n fun longList() = list().map { s -> s.toLong() }\n fun doubleList() = list().map { s -> s.toDouble() }\n\n fun array() = list().toTypedArray()\n fun intArray() = intList().toIntArray()\n fun longArray() = longList().toLongArray()\n fun doubleArray() = doubleList().toDoubleArray()\n}\n", "language": "Kotlin", "metadata": {"date": 1599420862, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s359091073.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359091073", "user_id": "u194412908"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "fun main(args: Array) {\n Program().solve()\n}\n\nclass Program {\n fun solve() {\n val sc = MyScanner()\n val n = sc.nextInt()\n val a = sc.intList()\n\n var sum = ModInt(0)\n var sum2 = ModInt(0)\n\n for (i in 0 until n) {\n sum += a[i];\n sum2 += a[i].toLong() * a[i]\n }\n\n val t = sum * sum - sum2\n println(t / 2)\n }\n}\n\nclass ModInt(_num: Number) : Number() {\n companion object {\n const val mod: Long = 1000000007L\n }\n\n private val num: Long = if (_num.toLong() < 0) (_num.toLong() % mod) + mod else _num.toLong() % mod\n operator fun plus(right: Number) = ModInt(num + (right.toLong() % mod))\n operator fun minus(right: Number) = ModInt(num - (right.toLong() % mod))\n operator fun times(right: Number) = ModInt(num * (right.toLong() % mod))\n\n // modが素数の時のみ\n operator fun div(right: Number) = this * ModInt(right).inverse()\n\n fun power(n: Number): ModInt {\n var a = this\n var result = ModInt(1)\n var tmp = n.toLong()\n while (tmp > 0) {\n if (tmp % 2 == 1L) {\n result *= a\n }\n tmp /= 2\n a *= a\n }\n return result\n }\n\n // modが素数のときのみ 逆元\n fun inverse(): ModInt {\n return power(mod - 2L)\n }\n\n override fun toString() = num.toString()\n override fun toInt() = num.toInt()\n override fun toLong() = num\n override fun toByte() = num.toByte()\n override fun toChar() = num.toChar()\n override fun toDouble() = num.toDouble()\n override fun toFloat() = num.toFloat()\n override fun toShort() = num.toShort()\n}\n\nclass MyScanner {\n private var ptr = 0\n private var l = listOf()\n\n fun next(): String {\n while (l.size <= ptr) {\n l = readLine()!!.split(' ')\n ptr = 0\n }\n return l[ptr++]\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextDouble() = next().toDouble()\n fun nextCharArray() = next().toCharArray()\n fun nextChar() = next()[0]\n\n fun list(): List {\n ptr = l.size\n return readLine()!!.split(' ')\n }\n\n fun intList() = list().map { s -> s.toInt() }\n fun longList() = list().map { s -> s.toLong() }\n fun doubleList() = list().map { s -> s.toDouble() }\n\n fun array() = list().toTypedArray()\n fun intArray() = intList().toIntArray()\n fun longArray() = longList().toLongArray()\n fun doubleArray() = doubleList().toDoubleArray()\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2568, "cpu_time_ms": 437, "memory_kb": 69716}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s763289566", "group_id": "codeNet:p02572", "input_text": "import java.io.BufferedReader\nimport java.io.IOException\nimport java.io.InputStreamReader\nimport java.util.*\nimport kotlin.math.*\n\nfun main() {\n var fs = Atcoder.FastReader()\n var n = fs.nextInt()\n var a = fs.readLongArray(n)\n var sum:Long = 0\n for (i in 0 until a.size) {\n sum += a[i]\n }\n var ans:Long = 0\n for (i in 0..a.size - 2) {\n sum -= a[i]\n ans += a[i]*sum\n ans %= 1000000007\n }\n println(ans)\n\n\n}\n\nclass Atcoder {\n internal class FastReader {\n private var br: BufferedReader = BufferedReader(InputStreamReader(System.`in`))\n private var st: StringTokenizer? = null\n\n operator fun next(): String {\n while (st == null || !st!!.hasMoreElements()) {\n try {\n st = StringTokenizer(br.readLine())\n } catch (e: IOException) {\n e.printStackTrace()\n }\n\n }\n return st!!.nextToken()\n }\n\n fun nextInt(): Int {\n return Integer.parseInt(next())\n }\n\n fun nextLong(): Long {\n return java.lang.Long.parseLong(next())\n }\n\n fun nextDouble(): Double {\n return java.lang.Double.parseDouble(next())\n }\n\n fun nextLine(): String {\n var str = \"\"\n try {\n str = br.readLine()\n } catch (e: IOException) {\n e.printStackTrace()\n }\n return str\n }\n\n fun readIntArray(n: Int): IntArray {\n val a = IntArray(n)\n for (i in 0 until n) a[i] = nextInt()\n return a\n }\n\n fun readLongArray(n: Int): LongArray {\n val a = LongArray(n)\n for (i in 0 until n) a[i] = nextLong()\n return a\n }\n\n fun readDoubleArray(n: Int): DoubleArray {\n val a = DoubleArray(n)\n for (i in 0 until n) a[i] = nextDouble()\n return a\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1598917807, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s763289566.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s763289566", "user_id": "u843609965"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.IOException\nimport java.io.InputStreamReader\nimport java.util.*\nimport kotlin.math.*\n\nfun main() {\n var fs = Atcoder.FastReader()\n var n = fs.nextInt()\n var a = fs.readLongArray(n)\n var sum:Long = 0\n for (i in 0 until a.size) {\n sum += a[i]\n }\n var ans:Long = 0\n for (i in 0..a.size - 2) {\n sum -= a[i]\n ans += a[i]*sum\n ans %= 1000000007\n }\n println(ans)\n\n\n}\n\nclass Atcoder {\n internal class FastReader {\n private var br: BufferedReader = BufferedReader(InputStreamReader(System.`in`))\n private var st: StringTokenizer? = null\n\n operator fun next(): String {\n while (st == null || !st!!.hasMoreElements()) {\n try {\n st = StringTokenizer(br.readLine())\n } catch (e: IOException) {\n e.printStackTrace()\n }\n\n }\n return st!!.nextToken()\n }\n\n fun nextInt(): Int {\n return Integer.parseInt(next())\n }\n\n fun nextLong(): Long {\n return java.lang.Long.parseLong(next())\n }\n\n fun nextDouble(): Double {\n return java.lang.Double.parseDouble(next())\n }\n\n fun nextLine(): String {\n var str = \"\"\n try {\n str = br.readLine()\n } catch (e: IOException) {\n e.printStackTrace()\n }\n return str\n }\n\n fun readIntArray(n: Int): IntArray {\n val a = IntArray(n)\n for (i in 0 until n) a[i] = nextInt()\n return a\n }\n\n fun readLongArray(n: Int): LongArray {\n val a = LongArray(n)\n for (i in 0 until n) a[i] = nextLong()\n return a\n }\n\n fun readDoubleArray(n: Int): DoubleArray {\n val a = DoubleArray(n)\n for (i in 0 until n) a[i] = nextDouble()\n return a\n }\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2003, "cpu_time_ms": 261, "memory_kb": 57520}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s198944298", "group_id": "codeNet:p02572", "input_text": "fun main() {\n val mod = 1000000007L\n readLine()\n val x = readLine()!!.split(\" \").map(String::toLong)\n val s = x.toMutableList()\n\n (1 until x.size).forEach { i -> s[i] += s[i - 1] }\n\n x.indices.map { i -> (x[i] * (s.last() - s[i])).rem(mod) }\n .reduce { acc, i -> (acc + i).rem(mod) }\n .let { println(it) }\n}\n", "language": "Kotlin", "metadata": {"date": 1598822951, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s198944298.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s198944298", "user_id": "u831422608"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "fun main() {\n val mod = 1000000007L\n readLine()\n val x = readLine()!!.split(\" \").map(String::toLong)\n val s = x.toMutableList()\n\n (1 until x.size).forEach { i -> s[i] += s[i - 1] }\n\n x.indices.map { i -> (x[i] * (s.last() - s[i])).rem(mod) }\n .reduce { acc, i -> (acc + i).rem(mod) }\n .let { println(it) }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 349, "cpu_time_ms": 481, "memory_kb": 76616}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s617497727", "group_id": "codeNet:p02572", "input_text": "fun main() {\n readLine()\n val x = readLine()!!.split(\" \").map(String::toLong)\n val s = x.toMutableList()\n\n (1 until x.size).forEach { i -> s[i] = (s[i] + s[i - 1]).rem(1000000007) }\n\n x.indices.map { i -> (x[i] * (s.last() - s[i])).rem(1000000007) }\n .reduce { acc, i -> (acc + i).rem(1000000007) }\n .let { println(it) }\n}\n", "language": "Kotlin", "metadata": {"date": 1598818686, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s617497727.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s617497727", "user_id": "u831422608"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "fun main() {\n readLine()\n val x = readLine()!!.split(\" \").map(String::toLong)\n val s = x.toMutableList()\n\n (1 until x.size).forEach { i -> s[i] = (s[i] + s[i - 1]).rem(1000000007) }\n\n x.indices.map { i -> (x[i] * (s.last() - s[i])).rem(1000000007) }\n .reduce { acc, i -> (acc + i).rem(1000000007) }\n .let { println(it) }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 361, "cpu_time_ms": 468, "memory_kb": 76812}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s365861538", "group_id": "codeNet:p02572", "input_text": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.File\nimport java.io.PrintWriter\nimport java.util.Arrays\nimport java.util.NoSuchElementException\nimport java.util.TreeMap\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\nfun PrintWriter.solve() {\n// val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n// print(\"Case #$case: \")\n\n val n = readInt()\n val A = ModIntArray(readIntArray(n))\n\n val S = ModIntArray(n)\n S[n-1] = A[n-1]\n for(i in n-2 downTo 1) S[i] = S[i+1] + A[i]\n\n val ans = (0 until n-1).sumByModInt { i ->\n A[i] * S[i+1]\n }\n\n println(ans.int)\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\nconst val BILLION7 = 1e9.toInt() + 7\nconst val MOD = BILLION7\nconst val TOTIENT = MOD - 1 // assumes MOD is prime\n\ninfix fun Int.modulo(mod: Int): Int = (this % mod).let { (it shr Int.SIZE_BITS - 1 and mod) + it }\ninfix fun Long.modulo(mod: Long) = (this % mod).let { (it shr Long.SIZE_BITS - 1 and mod) + it }\ninfix fun Long.modulo(mod: Int) = modulo(mod.toLong()).toInt()\n\nfun Int.mulMod(other: Int, mod: Int) = toLong() * other modulo mod\n\nfun Int.powMod(exponent: Long, mod: Int): Int {\n if(exponent < 0) error(\"Inverse not implemented\")\n var res = 1L\n var e = exponent\n var b = modulo(mod).toLong()\n\n while(e > 0) {\n if(e and 1 == 1L) {\n res = res * b % mod\n }\n e = e shr 1\n b = b * b % mod\n }\n return res.toInt()\n}\nfun Int.powMod(exponent: Int, mod: Int) = powMod(exponent.toLong(), mod)\nfun Int.modPowArray(n: Int, mod: Int): IntArray {\n val res = IntArray(n+1)\n res[0] = 1\n for(i in 1..n) res[i] = mulMod(res[i-1], mod)\n return res\n}\n\ninline fun Int.toModInt() = ModInt(this modulo MOD)\ninline fun Long.toModInt() = ModInt(this modulo MOD)\n\n/** note: Only use constructor for int within modulo range, otherwise use toModInt **/\ninline class ModInt(val int: Int) {\n companion object {\n /** can't seem to make these private or inlined without causing compiler issues */\n @JvmField val _invMemo = HashMap()\n fun _invMemoized(m: ModInt) = _invMemo.getOrPut(m) { m.inv_unmemoized() }\n }\n\n // normalizes an integer that's within range [-MOD, MOD) without branching\n private inline fun normalize(int: Int) = ModInt((int shr Int.SIZE_BITS - 1 and MOD) + int)\n\n operator fun plus(other: ModInt) = normalize(int + other.int - MOD) // overflow-safe even if MOD >= 2^30\n inline operator fun plus(other: Int) = plus(other.toModInt())\n operator fun inc() = normalize(int + (1 - MOD))\n\n operator fun minus(other: ModInt) = normalize(int - other.int)\n inline operator fun minus(other: Int) = minus(other.toModInt())\n operator fun dec() = normalize(int - 1)\n operator fun unaryMinus() = normalize(-int)\n\n operator fun times(other: ModInt) = ModInt((int.toLong() * other.int % MOD).toInt())\n inline operator fun times(other: Int) = ModInt(int.mulMod(other, MOD))\n\n fun pow(exponent: Int): ModInt {\n val e = if(exponent < 0) {\n require(int != 0) { \"Can't invert/divide by 0\" }\n exponent modulo TOTIENT\n } else exponent\n return ModInt(int.powMod(e, MOD))\n }\n\n fun pow(exponent: Long) = if(int == 0) when {\n exponent > 0 -> this\n exponent == 0L -> ModInt(1)\n else -> error(\"Can't invert/divide by 0\")\n } else pow(exponent modulo TOTIENT)\n\n inline fun inverse() = inv_memoized() /** NOTE: Change if necessary */\n\n fun inv_unmemoized(): ModInt {\n require(int != 0) { \"Can't invert/divide by 0\" }\n return pow(TOTIENT - 1)\n }\n inline fun inv_memoized() = _invMemoized(this)\n\n operator fun div(other: ModInt) = times(other.inverse())\n inline operator fun div(other: Int) = div(other.toModInt())\n\n override inline fun toString() = int.toString()\n}\n\ninline operator fun Int.plus(modInt: ModInt) = modInt + this\ninline operator fun Int.minus(modInt: ModInt) = toModInt() - modInt\ninline operator fun Int.times(modInt: ModInt) = modInt * this\ninline operator fun Int.div(modInt: ModInt) = modInt.inverse() * this\n\ninline class ModIntArray(val intArray: IntArray): Collection {\n inline operator fun get(i: Int) = ModInt(intArray[i])\n inline operator fun set(i: Int, v: ModInt) { intArray[i] = v.int }\n\n override inline val size: Int get() = intArray.size\n inline val lastIndex get() = intArray.lastIndex\n inline val indices get() = intArray.indices\n\n override inline fun contains(element: ModInt): Boolean = element.int in intArray\n\n override fun containsAll(elements: Collection): Boolean = elements.all(::contains)\n\n override inline fun isEmpty(): Boolean = intArray.isEmpty()\n\n override fun iterator(): Iterator = object: Iterator {\n var index = 0\n override fun hasNext(): Boolean = index < size\n override fun next(): ModInt = get(index++)\n }\n\n fun copyOf(newSize: Int) = ModIntArray(intArray.copyOf(newSize))\n fun copyOf() = copyOf(size)\n}\nfun ModIntArray.copyInto(destination: ModIntArray, destinationOffset: Int = 0, startIndex: Int = 0, endIndex: Int = size) =\n ModIntArray(intArray.copyInto(destination.intArray, destinationOffset, startIndex, endIndex))\ninline fun ModIntArray(size: Int) = ModIntArray(IntArray(size))\ninline fun ModIntArray(size: Int, init: (Int) -> ModInt) = ModIntArray(IntArray(size) { init(it).int })\n\nfun ModInt.powArray(n: Int) = ModIntArray(int.modPowArray(n, MOD))\n\ninline fun ModIntArray.first() = get(0)\ninline fun ModIntArray.last() = get(lastIndex)\ninline fun ModIntArray.joinToString(separator: CharSequence) = intArray.joinToString(separator)\ninline fun ModIntArray.fold(init: R, op: (acc: R, ModInt) -> R) = intArray.fold(init) { acc, i -> op(acc, ModInt(i)) }\ninline fun ModIntArray.foldRight(init: R, op: (ModInt, acc: R) -> R) = intArray.foldRight(init) { i, acc -> op(ModInt(i), acc) }\nfun ModIntArray.sum() = fold(ModInt(0), ModInt::plus)\nfun ModIntArray.product() = fold(ModInt(1), ModInt::times)\n\ninline fun Iterable.sumByModInt(func: (T) -> ModInt) = fold(ModInt(0)) { acc, t -> acc + func(t) }\ninline fun Iterable.productByModInt(func: (T) -> ModInt) = fold(ModInt(1)) { acc, t -> acc * func(t) }\ninline fun Sequence.sumByModInt(func: (T) -> ModInt) = fold(ModInt(0)) { acc, t -> acc + func(t) }\ninline fun Sequence.productByModInt(func: (T) -> ModInt) = fold(ModInt(1)) { acc, t -> acc * func(t) }\ninline fun Array.sumByModInt(func: (T) -> ModInt) = fold(ModInt(0)) { acc, t -> acc + func(t) }\ninline fun Array.productByModInt(func: (T) -> ModInt) = fold(ModInt(1)) { acc, t -> acc * func(t) }\nfun Iterable.sum() = sumByModInt { it }\nfun Sequence.sum() = sumByModInt { it }\nfun Iterable.product() = productByModInt { it }\nfun Sequence.product() = productByModInt { it }\nfun Collection.toModIntArray() = ModIntArray(size).also { var i = 0; for(e in this) { it[i++] = e } }\n\n\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "language": "Kotlin", "metadata": {"date": 1598816381, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s365861538.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s365861538", "user_id": "u596111103"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.File\nimport java.io.PrintWriter\nimport java.util.Arrays\nimport java.util.NoSuchElementException\nimport java.util.TreeMap\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\nfun PrintWriter.solve() {\n// val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n// print(\"Case #$case: \")\n\n val n = readInt()\n val A = ModIntArray(readIntArray(n))\n\n val S = ModIntArray(n)\n S[n-1] = A[n-1]\n for(i in n-2 downTo 1) S[i] = S[i+1] + A[i]\n\n val ans = (0 until n-1).sumByModInt { i ->\n A[i] * S[i+1]\n }\n\n println(ans.int)\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\nconst val BILLION7 = 1e9.toInt() + 7\nconst val MOD = BILLION7\nconst val TOTIENT = MOD - 1 // assumes MOD is prime\n\ninfix fun Int.modulo(mod: Int): Int = (this % mod).let { (it shr Int.SIZE_BITS - 1 and mod) + it }\ninfix fun Long.modulo(mod: Long) = (this % mod).let { (it shr Long.SIZE_BITS - 1 and mod) + it }\ninfix fun Long.modulo(mod: Int) = modulo(mod.toLong()).toInt()\n\nfun Int.mulMod(other: Int, mod: Int) = toLong() * other modulo mod\n\nfun Int.powMod(exponent: Long, mod: Int): Int {\n if(exponent < 0) error(\"Inverse not implemented\")\n var res = 1L\n var e = exponent\n var b = modulo(mod).toLong()\n\n while(e > 0) {\n if(e and 1 == 1L) {\n res = res * b % mod\n }\n e = e shr 1\n b = b * b % mod\n }\n return res.toInt()\n}\nfun Int.powMod(exponent: Int, mod: Int) = powMod(exponent.toLong(), mod)\nfun Int.modPowArray(n: Int, mod: Int): IntArray {\n val res = IntArray(n+1)\n res[0] = 1\n for(i in 1..n) res[i] = mulMod(res[i-1], mod)\n return res\n}\n\ninline fun Int.toModInt() = ModInt(this modulo MOD)\ninline fun Long.toModInt() = ModInt(this modulo MOD)\n\n/** note: Only use constructor for int within modulo range, otherwise use toModInt **/\ninline class ModInt(val int: Int) {\n companion object {\n /** can't seem to make these private or inlined without causing compiler issues */\n @JvmField val _invMemo = HashMap()\n fun _invMemoized(m: ModInt) = _invMemo.getOrPut(m) { m.inv_unmemoized() }\n }\n\n // normalizes an integer that's within range [-MOD, MOD) without branching\n private inline fun normalize(int: Int) = ModInt((int shr Int.SIZE_BITS - 1 and MOD) + int)\n\n operator fun plus(other: ModInt) = normalize(int + other.int - MOD) // overflow-safe even if MOD >= 2^30\n inline operator fun plus(other: Int) = plus(other.toModInt())\n operator fun inc() = normalize(int + (1 - MOD))\n\n operator fun minus(other: ModInt) = normalize(int - other.int)\n inline operator fun minus(other: Int) = minus(other.toModInt())\n operator fun dec() = normalize(int - 1)\n operator fun unaryMinus() = normalize(-int)\n\n operator fun times(other: ModInt) = ModInt((int.toLong() * other.int % MOD).toInt())\n inline operator fun times(other: Int) = ModInt(int.mulMod(other, MOD))\n\n fun pow(exponent: Int): ModInt {\n val e = if(exponent < 0) {\n require(int != 0) { \"Can't invert/divide by 0\" }\n exponent modulo TOTIENT\n } else exponent\n return ModInt(int.powMod(e, MOD))\n }\n\n fun pow(exponent: Long) = if(int == 0) when {\n exponent > 0 -> this\n exponent == 0L -> ModInt(1)\n else -> error(\"Can't invert/divide by 0\")\n } else pow(exponent modulo TOTIENT)\n\n inline fun inverse() = inv_memoized() /** NOTE: Change if necessary */\n\n fun inv_unmemoized(): ModInt {\n require(int != 0) { \"Can't invert/divide by 0\" }\n return pow(TOTIENT - 1)\n }\n inline fun inv_memoized() = _invMemoized(this)\n\n operator fun div(other: ModInt) = times(other.inverse())\n inline operator fun div(other: Int) = div(other.toModInt())\n\n override inline fun toString() = int.toString()\n}\n\ninline operator fun Int.plus(modInt: ModInt) = modInt + this\ninline operator fun Int.minus(modInt: ModInt) = toModInt() - modInt\ninline operator fun Int.times(modInt: ModInt) = modInt * this\ninline operator fun Int.div(modInt: ModInt) = modInt.inverse() * this\n\ninline class ModIntArray(val intArray: IntArray): Collection {\n inline operator fun get(i: Int) = ModInt(intArray[i])\n inline operator fun set(i: Int, v: ModInt) { intArray[i] = v.int }\n\n override inline val size: Int get() = intArray.size\n inline val lastIndex get() = intArray.lastIndex\n inline val indices get() = intArray.indices\n\n override inline fun contains(element: ModInt): Boolean = element.int in intArray\n\n override fun containsAll(elements: Collection): Boolean = elements.all(::contains)\n\n override inline fun isEmpty(): Boolean = intArray.isEmpty()\n\n override fun iterator(): Iterator = object: Iterator {\n var index = 0\n override fun hasNext(): Boolean = index < size\n override fun next(): ModInt = get(index++)\n }\n\n fun copyOf(newSize: Int) = ModIntArray(intArray.copyOf(newSize))\n fun copyOf() = copyOf(size)\n}\nfun ModIntArray.copyInto(destination: ModIntArray, destinationOffset: Int = 0, startIndex: Int = 0, endIndex: Int = size) =\n ModIntArray(intArray.copyInto(destination.intArray, destinationOffset, startIndex, endIndex))\ninline fun ModIntArray(size: Int) = ModIntArray(IntArray(size))\ninline fun ModIntArray(size: Int, init: (Int) -> ModInt) = ModIntArray(IntArray(size) { init(it).int })\n\nfun ModInt.powArray(n: Int) = ModIntArray(int.modPowArray(n, MOD))\n\ninline fun ModIntArray.first() = get(0)\ninline fun ModIntArray.last() = get(lastIndex)\ninline fun ModIntArray.joinToString(separator: CharSequence) = intArray.joinToString(separator)\ninline fun ModIntArray.fold(init: R, op: (acc: R, ModInt) -> R) = intArray.fold(init) { acc, i -> op(acc, ModInt(i)) }\ninline fun ModIntArray.foldRight(init: R, op: (ModInt, acc: R) -> R) = intArray.foldRight(init) { i, acc -> op(ModInt(i), acc) }\nfun ModIntArray.sum() = fold(ModInt(0), ModInt::plus)\nfun ModIntArray.product() = fold(ModInt(1), ModInt::times)\n\ninline fun Iterable.sumByModInt(func: (T) -> ModInt) = fold(ModInt(0)) { acc, t -> acc + func(t) }\ninline fun Iterable.productByModInt(func: (T) -> ModInt) = fold(ModInt(1)) { acc, t -> acc * func(t) }\ninline fun Sequence.sumByModInt(func: (T) -> ModInt) = fold(ModInt(0)) { acc, t -> acc + func(t) }\ninline fun Sequence.productByModInt(func: (T) -> ModInt) = fold(ModInt(1)) { acc, t -> acc * func(t) }\ninline fun Array.sumByModInt(func: (T) -> ModInt) = fold(ModInt(0)) { acc, t -> acc + func(t) }\ninline fun Array.productByModInt(func: (T) -> ModInt) = fold(ModInt(1)) { acc, t -> acc * func(t) }\nfun Iterable.sum() = sumByModInt { it }\nfun Sequence.sum() = sumByModInt { it }\nfun Iterable.product() = productByModInt { it }\nfun Sequence.product() = productByModInt { it }\nfun Collection.toModIntArray() = ModIntArray(size).also { var i = 0; for(e in this) { it[i++] = e } }\n\n\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 11094, "cpu_time_ms": 199, "memory_kb": 53620}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s906230363", "group_id": "codeNet:p02572", "input_text": "fun main() {\n val n = readInt()\n val a = readInts().map { it.toLong() }\n val mod = 1000000007L\n\n var total = a.reduce { acc, l -> (acc + l) % mod }\n var ans = 0L\n for (i in 0 until n) {\n total = (mod + total - a[i]) % mod\n ans = (ans + a[i] * total) % mod\n }\n\n println(ans)\n}\n\n// Input Reader\nprivate fun readLn() = readLine()!!\n\nprivate fun readStrings() = readLn().trim().split(\" \")\nprivate fun readInt() = readLn().toInt()\nprivate fun readInts() = readStrings().map { it.toInt() }\n", "language": "Kotlin", "metadata": {"date": 1598749314, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s906230363.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s906230363", "user_id": "u984465701"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "fun main() {\n val n = readInt()\n val a = readInts().map { it.toLong() }\n val mod = 1000000007L\n\n var total = a.reduce { acc, l -> (acc + l) % mod }\n var ans = 0L\n for (i in 0 until n) {\n total = (mod + total - a[i]) % mod\n ans = (ans + a[i] * total) % mod\n }\n\n println(ans)\n}\n\n// Input Reader\nprivate fun readLn() = readLine()!!\n\nprivate fun readStrings() = readLn().trim().split(\" \")\nprivate fun readInt() = readLn().toInt()\nprivate fun readInts() = readStrings().map { it.toInt() }\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 522, "cpu_time_ms": 440, "memory_kb": 72872}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s722526244", "group_id": "codeNet:p02572", "input_text": "import kotlin.math.*\nimport java.util.*\nimport java.io.*\nval big = 1000000007L\nvar ans:Long = 0L\nvar sum:Long = 0L\nvar powe:Long = 0L\nfun main() {\n val N = readLine()!!.toLong()\n val A = readLine()!!.split(\" \").map { it.toLong() }\n val temp = N.toInt()\n\n for(i in 0..temp-1){\n sum = (sum + A[i])%big\n }\n for(j in 0..temp-1){\n powe = (powe + ((A[j]*A[j])%big))%big\n }\n ans = ((sum*sum)%big)-powe\n if(ans < 0){\n ans = ans + big\n }\n ans = ans/2\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1598732848, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s722526244.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s722526244", "user_id": "u834569216"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "import kotlin.math.*\nimport java.util.*\nimport java.io.*\nval big = 1000000007L\nvar ans:Long = 0L\nvar sum:Long = 0L\nvar powe:Long = 0L\nfun main() {\n val N = readLine()!!.toLong()\n val A = readLine()!!.split(\" \").map { it.toLong() }\n val temp = N.toInt()\n\n for(i in 0..temp-1){\n sum = (sum + A[i])%big\n }\n for(j in 0..temp-1){\n powe = (powe + ((A[j]*A[j])%big))%big\n }\n ans = ((sum*sum)%big)-powe\n if(ans < 0){\n ans = ans + big\n }\n ans = ans/2\n println(ans)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 514, "cpu_time_ms": 433, "memory_kb": 65312}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s504441943", "group_id": "codeNet:p02572", "input_text": "fun main(args: Array) {\n val n = readLine().orEmpty().toLong()\n val a = readLine().orEmpty().split(\" \").map { it.toLong() }\n var sum = 0L\n (0 until a.size - 1).forEach { i ->\n (i + 1 until a.size).forEach { j ->\n sum += a[i] * a[j] % 1000000007\n }\n }\n println(sum % 1000000007)\n}\n", "language": "Kotlin", "metadata": {"date": 1598732639, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s504441943.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s504441943", "user_id": "u209173399"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine().orEmpty().toLong()\n val a = readLine().orEmpty().split(\" \").map { it.toLong() }\n var sum = 0L\n (0 until a.size - 1).forEach { i ->\n (i + 1 until a.size).forEach { j ->\n sum += a[i] * a[j] % 1000000007\n }\n }\n println(sum % 1000000007)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 331, "cpu_time_ms": 2208, "memory_kb": 65768}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s314510232", "group_id": "codeNet:p02572", "input_text": "import kotlin.math.pow\n\nfun main() {\n val P = 1000000007\n val PP = 2*P\n readLine()\n val list = readLine()!!.split(\" \").map { it.toLong() }\n var mod = ((list.sum()%PP).toDouble().pow(2).toLong()%PP - list.map { it.toDouble().pow(2).toLong()%PP }.sum()%PP)/2\n if(mod<0)\n mod += PP\n mod %= P\n println(mod)\n}", "language": "Kotlin", "metadata": {"date": 1598730097, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s314510232.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s314510232", "user_id": "u859210968"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "import kotlin.math.pow\n\nfun main() {\n val P = 1000000007\n val PP = 2*P\n readLine()\n val list = readLine()!!.split(\" \").map { it.toLong() }\n var mod = ((list.sum()%PP).toDouble().pow(2).toLong()%PP - list.map { it.toDouble().pow(2).toLong()%PP }.sum()%PP)/2\n if(mod<0)\n mod += PP\n mod %= P\n println(mod)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 335, "cpu_time_ms": 459, "memory_kb": 72120}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s471203734", "group_id": "codeNet:p02572", "input_text": "//\n\nfun main() {\n abc177c()\n}\n\nfun abc177c() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toLong() }\n var ans = 0L\n val base = 1_000_000_007L\n var p = a[0] % base\n for (i in 1 until n) {\n val t = (p * a[i]) % base\n ans = (ans + t) % base\n p = (p + a[i]) % base\n }\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1598729969, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s471203734.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s471203734", "user_id": "u628907033"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "//\n\nfun main() {\n abc177c()\n}\n\nfun abc177c() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toLong() }\n var ans = 0L\n val base = 1_000_000_007L\n var p = a[0] % base\n for (i in 1 until n) {\n val t = (p * a[i]) % base\n ans = (ans + t) % base\n p = (p + a[i]) % base\n }\n println(ans)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 357, "cpu_time_ms": 412, "memory_kb": 64852}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s829874544", "group_id": "codeNet:p02572", "input_text": "fun main(args: Array) {\n val n = readInt()\n val a = readLongList()\n val m = 1000000007\n\n var sum = 0L\n for (i in 0 until n) {\n sum += a[i] % m\n sum %= m\n }\n\n var ans = 0L\n for (i in 0 until n) {\n sum -= (a[i] % m)\n sum %= m\n ans += (a[i] % m) * sum\n ans %= m\n }\n println(ans % m)\n}\n\n// read\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\n", "language": "Kotlin", "metadata": {"date": 1598729256, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s829874544.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s829874544", "user_id": "u697467902"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readInt()\n val a = readLongList()\n val m = 1000000007\n\n var sum = 0L\n for (i in 0 until n) {\n sum += a[i] % m\n sum %= m\n }\n\n var ans = 0L\n for (i in 0 until n) {\n sum -= (a[i] % m)\n sum %= m\n ans += (a[i] % m) * sum\n ans %= m\n }\n println(ans % m)\n}\n\n// read\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 654, "cpu_time_ms": 418, "memory_kb": 64860}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s082667146", "group_id": "codeNet:p02572", "input_text": "const val MOD = 1000000007L\n\nfun main() {\n val N = readInt()\n val AN = readLongs()\n\n val SN = Array(N) { 0L }\n SN[0] = AN[0]\n for (i in 1 until N) {\n SN[i] = SN[i - 1] + AN[i]\n }\n\n var result = 0L\n for (i in 0 until N - 1) {\n result = (result + (AN[i] * ((SN.last() - SN[i]) % MOD)) % MOD) % MOD\n }\n println(result)\n}\n\nfun readString() = readLine()!!\nfun readStrings() = readString().split(\" \")\nfun readInt() = readString().toInt()\nfun readLong() = readString().toLong()\nfun readInts() = readStrings().map { it.toInt() }\nfun readLongs() = readStrings().map { it.toLong() }\n", "language": "Kotlin", "metadata": {"date": 1598729043, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s082667146.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s082667146", "user_id": "u979004569"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "const val MOD = 1000000007L\n\nfun main() {\n val N = readInt()\n val AN = readLongs()\n\n val SN = Array(N) { 0L }\n SN[0] = AN[0]\n for (i in 1 until N) {\n SN[i] = SN[i - 1] + AN[i]\n }\n\n var result = 0L\n for (i in 0 until N - 1) {\n result = (result + (AN[i] * ((SN.last() - SN[i]) % MOD)) % MOD) % MOD\n }\n println(result)\n}\n\nfun readString() = readLine()!!\nfun readStrings() = readString().split(\" \")\nfun readInt() = readString().toInt()\nfun readLong() = readString().toLong()\nfun readInts() = readStrings().map { it.toInt() }\nfun readLongs() = readStrings().map { it.toLong() }\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 589, "cpu_time_ms": 462, "memory_kb": 72928}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s798387257", "group_id": "codeNet:p02572", "input_text": "fun main(args: Array) {\n val n = readInt()\n val a = readLongList()\n val m = 1000000007\n\n var sum = 0L\n for (i in 0 until n) {\n sum += a[i] % m\n }\n sum %= m\n\n var ans = 0L\n for (i in 0 until n) {\n sum -= a[i]\n ans += a[i] * sum\n }\n println(ans % m)\n}\n\n// read\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)", "language": "Kotlin", "metadata": {"date": 1598728982, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s798387257.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s798387257", "user_id": "u697467902"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readInt()\n val a = readLongList()\n val m = 1000000007\n\n var sum = 0L\n for (i in 0 until n) {\n sum += a[i] % m\n }\n sum %= m\n\n var ans = 0L\n for (i in 0 until n) {\n sum -= a[i]\n ans += a[i] * sum\n }\n println(ans % m)\n}\n\n// read\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 603, "cpu_time_ms": 416, "memory_kb": 64792}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s953126465", "group_id": "codeNet:p02572", "input_text": "fun longList() = readLine()?.split(\" \")?.map(String::toLong) ?: TODO()\nfun main() {\n val n = readLine()?.toInt() ?: return\n val a = longList()\n val m = 1000000007\n var t = 0L\n 0.until(n - 1).forEach { i ->\n (i + 1).until(n).forEach { j ->\n t = (t + (a[i] * a[j])) % m\n }\n }\n println(t.toString())\n}\n", "language": "Kotlin", "metadata": {"date": 1598728785, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s953126465.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s953126465", "user_id": "u979429407"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "fun longList() = readLine()?.split(\" \")?.map(String::toLong) ?: TODO()\nfun main() {\n val n = readLine()?.toInt() ?: return\n val a = longList()\n val m = 1000000007\n var t = 0L\n 0.until(n - 1).forEach { i ->\n (i + 1).until(n).forEach { j ->\n t = (t + (a[i] * a[j])) % m\n }\n }\n println(t.toString())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 345, "cpu_time_ms": 2208, "memory_kb": 66072}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s686323476", "group_id": "codeNet:p02572", "input_text": "\n\nconst val m = 1000000007L\nfun main(args: Array) {\n val n = getInt()\n val a = getLongs()\n var sum = 0L\n a.forEach {\n sum = (sum + it) % m\n }\n\n var out = 0L\n a.forEach {\n out = (out + (sum - it) * it) % m\n }\n println(out * inv(2) % m)\n}\n\nfun inv(k: Long): Long {\n return pow(k, m - 2)\n}\n\nfun pow(k: Long, p: Long): Long {\n return when {\n p == 0L -> 1\n p == 1L -> k\n p % 2L == 0L -> pow(k, p / 2L).let { it * it % m }\n else -> pow(k, p / 2L).let { (it * it % m) * k % m }\n }\n}\n\nfun getInt() = readLine()!!.toInt()\nfun getInts() = readLine()!!.split(\" \").map { it.toInt() }\nfun getLong() = readLine()!!.toLong()\nfun getLongs() = readLine()!!.split(\" \").map { it.toLong() }\n\n", "language": "Kotlin", "metadata": {"date": 1598728729, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s686323476.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s686323476", "user_id": "u895858420"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "\n\nconst val m = 1000000007L\nfun main(args: Array) {\n val n = getInt()\n val a = getLongs()\n var sum = 0L\n a.forEach {\n sum = (sum + it) % m\n }\n\n var out = 0L\n a.forEach {\n out = (out + (sum - it) * it) % m\n }\n println(out * inv(2) % m)\n}\n\nfun inv(k: Long): Long {\n return pow(k, m - 2)\n}\n\nfun pow(k: Long, p: Long): Long {\n return when {\n p == 0L -> 1\n p == 1L -> k\n p % 2L == 0L -> pow(k, p / 2L).let { it * it % m }\n else -> pow(k, p / 2L).let { (it * it % m) * k % m }\n }\n}\n\nfun getInt() = readLine()!!.toInt()\nfun getInts() = readLine()!!.split(\" \").map { it.toInt() }\nfun getLong() = readLine()!!.toLong()\nfun getLongs() = readLine()!!.split(\" \").map { it.toLong() }\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 758, "cpu_time_ms": 415, "memory_kb": 64816}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s612213384", "group_id": "codeNet:p02572", "input_text": "import java.io.IOException\nimport java.lang.NumberFormatException\nimport java.lang.StringBuilder\nimport kotlin.math.absoluteValue\nimport kotlin.math.min\n\nobject CMain{\n fun solve(){\n val div = 1000000007L\n val n = nextInt()\n val a = LongArray(n){ nextLong()}\n val sum = a.sum() % div\n var ans = 0L\n a.forEach { ans += (it * sum) % div }\n ans %= div\n\n var sum2 = 0L\n a.forEach { sum2 += (it * it) % div }\n sum2 %= div\n ans -= sum2\n if(ans < 0) ans += div\n println(ans / 2)\n }\n\n\n\n\n\n // Scanner based on uwi-san's Java code\n val stream = System.`in`\n val buffer = ByteArray(1024)\n var ptr = 0\n var buflen = 0\n\n fun hasNextByte(): Boolean{\n if(ptr < buflen){\n return true\n }else{\n ptr = 0\n try{\n buflen = stream.read(buffer)\n }catch (e: IOException){\n e.printStackTrace()\n }\n if(buflen <= 0){\n return false\n }\n }\n return true\n }\n\n fun readByte() =\n if(hasNextByte()) buffer[ptr++]\n else -1\n\n fun isPrintableChar(c: Byte) = c in 33..126\n\n fun hasNext(): Boolean{\n while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++\n return hasNextByte()\n }\n\n fun next(): String{\n if(!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while(isPrintableChar(b)){\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long{\n if(!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if(b == '-'.toByte()){\n minus = true\n b = readByte()\n }\n if(b !in '0'.toByte()..'9'.toByte())\n throw NumberFormatException()\n while(true){\n if(b in '0'.toByte()..'9'.toByte()){\n n *= 10\n n += b - '0'.toByte()\n }else if(!isPrintableChar(b)){\n return if(minus) -n else n\n }else{\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int{\n val n1 = nextLong()\n if(n1 !in Int.MIN_VALUE..Int.MAX_VALUE)\n throw NumberFormatException()\n return n1.toInt()\n }\n\n fun NextDouble() = next().toDouble()\n}\n\nfun main(){\n CMain.solve()\n}\n\n", "language": "Kotlin", "metadata": {"date": 1598728156, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02572.html", "problem_id": "p02572", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02572/input.txt", "sample_output_relpath": "derived/input_output/data/p02572/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02572/Kotlin/s612213384.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s612213384", "user_id": "u097204018"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "import java.io.IOException\nimport java.lang.NumberFormatException\nimport java.lang.StringBuilder\nimport kotlin.math.absoluteValue\nimport kotlin.math.min\n\nobject CMain{\n fun solve(){\n val div = 1000000007L\n val n = nextInt()\n val a = LongArray(n){ nextLong()}\n val sum = a.sum() % div\n var ans = 0L\n a.forEach { ans += (it * sum) % div }\n ans %= div\n\n var sum2 = 0L\n a.forEach { sum2 += (it * it) % div }\n sum2 %= div\n ans -= sum2\n if(ans < 0) ans += div\n println(ans / 2)\n }\n\n\n\n\n\n // Scanner based on uwi-san's Java code\n val stream = System.`in`\n val buffer = ByteArray(1024)\n var ptr = 0\n var buflen = 0\n\n fun hasNextByte(): Boolean{\n if(ptr < buflen){\n return true\n }else{\n ptr = 0\n try{\n buflen = stream.read(buffer)\n }catch (e: IOException){\n e.printStackTrace()\n }\n if(buflen <= 0){\n return false\n }\n }\n return true\n }\n\n fun readByte() =\n if(hasNextByte()) buffer[ptr++]\n else -1\n\n fun isPrintableChar(c: Byte) = c in 33..126\n\n fun hasNext(): Boolean{\n while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++\n return hasNextByte()\n }\n\n fun next(): String{\n if(!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while(isPrintableChar(b)){\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long{\n if(!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if(b == '-'.toByte()){\n minus = true\n b = readByte()\n }\n if(b !in '0'.toByte()..'9'.toByte())\n throw NumberFormatException()\n while(true){\n if(b in '0'.toByte()..'9'.toByte()){\n n *= 10\n n += b - '0'.toByte()\n }else if(!isPrintableChar(b)){\n return if(minus) -n else n\n }else{\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int{\n val n1 = nextLong()\n if(n1 !in Int.MIN_VALUE..Int.MAX_VALUE)\n throw NumberFormatException()\n return n1.toInt()\n }\n\n fun NextDouble() = next().toDouble()\n}\n\nfun main(){\n CMain.solve()\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02572", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nFind the sum of A_i \\times A_j over all pairs (i,j) such that 1\\leq i < j \\leq N, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} A_i A_j, modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n11\n\nWe have 1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11.\n\nSample Input 2\n\n4\n141421356 17320508 22360679 244949\n\nSample Output 2\n\n437235829", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2566, "cpu_time_ms": 153, "memory_kb": 42788}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s634453983", "group_id": "codeNet:p02574", "input_text": "import java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport kotlin.math.max\nimport kotlin.math.min\n\nval br = BufferedReader(InputStreamReader(System.`in`))\nval out = PrintWriter(System.out)\n\nfun main() {\n br.use { out.use {\n solve()\n out.flush()\n } }\n}\n\nfun solve() {\n// すべてが素　同じものがない\n // 最大公約数が1 やるだけ\n\n val n = readInteger()\n val aList = readLongList()\n val tmp = IntArray(1000001)\n\n val primeTable = primeTable(1000000)\n for (a in aList) {\n var target = a.toInt()\n while (primeTable[target] != target.toLong()) {\n val prime = primeTable[target].toInt()\n tmp[prime]++\n\n while (target > 1 && target % prime == 0) {\n target /= prime\n }\n }\n }\n\n if (tmp.max()!! <= 1) {\n out.println(\"pairwise coprime\")\n return\n }\n\n val aaaa = aList.reduce { acc, a -> gcd(acc, a) }\n if (aaaa == 1L) {\n out.println(\"setwise coprime\")\n return\n }\n\n out.println(\"not coprime\")\n}\n\n/** O(nlog(logn)) // n * n <= Int.MAX_VALUE, n <= 10^6 */\nfun primeTable(n: Int): LongArray {\n val table = LongArray(n + 1) { it.toLong() }\n if (n >= 0) table[0] = 0\n if (n >= 1) table[1] = 1\n var i = 2\n while (i * i <= n) {\n if (table[i] == i.toLong()) {\n for (j in (i + i)..n step i) { table[j] = i.toLong()}\n }\n i++\n }\n return table\n}\n\n/** O(log(n)): n = min(a, b) */\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else gcd(b, a % b)\n\nfun readInteger() = Integer.parseInt(br.readLine())\nfun readLong() = java.lang.Long.parseLong(br.readLine())\nfun readStringList() = br.readLine()!!.split(' ')\nfun readIntegerList() = readStringList().map(Integer::parseInt)\nfun readLongList() = readStringList().map(java.lang.Long::parseLong)\nfun readDoubleList() = readStringList().map(java.lang.Double::parseDouble)\n", "language": "Kotlin", "metadata": {"date": 1599318395, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Kotlin/s634453983.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s634453983", "user_id": "u784448849"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport kotlin.math.max\nimport kotlin.math.min\n\nval br = BufferedReader(InputStreamReader(System.`in`))\nval out = PrintWriter(System.out)\n\nfun main() {\n br.use { out.use {\n solve()\n out.flush()\n } }\n}\n\nfun solve() {\n// すべてが素　同じものがない\n // 最大公約数が1 やるだけ\n\n val n = readInteger()\n val aList = readLongList()\n val tmp = IntArray(1000001)\n\n val primeTable = primeTable(1000000)\n for (a in aList) {\n var target = a.toInt()\n while (primeTable[target] != target.toLong()) {\n val prime = primeTable[target].toInt()\n tmp[prime]++\n\n while (target > 1 && target % prime == 0) {\n target /= prime\n }\n }\n }\n\n if (tmp.max()!! <= 1) {\n out.println(\"pairwise coprime\")\n return\n }\n\n val aaaa = aList.reduce { acc, a -> gcd(acc, a) }\n if (aaaa == 1L) {\n out.println(\"setwise coprime\")\n return\n }\n\n out.println(\"not coprime\")\n}\n\n/** O(nlog(logn)) // n * n <= Int.MAX_VALUE, n <= 10^6 */\nfun primeTable(n: Int): LongArray {\n val table = LongArray(n + 1) { it.toLong() }\n if (n >= 0) table[0] = 0\n if (n >= 1) table[1] = 1\n var i = 2\n while (i * i <= n) {\n if (table[i] == i.toLong()) {\n for (j in (i + i)..n step i) { table[j] = i.toLong()}\n }\n i++\n }\n return table\n}\n\n/** O(log(n)): n = min(a, b) */\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else gcd(b, a % b)\n\nfun readInteger() = Integer.parseInt(br.readLine())\nfun readLong() = java.lang.Long.parseLong(br.readLine())\nfun readStringList() = br.readLine()!!.split(' ')\nfun readIntegerList() = readStringList().map(Integer::parseInt)\nfun readLongList() = readStringList().map(java.lang.Long::parseLong)\nfun readDoubleList() = readStringList().map(java.lang.Double::parseDouble)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1978, "cpu_time_ms": 785, "memory_kb": 167092}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s401262401", "group_id": "codeNet:p02574", "input_text": "import java.lang.Integer.max\nimport java.lang.Integer.min\n\n//\n\nfun main() {\n abc177e()\n}\n\nfun abc177e() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val gcds = mutableMapOf()\n for (i in 0 until n) {\n var j = 2\n var t = a[i]\n while (j * j <= t) {\n if (t % j == 0) {\n gcds[j] = gcds.getOrDefault(j, 0) + 1\n if (t / j != j) {\n gcds[t / j] = gcds.getOrDefault(t / j, 0) + 1\n }\n }\n j++\n }\n gcds[t] = gcds.getOrDefault(t, 0) + 1\n }\n val maxCount = gcds.maxBy { it.value }!!\n if (maxCount.value == 1) {\n println(\"pairwise coprime\")\n } else if (maxCount.value == n) {\n println(\"not coprime\")\n } else {\n println(\"setwise coprime\")\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1598804574, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Kotlin/s401262401.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s401262401", "user_id": "u628907033"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "import java.lang.Integer.max\nimport java.lang.Integer.min\n\n//\n\nfun main() {\n abc177e()\n}\n\nfun abc177e() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val gcds = mutableMapOf()\n for (i in 0 until n) {\n var j = 2\n var t = a[i]\n while (j * j <= t) {\n if (t % j == 0) {\n gcds[j] = gcds.getOrDefault(j, 0) + 1\n if (t / j != j) {\n gcds[t / j] = gcds.getOrDefault(t / j, 0) + 1\n }\n }\n j++\n }\n gcds[t] = gcds.getOrDefault(t, 0) + 1\n }\n val maxCount = gcds.maxBy { it.value }!!\n if (maxCount.value == 1) {\n println(\"pairwise coprime\")\n } else if (maxCount.value == n) {\n println(\"not coprime\")\n } else {\n println(\"setwise coprime\")\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 867, "cpu_time_ms": 2210, "memory_kb": 159444}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s165458359", "group_id": "codeNet:p02574", "input_text": "fun main() = abc177e()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc177e() = IO_abc177e().exec {\n val n = readInt()\n val aList = List(n) { readInt() }\n\n tailrec fun gcd(a: Int, b: Int): Int = if (b == 0) a else gcd(b, a % b)\n\n val sieve = Sieve(2 * 1000_000)\n val appearedPrimes = mutableSetOf()\n\n val pc = aList.all { a ->\n val factors = sieve.primeFactorization(a)\n factors.all { (k, _) -> appearedPrimes.add(k) }\n }\n\n if (pc) return@exec println(\"pairwise coprime\")\n\n val answer = if (aList.reduce { acc, i -> gcd(acc, i) } == 1) \"setwise coprime\" else \"not coprime\"\n\n println(answer)\n}\n\nprivate class Sieve(n: Int) {\n private val divisibleBy = IntArray(n + 1)\n\n init {\n for (i in 2..n) for (j in i..n step i) {\n if (divisibleBy[j] != 0) break\n divisibleBy[j] = i\n }\n }\n\n fun primeFactorization(n: Int): MutableMap {\n var curr = n\n val factors = mutableMapOf()\n while (curr > 1) {\n factors.merge(divisibleBy[curr], 1, Int::plus)\n curr /= divisibleBy[curr]\n }\n return factors\n }\n}\n\n// region kokokara template dayo (^o^)\n@Suppress(\"unused\", \"ClassName\", \"SpellCheckingInspection\", \"ConvertToStringTemplate\", \"MemberVisibilityCanBePrivate\")\nprivate class IO_abc177e(private val separator: String = System.lineSeparator()) {\n private val input = System.`in`\n private val buffer = ByteArray(1024)\n private var pointer = 0\n private var bufferLength = 0\n private val sb = StringBuilder()\n private fun Byte.isPrintable() = this in 33..126\n private fun Byte.isNumeric() = this in '0'.toByte()..'9'.toByte()\n private fun Byte.toNumVal() = if (this.isNumeric()) this - '0'.toByte() else error(\"$this is not numeric\")\n\n private fun hasNextByte(): Boolean {\n return if (pointer < bufferLength) true else {\n pointer = 0\n bufferLength = input.read(buffer)\n bufferLength > 0\n }\n }\n\n private fun readByte(): Byte = if (hasNextByte()) buffer[pointer++] else -1\n private fun skipUnprintable() = run { while (hasNextByte() && !buffer[pointer].isPrintable()) pointer++ }\n private fun hasNext(): Boolean = run { skipUnprintable() }.run { hasNextByte() }\n private fun hasNextOrError() = if (!hasNext()) error(\"has no next element.\") else Unit\n\n fun readString(): String {\n hasNextOrError()\n val sb = StringBuilder()\n var b = readByte()\n while (b.isPrintable()) {\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun readLong(): Long {\n hasNextOrError()\n var n = 0L\n var negative = false\n var b = readByte()\n if (b == '-'.toByte()) {\n negative = true\n b = readByte()\n }\n if (!b.isNumeric()) error(\"$b is not numeric.\")\n while (true) {\n when {\n b.isNumeric() -> n = n * 10 + b.toNumVal()\n b.toInt() == -1 || !b.isPrintable() -> return if (negative) -n else n\n else -> error(\"failed to parse. [n=$n, b=$b]\")\n }\n b = readByte()\n }\n }\n\n fun readInt() = readLong()\n .let { if (it in Int.MIN_VALUE..Int.MAX_VALUE) it.toInt() else error(\"$it is not in range of Int.\") }\n\n fun readDouble(): Double {\n var n = 0.0\n var div = 1.0\n var negative = false\n var b = readByte()\n if (b == '-'.toByte()) {\n negative = true\n b = readByte()\n }\n do n = n * 10 + b.toNumVal()\n while (run { b = readByte() }.run { b.isNumeric() })\n if (b == '.'.toByte()) {\n while (run { b = readByte() }.run { b.isNumeric() })\n n += b.toNumVal() / (run { div *= 10 }.run { div })\n }\n return if (negative) -n else n\n }\n\n fun println(): Unit = run { sb.append(separator) }\n fun print(any: Any): Unit = run { sb.append(any) }\n fun println(any: Any): Unit = run { sb.append(any.toString() + separator) }\n fun flush() = run { kotlin.io.println(sb); sb.clear() }\n\n fun exec(action: IO_abc177e.() -> Unit) {\n var t: Throwable? = null\n Thread(null, { action() }, \"solve\", 128 * 1024 * 1024)\n .apply { setUncaughtExceptionHandler { _, t1 -> t = t1 } }\n .apply { start() }.join()\n t?.let { throw it }\n kotlin.io.print(sb)\n }\n\n fun readLine(): Nothing = error(\"readLine is disabled.\")\n}\n// endregion kokomade template dayo (^o^)\n", "language": "Kotlin", "metadata": {"date": 1598781684, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Kotlin/s165458359.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s165458359", "user_id": "u139478771"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "fun main() = abc177e()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc177e() = IO_abc177e().exec {\n val n = readInt()\n val aList = List(n) { readInt() }\n\n tailrec fun gcd(a: Int, b: Int): Int = if (b == 0) a else gcd(b, a % b)\n\n val sieve = Sieve(2 * 1000_000)\n val appearedPrimes = mutableSetOf()\n\n val pc = aList.all { a ->\n val factors = sieve.primeFactorization(a)\n factors.all { (k, _) -> appearedPrimes.add(k) }\n }\n\n if (pc) return@exec println(\"pairwise coprime\")\n\n val answer = if (aList.reduce { acc, i -> gcd(acc, i) } == 1) \"setwise coprime\" else \"not coprime\"\n\n println(answer)\n}\n\nprivate class Sieve(n: Int) {\n private val divisibleBy = IntArray(n + 1)\n\n init {\n for (i in 2..n) for (j in i..n step i) {\n if (divisibleBy[j] != 0) break\n divisibleBy[j] = i\n }\n }\n\n fun primeFactorization(n: Int): MutableMap {\n var curr = n\n val factors = mutableMapOf()\n while (curr > 1) {\n factors.merge(divisibleBy[curr], 1, Int::plus)\n curr /= divisibleBy[curr]\n }\n return factors\n }\n}\n\n// region kokokara template dayo (^o^)\n@Suppress(\"unused\", \"ClassName\", \"SpellCheckingInspection\", \"ConvertToStringTemplate\", \"MemberVisibilityCanBePrivate\")\nprivate class IO_abc177e(private val separator: String = System.lineSeparator()) {\n private val input = System.`in`\n private val buffer = ByteArray(1024)\n private var pointer = 0\n private var bufferLength = 0\n private val sb = StringBuilder()\n private fun Byte.isPrintable() = this in 33..126\n private fun Byte.isNumeric() = this in '0'.toByte()..'9'.toByte()\n private fun Byte.toNumVal() = if (this.isNumeric()) this - '0'.toByte() else error(\"$this is not numeric\")\n\n private fun hasNextByte(): Boolean {\n return if (pointer < bufferLength) true else {\n pointer = 0\n bufferLength = input.read(buffer)\n bufferLength > 0\n }\n }\n\n private fun readByte(): Byte = if (hasNextByte()) buffer[pointer++] else -1\n private fun skipUnprintable() = run { while (hasNextByte() && !buffer[pointer].isPrintable()) pointer++ }\n private fun hasNext(): Boolean = run { skipUnprintable() }.run { hasNextByte() }\n private fun hasNextOrError() = if (!hasNext()) error(\"has no next element.\") else Unit\n\n fun readString(): String {\n hasNextOrError()\n val sb = StringBuilder()\n var b = readByte()\n while (b.isPrintable()) {\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun readLong(): Long {\n hasNextOrError()\n var n = 0L\n var negative = false\n var b = readByte()\n if (b == '-'.toByte()) {\n negative = true\n b = readByte()\n }\n if (!b.isNumeric()) error(\"$b is not numeric.\")\n while (true) {\n when {\n b.isNumeric() -> n = n * 10 + b.toNumVal()\n b.toInt() == -1 || !b.isPrintable() -> return if (negative) -n else n\n else -> error(\"failed to parse. [n=$n, b=$b]\")\n }\n b = readByte()\n }\n }\n\n fun readInt() = readLong()\n .let { if (it in Int.MIN_VALUE..Int.MAX_VALUE) it.toInt() else error(\"$it is not in range of Int.\") }\n\n fun readDouble(): Double {\n var n = 0.0\n var div = 1.0\n var negative = false\n var b = readByte()\n if (b == '-'.toByte()) {\n negative = true\n b = readByte()\n }\n do n = n * 10 + b.toNumVal()\n while (run { b = readByte() }.run { b.isNumeric() })\n if (b == '.'.toByte()) {\n while (run { b = readByte() }.run { b.isNumeric() })\n n += b.toNumVal() / (run { div *= 10 }.run { div })\n }\n return if (negative) -n else n\n }\n\n fun println(): Unit = run { sb.append(separator) }\n fun print(any: Any): Unit = run { sb.append(any) }\n fun println(any: Any): Unit = run { sb.append(any.toString() + separator) }\n fun flush() = run { kotlin.io.println(sb); sb.clear() }\n\n fun exec(action: IO_abc177e.() -> Unit) {\n var t: Throwable? = null\n Thread(null, { action() }, \"solve\", 128 * 1024 * 1024)\n .apply { setUncaughtExceptionHandler { _, t1 -> t = t1 } }\n .apply { start() }.join()\n t?.let { throw it }\n kotlin.io.print(sb)\n }\n\n fun readLine(): Nothing = error(\"readLine is disabled.\")\n}\n// endregion kokomade template dayo (^o^)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4604, "cpu_time_ms": 368, "memory_kb": 85096}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s974148666", "group_id": "codeNet:p02574", "input_text": "import java.io.IOException\nimport java.lang.NumberFormatException\nimport java.lang.StringBuilder\nimport java.util.ArrayList\n\nobject AMain{\n fun solve(){\n val n = nextInt()\n val a = ArrayList()\n for(i in 1..n){\n a.add(nextLong())\n }\n\n var ispair = true\n\n\n a.sort()\n var pre = a[0]\n var mi = 1\n while(mi < a.size){\n if(a[mi] == pre){\n ispair = false\n a.removeAt(mi)\n }else{\n mi++\n }\n }\n\n\n val isprime = IntArray(1000001){1}\n val prime = ArrayList()\n isprime[0] = 0\n isprime[1] = 0\n for(i in 2..1000000){\n if(isprime[i] > 0){\n for(j in i until 1000001 step i){\n isprime[j] = 0\n }\n prime.add(i)\n }\n }\n// println(prime.size)\n if(ispair) {\n loop@ for (i in a.indices) {\n var ma = a[i].toInt()\n if (ma == 1) continue\n if (isprime[ma] > 0) {\n if (!check(isprime, ma)) {\n ispair = false\n break\n }\n } else {\n var pos = 0\n var checked = false\n while (ma > 1 && pos < prime.size) {\n if (ma % prime[pos] == 0) {\n ma /= prime[pos]\n if (checked) continue\n if (!check(isprime, ma)) {\n ispair = false\n break@loop\n }\n if (!check(isprime, prime[pos])) {\n ispair = false\n break@loop\n }\n checked = true\n } else {\n pos++\n checked = false\n }\n }\n }\n }\n }\n\n// var ispair = true\n// prime.forEach {\n// var num = 0\n// for(i in a.indices){\n// if(a[i] % it == 0L) num++\n// if(num >= 2){\n// ispair = false\n// return@forEach\n// }\n// }\n// }\n\n if(ispair){\n println(\"pairwise coprime\")\n return\n }\n\n var cur = a[0]\n for(i in 1 until a.size){\n cur = gcd(cur, a[i])\n }\n\n if(cur == 1L){\n println(\"setwise coprime\")\n }else{\n println(\"not coprime\")\n }\n\n }\n\n fun check(isprime: IntArray, x: Int): Boolean{\n if(x == 1) return true\n isprime[x]++\n if(isprime[x] > 2){\n return false\n }\n return true\n }\n\n fun gcd(a: Long, b: Long): Long{\n if(b == 0L) return a\n return gcd(b, a % b)\n }\n\n\n\n\n\n // Scanner based on uwi-san's Java code\n val stream = System.`in`\n val buffer = ByteArray(1024)\n var ptr = 0\n var buflen = 0\n\n fun hasNextByte(): Boolean{\n if(ptr < buflen){\n return true\n }else{\n ptr = 0\n try{\n buflen = stream.read(buffer)\n }catch (e: IOException){\n e.printStackTrace()\n }\n if(buflen <= 0){\n return false\n }\n }\n return true\n }\n\n fun readByte() =\n if(hasNextByte()) buffer[ptr++]\n else -1\n\n fun isPrintableChar(c: Byte) = c in 33..126\n\n fun hasNext(): Boolean{\n while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++\n return hasNextByte()\n }\n\n fun next(): String{\n if(!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while(isPrintableChar(b)){\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long{\n if(!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if(b == '-'.toByte()){\n minus = true\n b = readByte()\n }\n if(b !in '0'.toByte()..'9'.toByte())\n throw NumberFormatException()\n while(true){\n if(b in '0'.toByte()..'9'.toByte()){\n n *= 10\n n += b - '0'.toByte()\n }else if(!isPrintableChar(b)){\n return if(minus) -n else n\n }else{\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int{\n val n1 = nextLong()\n if(n1 !in Int.MIN_VALUE..Int.MAX_VALUE)\n throw NumberFormatException()\n return n1.toInt()\n }\n\n fun NextDouble() = next().toDouble()\n}\n\nfun main(){\n AMain.solve()\n}\n\n", "language": "Kotlin", "metadata": {"date": 1598733435, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Kotlin/s974148666.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s974148666", "user_id": "u097204018"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "import java.io.IOException\nimport java.lang.NumberFormatException\nimport java.lang.StringBuilder\nimport java.util.ArrayList\n\nobject AMain{\n fun solve(){\n val n = nextInt()\n val a = ArrayList()\n for(i in 1..n){\n a.add(nextLong())\n }\n\n var ispair = true\n\n\n a.sort()\n var pre = a[0]\n var mi = 1\n while(mi < a.size){\n if(a[mi] == pre){\n ispair = false\n a.removeAt(mi)\n }else{\n mi++\n }\n }\n\n\n val isprime = IntArray(1000001){1}\n val prime = ArrayList()\n isprime[0] = 0\n isprime[1] = 0\n for(i in 2..1000000){\n if(isprime[i] > 0){\n for(j in i until 1000001 step i){\n isprime[j] = 0\n }\n prime.add(i)\n }\n }\n// println(prime.size)\n if(ispair) {\n loop@ for (i in a.indices) {\n var ma = a[i].toInt()\n if (ma == 1) continue\n if (isprime[ma] > 0) {\n if (!check(isprime, ma)) {\n ispair = false\n break\n }\n } else {\n var pos = 0\n var checked = false\n while (ma > 1 && pos < prime.size) {\n if (ma % prime[pos] == 0) {\n ma /= prime[pos]\n if (checked) continue\n if (!check(isprime, ma)) {\n ispair = false\n break@loop\n }\n if (!check(isprime, prime[pos])) {\n ispair = false\n break@loop\n }\n checked = true\n } else {\n pos++\n checked = false\n }\n }\n }\n }\n }\n\n// var ispair = true\n// prime.forEach {\n// var num = 0\n// for(i in a.indices){\n// if(a[i] % it == 0L) num++\n// if(num >= 2){\n// ispair = false\n// return@forEach\n// }\n// }\n// }\n\n if(ispair){\n println(\"pairwise coprime\")\n return\n }\n\n var cur = a[0]\n for(i in 1 until a.size){\n cur = gcd(cur, a[i])\n }\n\n if(cur == 1L){\n println(\"setwise coprime\")\n }else{\n println(\"not coprime\")\n }\n\n }\n\n fun check(isprime: IntArray, x: Int): Boolean{\n if(x == 1) return true\n isprime[x]++\n if(isprime[x] > 2){\n return false\n }\n return true\n }\n\n fun gcd(a: Long, b: Long): Long{\n if(b == 0L) return a\n return gcd(b, a % b)\n }\n\n\n\n\n\n // Scanner based on uwi-san's Java code\n val stream = System.`in`\n val buffer = ByteArray(1024)\n var ptr = 0\n var buflen = 0\n\n fun hasNextByte(): Boolean{\n if(ptr < buflen){\n return true\n }else{\n ptr = 0\n try{\n buflen = stream.read(buffer)\n }catch (e: IOException){\n e.printStackTrace()\n }\n if(buflen <= 0){\n return false\n }\n }\n return true\n }\n\n fun readByte() =\n if(hasNextByte()) buffer[ptr++]\n else -1\n\n fun isPrintableChar(c: Byte) = c in 33..126\n\n fun hasNext(): Boolean{\n while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++\n return hasNextByte()\n }\n\n fun next(): String{\n if(!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while(isPrintableChar(b)){\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long{\n if(!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if(b == '-'.toByte()){\n minus = true\n b = readByte()\n }\n if(b !in '0'.toByte()..'9'.toByte())\n throw NumberFormatException()\n while(true){\n if(b in '0'.toByte()..'9'.toByte()){\n n *= 10\n n += b - '0'.toByte()\n }else if(!isPrintableChar(b)){\n return if(minus) -n else n\n }else{\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int{\n val n1 = nextLong()\n if(n1 !in Int.MIN_VALUE..Int.MAX_VALUE)\n throw NumberFormatException()\n return n1.toInt()\n }\n\n fun NextDouble() = next().toDouble()\n}\n\nfun main(){\n AMain.solve()\n}\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5070, "cpu_time_ms": 2208, "memory_kb": 88640}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s777359021", "group_id": "codeNet:p02574", "input_text": "\nimport java.math.BigInteger\n\n\nconst val A = \"pairwise coprime\"\nconst val B = \"setwise coprime\"\nconst val C = \"not coprime\"\nfun main(args: Array) {\n val n = getInt()\n val a = getInts()\n\n val g = a.reduce(::gcd)\n if (g != 1) {\n println(C)\n return\n }\n\n var x = BigInteger(a.first().toString())\n a.drop(1).map { BigInteger(it.toString()) }.forEach { y ->\n if (gcd(x, y) != BigInteger.ONE) {\n println(B)\n return\n }\n\n x = lcm(x, y)\n }\n\n println(A)\n}\n\nfun gcd(a: Int, b: Int): Int {\n if (a % b == 0) return b\n else return gcd(b, a % b)\n}\n\nfun gcd(a: BigInteger, b: BigInteger): BigInteger {\n if (a.mod(b) == BigInteger.ZERO) return b\n else return gcd(b, a % b)\n}\n\nfun lcm(a: BigInteger, b: BigInteger): BigInteger {\n return a * b / gcd(a, b)\n}\n\nfun getInt() = readLine()!!.toInt()\nfun getInts() = readLine()!!.split(\" \").map { it.toInt() }\nfun getLong() = readLine()!!.toLong()\nfun getLongs() = readLine()!!.split(\" \").map { it.toLong() }\n\n", "language": "Kotlin", "metadata": {"date": 1598733361, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Kotlin/s777359021.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s777359021", "user_id": "u895858420"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "\nimport java.math.BigInteger\n\n\nconst val A = \"pairwise coprime\"\nconst val B = \"setwise coprime\"\nconst val C = \"not coprime\"\nfun main(args: Array) {\n val n = getInt()\n val a = getInts()\n\n val g = a.reduce(::gcd)\n if (g != 1) {\n println(C)\n return\n }\n\n var x = BigInteger(a.first().toString())\n a.drop(1).map { BigInteger(it.toString()) }.forEach { y ->\n if (gcd(x, y) != BigInteger.ONE) {\n println(B)\n return\n }\n\n x = lcm(x, y)\n }\n\n println(A)\n}\n\nfun gcd(a: Int, b: Int): Int {\n if (a % b == 0) return b\n else return gcd(b, a % b)\n}\n\nfun gcd(a: BigInteger, b: BigInteger): BigInteger {\n if (a.mod(b) == BigInteger.ZERO) return b\n else return gcd(b, a % b)\n}\n\nfun lcm(a: BigInteger, b: BigInteger): BigInteger {\n return a * b / gcd(a, b)\n}\n\nfun getInt() = readLine()!!.toInt()\nfun getInts() = readLine()!!.split(\" \").map { it.toInt() }\nfun getLong() = readLine()!!.toLong()\nfun getLongs() = readLine()!!.split(\" \").map { it.toLong() }\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1041, "cpu_time_ms": 2208, "memory_kb": 162656}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s314403047", "group_id": "codeNet:p02574", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val n = readInt()\n val aList = readListOfLong()\n\n val cMul = LongArray(n+1) { 1L }\n for(i in 0 until n) {\n cMul[i+1] = cMul[i] * aList[i]\n \n }\n // println(\"cmul: ${cMul.toList()}\")\n var isPairWise = true\n\n for(i in 0 until n-1) {\n val a = aList[i]\n val mul = cMul[n] / cMul[i+1]\n val num = gcd(mul, a)\n if(num > 1L) {\n isPairWise = false\n }\n }\n\n val gcds = aList.fold(aList[0]) { acc, v -> gcd(acc, v) }\n val isSetwise = gcds == 1L\n\n val ans = if(isPairWise) \"pairwise coprime\"\n else {\n if(isSetwise) \"setwise coprime\"\n else \"not coprime\"\n }\n println(ans)\n\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n\t= this.groupBy { it }.mapValues { it.value.size }\n\nfun> Array.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int\n\t= this.toList().upperBound(element, fromIndex, toIndex)\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element >= this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn l\n}\n\nfun> Array.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int\n\t= this.toList().lowerBound(element, fromIndex, toIndex)\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element > this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n\tval divisors = mutableListOf()\n\tfor(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n\t\tif(this % i == 0L) {\n\t\t\tdivisors.add(i)\n\t\t\tif(i != this/i) {\n\t\t\t\tdivisors.add(this/i)\n\t\t\t}\n\t\t}\n\t}\n\treturn divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n\tif(this==1L) return false\n\tfor(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n\t\tif(this % i == 0L && this != i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\nfun Long.primeFactorize(): Map {\n\tval map = mutableMapOf()\n\tvar num = this\n\tfor(i in 2L .. Math.sqrt(num.toDouble()).toLong()+1L) {\n\t\tif(num % i == 0L) {\n\t\t\twhile(num % i == 0L) {\n\t\t\t\tmap[i] = (map[i]?:0) + 1\n\t\t\t\tnum /= i\n\t\t\t}\n\t\t}\n\t}\n\tif(num != 1L) {\n\t\tmap[num] = 1 \n\t}\n\treturn map\n}\n\nfun permutations(src: List): List> {\n\tif(src.size == 1) return listOf(src)\n\tval perms = mutableListOf>()\n\tval insertElement = src[0]\n\tpermutations(src.drop(1)).forEach { perm ->\n\t\tfor(i in 0..perm.size) {\n\t\t\tval newPerm = perm.toMutableList()\n\t\t\tnewPerm.add(i, insertElement)\n\t\t\tperms.add(newPerm.toList())\n\t\t}\n\t}\n\treturn perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n\tval v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n\tfor(i in 0 until v.size) {\n\t\tv[i][0] = 1L\n\t\tv[i][i] = 1L\n\t}\n\tfor(i in 0 until v.size) {\n\t\tfor(j in 1 until i) {\n\t\t\tv[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n\t\t}\n\t}\n\treturn v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n\twhen {\n\t\tn == 0L -> 1L\n\t\tn == 1L -> a % mod\n\t\tn % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n\t\telse -> {\n\t\t\tval tmp = repeatedModPow(a, n / 2L, mod)\n\t\t\t(tmp * tmp) % mod\n\t\t}\n\t}\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n\tvar ret = 1L\n\tval min = Math.min(k, n-k)\n\t// まず分母の計算\n\tfor(i in n downTo (n - min + 1)) {\n\t\tret = ret * i % mod\n\t}\n\tfor(i in min downTo 1) {\n\t\tret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n\t}\n\treturn ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n\tval factorials = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval inverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval factorialInverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tfor(i in 2 .. n) {\n\t\tfactorials[i] = (factorials[i-1] * i.toLong() % mod)\n\t\tinverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n\t\tfactorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n\t}\n\n\treturn factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n\tif(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n\ta / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n\tvar num = num_\n\tvar rtn: Long = 0\n\twhile(num != 0.toLong()) {\n\t\tval tmp = num % 10\n\t\trtn += tmp\n\t\tnum /= 10\n\t}\n\treturn rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n\tprivate val parent: Array = Array(n) { 0 }\n\tprivate val rank: Array = Array(n) { 0 }\n\tprivate val size: Array = Array(n) { 0 }\n\n\tinit {\n\t\tfor(i in 0 until n) {\n\t\t\tparent[i] = i\n\t\t\trank[i] = 1\n\t\t\tsize[i] = 1\n\t\t}\n\t}\n\n\tfun union(u: Int, v: Int) {\n\t\tvar x = root(u)\n\t\tvar y = root(v)\n\t\tif(x != y) {\n\t\t\tif(rank[y] < rank[x]) {\n\t\t\t\tval tmp = y \n\t\t\t\ty = x\n\t\t\t\tx = tmp \n\t\t\t}\n\t\t\tparent[x] = y\n\t\t\trank[y] += rank[x]\n\t\t\trank[x] = -1\n\t\t\tval totalSize = size[x] + size[y]\n\t\t\tsize[x] = totalSize\n\t\t\tsize[y] = totalSize\n\t\t}\n\t}\n\n\tfun root(u: Int): Int {\n\t\tvar x = u\n\t\twhile(parent[x] != x) {\n\t\t\tx = parent[x]\n\t\t}\n\t\treturn x \n\t}\n\n\tfun size(u: Int): Int = size[root(u)]\n}\n", "language": "Kotlin", "metadata": {"date": 1598733293, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Kotlin/s314403047.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s314403047", "user_id": "u026686258"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val n = readInt()\n val aList = readListOfLong()\n\n val cMul = LongArray(n+1) { 1L }\n for(i in 0 until n) {\n cMul[i+1] = cMul[i] * aList[i]\n \n }\n // println(\"cmul: ${cMul.toList()}\")\n var isPairWise = true\n\n for(i in 0 until n-1) {\n val a = aList[i]\n val mul = cMul[n] / cMul[i+1]\n val num = gcd(mul, a)\n if(num > 1L) {\n isPairWise = false\n }\n }\n\n val gcds = aList.fold(aList[0]) { acc, v -> gcd(acc, v) }\n val isSetwise = gcds == 1L\n\n val ans = if(isPairWise) \"pairwise coprime\"\n else {\n if(isSetwise) \"setwise coprime\"\n else \"not coprime\"\n }\n println(ans)\n\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n\t= this.groupBy { it }.mapValues { it.value.size }\n\nfun> Array.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int\n\t= this.toList().upperBound(element, fromIndex, toIndex)\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element >= this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn l\n}\n\nfun> Array.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int\n\t= this.toList().lowerBound(element, fromIndex, toIndex)\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element > this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n\tval divisors = mutableListOf()\n\tfor(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n\t\tif(this % i == 0L) {\n\t\t\tdivisors.add(i)\n\t\t\tif(i != this/i) {\n\t\t\t\tdivisors.add(this/i)\n\t\t\t}\n\t\t}\n\t}\n\treturn divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n\tif(this==1L) return false\n\tfor(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n\t\tif(this % i == 0L && this != i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\nfun Long.primeFactorize(): Map {\n\tval map = mutableMapOf()\n\tvar num = this\n\tfor(i in 2L .. Math.sqrt(num.toDouble()).toLong()+1L) {\n\t\tif(num % i == 0L) {\n\t\t\twhile(num % i == 0L) {\n\t\t\t\tmap[i] = (map[i]?:0) + 1\n\t\t\t\tnum /= i\n\t\t\t}\n\t\t}\n\t}\n\tif(num != 1L) {\n\t\tmap[num] = 1 \n\t}\n\treturn map\n}\n\nfun permutations(src: List): List> {\n\tif(src.size == 1) return listOf(src)\n\tval perms = mutableListOf>()\n\tval insertElement = src[0]\n\tpermutations(src.drop(1)).forEach { perm ->\n\t\tfor(i in 0..perm.size) {\n\t\t\tval newPerm = perm.toMutableList()\n\t\t\tnewPerm.add(i, insertElement)\n\t\t\tperms.add(newPerm.toList())\n\t\t}\n\t}\n\treturn perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n\tval v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n\tfor(i in 0 until v.size) {\n\t\tv[i][0] = 1L\n\t\tv[i][i] = 1L\n\t}\n\tfor(i in 0 until v.size) {\n\t\tfor(j in 1 until i) {\n\t\t\tv[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n\t\t}\n\t}\n\treturn v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n\twhen {\n\t\tn == 0L -> 1L\n\t\tn == 1L -> a % mod\n\t\tn % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n\t\telse -> {\n\t\t\tval tmp = repeatedModPow(a, n / 2L, mod)\n\t\t\t(tmp * tmp) % mod\n\t\t}\n\t}\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n\tvar ret = 1L\n\tval min = Math.min(k, n-k)\n\t// まず分母の計算\n\tfor(i in n downTo (n - min + 1)) {\n\t\tret = ret * i % mod\n\t}\n\tfor(i in min downTo 1) {\n\t\tret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n\t}\n\treturn ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n\tval factorials = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval inverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval factorialInverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tfor(i in 2 .. n) {\n\t\tfactorials[i] = (factorials[i-1] * i.toLong() % mod)\n\t\tinverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n\t\tfactorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n\t}\n\n\treturn factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n\tif(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n\ta / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n\tvar num = num_\n\tvar rtn: Long = 0\n\twhile(num != 0.toLong()) {\n\t\tval tmp = num % 10\n\t\trtn += tmp\n\t\tnum /= 10\n\t}\n\treturn rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n\tprivate val parent: Array = Array(n) { 0 }\n\tprivate val rank: Array = Array(n) { 0 }\n\tprivate val size: Array = Array(n) { 0 }\n\n\tinit {\n\t\tfor(i in 0 until n) {\n\t\t\tparent[i] = i\n\t\t\trank[i] = 1\n\t\t\tsize[i] = 1\n\t\t}\n\t}\n\n\tfun union(u: Int, v: Int) {\n\t\tvar x = root(u)\n\t\tvar y = root(v)\n\t\tif(x != y) {\n\t\t\tif(rank[y] < rank[x]) {\n\t\t\t\tval tmp = y \n\t\t\t\ty = x\n\t\t\t\tx = tmp \n\t\t\t}\n\t\t\tparent[x] = y\n\t\t\trank[y] += rank[x]\n\t\t\trank[x] = -1\n\t\t\tval totalSize = size[x] + size[y]\n\t\t\tsize[x] = totalSize\n\t\t\tsize[y] = totalSize\n\t\t}\n\t}\n\n\tfun root(u: Int): Int {\n\t\tvar x = u\n\t\twhile(parent[x] != x) {\n\t\t\tx = parent[x]\n\t\t}\n\t\treturn x \n\t}\n\n\tfun size(u: Int): Int = size[root(u)]\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6485, "cpu_time_ms": 969, "memory_kb": 157316}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s282498543", "group_id": "codeNet:p02574", "input_text": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n\n val allP = mutableSetOf()\n val dupP = Array(1000000) {0}\n var pMax = 0\n var pc = true\n\n fun sb(inp :Int): Set {\n var n = inp\n val s = Math.floor(Math.sqrt(n.toDouble())).toInt()\n val ret = mutableSetOf()\n if (!pc) {\n allP.forEach {\n if (n % it == 0) {\n ret.add(it)\n }\n }\n } else {\n if (n % 2 == 0) {\n ret.add(2)\n while (n % 2 == 0) {\n n /= 2\n }\n }\n var i = 3\n while (i <= s) {\n if (n % i == 0) {\n ret.add(i)\n while (n % i == 0) {\n n /= i\n }\n }\n i += 2\n }\n if (n > s) ret.add(n)\n }\n return ret\n }\n\n readLine()!!.split(' ').map { s->\n val p = sb(s.toInt())\n p.forEach {\n if (pc) {\n if (it in allP) {\n pc = false\n }\n }\n dupP[it]++\n pMax = Math.max(pMax, dupP[it])\n allP.add(it)\n }\n }\n\n println(\n when {\n pc -> \"pairwise coprime\"\n pMax == N -> \"not coprime\"\n else -> \"setwise coprime\"\n }\n )\n}\n", "language": "Kotlin", "metadata": {"date": 1598733141, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Kotlin/s282498543.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s282498543", "user_id": "u288435405"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n\n val allP = mutableSetOf()\n val dupP = Array(1000000) {0}\n var pMax = 0\n var pc = true\n\n fun sb(inp :Int): Set {\n var n = inp\n val s = Math.floor(Math.sqrt(n.toDouble())).toInt()\n val ret = mutableSetOf()\n if (!pc) {\n allP.forEach {\n if (n % it == 0) {\n ret.add(it)\n }\n }\n } else {\n if (n % 2 == 0) {\n ret.add(2)\n while (n % 2 == 0) {\n n /= 2\n }\n }\n var i = 3\n while (i <= s) {\n if (n % i == 0) {\n ret.add(i)\n while (n % i == 0) {\n n /= i\n }\n }\n i += 2\n }\n if (n > s) ret.add(n)\n }\n return ret\n }\n\n readLine()!!.split(' ').map { s->\n val p = sb(s.toInt())\n p.forEach {\n if (pc) {\n if (it in allP) {\n pc = false\n }\n }\n dupP[it]++\n pMax = Math.max(pMax, dupP[it])\n allP.add(it)\n }\n }\n\n println(\n when {\n pc -> \"pairwise coprime\"\n pMax == N -> \"not coprime\"\n else -> \"setwise coprime\"\n }\n )\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1453, "cpu_time_ms": 2208, "memory_kb": 151392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s451337742", "group_id": "codeNet:p02574", "input_text": "import java.math.BigInteger\n \nfun main(args: Array) {\n val n = readLine()!!.toInt()\n val arr = readLine()!!.split(' ').map { it.toLong() }\n \n var product = BigInteger.valueOf(1L)\n arr.forEach {\n product = product.multiply(BigInteger.valueOf(it))\n }\n var ans = BigInteger.ONE\n for (i in arr.indices) {\n ans = lcm(ans, BigInteger.valueOf(arr[i]))\n }\n if (ans == product) {\n println(\"pairwise coprime\")\n return\n }\n \n var result = 0L\n for (element in arr) {\n result = gcd(result, element)\n if (result == 1L) {\n println(\"setwise coprime\")\n return\n }\n }\n \n println(\"not coprime\")\n}\n \nfun lcm(a: BigInteger, b: BigInteger): BigInteger {\n return a / gcd(a, b) * b\n}\n \nfun gcd(a: BigInteger, b: BigInteger): BigInteger {\n return if (b == BigInteger.ZERO) a else gcd(b, a % b)\n}\n\nfun gcd(a: Long, b: Long): Long {\n return if (b == 0L) a else gcd(b, a % b)\n}", "language": "Kotlin", "metadata": {"date": 1598731924, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Kotlin/s451337742.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s451337742", "user_id": "u231726477"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "import java.math.BigInteger\n \nfun main(args: Array) {\n val n = readLine()!!.toInt()\n val arr = readLine()!!.split(' ').map { it.toLong() }\n \n var product = BigInteger.valueOf(1L)\n arr.forEach {\n product = product.multiply(BigInteger.valueOf(it))\n }\n var ans = BigInteger.ONE\n for (i in arr.indices) {\n ans = lcm(ans, BigInteger.valueOf(arr[i]))\n }\n if (ans == product) {\n println(\"pairwise coprime\")\n return\n }\n \n var result = 0L\n for (element in arr) {\n result = gcd(result, element)\n if (result == 1L) {\n println(\"setwise coprime\")\n return\n }\n }\n \n println(\"not coprime\")\n}\n \nfun lcm(a: BigInteger, b: BigInteger): BigInteger {\n return a / gcd(a, b) * b\n}\n \nfun gcd(a: BigInteger, b: BigInteger): BigInteger {\n return if (b == BigInteger.ZERO) a else gcd(b, a % b)\n}\n\nfun gcd(a: Long, b: Long): Long {\n return if (b == 0L) a else gcd(b, a % b)\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 977, "cpu_time_ms": 2211, "memory_kb": 180448}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s840563827", "group_id": "codeNet:p02574", "input_text": "// solution is at the bottom\n\nimport kotlin.math.*\nimport kotlin.system.exitProcess\n\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(true) {\n when(c) {\n '\\n', Char.MIN_VALUE -> return@buildString\n else -> {\n append(c)\n c = readChar()\n }\n }\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\nfun gcd(xx: Int, yy: Int): Int {\n var x = xx\n var y = yy\n while (y != 0) {\n x %= y\n x = y.also {y = x}\n }\n\n return x\n}\n\nfun main() {\n val MAX = 1_000_001\n val n = readInt()\n val a = readIntArray(n)\n\n val primes = BooleanArray(MAX) {true}\n primes[2] = true\n primes[1] = false\n for (p in 2 until MAX) {\n if (primes[p]) {\n var pp = 2*p\n while (pp < MAX) {\n primes[pp] = false\n pp += p\n }\n }\n }\n\n val primesSet = mutableSetOf()\n val primesList = mutableListOf()\n val used = BooleanArray(MAX) {false}\n\n for (x in 1..MAX - 1) {\n if (primes[x]) {\n primesSet.add(x)\n primesList.add(x)\n }\n }\n\n var ok = false\n\n fun factorize(x: Int) {\n if (x == 1) {\n return\n }\n if (x in primesSet) {\n if (used[x]) {\n ok = true\n return\n } else {\n used[x] = true\n }\n } else {\n for (p in primesList) {\n if (x % p == 0) {\n if (used[p]) {\n ok = true\n return\n } else {\n used[p] = true\n var xx = x\n while (xx % p == 0) {\n xx /= p\n }\n\n factorize(xx)\n break\n }\n }\n }\n }\n }\n\n if (n <= primesSet.size) {\n for (i in 0 until n) {\n factorize(a[i])\n if (ok) {\n break\n }\n }\n\n if (!ok) {\n println(\"pairwise coprime\")\n exitProcess(0)\n }\n }\n\n var g = a[0]\n for (i in 1 until n) {\n g = gcd(g, a[i])\n }\n\n if (g == 1) {\n println(\"setwise coprime\")\n } else {\n println(\"not coprime\")\n }\n\n\n}\n", "language": "Kotlin", "metadata": {"date": 1598730269, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Kotlin/s840563827.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s840563827", "user_id": "u188093234"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "// solution is at the bottom\n\nimport kotlin.math.*\nimport kotlin.system.exitProcess\n\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(true) {\n when(c) {\n '\\n', Char.MIN_VALUE -> return@buildString\n else -> {\n append(c)\n c = readChar()\n }\n }\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\nfun gcd(xx: Int, yy: Int): Int {\n var x = xx\n var y = yy\n while (y != 0) {\n x %= y\n x = y.also {y = x}\n }\n\n return x\n}\n\nfun main() {\n val MAX = 1_000_001\n val n = readInt()\n val a = readIntArray(n)\n\n val primes = BooleanArray(MAX) {true}\n primes[2] = true\n primes[1] = false\n for (p in 2 until MAX) {\n if (primes[p]) {\n var pp = 2*p\n while (pp < MAX) {\n primes[pp] = false\n pp += p\n }\n }\n }\n\n val primesSet = mutableSetOf()\n val primesList = mutableListOf()\n val used = BooleanArray(MAX) {false}\n\n for (x in 1..MAX - 1) {\n if (primes[x]) {\n primesSet.add(x)\n primesList.add(x)\n }\n }\n\n var ok = false\n\n fun factorize(x: Int) {\n if (x == 1) {\n return\n }\n if (x in primesSet) {\n if (used[x]) {\n ok = true\n return\n } else {\n used[x] = true\n }\n } else {\n for (p in primesList) {\n if (x % p == 0) {\n if (used[p]) {\n ok = true\n return\n } else {\n used[p] = true\n var xx = x\n while (xx % p == 0) {\n xx /= p\n }\n\n factorize(xx)\n break\n }\n }\n }\n }\n }\n\n if (n <= primesSet.size) {\n for (i in 0 until n) {\n factorize(a[i])\n if (ok) {\n break\n }\n }\n\n if (!ok) {\n println(\"pairwise coprime\")\n exitProcess(0)\n }\n }\n\n var g = a[0]\n for (i in 1 until n) {\n g = gcd(g, a[i])\n }\n\n if (g == 1) {\n println(\"setwise coprime\")\n } else {\n println(\"not coprime\")\n }\n\n\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3780, "cpu_time_ms": 351, "memory_kb": 64808}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s265460430", "group_id": "codeNet:p02574", "input_text": "// solution is at the bottom\n\nimport kotlin.math.*\nimport kotlin.system.exitProcess\n\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(true) {\n when(c) {\n '\\n', Char.MIN_VALUE -> return@buildString\n else -> {\n append(c)\n c = readChar()\n }\n }\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\nfun gcd(xx: Int, yy: Int): Int {\n var x = xx\n var y = yy\n while (y != 0) {\n x %= y\n x = y.also {y = x}\n }\n\n return x\n}\n\nfun main() {\n val MAX = 1_000_001\n val n = readInt()\n val a = readIntArray(n)\n\n val primes = BooleanArray(MAX) {true}\n primes[2] = true\n primes[1] = false\n for (p in 2 until MAX) {\n if (primes[p]) {\n var pp = 2*p\n while (pp < MAX) {\n primes[pp] = false\n pp += p\n }\n }\n }\n\n val primesSet = mutableSetOf()\n val primesList = mutableListOf()\n val used = BooleanArray(MAX) {false}\n\n for (x in 1..MAX - 1) {\n if (primes[x]) {\n primesSet.add(x)\n primesList.add(x)\n }\n }\n\n var ok = false\n\n fun factorize(x: Int) {\n if (x == 1) {\n return\n }\n if (x in primesSet) {\n if (used[x]) {\n ok = true\n return\n } else {\n used[x] = true\n }\n } else {\n for (p in primesList) {\n if (x % p == 0) {\n if (used[p]) {\n ok = true\n return\n } else {\n used[p] = true\n var xx = x\n while (xx % p == 0) {\n xx /= p\n }\n\n factorize(xx)\n break\n }\n }\n }\n }\n }\n\n if (n < primesSet.size) {\n for (i in 0 until n) {\n factorize(a[i])\n if (ok) {\n break\n }\n }\n\n if (!ok) {\n println(\"pairwise coprime\")\n exitProcess(0)\n }\n }\n\n var g = a[0]\n for (i in 1 until n) {\n g = gcd(g, a[i])\n }\n\n if (g == 1) {\n println(\"setwise coprime\")\n } else {\n println(\"not coprime\")\n }\n\n\n}\n", "language": "Kotlin", "metadata": {"date": 1598730182, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02574.html", "problem_id": "p02574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02574/input.txt", "sample_output_relpath": "derived/input_output/data/p02574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02574/Kotlin/s265460430.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s265460430", "user_id": "u188093234"}, "prompt_components": {"gold_output": "pairwise coprime\n", "input_to_evaluate": "// solution is at the bottom\n\nimport kotlin.math.*\nimport kotlin.system.exitProcess\n\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(true) {\n when(c) {\n '\\n', Char.MIN_VALUE -> return@buildString\n else -> {\n append(c)\n c = readChar()\n }\n }\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\nfun gcd(xx: Int, yy: Int): Int {\n var x = xx\n var y = yy\n while (y != 0) {\n x %= y\n x = y.also {y = x}\n }\n\n return x\n}\n\nfun main() {\n val MAX = 1_000_001\n val n = readInt()\n val a = readIntArray(n)\n\n val primes = BooleanArray(MAX) {true}\n primes[2] = true\n primes[1] = false\n for (p in 2 until MAX) {\n if (primes[p]) {\n var pp = 2*p\n while (pp < MAX) {\n primes[pp] = false\n pp += p\n }\n }\n }\n\n val primesSet = mutableSetOf()\n val primesList = mutableListOf()\n val used = BooleanArray(MAX) {false}\n\n for (x in 1..MAX - 1) {\n if (primes[x]) {\n primesSet.add(x)\n primesList.add(x)\n }\n }\n\n var ok = false\n\n fun factorize(x: Int) {\n if (x == 1) {\n return\n }\n if (x in primesSet) {\n if (used[x]) {\n ok = true\n return\n } else {\n used[x] = true\n }\n } else {\n for (p in primesList) {\n if (x % p == 0) {\n if (used[p]) {\n ok = true\n return\n } else {\n used[p] = true\n var xx = x\n while (xx % p == 0) {\n xx /= p\n }\n\n factorize(xx)\n break\n }\n }\n }\n }\n }\n\n if (n < primesSet.size) {\n for (i in 0 until n) {\n factorize(a[i])\n if (ok) {\n break\n }\n }\n\n if (!ok) {\n println(\"pairwise coprime\")\n exitProcess(0)\n }\n }\n\n var g = a[0]\n for (i in 1 until n) {\n g = gcd(g, a[i])\n }\n\n if (g == 1) {\n println(\"setwise coprime\")\n } else {\n println(\"not coprime\")\n }\n\n\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "sample_input": "3\n3 4 5\n"}, "reference_outputs": ["pairwise coprime\n"], "source_document_id": "p02574", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N integers. The i-th number is A_i.\n\n\\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every pair (i, j) such that 1\\leq i < j \\leq N.\n\n\\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime but GCD(A_1,\\ldots,A_N)=1.\n\nDetermine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.\n\nHere, GCD(\\ldots) denotes greatest common divisor.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\n1 \\leq A_i\\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nIf \\{A_i\\} is pairwise coprime, print pairwise coprime; if \\{A_i\\} is setwise coprime, print setwise coprime; if neither, print not coprime.\n\nSample Input 1\n\n3\n3 4 5\n\nSample Output 1\n\npairwise coprime\n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\nSample Input 2\n\n3\n6 10 15\n\nSample Output 2\n\nsetwise coprime\n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.\n\nSample Input 3\n\n3\n6 10 16\n\nSample Output 3\n\nnot coprime\n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3779, "cpu_time_ms": 362, "memory_kb": 61424}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s699122774", "group_id": "codeNet:p02580", "input_text": "import java.util.*\nfun main(args: Array) {\n val reader = Scanner(System.`in`)\n val (H, M, W) = readLine()!!.split(\" \").map{ it.toInt() }\n val map = Array(H){\n val rows = IntArray(M)\n rows.fill(0)\n rows\n }\n var maxRowNum = 0\n var rowNoList = mutableListOf()\n val rowNums = IntArray(H)\n rowNums.fill(0)\n\n var maxColumnNum = 0\n var columnNoList = mutableListOf()\n val columnNums = IntArray(M)\n columnNums.fill(0)\n\n repeat(W){\n val (row, column) = readLine()!!.split(\" \").map { it.toInt() - 1}\n rowNums[row] += 1\n columnNums[column] += 1\n\n map[row][column]= 1\n\n if(rowNums[row] > maxRowNum){\n maxRowNum = rowNums[row]\n }\n\n if(columnNums[column] > maxColumnNum){\n maxColumnNum = columnNums[column]\n }\n }\n\n rowNums.forEachIndexed { index, i ->\n if(i == maxRowNum){\n rowNoList.add(index)\n }\n }\n\n columnNums.forEachIndexed{ index, i->\n if(i == maxColumnNum){\n columnNoList.add(index)\n }\n }\n\n var findCommon = true\n for(rowIndex in 0..rowNoList.size - 1){\n for(columnIndex in 0..columnNoList.size - 1){\n if(map[rowIndex][columnIndex] == 0){\n findCommon = false\n break\n }\n }\n if(!findCommon){\n break\n }\n }\n println(if(findCommon) maxRowNum + maxColumnNum - 1 else maxRowNum + maxColumnNum)\n}", "language": "Kotlin", "metadata": {"date": 1599233583, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Kotlin/s699122774.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s699122774", "user_id": "u412306454"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\nfun main(args: Array) {\n val reader = Scanner(System.`in`)\n val (H, M, W) = readLine()!!.split(\" \").map{ it.toInt() }\n val map = Array(H){\n val rows = IntArray(M)\n rows.fill(0)\n rows\n }\n var maxRowNum = 0\n var rowNoList = mutableListOf()\n val rowNums = IntArray(H)\n rowNums.fill(0)\n\n var maxColumnNum = 0\n var columnNoList = mutableListOf()\n val columnNums = IntArray(M)\n columnNums.fill(0)\n\n repeat(W){\n val (row, column) = readLine()!!.split(\" \").map { it.toInt() - 1}\n rowNums[row] += 1\n columnNums[column] += 1\n\n map[row][column]= 1\n\n if(rowNums[row] > maxRowNum){\n maxRowNum = rowNums[row]\n }\n\n if(columnNums[column] > maxColumnNum){\n maxColumnNum = columnNums[column]\n }\n }\n\n rowNums.forEachIndexed { index, i ->\n if(i == maxRowNum){\n rowNoList.add(index)\n }\n }\n\n columnNums.forEachIndexed{ index, i->\n if(i == maxColumnNum){\n columnNoList.add(index)\n }\n }\n\n var findCommon = true\n for(rowIndex in 0..rowNoList.size - 1){\n for(columnIndex in 0..columnNoList.size - 1){\n if(map[rowIndex][columnIndex] == 0){\n findCommon = false\n break\n }\n }\n if(!findCommon){\n break\n }\n }\n println(if(findCommon) maxRowNum + maxColumnNum - 1 else maxRowNum + maxColumnNum)\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1505, "cpu_time_ms": 1074, "memory_kb": 956336}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s840507743", "group_id": "codeNet:p02580", "input_text": "import java.io.*\nimport java.util.*\nimport java.lang.*\nimport java.lang.Math.*\n\n\nfun solve() {\n val (H, W, M) = rd.readIntArray()\n val X = IntArray(M); val Y = IntArray(M)\n val rowSum = IntArray(H){0}\n val colSum = IntArray(W){0}\n val st = mutableSetOf()\n for (i in 0 until M) {\n val (x, y) = rd.readIntArray().map{ it - 1 }\n X[i] = x; Y[i] = y\n rowSum[x]++\n colSum[y]++\n st.add(IntPair(x, y))\n }\n\n val rsMax = rowSum.max()!!\n val bxs = rowSum.withIndex()\n .filter { it.value == rsMax }.map{ it.index }\n\n val csMax = colSum.max()!!\n val bys = colSum.withIndex()\n .filter { it.value == csMax }.map { it.index }\n\n var occupied = true\n for (bx in bxs) {\n for (by in bys) {\n if (!st.contains(IntPair(bx, by))) {\n occupied = false\n break\n }\n }\n if (!occupied) break\n }\n\n val ans = if (occupied) rsMax+csMax-1 else rsMax+csMax\n print(ans)\n}\n\n\n//val rd = debug.Reader(\"abc\", \"176\", \"e\", \"sample-1\")\nval rd = Reader()\n\n\nfun main(args: Array) {\n try {\n var exception: Throwable? = null\n val sth = Thread(null, SolveThread(), \"solveThread\", 128 * 1024 * 1024)\n sth.setUncaughtExceptionHandler { _, e -> exception = e }\n sth.start(); sth.join()\n if (exception != null) throw exception!! }\n catch (e: Exception) { throw e }\n finally { rd.close() }\n}\nconst val MOD = 1_000_000_007L; const val INF = Int.MAX_VALUE/2; const val LINF = Long.MAX_VALUE/2\nconst val EPS = 1e-9; fun DBLEQ(a: Double, b: Double): Boolean {return abs(a - b) < EPS}\ndata class IntPair(val first: Int, val second: Int)\ndata class To(val idx: Int, val cost: Long)\nfun edge(V: Int): Array> { return Array(V){ArrayList()} }\nval errPrintln: (Any) -> Unit = { msg -> System.err.println(msg) }\nfun rAssert(exp: Boolean, lazyMsg: () -> String = {\"\"}) {\n if (!exp) { val msg = lazyMsg(); errPrintln(\"EAssert Error: $msg\"); throw Error(msg) }\n}\nfun tAssert(exp: Boolean, lazyMsg: () -> String = {\"\"}) {\n if (!exp) { val msg = lazyMsg(); errPrintln(\"TAssert Error: $msg\"); Thread.sleep(3000) }\n}\nclass SolveThread : Runnable {\n override fun run() { solve() }\n}\nclass Reader {\n private val br = BufferedReader(InputStreamReader(System.`in`))\n val readString: () -> String = { br.readLine() }\n val readInt: () -> Int = { br.readLine().toInt() }\n val readLong: () -> Long = { br.readLine().toLong() }\n val readIntArray: () -> IntArray = { br.readLine().split(' ').map { it.toInt() }.toIntArray() }\n val readLongArray: () -> LongArray = { br.readLine().split(' ').map { it.toLong() }.toLongArray() }\n val readListInt: () -> List = { br.readLine().split(' ').map { it.toInt() } }\n val readListLong: () -> List = { br.readLine().split(' ').map { it.toLong() } }\n val readListIntCol: (Int) -> List = { N -> (0 until N).map { readInt() } }\n val readListLongCol: (Int) -> List = { N -> (0 until N).map { readLong() } }\n val close: () -> Unit = { br.close() }\n protected fun finalize() { close() }\n}\n", "language": "Kotlin", "metadata": {"date": 1598280466, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Kotlin/s840507743.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s840507743", "user_id": "u404244809"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.*\nimport java.util.*\nimport java.lang.*\nimport java.lang.Math.*\n\n\nfun solve() {\n val (H, W, M) = rd.readIntArray()\n val X = IntArray(M); val Y = IntArray(M)\n val rowSum = IntArray(H){0}\n val colSum = IntArray(W){0}\n val st = mutableSetOf()\n for (i in 0 until M) {\n val (x, y) = rd.readIntArray().map{ it - 1 }\n X[i] = x; Y[i] = y\n rowSum[x]++\n colSum[y]++\n st.add(IntPair(x, y))\n }\n\n val rsMax = rowSum.max()!!\n val bxs = rowSum.withIndex()\n .filter { it.value == rsMax }.map{ it.index }\n\n val csMax = colSum.max()!!\n val bys = colSum.withIndex()\n .filter { it.value == csMax }.map { it.index }\n\n var occupied = true\n for (bx in bxs) {\n for (by in bys) {\n if (!st.contains(IntPair(bx, by))) {\n occupied = false\n break\n }\n }\n if (!occupied) break\n }\n\n val ans = if (occupied) rsMax+csMax-1 else rsMax+csMax\n print(ans)\n}\n\n\n//val rd = debug.Reader(\"abc\", \"176\", \"e\", \"sample-1\")\nval rd = Reader()\n\n\nfun main(args: Array) {\n try {\n var exception: Throwable? = null\n val sth = Thread(null, SolveThread(), \"solveThread\", 128 * 1024 * 1024)\n sth.setUncaughtExceptionHandler { _, e -> exception = e }\n sth.start(); sth.join()\n if (exception != null) throw exception!! }\n catch (e: Exception) { throw e }\n finally { rd.close() }\n}\nconst val MOD = 1_000_000_007L; const val INF = Int.MAX_VALUE/2; const val LINF = Long.MAX_VALUE/2\nconst val EPS = 1e-9; fun DBLEQ(a: Double, b: Double): Boolean {return abs(a - b) < EPS}\ndata class IntPair(val first: Int, val second: Int)\ndata class To(val idx: Int, val cost: Long)\nfun edge(V: Int): Array> { return Array(V){ArrayList()} }\nval errPrintln: (Any) -> Unit = { msg -> System.err.println(msg) }\nfun rAssert(exp: Boolean, lazyMsg: () -> String = {\"\"}) {\n if (!exp) { val msg = lazyMsg(); errPrintln(\"EAssert Error: $msg\"); throw Error(msg) }\n}\nfun tAssert(exp: Boolean, lazyMsg: () -> String = {\"\"}) {\n if (!exp) { val msg = lazyMsg(); errPrintln(\"TAssert Error: $msg\"); Thread.sleep(3000) }\n}\nclass SolveThread : Runnable {\n override fun run() { solve() }\n}\nclass Reader {\n private val br = BufferedReader(InputStreamReader(System.`in`))\n val readString: () -> String = { br.readLine() }\n val readInt: () -> Int = { br.readLine().toInt() }\n val readLong: () -> Long = { br.readLine().toLong() }\n val readIntArray: () -> IntArray = { br.readLine().split(' ').map { it.toInt() }.toIntArray() }\n val readLongArray: () -> LongArray = { br.readLine().split(' ').map { it.toLong() }.toLongArray() }\n val readListInt: () -> List = { br.readLine().split(' ').map { it.toInt() } }\n val readListLong: () -> List = { br.readLine().split(' ').map { it.toLong() } }\n val readListIntCol: (Int) -> List = { N -> (0 until N).map { readInt() } }\n val readListLongCol: (Int) -> List = { N -> (0 until N).map { readLong() } }\n val close: () -> Unit = { br.close() }\n protected fun finalize() { close() }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3164, "cpu_time_ms": 1676, "memory_kb": 116764}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s731489586", "group_id": "codeNet:p02580", "input_text": "import java.util.*\n\n//\n\nfun main() {\n abc176e()\n}\n\nfun abc176e() {\n val (h, w, m) = readLine()!!.split(\" \").map { it.toInt() }\n val bom = mutableMapOf>()\n val countH = IntArray(h + 1) { 0 }\n val countW = IntArray(w + 1) { 0 }\n var maxH = 0\n val maxHIndices = mutableSetOf()\n var maxW = 0\n val maxWIndices = mutableSetOf()\n repeat(m) {\n val (ih, iw) = readLine()!!.split(\" \").map { it.toInt() }\n if (ih in bom) {\n bom[ih]!!.add(iw)\n } else {\n bom[ih] = mutableSetOf(iw)\n }\n countH[ih]++\n if (countH[ih] > maxH) {\n maxH = countH[ih]\n maxHIndices.clear()\n maxHIndices.add(ih)\n } else if (countH[ih] == maxH) {\n maxHIndices.add(ih)\n }\n countW[iw]++\n if (countW[iw] > maxW) {\n maxW = countW[iw]\n maxWIndices.clear()\n maxWIndices.add(iw)\n } else if (countW[iw] == maxW) {\n maxWIndices.add(iw)\n }\n }\n for (th in maxHIndices) {\n for (tw in maxWIndices) {\n if (bom[th]?.contains(tw)?.not() ?: false) {\n println(maxH + maxW)\n return\n }\n }\n }\n println(maxH + maxW - 1)\n}\n", "language": "Kotlin", "metadata": {"date": 1598201736, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Kotlin/s731489586.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s731489586", "user_id": "u628907033"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\n//\n\nfun main() {\n abc176e()\n}\n\nfun abc176e() {\n val (h, w, m) = readLine()!!.split(\" \").map { it.toInt() }\n val bom = mutableMapOf>()\n val countH = IntArray(h + 1) { 0 }\n val countW = IntArray(w + 1) { 0 }\n var maxH = 0\n val maxHIndices = mutableSetOf()\n var maxW = 0\n val maxWIndices = mutableSetOf()\n repeat(m) {\n val (ih, iw) = readLine()!!.split(\" \").map { it.toInt() }\n if (ih in bom) {\n bom[ih]!!.add(iw)\n } else {\n bom[ih] = mutableSetOf(iw)\n }\n countH[ih]++\n if (countH[ih] > maxH) {\n maxH = countH[ih]\n maxHIndices.clear()\n maxHIndices.add(ih)\n } else if (countH[ih] == maxH) {\n maxHIndices.add(ih)\n }\n countW[iw]++\n if (countW[iw] > maxW) {\n maxW = countW[iw]\n maxWIndices.clear()\n maxWIndices.add(iw)\n } else if (countW[iw] == maxW) {\n maxWIndices.add(iw)\n }\n }\n for (th in maxHIndices) {\n for (tw in maxWIndices) {\n if (bom[th]?.contains(tw)?.not() ?: false) {\n println(maxH + maxW)\n return\n }\n }\n }\n println(maxH + maxW - 1)\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1293, "cpu_time_ms": 2700, "memory_kb": 219988}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s727838968", "group_id": "codeNet:p02580", "input_text": "fun main(args: Array) {\n val (H, W, M) = readLine()!!.split(' ').map { it.toInt() }\n val arrH = IntArray(H+1)\n val arrW = IntArray(W+1)\n val arr = mutableSetOf>()\n\n arrH[0] = 0\n arrW[0] = 0\n\n var maxH = 0\n var maxW = 0\n\n repeat(M) {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n\n arrH[h]++\n if (arrH[h] > arrH[maxH]) maxH = h\n\n arrW[w]++\n if (arrW[w] > arrW[maxW]) maxW = w\n\n arr.add(h to w)\n }\n\n val ans = arrH[maxH] + arrW[maxW]\n if (maxH to maxW !in arr) println(ans)\n else {\n val lstH = arrH.withIndex().filter { it.value == arrH[maxH] }.map { it.index}\n val lstW = arrW.withIndex().filter { it.value == arrW[maxW] }.map { it.index}\n\n lstH.forEach { i ->\n lstW.forEach { j ->\n if (maxH to maxW !in arr) {\n println(ans)\n return\n }\n }\n }\n println(ans - 1)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1598142638, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Kotlin/s727838968.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s727838968", "user_id": "u288435405"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val (H, W, M) = readLine()!!.split(' ').map { it.toInt() }\n val arrH = IntArray(H+1)\n val arrW = IntArray(W+1)\n val arr = mutableSetOf>()\n\n arrH[0] = 0\n arrW[0] = 0\n\n var maxH = 0\n var maxW = 0\n\n repeat(M) {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n\n arrH[h]++\n if (arrH[h] > arrH[maxH]) maxH = h\n\n arrW[w]++\n if (arrW[w] > arrW[maxW]) maxW = w\n\n arr.add(h to w)\n }\n\n val ans = arrH[maxH] + arrW[maxW]\n if (maxH to maxW !in arr) println(ans)\n else {\n val lstH = arrH.withIndex().filter { it.value == arrH[maxH] }.map { it.index}\n val lstW = arrW.withIndex().filter { it.value == arrW[maxW] }.map { it.index}\n\n lstH.forEach { i ->\n lstW.forEach { j ->\n if (maxH to maxW !in arr) {\n println(ans)\n return\n }\n }\n }\n println(ans - 1)\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1007, "cpu_time_ms": 3312, "memory_kb": 136252}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s205514636", "group_id": "codeNet:p02580", "input_text": "fun main(args : Array) {\n val (h, w, m) = readLine()!!.split(\" \").map { it.toInt() }\n val hasBomb = Array(h) { BooleanArray(w){false} }\n val hBombs = IntArray(h) {0}\n val wBombs = IntArray(w) {0}\n\n repeat(m) {\n val (bh, bw) = readLine()!!.split(\" \").map { it.toInt()-1 }\n hasBomb[bh][bw] = true\n hBombs[bh]++\n wBombs[bw]++\n }\n\n var hIndexes = mutableListOf()\n var hMax = 0\n var wIndexes = mutableListOf()\n var wMax = 0\n\n hBombs.forEachIndexed { idx, i ->\n if (i > hMax) {\n hMax = i\n hIndexes = mutableListOf(idx)\n } else if (i == hMax) {\n hIndexes.add(idx)\n }\n }\n\n wBombs.forEachIndexed { idx, i ->\n if (i > wMax) {\n wMax = i\n wIndexes = mutableListOf(idx)\n } else if (i == wMax) {\n wIndexes.add(idx)\n }\n }\n\n for (hIdx in hIndexes) {\n for (wIdx in wIndexes) {\n if (!hasBomb[hIdx][wIdx]) {\n println(hMax+wMax)\n return\n }\n }\n }\n\n println(hMax+wMax-1)\n}", "language": "Kotlin", "metadata": {"date": 1598134836, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Kotlin/s205514636.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s205514636", "user_id": "u262403099"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args : Array) {\n val (h, w, m) = readLine()!!.split(\" \").map { it.toInt() }\n val hasBomb = Array(h) { BooleanArray(w){false} }\n val hBombs = IntArray(h) {0}\n val wBombs = IntArray(w) {0}\n\n repeat(m) {\n val (bh, bw) = readLine()!!.split(\" \").map { it.toInt()-1 }\n hasBomb[bh][bw] = true\n hBombs[bh]++\n wBombs[bw]++\n }\n\n var hIndexes = mutableListOf()\n var hMax = 0\n var wIndexes = mutableListOf()\n var wMax = 0\n\n hBombs.forEachIndexed { idx, i ->\n if (i > hMax) {\n hMax = i\n hIndexes = mutableListOf(idx)\n } else if (i == hMax) {\n hIndexes.add(idx)\n }\n }\n\n wBombs.forEachIndexed { idx, i ->\n if (i > wMax) {\n wMax = i\n wIndexes = mutableListOf(idx)\n } else if (i == wMax) {\n wIndexes.add(idx)\n }\n }\n\n for (hIdx in hIndexes) {\n for (wIdx in wIndexes) {\n if (!hasBomb[hIdx][wIdx]) {\n println(hMax+wMax)\n return\n }\n }\n }\n\n println(hMax+wMax-1)\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1121, "cpu_time_ms": 1157, "memory_kb": 959200}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s045115473", "group_id": "codeNet:p02580", "input_text": "import kotlin.math.max\n\nfun main() {\n val (h, w, m) = nextIntList()\n val map = sized2DArray(h, w, 0)\n val mapX = mutableMapOf()\n val mapY = mutableMapOf()\n repeat(m) {\n val (y, x) = nextIntList()\n map[y - 1][x - 1] += 1\n mapX[x - 1] = mapX.getOrDefault(x - 1, 0) + 1\n mapY[y - 1] = mapY.getOrDefault(y - 1, 0) + 1\n }\n\n var count = 0\n (0 until h).forEach { y ->\n val vy = mapY.getOrDefault(y, 0)\n (0 until w).forEach { x ->\n val vx = mapX.getOrDefault(x, 0)\n count = max(count, vy + vx - (if (map[y][x] > 0) 1 else 0))\n }\n }\n\n println(count)\n}\n\n// # Utils\n// ## Input\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = next().split(\" \").map(String::toInt)\nfun nextLongList() = next().split(\" \").map(String::toLong)\nfun nextDoubleList() = next().split(\" \").map(String::toDouble)\n\n// ## Array\ninline fun sizedArray(size: Int, default: T) = Array(size) { default }\ninline fun sized2DArray(row: Int, column: Int, default: T) = Array(row) { Array(column) { default } }\n\n// ## mod^-1\n// [NOTE] CANNOT use this for 0, mod, 2mod, 3mod ...(return wrong value)\nfun modinv(num: Long, mod: Long): Long {\n var a = num\n var b = mod\n var u = 1L\n var v = 0L\n while (b > 0) {\n val t = a.div(b)\n a -= t * b\n a = b.also { b = a } // swap a and b\n u -= t * v\n u = v.also { v = u } // swap u and v\n }\n u %= mod\n if (u < 0) u += mod\n return u\n}", "language": "Kotlin", "metadata": {"date": 1598128712, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Kotlin/s045115473.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s045115473", "user_id": "u885556801"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import kotlin.math.max\n\nfun main() {\n val (h, w, m) = nextIntList()\n val map = sized2DArray(h, w, 0)\n val mapX = mutableMapOf()\n val mapY = mutableMapOf()\n repeat(m) {\n val (y, x) = nextIntList()\n map[y - 1][x - 1] += 1\n mapX[x - 1] = mapX.getOrDefault(x - 1, 0) + 1\n mapY[y - 1] = mapY.getOrDefault(y - 1, 0) + 1\n }\n\n var count = 0\n (0 until h).forEach { y ->\n val vy = mapY.getOrDefault(y, 0)\n (0 until w).forEach { x ->\n val vx = mapX.getOrDefault(x, 0)\n count = max(count, vy + vx - (if (map[y][x] > 0) 1 else 0))\n }\n }\n\n println(count)\n}\n\n// # Utils\n// ## Input\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = next().split(\" \").map(String::toInt)\nfun nextLongList() = next().split(\" \").map(String::toLong)\nfun nextDoubleList() = next().split(\" \").map(String::toDouble)\n\n// ## Array\ninline fun sizedArray(size: Int, default: T) = Array(size) { default }\ninline fun sized2DArray(row: Int, column: Int, default: T) = Array(row) { Array(column) { default } }\n\n// ## mod^-1\n// [NOTE] CANNOT use this for 0, mod, 2mod, 3mod ...(return wrong value)\nfun modinv(num: Long, mod: Long): Long {\n var a = num\n var b = mod\n var u = 1L\n var v = 0L\n while (b > 0) {\n val t = a.div(b)\n a -= t * b\n a = b.also { b = a } // swap a and b\n u -= t * v\n u = v.also { v = u } // swap u and v\n }\n u %= mod\n if (u < 0) u += mod\n return u\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1662, "cpu_time_ms": 3331, "memory_kb": 961552}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s711604105", "group_id": "codeNet:p02580", "input_text": "import java.io.IOException\nimport java.lang.NumberFormatException\nimport java.lang.StringBuilder\nimport kotlin.math.max\nimport kotlin.math.pow\n\nobject AMain{\n fun solve(){\n val h = nextInt()\n val w = nextInt()\n val m = nextInt()\n\n val numh = IntArray(h)\n val numw = IntArray(w)\n val map = HashMap, Int>()\n\n for(i in 1..m){\n val mh = nextInt() - 1\n val mw = nextInt() - 1\n numh[mh]++\n numw[mw]++\n map[mh to mw] = 1\n }\n\n val maxh = numh.max()!!\n val maxw = numw.max()!!\n\n val listh = ArrayList()\n val listw = ArrayList()\n for (i in 0 until h){\n if(numh[i] == maxh) listh.add(i)\n }\n for (i in 0 until w){\n if(numw[i] == maxw) listw.add(i)\n }\n\n var ans = maxh + maxw - 1\n for(i in 0 until listh.size){\n for(j in 0 until listw.size){\n if(!map.containsKey(listh[i] to listw[j])){\n ans = maxh + maxw\n break;\n }\n }\n }\n\n println(ans)\n }\n\n\n\n\n\n // Scanner based on uwi-san's Java code\n val stream = System.`in`\n val buffer = ByteArray(1024)\n var ptr = 0\n var buflen = 0\n\n fun hasNextByte(): Boolean{\n if(ptr < buflen){\n return true\n }else{\n ptr = 0\n try{\n buflen = stream.read(buffer)\n }catch (e: IOException){\n e.printStackTrace()\n }\n if(buflen <= 0){\n return false\n }\n }\n return true\n }\n\n fun readByte() =\n if(hasNextByte()) buffer[ptr++]\n else -1\n\n fun isPrintableChar(c: Byte) = c in 33..126\n\n fun hasNext(): Boolean{\n while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++\n return hasNextByte()\n }\n\n fun next(): String{\n if(!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while(isPrintableChar(b)){\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long{\n if(!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if(b == '-'.toByte()){\n minus = true\n b = readByte()\n }\n if(b !in '0'.toByte()..'9'.toByte())\n throw NumberFormatException()\n while(true){\n if(b in '0'.toByte()..'9'.toByte()){\n n *= 10\n n += b - '0'.toByte()\n }else if(!isPrintableChar(b)){\n return if(minus) -n else n\n }else{\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int{\n val n1 = nextLong()\n if(n1 !in Int.MIN_VALUE..Int.MAX_VALUE)\n throw NumberFormatException()\n return n1.toInt()\n }\n\n fun NextDouble() = next().toDouble()\n}\n\nfun main(){\n AMain.solve()\n}\n\n", "language": "Kotlin", "metadata": {"date": 1598128105, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Kotlin/s711604105.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s711604105", "user_id": "u097204018"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.IOException\nimport java.lang.NumberFormatException\nimport java.lang.StringBuilder\nimport kotlin.math.max\nimport kotlin.math.pow\n\nobject AMain{\n fun solve(){\n val h = nextInt()\n val w = nextInt()\n val m = nextInt()\n\n val numh = IntArray(h)\n val numw = IntArray(w)\n val map = HashMap, Int>()\n\n for(i in 1..m){\n val mh = nextInt() - 1\n val mw = nextInt() - 1\n numh[mh]++\n numw[mw]++\n map[mh to mw] = 1\n }\n\n val maxh = numh.max()!!\n val maxw = numw.max()!!\n\n val listh = ArrayList()\n val listw = ArrayList()\n for (i in 0 until h){\n if(numh[i] == maxh) listh.add(i)\n }\n for (i in 0 until w){\n if(numw[i] == maxw) listw.add(i)\n }\n\n var ans = maxh + maxw - 1\n for(i in 0 until listh.size){\n for(j in 0 until listw.size){\n if(!map.containsKey(listh[i] to listw[j])){\n ans = maxh + maxw\n break;\n }\n }\n }\n\n println(ans)\n }\n\n\n\n\n\n // Scanner based on uwi-san's Java code\n val stream = System.`in`\n val buffer = ByteArray(1024)\n var ptr = 0\n var buflen = 0\n\n fun hasNextByte(): Boolean{\n if(ptr < buflen){\n return true\n }else{\n ptr = 0\n try{\n buflen = stream.read(buffer)\n }catch (e: IOException){\n e.printStackTrace()\n }\n if(buflen <= 0){\n return false\n }\n }\n return true\n }\n\n fun readByte() =\n if(hasNextByte()) buffer[ptr++]\n else -1\n\n fun isPrintableChar(c: Byte) = c in 33..126\n\n fun hasNext(): Boolean{\n while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++\n return hasNextByte()\n }\n\n fun next(): String{\n if(!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while(isPrintableChar(b)){\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long{\n if(!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if(b == '-'.toByte()){\n minus = true\n b = readByte()\n }\n if(b !in '0'.toByte()..'9'.toByte())\n throw NumberFormatException()\n while(true){\n if(b in '0'.toByte()..'9'.toByte()){\n n *= 10\n n += b - '0'.toByte()\n }else if(!isPrintableChar(b)){\n return if(minus) -n else n\n }else{\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int{\n val n1 = nextLong()\n if(n1 !in Int.MIN_VALUE..Int.MAX_VALUE)\n throw NumberFormatException()\n return n1.toInt()\n }\n\n fun NextDouble() = next().toDouble()\n}\n\nfun main(){\n AMain.solve()\n}\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3160, "cpu_time_ms": 1146, "memory_kb": 101172}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s954405478", "group_id": "codeNet:p02580", "input_text": "fun main() {\n val (h, w, m) = readLine()!!.split(\" \").map { it.toInt() }\n val gyou = MutableList(h) { 0 }\n val retu = MutableList(w) { 0 }\n val grid = MutableList(m) { MutableList(w) { 0 } }\n for (i in 0 until m) {\n val hw = readLine()!!.split(\" \").map { it.toInt() }\n grid[hw[0] - 1][hw[1] - 1] = 1\n gyou[hw[0] - 1]++\n retu[hw[1] - 1]++\n }\n var ans = gyou.max()!! + retu.max()!!\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1598127294, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Kotlin/s954405478.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s954405478", "user_id": "u385678999"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val (h, w, m) = readLine()!!.split(\" \").map { it.toInt() }\n val gyou = MutableList(h) { 0 }\n val retu = MutableList(w) { 0 }\n val grid = MutableList(m) { MutableList(w) { 0 } }\n for (i in 0 until m) {\n val hw = readLine()!!.split(\" \").map { it.toInt() }\n grid[hw[0] - 1][hw[1] - 1] = 1\n gyou[hw[0] - 1]++\n retu[hw[1] - 1]++\n }\n var ans = gyou.max()!! + retu.max()!!\n println(ans)\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 447, "cpu_time_ms": 3331, "memory_kb": 964244}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s431827494", "group_id": "codeNet:p02580", "input_text": "// solution is at the bottom\n\nimport kotlin.math.*\n\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(true) {\n when(c) {\n '\\n', Char.MIN_VALUE -> return@buildString\n else -> {\n append(c)\n c = readChar()\n }\n }\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n\nfun main() {\n val (n, m, k) = readIntArray(3)\n val colCount = IntArray(m) {0}\n val rowCount = IntArray(n) {0}\n\n val points = mutableSetOf>()\n for (kk in 1..k) {\n var (row, col) = readIntArray(2)\n row--\n col--\n\n colCount[col]++\n rowCount[row]++\n\n points.add(Pair(row, col))\n }\n\n// println(colCount.joinToString(\" \"))\n// println(rowCount.joinToString(\" \"))\n\n val colMax = colCount.max()!!\n val col = colCount.indexOf(colMax)\n\n var result = 0\n\n for (row in 0 until n) {\n var ths = colCount[col] + rowCount[row]\n if (Pair(row, col) in points) {\n ths--\n }\n\n result = max(result, ths)\n }\n\n val rowMax = rowCount.max()!!\n val row = rowCount.indexOf(rowMax)\n\n for (col in 0 until m) {\n var ths = colCount[col] + rowCount[row]\n if (Pair(row, col) in points) {\n ths--\n }\n\n result = max(result, ths)\n }\n\n println(result)\n}\n", "language": "Kotlin", "metadata": {"date": 1598126645, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Kotlin/s431827494.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s431827494", "user_id": "u188093234"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "// solution is at the bottom\n\nimport kotlin.math.*\n\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(true) {\n when(c) {\n '\\n', Char.MIN_VALUE -> return@buildString\n else -> {\n append(c)\n c = readChar()\n }\n }\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n\nfun main() {\n val (n, m, k) = readIntArray(3)\n val colCount = IntArray(m) {0}\n val rowCount = IntArray(n) {0}\n\n val points = mutableSetOf>()\n for (kk in 1..k) {\n var (row, col) = readIntArray(2)\n row--\n col--\n\n colCount[col]++\n rowCount[row]++\n\n points.add(Pair(row, col))\n }\n\n// println(colCount.joinToString(\" \"))\n// println(rowCount.joinToString(\" \"))\n\n val colMax = colCount.max()!!\n val col = colCount.indexOf(colMax)\n\n var result = 0\n\n for (row in 0 until n) {\n var ths = colCount[col] + rowCount[row]\n if (Pair(row, col) in points) {\n ths--\n }\n\n result = max(result, ths)\n }\n\n val rowMax = rowCount.max()!!\n val row = rowCount.indexOf(rowMax)\n\n for (col in 0 until m) {\n var ths = colCount[col] + rowCount[row]\n if (Pair(row, col) in points) {\n ths--\n }\n\n result = max(result, ths)\n }\n\n println(result)\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2720, "cpu_time_ms": 1574, "memory_kb": 109284}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s140519717", "group_id": "codeNet:p02580", "input_text": "fun main() {\n val f = readLine()!!.split(\" \").map { it.toInt() }\n val (m, n) = f[0] to f[1]\n val matrix = Array(m) { IntArray(n) }\n val rows = IntArray(m)\n val cols = IntArray(n)\n val targets = f[2]\n var max = 0\n for (t in 1..targets) {\n val (i, j) = readLine()!!.split(\" \").map { it.toInt() - 1 }\n matrix[i][j] = 1\n rows[i]++\n cols[j]++\n }\n for (i in rows.indices) {\n for (j in cols.indices) {\n var sum = rows[i] + cols[j]\n if (matrix[i][j] == 1) sum--\n max = maxOf(sum, max)\n }\n }\n println(max)\n}", "language": "Kotlin", "metadata": {"date": 1598126084, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Kotlin/s140519717.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s140519717", "user_id": "u594200089"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val f = readLine()!!.split(\" \").map { it.toInt() }\n val (m, n) = f[0] to f[1]\n val matrix = Array(m) { IntArray(n) }\n val rows = IntArray(m)\n val cols = IntArray(n)\n val targets = f[2]\n var max = 0\n for (t in 1..targets) {\n val (i, j) = readLine()!!.split(\" \").map { it.toInt() - 1 }\n matrix[i][j] = 1\n rows[i]++\n cols[j]++\n }\n for (i in rows.indices) {\n for (j in cols.indices) {\n var sum = rows[i] + cols[j]\n if (matrix[i][j] == 1) sum--\n max = maxOf(sum, max)\n }\n }\n println(max)\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 609, "cpu_time_ms": 1009, "memory_kb": 954056}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s877127929", "group_id": "codeNet:p02580", "input_text": "import java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\n\nval br = BufferedReader(InputStreamReader(System.`in`))\nval out = PrintWriter(System.out)\n\nfun main() {\n br.use { out.use {\n solve()\n out.flush()\n } }\n}\n\nfun solve() {\n val (h, w, m) = readIntegerList()\n val hw = Array(m) {\n val (h, w) = readIntegerList()\n Pair(h, w)\n }\n\n val mapH = mutableMapOf()\n for (a in hw) {\n mapH[a.first] = (mapH[a.first] ?: 0) + 1\n }\n val maxh = mapH.values.max()!!\n val hList = mutableListOf()\n for (a in mapH) {\n if (a.value == maxh) hList.add(a.key)\n }\n\n val mapW = mutableMapOf()\n for (a in hw) {\n mapW[a.second] = (mapW[a.second] ?: 0) + 1\n }\n val maxw = mapW.values.max()!!\n val wList = mutableSetOf()\n for (a in mapW) {\n if (a.value == maxw) wList.add(a.key)\n }\n\n val hwMap = mutableMapOf>()\n for (t in hw) {\n if(hwMap[t.first] != null){\n hwMap[t.first]?.add(t.second)\n } else {\n hwMap[t.first] = HashSet()\n hwMap[t.first]?.add(t.second)\n }\n }\n\n for (h in hList) {\n val ww = hwMap[h]!!\n if (wList.subtract(ww).size > 0) {\n out.println(maxh + maxw)\n return\n }\n }\n out.println(maxh + maxw - 1)\n}\n\n\n\nfun readInteger() = Integer.parseInt(br.readLine())\nfun readLong() = java.lang.Long.parseLong(br.readLine())\nfun readStringList() = br.readLine()!!.split(' ')\nfun readIntegerList() = readStringList().map(Integer::parseInt)\nfun readLongList() = readStringList().map(java.lang.Long::parseLong)\nfun readDoubleList() = readStringList().map(java.lang.Double::parseDouble)\n", "language": "Kotlin", "metadata": {"date": 1598125540, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02580.html", "problem_id": "p02580", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02580/input.txt", "sample_output_relpath": "derived/input_output/data/p02580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02580/Kotlin/s877127929.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s877127929", "user_id": "u784448849"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\n\nval br = BufferedReader(InputStreamReader(System.`in`))\nval out = PrintWriter(System.out)\n\nfun main() {\n br.use { out.use {\n solve()\n out.flush()\n } }\n}\n\nfun solve() {\n val (h, w, m) = readIntegerList()\n val hw = Array(m) {\n val (h, w) = readIntegerList()\n Pair(h, w)\n }\n\n val mapH = mutableMapOf()\n for (a in hw) {\n mapH[a.first] = (mapH[a.first] ?: 0) + 1\n }\n val maxh = mapH.values.max()!!\n val hList = mutableListOf()\n for (a in mapH) {\n if (a.value == maxh) hList.add(a.key)\n }\n\n val mapW = mutableMapOf()\n for (a in hw) {\n mapW[a.second] = (mapW[a.second] ?: 0) + 1\n }\n val maxw = mapW.values.max()!!\n val wList = mutableSetOf()\n for (a in mapW) {\n if (a.value == maxw) wList.add(a.key)\n }\n\n val hwMap = mutableMapOf>()\n for (t in hw) {\n if(hwMap[t.first] != null){\n hwMap[t.first]?.add(t.second)\n } else {\n hwMap[t.first] = HashSet()\n hwMap[t.first]?.add(t.second)\n }\n }\n\n for (h in hList) {\n val ww = hwMap[h]!!\n if (wList.subtract(ww).size > 0) {\n out.println(maxh + maxw)\n return\n }\n }\n out.println(maxh + maxw - 1)\n}\n\n\n\nfun readInteger() = Integer.parseInt(br.readLine())\nfun readLong() = java.lang.Long.parseLong(br.readLine())\nfun readStringList() = br.readLine()!!.split(' ')\nfun readIntegerList() = readStringList().map(Integer::parseInt)\nfun readLongList() = readStringList().map(java.lang.Long::parseLong)\nfun readDoubleList() = readStringList().map(java.lang.Double::parseDouble)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "sample_input": "2 3 3\n2 2\n1 1\n1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02580", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a two-dimensional grid with H \\times W squares. There are M targets to destroy in this grid - the position of the i-th target is \\left(h_i, w_i \\right).\n\nTakahashi will choose one square in this grid, place a bomb there, and ignite it. The bomb will destroy all targets that are in the row or the column where the bomb is placed. It is possible to place the bomb at a square with a target.\n\nTakahashi is trying to maximize the number of targets to destroy. Find the maximum number of targets that can be destroyed.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 3 \\times 10^5\n\n1 \\leq M \\leq \\min\\left(H\\times W, 3 \\times 10^5\\right)\n\n1 \\leq h_i \\leq H\n\n1 \\leq w_i \\leq W\n\n\\left(h_i, w_i\\right) \\neq \\left(h_j, w_j\\right) \\left(i \\neq j\\right)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W M\nh_1 w_1\n\\vdots\nh_M w_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 3\n2 2\n1 1\n1 3\n\nSample Output 1\n\n3\n\nWe can destroy all the targets by placing the bomb at \\left(1, 2\\right).\n\nSample Input 2\n\n3 3 4\n3 3\n3 1\n1 1\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5 5 10\n2 5\n4 3\n2 3\n5 5\n2 2\n5 4\n5 3\n5 1\n3 5\n1 4\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1765, "cpu_time_ms": 1642, "memory_kb": 175404}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s857248630", "group_id": "codeNet:p02612", "input_text": "fun main() {\n val inp= readLine()!!.toInt()\n print(if (inp % 1000 == 0) 0 else 1000 - inp % 1000)\n}", "language": "Kotlin", "metadata": {"date": 1598226076, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s857248630.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s857248630", "user_id": "u455317716"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "fun main() {\n val inp= readLine()!!.toInt()\n print(if (inp % 1000 == 0) 0 else 1000 - inp % 1000)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 105, "cpu_time_ms": 98, "memory_kb": 34592}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s488952738", "group_id": "codeNet:p02612", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n println(if (n % 1000 != 0) 1000 - n % 1000 else 0)\n}", "language": "Kotlin", "metadata": {"date": 1594083668, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s488952738.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488952738", "user_id": "u172820018"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n println(if (n % 1000 != 0) 1000 - n % 1000 else 0)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 121, "cpu_time_ms": 98, "memory_kb": 34420}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s687539774", "group_id": "codeNet:p02612", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n println(n % 1000)\n}", "language": "Kotlin", "metadata": {"date": 1594083558, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s687539774.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s687539774", "user_id": "u172820018"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n println(n % 1000)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 88, "cpu_time_ms": 100, "memory_kb": 34432}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s394112900", "group_id": "codeNet:p02612", "input_text": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.PrintWriter\nimport java.util.TreeSet\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\n\nfun PrintWriter.solve() {\n //val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n val n = readInt()\n val ans = -n modulo 1000\n\n println(ans)\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\ninfix fun Int.modulo(mod: Int): Int = (this % mod).let { (it shr Int.SIZE_BITS - 1 and mod) + it }\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "language": "Kotlin", "metadata": {"date": 1594003657, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s394112900.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s394112900", "user_id": "u596111103"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.PrintWriter\nimport java.util.TreeSet\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\n\nfun PrintWriter.solve() {\n //val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n val n = readInt()\n val ans = -n modulo 1000\n\n println(ans)\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\ninfix fun Int.modulo(mod: Int): Int = (this % mod).let { (it shr Int.SIZE_BITS - 1 and mod) + it }\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4555, "cpu_time_ms": 101, "memory_kb": 34256}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s446048723", "group_id": "codeNet:p02612", "input_text": "fun main(args: Array) {\n var n = readLine()!!.toInt()\n while(n > 1000) {\n n-=1000\n }\n println(1000- n)\n}\n", "language": "Kotlin", "metadata": {"date": 1593999084, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s446048723.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s446048723", "user_id": "u288435405"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "fun main(args: Array) {\n var n = readLine()!!.toInt()\n while(n > 1000) {\n n-=1000\n }\n println(1000- n)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 132, "cpu_time_ms": 113, "memory_kb": 34372}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s032735198", "group_id": "codeNet:p02612", "input_text": "fun main(args:Array) {\n val N = readLine()!!.toInt()\n\n val X = N.div(1000) * 1000\n\n if(X == N){\n println(0)\n }else if(N >= X){\n println((X+1000) - N)\n }\n\n\n}\n", "language": "Kotlin", "metadata": {"date": 1593998552, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s032735198.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s032735198", "user_id": "u035856025"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "fun main(args:Array) {\n val N = readLine()!!.toInt()\n\n val X = N.div(1000) * 1000\n\n if(X == N){\n println(0)\n }else if(N >= X){\n println((X+1000) - N)\n }\n\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 193, "cpu_time_ms": 104, "memory_kb": 34448}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s992428098", "group_id": "codeNet:p02612", "input_text": "import java.util.*\nfun main(args: Array)\n{\n val sc=Scanner(System.`in`)\n var n=sc.nextInt()\n var ans=n%1000\n if(ans==0)\n {\n print(ans)\n }\n else\n {\n print(1000-ans)\n }\n\n\n}", "language": "Kotlin", "metadata": {"date": 1593997615, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s992428098.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s992428098", "user_id": "u867045157"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "import java.util.*\nfun main(args: Array)\n{\n val sc=Scanner(System.`in`)\n var n=sc.nextInt()\n var ans=n%1000\n if(ans==0)\n {\n print(ans)\n }\n else\n {\n print(1000-ans)\n }\n\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 219, "cpu_time_ms": 141, "memory_kb": 36388}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s422412421", "group_id": "codeNet:p02612", "input_text": "import java.util.*\nfun main(args: Array) {\n val reader = Scanner(System.`in`)\n val N = reader.nextInt()\n var result = N % 1000\n if(result != 0){\n result = 1000 - result\n }\n \n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1593997456, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s422412421.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s422412421", "user_id": "u412306454"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "import java.util.*\nfun main(args: Array) {\n val reader = Scanner(System.`in`)\n val N = reader.nextInt()\n var result = N % 1000\n if(result != 0){\n result = 1000 - result\n }\n \n println(result)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 228, "cpu_time_ms": 157, "memory_kb": 36380}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s329736750", "group_id": "codeNet:p02612", "input_text": "fun main() {\n val n = readLine()!!.toInt()\n println(1000 - (n % 1000))\n}", "language": "Kotlin", "metadata": {"date": 1593997448, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s329736750.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s329736750", "user_id": "u817663013"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "fun main() {\n val n = readLine()!!.toInt()\n println(1000 - (n % 1000))\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 78, "cpu_time_ms": 103, "memory_kb": 34624}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s675670157", "group_id": "codeNet:p02612", "input_text": "//\n\nfun main() {\n abc173a()\n}\n\nfun abc173a() {\n val n = readLine()!!.toInt()\n if (n % 1000 == 0) {\n println(0)\n } else {\n println(1000 - (n % 1000))\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1593997377, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s675670157.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s675670157", "user_id": "u628907033"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "//\n\nfun main() {\n abc173a()\n}\n\nfun abc173a() {\n val n = readLine()!!.toInt()\n if (n % 1000 == 0) {\n println(0)\n } else {\n println(1000 - (n % 1000))\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 183, "cpu_time_ms": 104, "memory_kb": 34560}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s718907097", "group_id": "codeNet:p02612", "input_text": "fun main() {\n var n = readLine()!!.toInt()\n if(n % 1000 == 0) println(0)\n else println(1000 - (n % 1000))\n}", "language": "Kotlin", "metadata": {"date": 1593997375, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s718907097.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s718907097", "user_id": "u527280956"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "fun main() {\n var n = readLine()!!.toInt()\n if(n % 1000 == 0) println(0)\n else println(1000 - (n % 1000))\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 116, "cpu_time_ms": 102, "memory_kb": 34416}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s602102066", "group_id": "codeNet:p02612", "input_text": "fun main(args: Array) {\n val n = readInt()\n var m = 1000\n while (m < n) {\n m += 1000\n }\n println(m-n)\n}\n\n// Tools\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()", "language": "Kotlin", "metadata": {"date": 1593997322, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s602102066.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s602102066", "user_id": "u697467902"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readInt()\n var m = 1000\n while (m < n) {\n m += 1000\n }\n println(m-n)\n}\n\n// Tools\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 212, "cpu_time_ms": 106, "memory_kb": 34496}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s128466847", "group_id": "codeNet:p02612", "input_text": "fun main() {\n val N = readInt()\n println((1000 - N % 1000) % 1000)\n}\n\nfun readString() = readLine()!!\nfun readStrings() = readString().split(\" \")\nfun readInt() = readString().toInt()\nfun readLong() = readString().toLong()\nfun readInts() = readStrings().map { it.toInt() }\nfun readLongs() = readStrings().map { it.toLong() }\n", "language": "Kotlin", "metadata": {"date": 1593997311, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s128466847.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s128466847", "user_id": "u979004569"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "fun main() {\n val N = readInt()\n println((1000 - N % 1000) % 1000)\n}\n\nfun readString() = readLine()!!\nfun readStrings() = readString().split(\" \")\nfun readInt() = readString().toInt()\nfun readLong() = readString().toLong()\nfun readInts() = readStrings().map { it.toInt() }\nfun readLongs() = readStrings().map { it.toLong() }\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 326, "cpu_time_ms": 111, "memory_kb": 34400}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s011528837", "group_id": "codeNet:p02612", "input_text": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun Iterable.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\nfun Array.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\n\nfun main() {\n val N = nextInt()\n val a = N % 1000\n println(if (a == 0) 0 else (1000 - a))\n}", "language": "Kotlin", "metadata": {"date": 1593997273, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s011528837.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s011528837", "user_id": "u860789370"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun Iterable.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\nfun Array.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\n\nfun main() {\n val N = nextInt()\n val a = N % 1000\n println(if (a == 0) 0 else (1000 - a))\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 931, "cpu_time_ms": 103, "memory_kb": 34696}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s111288024", "group_id": "codeNet:p02612", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.util.*\nimport kotlin.math.abs\nimport kotlin.math.max\nimport kotlin.math.min\n\nval MOD = 1_000_000_007L\n\nclass Solver(stream: InputStream, private val out: java.io.PrintWriter) {\n fun solve() {\n val N = ni()\n out.println((1000 - N % 1000) % 1000)\n }\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n private val isDebug = try {\n // なんか本番でエラーでる\n System.getenv(\"MY_DEBUG\") != null\n } catch (t: Throwable) {\n false\n }\n\n private var tokenizer: StringTokenizer? = null\n private val reader = BufferedReader(InputStreamReader(stream), 32768)\n private fun next(): String {\n while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n private fun ni() = next().toInt()\n private fun nl() = next().toLong()\n private fun ns() = next()\n private fun na(n: Int, offset: Int = 0): IntArray {\n return map(n) { ni() + offset }\n }\n private fun nal(n: Int, offset: Int = 0): LongArray {\n val res = LongArray(n)\n for (i in 0 until n) {\n res[i] = nl() + offset\n }\n return res\n }\n\n private fun na2(n: Int, offset: Int = 0): Array {\n val a = Array(2){IntArray(n)}\n for (i in 0 until n) {\n for (e in a) {\n e[i] = ni() + offset\n }\n }\n return a\n }\n\n private inline fun map(n: Int, f: (Int) -> Int): IntArray {\n val res = IntArray(n)\n for (i in 0 until n) {\n res[i] = f(i)\n }\n return res\n }\n\n private inline fun debug(msg: () -> String) {\n if (isDebug) System.err.println(msg())\n }\n\n private fun debug(a: LongArray) {\n debug { a.joinToString(\" \") }\n }\n\n private fun debug(a: IntArray) {\n debug { a.joinToString(\" \") }\n }\n\n private fun debug(a: BooleanArray) {\n debug { a.map { if (it) 1 else 0 }.joinToString(\"\") }\n }\n\n private fun debugDim(A: Array) {\n if (isDebug) {\n for (a in A) {\n debug(a)\n }\n }\n }\n private fun debugDim(A: Array) {\n if (isDebug) {\n for (a in A) {\n debug(a)\n }\n }\n }\n\n /**\n * 勝手にimport消されるのを防ぎたい\n */\n private fun hoge() {\n min(1, 2)\n max(1, 2)\n abs(-10)\n }\n}\n\nfun main() {\n val out = java.io.PrintWriter(System.out)\n Solver(System.`in`, out).solve()\n out.flush()\n}", "language": "Kotlin", "metadata": {"date": 1593997256, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02612.html", "problem_id": "p02612", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02612/input.txt", "sample_output_relpath": "derived/input_output/data/p02612/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02612/Kotlin/s111288024.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s111288024", "user_id": "u460609472"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.util.*\nimport kotlin.math.abs\nimport kotlin.math.max\nimport kotlin.math.min\n\nval MOD = 1_000_000_007L\n\nclass Solver(stream: InputStream, private val out: java.io.PrintWriter) {\n fun solve() {\n val N = ni()\n out.println((1000 - N % 1000) % 1000)\n }\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n private val isDebug = try {\n // なんか本番でエラーでる\n System.getenv(\"MY_DEBUG\") != null\n } catch (t: Throwable) {\n false\n }\n\n private var tokenizer: StringTokenizer? = null\n private val reader = BufferedReader(InputStreamReader(stream), 32768)\n private fun next(): String {\n while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n private fun ni() = next().toInt()\n private fun nl() = next().toLong()\n private fun ns() = next()\n private fun na(n: Int, offset: Int = 0): IntArray {\n return map(n) { ni() + offset }\n }\n private fun nal(n: Int, offset: Int = 0): LongArray {\n val res = LongArray(n)\n for (i in 0 until n) {\n res[i] = nl() + offset\n }\n return res\n }\n\n private fun na2(n: Int, offset: Int = 0): Array {\n val a = Array(2){IntArray(n)}\n for (i in 0 until n) {\n for (e in a) {\n e[i] = ni() + offset\n }\n }\n return a\n }\n\n private inline fun map(n: Int, f: (Int) -> Int): IntArray {\n val res = IntArray(n)\n for (i in 0 until n) {\n res[i] = f(i)\n }\n return res\n }\n\n private inline fun debug(msg: () -> String) {\n if (isDebug) System.err.println(msg())\n }\n\n private fun debug(a: LongArray) {\n debug { a.joinToString(\" \") }\n }\n\n private fun debug(a: IntArray) {\n debug { a.joinToString(\" \") }\n }\n\n private fun debug(a: BooleanArray) {\n debug { a.map { if (it) 1 else 0 }.joinToString(\"\") }\n }\n\n private fun debugDim(A: Array) {\n if (isDebug) {\n for (a in A) {\n debug(a)\n }\n }\n }\n private fun debugDim(A: Array) {\n if (isDebug) {\n for (a in A) {\n debug(a)\n }\n }\n }\n\n /**\n * 勝手にimport消されるのを防ぎたい\n */\n private fun hoge() {\n min(1, 2)\n max(1, 2)\n abs(-10)\n }\n}\n\nfun main() {\n val out = java.io.PrintWriter(System.out)\n Solver(System.`in`, out).solve()\n out.flush()\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "sample_input": "1900\n"}, "reference_outputs": ["100\n"], "source_document_id": "p02612", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe will buy a product for N yen (the currency of Japan) at a shop.\n\nIf we use only 1000-yen bills to pay the price, how much change will we receive?\n\nAssume we use the minimum number of bills required.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the amount of change as an integer.\n\nSample Input 1\n\n1900\n\nSample Output 1\n\n100\n\nWe will use two 1000-yen bills to pay the price and receive 100 yen in change.\n\nSample Input 2\n\n3000\n\nSample Output 2\n\n0\n\nWe can pay the exact price.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2426, "cpu_time_ms": 95, "memory_kb": 34688}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s546940768", "group_id": "codeNet:p02618", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n lateinit var calcScore: (ans: List) -> Long\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val D = sc.next().toInt()\n val c = IntArray(26) { sc.next().toInt() }\n val s = Array(D) { IntArray(26) { sc.next().toInt() } }\n\n calcScore = { t ->\n val d = IntArray(26) { -1 }// 最後におこなった日\n var score = 0L\n for (i in t.indices) {\n score += s[i][t[i]]\n d[t[i]] = i\n for (j in 0 until 26) {\n score -= c[j] * (i - d[j])\n }\n }\n score\n }\n\n val ans = Stack()\n val d = IntArray(26) // 最後におこなった日\n for (i in 0 until D) {\n var sMax = 0L\n var jMax = 0\n for (j in 0 until 26) {\n ans.push(j)\n val sco = calcScore(ans)\n if (sMax < sco) {\n sMax = sco\n jMax = j\n }\n ans.pop()\n }\n ans.push(jMax)\n d[jMax] = i\n }\n\n ans.forEach { pw.println(it + 1) }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1594264467, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Kotlin/s546940768.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s546940768", "user_id": "u297767059"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n lateinit var calcScore: (ans: List) -> Long\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val D = sc.next().toInt()\n val c = IntArray(26) { sc.next().toInt() }\n val s = Array(D) { IntArray(26) { sc.next().toInt() } }\n\n calcScore = { t ->\n val d = IntArray(26) { -1 }// 最後におこなった日\n var score = 0L\n for (i in t.indices) {\n score += s[i][t[i]]\n d[t[i]] = i\n for (j in 0 until 26) {\n score -= c[j] * (i - d[j])\n }\n }\n score\n }\n\n val ans = Stack()\n val d = IntArray(26) // 最後におこなった日\n for (i in 0 until D) {\n var sMax = 0L\n var jMax = 0\n for (j in 0 until 26) {\n ans.push(j)\n val sco = calcScore(ans)\n if (sMax < sco) {\n sMax = sco\n jMax = j\n }\n ans.pop()\n }\n ans.push(jMax)\n d[jMax] = i\n }\n\n ans.forEach { pw.println(it + 1) }\n }\n}\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1348, "cpu_time_ms": 331, "memory_kb": 44276}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s744670986", "group_id": "codeNet:p02618", "input_text": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.File\nimport java.io.PrintWriter\nimport java.util.Arrays\nimport java.util.NoSuchElementException\nimport java.util.TreeSet\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\n\nfun PrintWriter.solve() {\n val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n object {\n val D = readInt()\n\n val C = readIntArray(26)\n val S = Array(D) { readIntArray(26) }\n\n var v = 0L\n val last = IntArray(26)\n val L = Array(26) {\n IntTreeSet().also {\n it.add(-1)\n it.add(D)\n }\n }\n val T = IntArray(D) { random.nextInt(26) }.also { T ->\n repeat(D) { d ->\n val t = T[d]\n\n v += S[d][t]\n last[t] = d + 1\n for (i in 0 until 26) {\n v -= C[i] * (d + 1 - last[i])\n }\n\n L[t].add(d)\n }\n }\n\n fun update(d: Int, q: Int) {\n val t = T[d]\n v += S[d][q] - S[d][t]\n\n L[t].remove(d)\n var a = L[t].floor(d)\n var b = L[t].ceiling(d)\n v -= C[t] * (d - a) * (b - d)\n\n a = L[q].floor(d)\n b = L[q].ceiling(d)\n v += C[q] * (d - a) * (b - d)\n L[q].add(d)\n\n T[d] = q\n }\n\n var score = max(0, 1e6.toLong() + v)\n var best = T.copyOf()\n\n fun prob(e0: Long, e1: Long, temp: Double) = if (e1 < e0) 1.0\n else exp(-(e1 - e0).toDouble() / (temp))\n\n init {\n while(true) {\n val time = System.nanoTime() - startTime\n if(time >= timeLimit) break\n val d = random.nextInt(D)\n val q = random.nextInt(26)\n val t = T[d]\n\n val e0 = -v\n update(d, q)\n\n val temp = T0 - (T0 - T1) * time / timeLimit\n if(random.nextDouble() >= prob(e0, -v, temp)) {\n update(d, t)\n } else {\n val newScore = max(0, 1e6.toLong() + v)\n if (newScore > score) {\n score = newScore\n best = T.copyOf()\n }\n }\n }\n\n// System.err.println(\"Score: ${score}\")\n for(t in best) println(t+1)\n }\n }\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\nconst val T0 = 4e3\nconst val T1 = 1e2\nconst val timeLimit = 1.85e9.toLong()\n\ntypealias IntTreeSet = _Ez_Int_TreeSet\n\nclass _Ez_Int_TreeSet @JvmOverloads constructor(capacity: Int = DEFAULT_CAPACITY) {\n // Arrays are 1-indexed. Index 0 is a null node.\n private /*C*/ var key: IntArray\n private var left: IntArray\n private var right: IntArray\n private var p: IntArray\n private var color: BooleanArray\n private var size = 0\n private var root = 0\n private var returnedNull = false\n\n constructor( /*C*/\n srcArray: IntArray\n ) : this(srcArray.size) {\n for ( /*C*/\n /*C*/element in srcArray) {\n add(element)\n }\n }\n\n fun size(): Int {\n return size\n }\n\n val isEmpty: Boolean\n get() = size == 0\n\n operator fun contains( /*C*/\n /*C*/element: Int\n ): Boolean {\n var x = root\n while (x != NULL) {\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return true\n }\n }\n return false\n }\n\n operator fun iterator() = _Ez_Int_TreeSetIterator() as IntIterator\n\n /*C*/ fun toArray(): IntArray {\n /*C*/\n val result = IntArray(size)\n var i = 0\n var x = firstNode()\n while (x != NULL) {\n result[i] = key[x]\n x = successorNode(x)\n i++\n }\n return result\n }\n\n fun add( /*C*/\n /*C*/element: Int\n ): Boolean {\n var y = NULL\n var x = root\n while (x != NULL) {\n y = x\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return false\n }\n }\n if (size == color.size - 1) {\n enlarge()\n }\n val z = ++size\n key[z] = element\n p[z] = y\n if (y == NULL) {\n root = z\n } else {\n if (element < key[y]) {\n left[y] = z\n } else {\n right[y] = z\n }\n }\n left[z] = NULL\n right[z] = NULL\n color[z] = RED\n fixAfterAdd(z)\n return true\n }\n\n fun remove( /*C*/\n /*C*/element: Int\n ): Boolean {\n var z = root\n while (z != NULL) {\n z = if (element < key[z]) {\n left[z]\n } else if (element > key[z]) {\n right[z]\n } else {\n removeNode(z)\n return true\n }\n }\n return false\n }\n\n private fun removeNode(z: Int) {\n val y =\n if (left[z] == NULL || right[z] == NULL) z else successorNode(\n z\n )\n val x = if (left[y] != NULL) left[y] else right[y]\n p[x] = p[y]\n if (p[y] == NULL) {\n root = x\n } else {\n if (y == left[p[y]]) {\n left[p[y]] = x\n } else {\n right[p[y]] = x\n }\n }\n if (y != z) {\n key[z] = key[y]\n }\n if (color[y] == BLACK) {\n fixAfterRemove(x)\n }\n // Swap with last\n if (y != size) {\n // copy fields\n key[y] = key[size]\n left[y] = left[size]\n right[y] = right[size]\n p[y] = p[size]\n color[y] = color[size]\n // fix the children's parents\n p[left[size]] = y\n p[right[size]] = y\n // fix one of the parent's children\n if (left[p[size]] == size) {\n left[p[size]] = y\n } else {\n right[p[size]] = y\n }\n // fix root\n if (root == size) {\n root = y\n }\n }\n size--\n }\n\n private fun successorNode(x: Int): Int {\n var x = x\n return if (right[x] != NULL) {\n x = right[x]\n while (left[x] != NULL) {\n x = left[x]\n }\n x\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n y\n }\n }\n\n private fun fixAfterAdd(z: Int) {\n var z = z\n while (color[p[z]] == RED) {\n if (p[z] == left[p[p[z]]]) {\n val y = right[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == right[p[z]]) {\n z = p[z]\n rotateLeft(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateRight(p[p[z]])\n }\n } else {\n val y = left[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == left[p[z]]) {\n z = p[z]\n rotateRight(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateLeft(p[p[z]])\n }\n }\n }\n color[root] = BLACK\n }\n\n private fun fixAfterRemove(x: Int) {\n var x = x\n while (x != root && color[x] == BLACK) {\n if (x == left[p[x]]) {\n var w = right[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateLeft(p[x])\n w = right[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[right[w]] == BLACK) {\n color[left[w]] = BLACK\n color[w] = RED\n rotateRight(w)\n w = right[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[right[w]] = BLACK\n rotateLeft(p[x])\n x = root\n }\n } else {\n var w = left[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateRight(p[x])\n w = left[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[left[w]] == BLACK) {\n color[right[w]] = BLACK\n color[w] = RED\n rotateLeft(w)\n w = left[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[left[w]] = BLACK\n rotateRight(p[x])\n x = root\n }\n }\n }\n color[x] = BLACK\n }\n\n private fun rotateLeft(x: Int) {\n val y = right[x]\n right[x] = left[y]\n if (left[y] != NULL) {\n p[left[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == left[p[x]]) {\n left[p[x]] = y\n } else {\n right[p[x]] = y\n }\n }\n left[y] = x\n p[x] = y\n }\n\n private fun rotateRight(x: Int) {\n val y = left[x]\n left[x] = right[y]\n if (right[y] != NULL) {\n p[right[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == right[p[x]]) {\n right[p[x]] = y\n } else {\n left[p[x]] = y\n }\n }\n right[y] = x\n p[x] = y\n }\n\n fun clear() {\n color[NULL] = BLACK\n size = 0\n root = NULL\n }\n\n private fun enlarge() {\n val newLength =\n Math.max(color.size + 1, (color.size * ENLARGE_SCALE).toInt())\n key = Arrays.copyOf(key, newLength)\n left = Arrays.copyOf(left, newLength)\n right = Arrays.copyOf(right, newLength)\n p = Arrays.copyOf(p, newLength)\n color = Arrays.copyOf(color, newLength)\n }\n\n private fun firstNode(): Int {\n var x = root\n while (left[x] != NULL) {\n x = left[x]\n }\n return x\n }\n\n private fun lastNode(): Int {\n var x = root\n while (right[x] != NULL) {\n x = right[x]\n }\n return x\n }\n\n /*C*/ /*C*/\n val first: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ /*C*/\n val last: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ fun /*C*/removeFirst(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/removeLast(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/floor( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/ceiling( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/lower( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/higher( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n fun returnedNull(): Boolean {\n return returnedNull\n }\n\n override fun equals(o: Any?): Boolean {\n if (this === o) return true\n if (o == null || javaClass != o.javaClass) return false\n val that = o as _Ez_Int_TreeSet\n if (size != that.size) {\n return false\n }\n var x = firstNode()\n var y = that.firstNode()\n while (x != NULL) {\n if (key[x] != that.key[y]) {\n return false\n }\n x = successorNode(x)\n y = that.successorNode(y)\n }\n return true\n }\n\n override fun toString(): String {\n val sb = StringBuilder()\n sb.append('[')\n var x = firstNode()\n while (x != NULL) {\n if (sb.length > 1) {\n sb.append(\", \")\n }\n sb.append(key[x])\n x = successorNode(x)\n }\n sb.append(']')\n return sb.toString()\n }\n\n private inner class _Ez_Int_TreeSetIterator constructor() : IntIterator() {\n private var x: Int\n override fun hasNext(): Boolean {\n return x != NULL\n }\n\n /*C*/ override fun /*C*/nextInt(): Int {\n if (x == NULL) {\n throw NoSuchElementException(\"Iterator doesn't have more elements\")\n }\n val /*C*/result = key[x]\n x = successorNode(x)\n return result\n }\n\n init {\n x = firstNode()\n }\n }\n\n companion object {\n private const val DEFAULT_CAPACITY = 10\n private const val ENLARGE_SCALE = 2.0\n private const val HASHCODE_INITIAL_VALUE = -0x7ee3623b\n private const val HASHCODE_MULTIPLIER = 0x01000193\n private const val BLACK = false\n private const val RED = true\n private const val NULL = 0\n private /*C*/ val /*C*/DEFAULT_NULL_ELEMENT = IntArray(1)[0]\n }\n\n init {\n var capacity = capacity\n require(capacity >= 0) { \"Capacity must be non-negative\" }\n capacity++\n key = IntArray(capacity)\n left = IntArray(capacity)\n right = IntArray(capacity)\n p = IntArray(capacity)\n color = BooleanArray(capacity)\n color[NULL] = BLACK\n size = 0\n root = NULL\n returnedNull = false\n }\n}\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "language": "Kotlin", "metadata": {"date": 1593561658, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Kotlin/s744670986.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s744670986", "user_id": "u596111103"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.File\nimport java.io.PrintWriter\nimport java.util.Arrays\nimport java.util.NoSuchElementException\nimport java.util.TreeSet\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\n\nfun PrintWriter.solve() {\n val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n object {\n val D = readInt()\n\n val C = readIntArray(26)\n val S = Array(D) { readIntArray(26) }\n\n var v = 0L\n val last = IntArray(26)\n val L = Array(26) {\n IntTreeSet().also {\n it.add(-1)\n it.add(D)\n }\n }\n val T = IntArray(D) { random.nextInt(26) }.also { T ->\n repeat(D) { d ->\n val t = T[d]\n\n v += S[d][t]\n last[t] = d + 1\n for (i in 0 until 26) {\n v -= C[i] * (d + 1 - last[i])\n }\n\n L[t].add(d)\n }\n }\n\n fun update(d: Int, q: Int) {\n val t = T[d]\n v += S[d][q] - S[d][t]\n\n L[t].remove(d)\n var a = L[t].floor(d)\n var b = L[t].ceiling(d)\n v -= C[t] * (d - a) * (b - d)\n\n a = L[q].floor(d)\n b = L[q].ceiling(d)\n v += C[q] * (d - a) * (b - d)\n L[q].add(d)\n\n T[d] = q\n }\n\n var score = max(0, 1e6.toLong() + v)\n var best = T.copyOf()\n\n fun prob(e0: Long, e1: Long, temp: Double) = if (e1 < e0) 1.0\n else exp(-(e1 - e0).toDouble() / (temp))\n\n init {\n while(true) {\n val time = System.nanoTime() - startTime\n if(time >= timeLimit) break\n val d = random.nextInt(D)\n val q = random.nextInt(26)\n val t = T[d]\n\n val e0 = -v\n update(d, q)\n\n val temp = T0 - (T0 - T1) * time / timeLimit\n if(random.nextDouble() >= prob(e0, -v, temp)) {\n update(d, t)\n } else {\n val newScore = max(0, 1e6.toLong() + v)\n if (newScore > score) {\n score = newScore\n best = T.copyOf()\n }\n }\n }\n\n// System.err.println(\"Score: ${score}\")\n for(t in best) println(t+1)\n }\n }\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\nconst val T0 = 4e3\nconst val T1 = 1e2\nconst val timeLimit = 1.85e9.toLong()\n\ntypealias IntTreeSet = _Ez_Int_TreeSet\n\nclass _Ez_Int_TreeSet @JvmOverloads constructor(capacity: Int = DEFAULT_CAPACITY) {\n // Arrays are 1-indexed. Index 0 is a null node.\n private /*C*/ var key: IntArray\n private var left: IntArray\n private var right: IntArray\n private var p: IntArray\n private var color: BooleanArray\n private var size = 0\n private var root = 0\n private var returnedNull = false\n\n constructor( /*C*/\n srcArray: IntArray\n ) : this(srcArray.size) {\n for ( /*C*/\n /*C*/element in srcArray) {\n add(element)\n }\n }\n\n fun size(): Int {\n return size\n }\n\n val isEmpty: Boolean\n get() = size == 0\n\n operator fun contains( /*C*/\n /*C*/element: Int\n ): Boolean {\n var x = root\n while (x != NULL) {\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return true\n }\n }\n return false\n }\n\n operator fun iterator() = _Ez_Int_TreeSetIterator() as IntIterator\n\n /*C*/ fun toArray(): IntArray {\n /*C*/\n val result = IntArray(size)\n var i = 0\n var x = firstNode()\n while (x != NULL) {\n result[i] = key[x]\n x = successorNode(x)\n i++\n }\n return result\n }\n\n fun add( /*C*/\n /*C*/element: Int\n ): Boolean {\n var y = NULL\n var x = root\n while (x != NULL) {\n y = x\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return false\n }\n }\n if (size == color.size - 1) {\n enlarge()\n }\n val z = ++size\n key[z] = element\n p[z] = y\n if (y == NULL) {\n root = z\n } else {\n if (element < key[y]) {\n left[y] = z\n } else {\n right[y] = z\n }\n }\n left[z] = NULL\n right[z] = NULL\n color[z] = RED\n fixAfterAdd(z)\n return true\n }\n\n fun remove( /*C*/\n /*C*/element: Int\n ): Boolean {\n var z = root\n while (z != NULL) {\n z = if (element < key[z]) {\n left[z]\n } else if (element > key[z]) {\n right[z]\n } else {\n removeNode(z)\n return true\n }\n }\n return false\n }\n\n private fun removeNode(z: Int) {\n val y =\n if (left[z] == NULL || right[z] == NULL) z else successorNode(\n z\n )\n val x = if (left[y] != NULL) left[y] else right[y]\n p[x] = p[y]\n if (p[y] == NULL) {\n root = x\n } else {\n if (y == left[p[y]]) {\n left[p[y]] = x\n } else {\n right[p[y]] = x\n }\n }\n if (y != z) {\n key[z] = key[y]\n }\n if (color[y] == BLACK) {\n fixAfterRemove(x)\n }\n // Swap with last\n if (y != size) {\n // copy fields\n key[y] = key[size]\n left[y] = left[size]\n right[y] = right[size]\n p[y] = p[size]\n color[y] = color[size]\n // fix the children's parents\n p[left[size]] = y\n p[right[size]] = y\n // fix one of the parent's children\n if (left[p[size]] == size) {\n left[p[size]] = y\n } else {\n right[p[size]] = y\n }\n // fix root\n if (root == size) {\n root = y\n }\n }\n size--\n }\n\n private fun successorNode(x: Int): Int {\n var x = x\n return if (right[x] != NULL) {\n x = right[x]\n while (left[x] != NULL) {\n x = left[x]\n }\n x\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n y\n }\n }\n\n private fun fixAfterAdd(z: Int) {\n var z = z\n while (color[p[z]] == RED) {\n if (p[z] == left[p[p[z]]]) {\n val y = right[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == right[p[z]]) {\n z = p[z]\n rotateLeft(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateRight(p[p[z]])\n }\n } else {\n val y = left[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == left[p[z]]) {\n z = p[z]\n rotateRight(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateLeft(p[p[z]])\n }\n }\n }\n color[root] = BLACK\n }\n\n private fun fixAfterRemove(x: Int) {\n var x = x\n while (x != root && color[x] == BLACK) {\n if (x == left[p[x]]) {\n var w = right[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateLeft(p[x])\n w = right[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[right[w]] == BLACK) {\n color[left[w]] = BLACK\n color[w] = RED\n rotateRight(w)\n w = right[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[right[w]] = BLACK\n rotateLeft(p[x])\n x = root\n }\n } else {\n var w = left[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateRight(p[x])\n w = left[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[left[w]] == BLACK) {\n color[right[w]] = BLACK\n color[w] = RED\n rotateLeft(w)\n w = left[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[left[w]] = BLACK\n rotateRight(p[x])\n x = root\n }\n }\n }\n color[x] = BLACK\n }\n\n private fun rotateLeft(x: Int) {\n val y = right[x]\n right[x] = left[y]\n if (left[y] != NULL) {\n p[left[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == left[p[x]]) {\n left[p[x]] = y\n } else {\n right[p[x]] = y\n }\n }\n left[y] = x\n p[x] = y\n }\n\n private fun rotateRight(x: Int) {\n val y = left[x]\n left[x] = right[y]\n if (right[y] != NULL) {\n p[right[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == right[p[x]]) {\n right[p[x]] = y\n } else {\n left[p[x]] = y\n }\n }\n right[y] = x\n p[x] = y\n }\n\n fun clear() {\n color[NULL] = BLACK\n size = 0\n root = NULL\n }\n\n private fun enlarge() {\n val newLength =\n Math.max(color.size + 1, (color.size * ENLARGE_SCALE).toInt())\n key = Arrays.copyOf(key, newLength)\n left = Arrays.copyOf(left, newLength)\n right = Arrays.copyOf(right, newLength)\n p = Arrays.copyOf(p, newLength)\n color = Arrays.copyOf(color, newLength)\n }\n\n private fun firstNode(): Int {\n var x = root\n while (left[x] != NULL) {\n x = left[x]\n }\n return x\n }\n\n private fun lastNode(): Int {\n var x = root\n while (right[x] != NULL) {\n x = right[x]\n }\n return x\n }\n\n /*C*/ /*C*/\n val first: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ /*C*/\n val last: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ fun /*C*/removeFirst(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/removeLast(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/floor( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/ceiling( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/lower( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/higher( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n fun returnedNull(): Boolean {\n return returnedNull\n }\n\n override fun equals(o: Any?): Boolean {\n if (this === o) return true\n if (o == null || javaClass != o.javaClass) return false\n val that = o as _Ez_Int_TreeSet\n if (size != that.size) {\n return false\n }\n var x = firstNode()\n var y = that.firstNode()\n while (x != NULL) {\n if (key[x] != that.key[y]) {\n return false\n }\n x = successorNode(x)\n y = that.successorNode(y)\n }\n return true\n }\n\n override fun toString(): String {\n val sb = StringBuilder()\n sb.append('[')\n var x = firstNode()\n while (x != NULL) {\n if (sb.length > 1) {\n sb.append(\", \")\n }\n sb.append(key[x])\n x = successorNode(x)\n }\n sb.append(']')\n return sb.toString()\n }\n\n private inner class _Ez_Int_TreeSetIterator constructor() : IntIterator() {\n private var x: Int\n override fun hasNext(): Boolean {\n return x != NULL\n }\n\n /*C*/ override fun /*C*/nextInt(): Int {\n if (x == NULL) {\n throw NoSuchElementException(\"Iterator doesn't have more elements\")\n }\n val /*C*/result = key[x]\n x = successorNode(x)\n return result\n }\n\n init {\n x = firstNode()\n }\n }\n\n companion object {\n private const val DEFAULT_CAPACITY = 10\n private const val ENLARGE_SCALE = 2.0\n private const val HASHCODE_INITIAL_VALUE = -0x7ee3623b\n private const val HASHCODE_MULTIPLIER = 0x01000193\n private const val BLACK = false\n private const val RED = true\n private const val NULL = 0\n private /*C*/ val /*C*/DEFAULT_NULL_ELEMENT = IntArray(1)[0]\n }\n\n init {\n var capacity = capacity\n require(capacity >= 0) { \"Capacity must be non-negative\" }\n capacity++\n key = IntArray(capacity)\n left = IntArray(capacity)\n right = IntArray(capacity)\n p = IntArray(capacity)\n color = BooleanArray(capacity)\n color[NULL] = BLACK\n size = 0\n root = NULL\n returnedNull = false\n }\n}\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 23745, "cpu_time_ms": 1955, "memory_kb": 44160}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s016285012", "group_id": "codeNet:p02618", "input_text": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.File\nimport java.io.PrintWriter\nimport java.util.Arrays\nimport java.util.NoSuchElementException\nimport java.util.TreeSet\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\n\nfun PrintWriter.solve() {\n val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n object {\n val D = readInt()\n\n val C = readIntArray(26)\n val S = Array(D) { readIntArray(26) }\n\n var v = 0L\n val last = IntArray(26)\n val L = Array(26) {\n IntTreeSet().also {\n it.add(-1)\n it.add(D)\n }\n }\n val T = IntArray(D) { random.nextInt(26) }.also { T ->\n repeat(D) { d ->\n val t = T[d]\n\n v += S[d][t]\n last[t] = d + 1\n for (i in 0 until 26) {\n v -= C[i] * (d + 1 - last[i])\n }\n\n L[t].add(d)\n }\n }\n\n fun update(d: Int, q: Int) {\n val t = T[d]\n v += S[d][q] - S[d][t]\n\n L[t].remove(d)\n var a = L[t].floor(d)\n var b = L[t].ceiling(d)\n v -= C[t] * (d - a) * (b - d)\n\n a = L[q].floor(d)\n b = L[q].ceiling(d)\n v += C[q] * (d - a) * (b - d)\n L[q].add(d)\n\n T[d] = q\n }\n\n var score = max(0, 1e6.toLong() + v)\n var best = T.copyOf()\n\n fun prob(e0: Long, e1: Long, temp: Double) = if (e1 < e0) 1.0\n else exp(-(e1 - e0).toDouble() / (temp))\n\n init {\n while(true) {\n val time = System.nanoTime() - startTime\n if(time >= timeLimit) break\n val d = random.nextInt(D)\n val q = random.nextInt(26)\n val t = T[d]\n\n val e0 = -v\n update(d, q)\n\n val scaledTime = time.toDouble() / timeLimit\n val temp = T0.pow(1 - scaledTime) * T1.pow(scaledTime)\n if(random.nextDouble() >= prob(e0, -v, temp)) {\n update(d, t)\n } else {\n val newScore = max(0, 1e6.toLong() + v)\n if (newScore > score) {\n score = newScore\n best = T.copyOf()\n }\n }\n }\n\n// System.err.println(\"Score: ${score}\")\n for(t in best) println(t+1)\n }\n }\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\nconst val T0 = 4e3\nconst val T1 = 6e2\nconst val timeLimit = 1.85e9.toLong()\n\ntypealias IntTreeSet = _Ez_Int_TreeSet\n\nclass _Ez_Int_TreeSet @JvmOverloads constructor(capacity: Int = DEFAULT_CAPACITY) {\n // Arrays are 1-indexed. Index 0 is a null node.\n private /*C*/ var key: IntArray\n private var left: IntArray\n private var right: IntArray\n private var p: IntArray\n private var color: BooleanArray\n private var size = 0\n private var root = 0\n private var returnedNull = false\n\n constructor( /*C*/\n srcArray: IntArray\n ) : this(srcArray.size) {\n for ( /*C*/\n /*C*/element in srcArray) {\n add(element)\n }\n }\n\n fun size(): Int {\n return size\n }\n\n val isEmpty: Boolean\n get() = size == 0\n\n operator fun contains( /*C*/\n /*C*/element: Int\n ): Boolean {\n var x = root\n while (x != NULL) {\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return true\n }\n }\n return false\n }\n\n operator fun iterator() = _Ez_Int_TreeSetIterator() as IntIterator\n\n /*C*/ fun toArray(): IntArray {\n /*C*/\n val result = IntArray(size)\n var i = 0\n var x = firstNode()\n while (x != NULL) {\n result[i] = key[x]\n x = successorNode(x)\n i++\n }\n return result\n }\n\n fun add( /*C*/\n /*C*/element: Int\n ): Boolean {\n var y = NULL\n var x = root\n while (x != NULL) {\n y = x\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return false\n }\n }\n if (size == color.size - 1) {\n enlarge()\n }\n val z = ++size\n key[z] = element\n p[z] = y\n if (y == NULL) {\n root = z\n } else {\n if (element < key[y]) {\n left[y] = z\n } else {\n right[y] = z\n }\n }\n left[z] = NULL\n right[z] = NULL\n color[z] = RED\n fixAfterAdd(z)\n return true\n }\n\n fun remove( /*C*/\n /*C*/element: Int\n ): Boolean {\n var z = root\n while (z != NULL) {\n z = if (element < key[z]) {\n left[z]\n } else if (element > key[z]) {\n right[z]\n } else {\n removeNode(z)\n return true\n }\n }\n return false\n }\n\n private fun removeNode(z: Int) {\n val y =\n if (left[z] == NULL || right[z] == NULL) z else successorNode(\n z\n )\n val x = if (left[y] != NULL) left[y] else right[y]\n p[x] = p[y]\n if (p[y] == NULL) {\n root = x\n } else {\n if (y == left[p[y]]) {\n left[p[y]] = x\n } else {\n right[p[y]] = x\n }\n }\n if (y != z) {\n key[z] = key[y]\n }\n if (color[y] == BLACK) {\n fixAfterRemove(x)\n }\n // Swap with last\n if (y != size) {\n // copy fields\n key[y] = key[size]\n left[y] = left[size]\n right[y] = right[size]\n p[y] = p[size]\n color[y] = color[size]\n // fix the children's parents\n p[left[size]] = y\n p[right[size]] = y\n // fix one of the parent's children\n if (left[p[size]] == size) {\n left[p[size]] = y\n } else {\n right[p[size]] = y\n }\n // fix root\n if (root == size) {\n root = y\n }\n }\n size--\n }\n\n private fun successorNode(x: Int): Int {\n var x = x\n return if (right[x] != NULL) {\n x = right[x]\n while (left[x] != NULL) {\n x = left[x]\n }\n x\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n y\n }\n }\n\n private fun fixAfterAdd(z: Int) {\n var z = z\n while (color[p[z]] == RED) {\n if (p[z] == left[p[p[z]]]) {\n val y = right[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == right[p[z]]) {\n z = p[z]\n rotateLeft(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateRight(p[p[z]])\n }\n } else {\n val y = left[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == left[p[z]]) {\n z = p[z]\n rotateRight(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateLeft(p[p[z]])\n }\n }\n }\n color[root] = BLACK\n }\n\n private fun fixAfterRemove(x: Int) {\n var x = x\n while (x != root && color[x] == BLACK) {\n if (x == left[p[x]]) {\n var w = right[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateLeft(p[x])\n w = right[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[right[w]] == BLACK) {\n color[left[w]] = BLACK\n color[w] = RED\n rotateRight(w)\n w = right[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[right[w]] = BLACK\n rotateLeft(p[x])\n x = root\n }\n } else {\n var w = left[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateRight(p[x])\n w = left[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[left[w]] == BLACK) {\n color[right[w]] = BLACK\n color[w] = RED\n rotateLeft(w)\n w = left[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[left[w]] = BLACK\n rotateRight(p[x])\n x = root\n }\n }\n }\n color[x] = BLACK\n }\n\n private fun rotateLeft(x: Int) {\n val y = right[x]\n right[x] = left[y]\n if (left[y] != NULL) {\n p[left[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == left[p[x]]) {\n left[p[x]] = y\n } else {\n right[p[x]] = y\n }\n }\n left[y] = x\n p[x] = y\n }\n\n private fun rotateRight(x: Int) {\n val y = left[x]\n left[x] = right[y]\n if (right[y] != NULL) {\n p[right[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == right[p[x]]) {\n right[p[x]] = y\n } else {\n left[p[x]] = y\n }\n }\n right[y] = x\n p[x] = y\n }\n\n fun clear() {\n color[NULL] = BLACK\n size = 0\n root = NULL\n }\n\n private fun enlarge() {\n val newLength =\n Math.max(color.size + 1, (color.size * ENLARGE_SCALE).toInt())\n key = Arrays.copyOf(key, newLength)\n left = Arrays.copyOf(left, newLength)\n right = Arrays.copyOf(right, newLength)\n p = Arrays.copyOf(p, newLength)\n color = Arrays.copyOf(color, newLength)\n }\n\n private fun firstNode(): Int {\n var x = root\n while (left[x] != NULL) {\n x = left[x]\n }\n return x\n }\n\n private fun lastNode(): Int {\n var x = root\n while (right[x] != NULL) {\n x = right[x]\n }\n return x\n }\n\n /*C*/ /*C*/\n val first: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ /*C*/\n val last: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ fun /*C*/removeFirst(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/removeLast(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/floor( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/ceiling( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/lower( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/higher( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n fun returnedNull(): Boolean {\n return returnedNull\n }\n\n override fun equals(o: Any?): Boolean {\n if (this === o) return true\n if (o == null || javaClass != o.javaClass) return false\n val that = o as _Ez_Int_TreeSet\n if (size != that.size) {\n return false\n }\n var x = firstNode()\n var y = that.firstNode()\n while (x != NULL) {\n if (key[x] != that.key[y]) {\n return false\n }\n x = successorNode(x)\n y = that.successorNode(y)\n }\n return true\n }\n\n override fun toString(): String {\n val sb = StringBuilder()\n sb.append('[')\n var x = firstNode()\n while (x != NULL) {\n if (sb.length > 1) {\n sb.append(\", \")\n }\n sb.append(key[x])\n x = successorNode(x)\n }\n sb.append(']')\n return sb.toString()\n }\n\n private inner class _Ez_Int_TreeSetIterator constructor() : IntIterator() {\n private var x: Int\n override fun hasNext(): Boolean {\n return x != NULL\n }\n\n /*C*/ override fun /*C*/nextInt(): Int {\n if (x == NULL) {\n throw NoSuchElementException(\"Iterator doesn't have more elements\")\n }\n val /*C*/result = key[x]\n x = successorNode(x)\n return result\n }\n\n init {\n x = firstNode()\n }\n }\n\n companion object {\n private const val DEFAULT_CAPACITY = 10\n private const val ENLARGE_SCALE = 2.0\n private const val HASHCODE_INITIAL_VALUE = -0x7ee3623b\n private const val HASHCODE_MULTIPLIER = 0x01000193\n private const val BLACK = false\n private const val RED = true\n private const val NULL = 0\n private /*C*/ val /*C*/DEFAULT_NULL_ELEMENT = IntArray(1)[0]\n }\n\n init {\n var capacity = capacity\n require(capacity >= 0) { \"Capacity must be non-negative\" }\n capacity++\n key = IntArray(capacity)\n left = IntArray(capacity)\n right = IntArray(capacity)\n p = IntArray(capacity)\n color = BooleanArray(capacity)\n color[NULL] = BLACK\n size = 0\n root = NULL\n returnedNull = false\n }\n}\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "language": "Kotlin", "metadata": {"date": 1593559497, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Kotlin/s016285012.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s016285012", "user_id": "u596111103"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.File\nimport java.io.PrintWriter\nimport java.util.Arrays\nimport java.util.NoSuchElementException\nimport java.util.TreeSet\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\n\nfun PrintWriter.solve() {\n val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n object {\n val D = readInt()\n\n val C = readIntArray(26)\n val S = Array(D) { readIntArray(26) }\n\n var v = 0L\n val last = IntArray(26)\n val L = Array(26) {\n IntTreeSet().also {\n it.add(-1)\n it.add(D)\n }\n }\n val T = IntArray(D) { random.nextInt(26) }.also { T ->\n repeat(D) { d ->\n val t = T[d]\n\n v += S[d][t]\n last[t] = d + 1\n for (i in 0 until 26) {\n v -= C[i] * (d + 1 - last[i])\n }\n\n L[t].add(d)\n }\n }\n\n fun update(d: Int, q: Int) {\n val t = T[d]\n v += S[d][q] - S[d][t]\n\n L[t].remove(d)\n var a = L[t].floor(d)\n var b = L[t].ceiling(d)\n v -= C[t] * (d - a) * (b - d)\n\n a = L[q].floor(d)\n b = L[q].ceiling(d)\n v += C[q] * (d - a) * (b - d)\n L[q].add(d)\n\n T[d] = q\n }\n\n var score = max(0, 1e6.toLong() + v)\n var best = T.copyOf()\n\n fun prob(e0: Long, e1: Long, temp: Double) = if (e1 < e0) 1.0\n else exp(-(e1 - e0).toDouble() / (temp))\n\n init {\n while(true) {\n val time = System.nanoTime() - startTime\n if(time >= timeLimit) break\n val d = random.nextInt(D)\n val q = random.nextInt(26)\n val t = T[d]\n\n val e0 = -v\n update(d, q)\n\n val scaledTime = time.toDouble() / timeLimit\n val temp = T0.pow(1 - scaledTime) * T1.pow(scaledTime)\n if(random.nextDouble() >= prob(e0, -v, temp)) {\n update(d, t)\n } else {\n val newScore = max(0, 1e6.toLong() + v)\n if (newScore > score) {\n score = newScore\n best = T.copyOf()\n }\n }\n }\n\n// System.err.println(\"Score: ${score}\")\n for(t in best) println(t+1)\n }\n }\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\nconst val T0 = 4e3\nconst val T1 = 6e2\nconst val timeLimit = 1.85e9.toLong()\n\ntypealias IntTreeSet = _Ez_Int_TreeSet\n\nclass _Ez_Int_TreeSet @JvmOverloads constructor(capacity: Int = DEFAULT_CAPACITY) {\n // Arrays are 1-indexed. Index 0 is a null node.\n private /*C*/ var key: IntArray\n private var left: IntArray\n private var right: IntArray\n private var p: IntArray\n private var color: BooleanArray\n private var size = 0\n private var root = 0\n private var returnedNull = false\n\n constructor( /*C*/\n srcArray: IntArray\n ) : this(srcArray.size) {\n for ( /*C*/\n /*C*/element in srcArray) {\n add(element)\n }\n }\n\n fun size(): Int {\n return size\n }\n\n val isEmpty: Boolean\n get() = size == 0\n\n operator fun contains( /*C*/\n /*C*/element: Int\n ): Boolean {\n var x = root\n while (x != NULL) {\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return true\n }\n }\n return false\n }\n\n operator fun iterator() = _Ez_Int_TreeSetIterator() as IntIterator\n\n /*C*/ fun toArray(): IntArray {\n /*C*/\n val result = IntArray(size)\n var i = 0\n var x = firstNode()\n while (x != NULL) {\n result[i] = key[x]\n x = successorNode(x)\n i++\n }\n return result\n }\n\n fun add( /*C*/\n /*C*/element: Int\n ): Boolean {\n var y = NULL\n var x = root\n while (x != NULL) {\n y = x\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return false\n }\n }\n if (size == color.size - 1) {\n enlarge()\n }\n val z = ++size\n key[z] = element\n p[z] = y\n if (y == NULL) {\n root = z\n } else {\n if (element < key[y]) {\n left[y] = z\n } else {\n right[y] = z\n }\n }\n left[z] = NULL\n right[z] = NULL\n color[z] = RED\n fixAfterAdd(z)\n return true\n }\n\n fun remove( /*C*/\n /*C*/element: Int\n ): Boolean {\n var z = root\n while (z != NULL) {\n z = if (element < key[z]) {\n left[z]\n } else if (element > key[z]) {\n right[z]\n } else {\n removeNode(z)\n return true\n }\n }\n return false\n }\n\n private fun removeNode(z: Int) {\n val y =\n if (left[z] == NULL || right[z] == NULL) z else successorNode(\n z\n )\n val x = if (left[y] != NULL) left[y] else right[y]\n p[x] = p[y]\n if (p[y] == NULL) {\n root = x\n } else {\n if (y == left[p[y]]) {\n left[p[y]] = x\n } else {\n right[p[y]] = x\n }\n }\n if (y != z) {\n key[z] = key[y]\n }\n if (color[y] == BLACK) {\n fixAfterRemove(x)\n }\n // Swap with last\n if (y != size) {\n // copy fields\n key[y] = key[size]\n left[y] = left[size]\n right[y] = right[size]\n p[y] = p[size]\n color[y] = color[size]\n // fix the children's parents\n p[left[size]] = y\n p[right[size]] = y\n // fix one of the parent's children\n if (left[p[size]] == size) {\n left[p[size]] = y\n } else {\n right[p[size]] = y\n }\n // fix root\n if (root == size) {\n root = y\n }\n }\n size--\n }\n\n private fun successorNode(x: Int): Int {\n var x = x\n return if (right[x] != NULL) {\n x = right[x]\n while (left[x] != NULL) {\n x = left[x]\n }\n x\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n y\n }\n }\n\n private fun fixAfterAdd(z: Int) {\n var z = z\n while (color[p[z]] == RED) {\n if (p[z] == left[p[p[z]]]) {\n val y = right[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == right[p[z]]) {\n z = p[z]\n rotateLeft(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateRight(p[p[z]])\n }\n } else {\n val y = left[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == left[p[z]]) {\n z = p[z]\n rotateRight(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateLeft(p[p[z]])\n }\n }\n }\n color[root] = BLACK\n }\n\n private fun fixAfterRemove(x: Int) {\n var x = x\n while (x != root && color[x] == BLACK) {\n if (x == left[p[x]]) {\n var w = right[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateLeft(p[x])\n w = right[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[right[w]] == BLACK) {\n color[left[w]] = BLACK\n color[w] = RED\n rotateRight(w)\n w = right[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[right[w]] = BLACK\n rotateLeft(p[x])\n x = root\n }\n } else {\n var w = left[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateRight(p[x])\n w = left[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[left[w]] == BLACK) {\n color[right[w]] = BLACK\n color[w] = RED\n rotateLeft(w)\n w = left[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[left[w]] = BLACK\n rotateRight(p[x])\n x = root\n }\n }\n }\n color[x] = BLACK\n }\n\n private fun rotateLeft(x: Int) {\n val y = right[x]\n right[x] = left[y]\n if (left[y] != NULL) {\n p[left[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == left[p[x]]) {\n left[p[x]] = y\n } else {\n right[p[x]] = y\n }\n }\n left[y] = x\n p[x] = y\n }\n\n private fun rotateRight(x: Int) {\n val y = left[x]\n left[x] = right[y]\n if (right[y] != NULL) {\n p[right[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == right[p[x]]) {\n right[p[x]] = y\n } else {\n left[p[x]] = y\n }\n }\n right[y] = x\n p[x] = y\n }\n\n fun clear() {\n color[NULL] = BLACK\n size = 0\n root = NULL\n }\n\n private fun enlarge() {\n val newLength =\n Math.max(color.size + 1, (color.size * ENLARGE_SCALE).toInt())\n key = Arrays.copyOf(key, newLength)\n left = Arrays.copyOf(left, newLength)\n right = Arrays.copyOf(right, newLength)\n p = Arrays.copyOf(p, newLength)\n color = Arrays.copyOf(color, newLength)\n }\n\n private fun firstNode(): Int {\n var x = root\n while (left[x] != NULL) {\n x = left[x]\n }\n return x\n }\n\n private fun lastNode(): Int {\n var x = root\n while (right[x] != NULL) {\n x = right[x]\n }\n return x\n }\n\n /*C*/ /*C*/\n val first: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ /*C*/\n val last: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ fun /*C*/removeFirst(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/removeLast(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/floor( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/ceiling( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/lower( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/higher( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n fun returnedNull(): Boolean {\n return returnedNull\n }\n\n override fun equals(o: Any?): Boolean {\n if (this === o) return true\n if (o == null || javaClass != o.javaClass) return false\n val that = o as _Ez_Int_TreeSet\n if (size != that.size) {\n return false\n }\n var x = firstNode()\n var y = that.firstNode()\n while (x != NULL) {\n if (key[x] != that.key[y]) {\n return false\n }\n x = successorNode(x)\n y = that.successorNode(y)\n }\n return true\n }\n\n override fun toString(): String {\n val sb = StringBuilder()\n sb.append('[')\n var x = firstNode()\n while (x != NULL) {\n if (sb.length > 1) {\n sb.append(\", \")\n }\n sb.append(key[x])\n x = successorNode(x)\n }\n sb.append(']')\n return sb.toString()\n }\n\n private inner class _Ez_Int_TreeSetIterator constructor() : IntIterator() {\n private var x: Int\n override fun hasNext(): Boolean {\n return x != NULL\n }\n\n /*C*/ override fun /*C*/nextInt(): Int {\n if (x == NULL) {\n throw NoSuchElementException(\"Iterator doesn't have more elements\")\n }\n val /*C*/result = key[x]\n x = successorNode(x)\n return result\n }\n\n init {\n x = firstNode()\n }\n }\n\n companion object {\n private const val DEFAULT_CAPACITY = 10\n private const val ENLARGE_SCALE = 2.0\n private const val HASHCODE_INITIAL_VALUE = -0x7ee3623b\n private const val HASHCODE_MULTIPLIER = 0x01000193\n private const val BLACK = false\n private const val RED = true\n private const val NULL = 0\n private /*C*/ val /*C*/DEFAULT_NULL_ELEMENT = IntArray(1)[0]\n }\n\n init {\n var capacity = capacity\n require(capacity >= 0) { \"Capacity must be non-negative\" }\n capacity++\n key = IntArray(capacity)\n left = IntArray(capacity)\n right = IntArray(capacity)\n p = IntArray(capacity)\n color = BooleanArray(capacity)\n color[NULL] = BLACK\n size = 0\n root = NULL\n returnedNull = false\n }\n}\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 23820, "cpu_time_ms": 1949, "memory_kb": 44232}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s688816353", "group_id": "codeNet:p02618", "input_text": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.File\nimport java.io.PrintWriter\nimport java.util.Arrays\nimport java.util.NoSuchElementException\nimport java.util.TreeSet\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\n\nfun PrintWriter.solve() {\n val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n object {\n val D = readInt()\n\n val C = readIntArray(26)\n val S = Array(D) { readIntArray(26) }\n\n var v = 0L\n val last = IntArray(26)\n val L = Array(26) {\n IntTreeSet().also {\n it.add(-1)\n it.add(D)\n }\n }\n val T = IntArray(D) { random.nextInt(26) }.also { T ->\n repeat(D) { d ->\n val t = T[d]\n\n v += S[d][t]\n last[t] = d + 1\n for (i in 0 until 26) {\n v -= C[i] * (d + 1 - last[i])\n }\n\n L[t].add(d)\n }\n }\n\n fun update(d: Int, q: Int) {\n val t = T[d]\n v += S[d][q] - S[d][t]\n\n L[t].remove(d)\n var a = L[t].floor(d)\n var b = L[t].ceiling(d)\n v -= C[t] * (d - a) * (b - d)\n\n a = L[q].floor(d)\n b = L[q].ceiling(d)\n v += C[q] * (d - a) * (b - d)\n L[q].add(d)\n\n T[d] = q\n }\n\n var score = max(0, 1e6.toLong() + v)\n var best = T.copyOf()\n\n fun prob(e0: Long, e1: Long, temp: Double) = if (e1 < e0) 1.0\n else exp(-(e1 - e0).toDouble() / (temp))\n\n init {\n while(true) {\n val time = System.nanoTime() - startTime\n if(time >= timeLimit) break\n val d = random.nextInt(D)\n val q = random.nextInt(26)\n val t = T[d]\n\n val e0 = -v\n update(d, q)\n\n val temp = T0 - (T0 - T1) * time / timeLimit\n if(random.nextDouble() >= prob(e0, -v, temp)) {\n update(d, t)\n }\n\n val newScore = max(0, 1e6.toLong() + v)\n if(newScore > score) {\n score = newScore\n best = T.copyOf()\n }\n }\n\n //System.err.println(\"Score: ${score}\")\n for(t in best) println(t+1)\n }\n }\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\nconst val T0 = 6e3\nconst val T1 = 6e2\nconst val timeLimit = 1.8e9.toLong()\n\ntypealias IntTreeSet = _Ez_Int_TreeSet\n\nclass _Ez_Int_TreeSet @JvmOverloads constructor(capacity: Int = DEFAULT_CAPACITY) {\n // Arrays are 1-indexed. Index 0 is a null node.\n private /*C*/ var key: IntArray\n private var left: IntArray\n private var right: IntArray\n private var p: IntArray\n private var color: BooleanArray\n private var size = 0\n private var root = 0\n private var returnedNull = false\n\n constructor( /*C*/\n srcArray: IntArray\n ) : this(srcArray.size) {\n for ( /*C*/\n /*C*/element in srcArray) {\n add(element)\n }\n }\n\n fun size(): Int {\n return size\n }\n\n val isEmpty: Boolean\n get() = size == 0\n\n operator fun contains( /*C*/\n /*C*/element: Int\n ): Boolean {\n var x = root\n while (x != NULL) {\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return true\n }\n }\n return false\n }\n\n operator fun iterator() = _Ez_Int_TreeSetIterator() as IntIterator\n\n /*C*/ fun toArray(): IntArray {\n /*C*/\n val result = IntArray(size)\n var i = 0\n var x = firstNode()\n while (x != NULL) {\n result[i] = key[x]\n x = successorNode(x)\n i++\n }\n return result\n }\n\n fun add( /*C*/\n /*C*/element: Int\n ): Boolean {\n var y = NULL\n var x = root\n while (x != NULL) {\n y = x\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return false\n }\n }\n if (size == color.size - 1) {\n enlarge()\n }\n val z = ++size\n key[z] = element\n p[z] = y\n if (y == NULL) {\n root = z\n } else {\n if (element < key[y]) {\n left[y] = z\n } else {\n right[y] = z\n }\n }\n left[z] = NULL\n right[z] = NULL\n color[z] = RED\n fixAfterAdd(z)\n return true\n }\n\n fun remove( /*C*/\n /*C*/element: Int\n ): Boolean {\n var z = root\n while (z != NULL) {\n z = if (element < key[z]) {\n left[z]\n } else if (element > key[z]) {\n right[z]\n } else {\n removeNode(z)\n return true\n }\n }\n return false\n }\n\n private fun removeNode(z: Int) {\n val y =\n if (left[z] == NULL || right[z] == NULL) z else successorNode(\n z\n )\n val x = if (left[y] != NULL) left[y] else right[y]\n p[x] = p[y]\n if (p[y] == NULL) {\n root = x\n } else {\n if (y == left[p[y]]) {\n left[p[y]] = x\n } else {\n right[p[y]] = x\n }\n }\n if (y != z) {\n key[z] = key[y]\n }\n if (color[y] == BLACK) {\n fixAfterRemove(x)\n }\n // Swap with last\n if (y != size) {\n // copy fields\n key[y] = key[size]\n left[y] = left[size]\n right[y] = right[size]\n p[y] = p[size]\n color[y] = color[size]\n // fix the children's parents\n p[left[size]] = y\n p[right[size]] = y\n // fix one of the parent's children\n if (left[p[size]] == size) {\n left[p[size]] = y\n } else {\n right[p[size]] = y\n }\n // fix root\n if (root == size) {\n root = y\n }\n }\n size--\n }\n\n private fun successorNode(x: Int): Int {\n var x = x\n return if (right[x] != NULL) {\n x = right[x]\n while (left[x] != NULL) {\n x = left[x]\n }\n x\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n y\n }\n }\n\n private fun fixAfterAdd(z: Int) {\n var z = z\n while (color[p[z]] == RED) {\n if (p[z] == left[p[p[z]]]) {\n val y = right[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == right[p[z]]) {\n z = p[z]\n rotateLeft(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateRight(p[p[z]])\n }\n } else {\n val y = left[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == left[p[z]]) {\n z = p[z]\n rotateRight(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateLeft(p[p[z]])\n }\n }\n }\n color[root] = BLACK\n }\n\n private fun fixAfterRemove(x: Int) {\n var x = x\n while (x != root && color[x] == BLACK) {\n if (x == left[p[x]]) {\n var w = right[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateLeft(p[x])\n w = right[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[right[w]] == BLACK) {\n color[left[w]] = BLACK\n color[w] = RED\n rotateRight(w)\n w = right[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[right[w]] = BLACK\n rotateLeft(p[x])\n x = root\n }\n } else {\n var w = left[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateRight(p[x])\n w = left[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[left[w]] == BLACK) {\n color[right[w]] = BLACK\n color[w] = RED\n rotateLeft(w)\n w = left[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[left[w]] = BLACK\n rotateRight(p[x])\n x = root\n }\n }\n }\n color[x] = BLACK\n }\n\n private fun rotateLeft(x: Int) {\n val y = right[x]\n right[x] = left[y]\n if (left[y] != NULL) {\n p[left[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == left[p[x]]) {\n left[p[x]] = y\n } else {\n right[p[x]] = y\n }\n }\n left[y] = x\n p[x] = y\n }\n\n private fun rotateRight(x: Int) {\n val y = left[x]\n left[x] = right[y]\n if (right[y] != NULL) {\n p[right[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == right[p[x]]) {\n right[p[x]] = y\n } else {\n left[p[x]] = y\n }\n }\n right[y] = x\n p[x] = y\n }\n\n fun clear() {\n color[NULL] = BLACK\n size = 0\n root = NULL\n }\n\n private fun enlarge() {\n val newLength =\n Math.max(color.size + 1, (color.size * ENLARGE_SCALE).toInt())\n key = Arrays.copyOf(key, newLength)\n left = Arrays.copyOf(left, newLength)\n right = Arrays.copyOf(right, newLength)\n p = Arrays.copyOf(p, newLength)\n color = Arrays.copyOf(color, newLength)\n }\n\n private fun firstNode(): Int {\n var x = root\n while (left[x] != NULL) {\n x = left[x]\n }\n return x\n }\n\n private fun lastNode(): Int {\n var x = root\n while (right[x] != NULL) {\n x = right[x]\n }\n return x\n }\n\n /*C*/ /*C*/\n val first: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ /*C*/\n val last: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ fun /*C*/removeFirst(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/removeLast(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/floor( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/ceiling( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/lower( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/higher( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n fun returnedNull(): Boolean {\n return returnedNull\n }\n\n override fun equals(o: Any?): Boolean {\n if (this === o) return true\n if (o == null || javaClass != o.javaClass) return false\n val that = o as _Ez_Int_TreeSet\n if (size != that.size) {\n return false\n }\n var x = firstNode()\n var y = that.firstNode()\n while (x != NULL) {\n if (key[x] != that.key[y]) {\n return false\n }\n x = successorNode(x)\n y = that.successorNode(y)\n }\n return true\n }\n\n override fun toString(): String {\n val sb = StringBuilder()\n sb.append('[')\n var x = firstNode()\n while (x != NULL) {\n if (sb.length > 1) {\n sb.append(\", \")\n }\n sb.append(key[x])\n x = successorNode(x)\n }\n sb.append(']')\n return sb.toString()\n }\n\n private inner class _Ez_Int_TreeSetIterator constructor() : IntIterator() {\n private var x: Int\n override fun hasNext(): Boolean {\n return x != NULL\n }\n\n /*C*/ override fun /*C*/nextInt(): Int {\n if (x == NULL) {\n throw NoSuchElementException(\"Iterator doesn't have more elements\")\n }\n val /*C*/result = key[x]\n x = successorNode(x)\n return result\n }\n\n init {\n x = firstNode()\n }\n }\n\n companion object {\n private const val DEFAULT_CAPACITY = 10\n private const val ENLARGE_SCALE = 2.0\n private const val HASHCODE_INITIAL_VALUE = -0x7ee3623b\n private const val HASHCODE_MULTIPLIER = 0x01000193\n private const val BLACK = false\n private const val RED = true\n private const val NULL = 0\n private /*C*/ val /*C*/DEFAULT_NULL_ELEMENT = IntArray(1)[0]\n }\n\n init {\n var capacity = capacity\n require(capacity >= 0) { \"Capacity must be non-negative\" }\n capacity++\n key = IntArray(capacity)\n left = IntArray(capacity)\n right = IntArray(capacity)\n p = IntArray(capacity)\n color = BooleanArray(capacity)\n color[NULL] = BLACK\n size = 0\n root = NULL\n returnedNull = false\n }\n}\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "language": "Kotlin", "metadata": {"date": 1593558398, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Kotlin/s688816353.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s688816353", "user_id": "u596111103"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.File\nimport java.io.PrintWriter\nimport java.util.Arrays\nimport java.util.NoSuchElementException\nimport java.util.TreeSet\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\n\nfun PrintWriter.solve() {\n val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n object {\n val D = readInt()\n\n val C = readIntArray(26)\n val S = Array(D) { readIntArray(26) }\n\n var v = 0L\n val last = IntArray(26)\n val L = Array(26) {\n IntTreeSet().also {\n it.add(-1)\n it.add(D)\n }\n }\n val T = IntArray(D) { random.nextInt(26) }.also { T ->\n repeat(D) { d ->\n val t = T[d]\n\n v += S[d][t]\n last[t] = d + 1\n for (i in 0 until 26) {\n v -= C[i] * (d + 1 - last[i])\n }\n\n L[t].add(d)\n }\n }\n\n fun update(d: Int, q: Int) {\n val t = T[d]\n v += S[d][q] - S[d][t]\n\n L[t].remove(d)\n var a = L[t].floor(d)\n var b = L[t].ceiling(d)\n v -= C[t] * (d - a) * (b - d)\n\n a = L[q].floor(d)\n b = L[q].ceiling(d)\n v += C[q] * (d - a) * (b - d)\n L[q].add(d)\n\n T[d] = q\n }\n\n var score = max(0, 1e6.toLong() + v)\n var best = T.copyOf()\n\n fun prob(e0: Long, e1: Long, temp: Double) = if (e1 < e0) 1.0\n else exp(-(e1 - e0).toDouble() / (temp))\n\n init {\n while(true) {\n val time = System.nanoTime() - startTime\n if(time >= timeLimit) break\n val d = random.nextInt(D)\n val q = random.nextInt(26)\n val t = T[d]\n\n val e0 = -v\n update(d, q)\n\n val temp = T0 - (T0 - T1) * time / timeLimit\n if(random.nextDouble() >= prob(e0, -v, temp)) {\n update(d, t)\n }\n\n val newScore = max(0, 1e6.toLong() + v)\n if(newScore > score) {\n score = newScore\n best = T.copyOf()\n }\n }\n\n //System.err.println(\"Score: ${score}\")\n for(t in best) println(t+1)\n }\n }\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\nconst val T0 = 6e3\nconst val T1 = 6e2\nconst val timeLimit = 1.8e9.toLong()\n\ntypealias IntTreeSet = _Ez_Int_TreeSet\n\nclass _Ez_Int_TreeSet @JvmOverloads constructor(capacity: Int = DEFAULT_CAPACITY) {\n // Arrays are 1-indexed. Index 0 is a null node.\n private /*C*/ var key: IntArray\n private var left: IntArray\n private var right: IntArray\n private var p: IntArray\n private var color: BooleanArray\n private var size = 0\n private var root = 0\n private var returnedNull = false\n\n constructor( /*C*/\n srcArray: IntArray\n ) : this(srcArray.size) {\n for ( /*C*/\n /*C*/element in srcArray) {\n add(element)\n }\n }\n\n fun size(): Int {\n return size\n }\n\n val isEmpty: Boolean\n get() = size == 0\n\n operator fun contains( /*C*/\n /*C*/element: Int\n ): Boolean {\n var x = root\n while (x != NULL) {\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return true\n }\n }\n return false\n }\n\n operator fun iterator() = _Ez_Int_TreeSetIterator() as IntIterator\n\n /*C*/ fun toArray(): IntArray {\n /*C*/\n val result = IntArray(size)\n var i = 0\n var x = firstNode()\n while (x != NULL) {\n result[i] = key[x]\n x = successorNode(x)\n i++\n }\n return result\n }\n\n fun add( /*C*/\n /*C*/element: Int\n ): Boolean {\n var y = NULL\n var x = root\n while (x != NULL) {\n y = x\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return false\n }\n }\n if (size == color.size - 1) {\n enlarge()\n }\n val z = ++size\n key[z] = element\n p[z] = y\n if (y == NULL) {\n root = z\n } else {\n if (element < key[y]) {\n left[y] = z\n } else {\n right[y] = z\n }\n }\n left[z] = NULL\n right[z] = NULL\n color[z] = RED\n fixAfterAdd(z)\n return true\n }\n\n fun remove( /*C*/\n /*C*/element: Int\n ): Boolean {\n var z = root\n while (z != NULL) {\n z = if (element < key[z]) {\n left[z]\n } else if (element > key[z]) {\n right[z]\n } else {\n removeNode(z)\n return true\n }\n }\n return false\n }\n\n private fun removeNode(z: Int) {\n val y =\n if (left[z] == NULL || right[z] == NULL) z else successorNode(\n z\n )\n val x = if (left[y] != NULL) left[y] else right[y]\n p[x] = p[y]\n if (p[y] == NULL) {\n root = x\n } else {\n if (y == left[p[y]]) {\n left[p[y]] = x\n } else {\n right[p[y]] = x\n }\n }\n if (y != z) {\n key[z] = key[y]\n }\n if (color[y] == BLACK) {\n fixAfterRemove(x)\n }\n // Swap with last\n if (y != size) {\n // copy fields\n key[y] = key[size]\n left[y] = left[size]\n right[y] = right[size]\n p[y] = p[size]\n color[y] = color[size]\n // fix the children's parents\n p[left[size]] = y\n p[right[size]] = y\n // fix one of the parent's children\n if (left[p[size]] == size) {\n left[p[size]] = y\n } else {\n right[p[size]] = y\n }\n // fix root\n if (root == size) {\n root = y\n }\n }\n size--\n }\n\n private fun successorNode(x: Int): Int {\n var x = x\n return if (right[x] != NULL) {\n x = right[x]\n while (left[x] != NULL) {\n x = left[x]\n }\n x\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n y\n }\n }\n\n private fun fixAfterAdd(z: Int) {\n var z = z\n while (color[p[z]] == RED) {\n if (p[z] == left[p[p[z]]]) {\n val y = right[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == right[p[z]]) {\n z = p[z]\n rotateLeft(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateRight(p[p[z]])\n }\n } else {\n val y = left[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == left[p[z]]) {\n z = p[z]\n rotateRight(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateLeft(p[p[z]])\n }\n }\n }\n color[root] = BLACK\n }\n\n private fun fixAfterRemove(x: Int) {\n var x = x\n while (x != root && color[x] == BLACK) {\n if (x == left[p[x]]) {\n var w = right[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateLeft(p[x])\n w = right[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[right[w]] == BLACK) {\n color[left[w]] = BLACK\n color[w] = RED\n rotateRight(w)\n w = right[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[right[w]] = BLACK\n rotateLeft(p[x])\n x = root\n }\n } else {\n var w = left[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateRight(p[x])\n w = left[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[left[w]] == BLACK) {\n color[right[w]] = BLACK\n color[w] = RED\n rotateLeft(w)\n w = left[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[left[w]] = BLACK\n rotateRight(p[x])\n x = root\n }\n }\n }\n color[x] = BLACK\n }\n\n private fun rotateLeft(x: Int) {\n val y = right[x]\n right[x] = left[y]\n if (left[y] != NULL) {\n p[left[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == left[p[x]]) {\n left[p[x]] = y\n } else {\n right[p[x]] = y\n }\n }\n left[y] = x\n p[x] = y\n }\n\n private fun rotateRight(x: Int) {\n val y = left[x]\n left[x] = right[y]\n if (right[y] != NULL) {\n p[right[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == right[p[x]]) {\n right[p[x]] = y\n } else {\n left[p[x]] = y\n }\n }\n right[y] = x\n p[x] = y\n }\n\n fun clear() {\n color[NULL] = BLACK\n size = 0\n root = NULL\n }\n\n private fun enlarge() {\n val newLength =\n Math.max(color.size + 1, (color.size * ENLARGE_SCALE).toInt())\n key = Arrays.copyOf(key, newLength)\n left = Arrays.copyOf(left, newLength)\n right = Arrays.copyOf(right, newLength)\n p = Arrays.copyOf(p, newLength)\n color = Arrays.copyOf(color, newLength)\n }\n\n private fun firstNode(): Int {\n var x = root\n while (left[x] != NULL) {\n x = left[x]\n }\n return x\n }\n\n private fun lastNode(): Int {\n var x = root\n while (right[x] != NULL) {\n x = right[x]\n }\n return x\n }\n\n /*C*/ /*C*/\n val first: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ /*C*/\n val last: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ fun /*C*/removeFirst(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/removeLast(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/floor( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/ceiling( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/lower( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/higher( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n fun returnedNull(): Boolean {\n return returnedNull\n }\n\n override fun equals(o: Any?): Boolean {\n if (this === o) return true\n if (o == null || javaClass != o.javaClass) return false\n val that = o as _Ez_Int_TreeSet\n if (size != that.size) {\n return false\n }\n var x = firstNode()\n var y = that.firstNode()\n while (x != NULL) {\n if (key[x] != that.key[y]) {\n return false\n }\n x = successorNode(x)\n y = that.successorNode(y)\n }\n return true\n }\n\n override fun toString(): String {\n val sb = StringBuilder()\n sb.append('[')\n var x = firstNode()\n while (x != NULL) {\n if (sb.length > 1) {\n sb.append(\", \")\n }\n sb.append(key[x])\n x = successorNode(x)\n }\n sb.append(']')\n return sb.toString()\n }\n\n private inner class _Ez_Int_TreeSetIterator constructor() : IntIterator() {\n private var x: Int\n override fun hasNext(): Boolean {\n return x != NULL\n }\n\n /*C*/ override fun /*C*/nextInt(): Int {\n if (x == NULL) {\n throw NoSuchElementException(\"Iterator doesn't have more elements\")\n }\n val /*C*/result = key[x]\n x = successorNode(x)\n return result\n }\n\n init {\n x = firstNode()\n }\n }\n\n companion object {\n private const val DEFAULT_CAPACITY = 10\n private const val ENLARGE_SCALE = 2.0\n private const val HASHCODE_INITIAL_VALUE = -0x7ee3623b\n private const val HASHCODE_MULTIPLIER = 0x01000193\n private const val BLACK = false\n private const val RED = true\n private const val NULL = 0\n private /*C*/ val /*C*/DEFAULT_NULL_ELEMENT = IntArray(1)[0]\n }\n\n init {\n var capacity = capacity\n require(capacity >= 0) { \"Capacity must be non-negative\" }\n capacity++\n key = IntArray(capacity)\n left = IntArray(capacity)\n right = IntArray(capacity)\n p = IntArray(capacity)\n color = BooleanArray(capacity)\n color[NULL] = BLACK\n size = 0\n root = NULL\n returnedNull = false\n }\n}\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 23695, "cpu_time_ms": 1902, "memory_kb": 44120}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s801041587", "group_id": "codeNet:p02618", "input_text": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.File\nimport java.io.PrintWriter\nimport java.util.Arrays\nimport java.util.NoSuchElementException\nimport java.util.TreeSet\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\n\nfun PrintWriter.solve() {\n val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n object {\n val D = readInt()\n\n val C = readIntArray(26)\n val S = Array(D) { readIntArray(26) }\n\n var v = 0L\n val last = IntArray(26)\n val L = Array(26) {\n IntTreeSet().also {\n it.add(-1)\n it.add(D)\n }\n }\n val T = IntArray(D) { random.nextInt(26) }.also { T ->\n repeat(D) { d ->\n val t = T[d]\n\n v += S[d][t]\n last[t] = d + 1\n for (i in 0 until 26) {\n v -= C[i] * (d + 1 - last[i])\n }\n\n L[t].add(d)\n }\n }\n\n fun update(d: Int, q: Int) {\n val t = T[d]\n v += S[d][q] - S[d][t]\n\n L[t].remove(d)\n var a = L[t].floor(d)\n var b = L[t].ceiling(d)\n v -= C[t] * (d - a) * (b - d)\n\n a = L[q].floor(d)\n b = L[q].ceiling(d)\n v += C[q] * (d - a) * (b - d)\n L[q].add(d)\n\n T[d] = q\n }\n\n var score = max(0, 1e6.toLong() + v)\n var best = T.copyOf()\n\n fun prob(e0: Long, e1: Long, temp: Double) = if (e1 < e0) 1.0\n else exp(-(e1 - e0).toDouble() / (temp))\n\n init {\n while(true) {\n val time = System.nanoTime() - startTime\n if(time >= timeLimit) break\n val d = random.nextInt(D)\n val q = random.nextInt(26)\n val t = T[d]\n\n val e0 = -v\n update(d, q)\n\n val temp = T0 - (T0 - T1) * time / timeLimit\n if(random.nextDouble() >= prob(e0, -v, temp)) {\n update(d, t)\n }\n\n val newScore = max(0, 1e6.toLong() + v)\n if(newScore > score) {\n score = newScore\n best = T.copyOf()\n }\n }\n\n //System.err.println(\"Score: ${score}\")\n for(t in best) println(t+1)\n }\n }\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\nconst val T0 = 2e4\nconst val T1 = 6e2\nconst val timeLimit = 1.8e9.toLong()\n\ntypealias IntTreeSet = _Ez_Int_TreeSet\n\nclass _Ez_Int_TreeSet @JvmOverloads constructor(capacity: Int = DEFAULT_CAPACITY) {\n // Arrays are 1-indexed. Index 0 is a null node.\n private /*C*/ var key: IntArray\n private var left: IntArray\n private var right: IntArray\n private var p: IntArray\n private var color: BooleanArray\n private var size = 0\n private var root = 0\n private var returnedNull = false\n\n constructor( /*C*/\n srcArray: IntArray\n ) : this(srcArray.size) {\n for ( /*C*/\n /*C*/element in srcArray) {\n add(element)\n }\n }\n\n fun size(): Int {\n return size\n }\n\n val isEmpty: Boolean\n get() = size == 0\n\n operator fun contains( /*C*/\n /*C*/element: Int\n ): Boolean {\n var x = root\n while (x != NULL) {\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return true\n }\n }\n return false\n }\n\n operator fun iterator() = _Ez_Int_TreeSetIterator() as IntIterator\n\n /*C*/ fun toArray(): IntArray {\n /*C*/\n val result = IntArray(size)\n var i = 0\n var x = firstNode()\n while (x != NULL) {\n result[i] = key[x]\n x = successorNode(x)\n i++\n }\n return result\n }\n\n fun add( /*C*/\n /*C*/element: Int\n ): Boolean {\n var y = NULL\n var x = root\n while (x != NULL) {\n y = x\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return false\n }\n }\n if (size == color.size - 1) {\n enlarge()\n }\n val z = ++size\n key[z] = element\n p[z] = y\n if (y == NULL) {\n root = z\n } else {\n if (element < key[y]) {\n left[y] = z\n } else {\n right[y] = z\n }\n }\n left[z] = NULL\n right[z] = NULL\n color[z] = RED\n fixAfterAdd(z)\n return true\n }\n\n fun remove( /*C*/\n /*C*/element: Int\n ): Boolean {\n var z = root\n while (z != NULL) {\n z = if (element < key[z]) {\n left[z]\n } else if (element > key[z]) {\n right[z]\n } else {\n removeNode(z)\n return true\n }\n }\n return false\n }\n\n private fun removeNode(z: Int) {\n val y =\n if (left[z] == NULL || right[z] == NULL) z else successorNode(\n z\n )\n val x = if (left[y] != NULL) left[y] else right[y]\n p[x] = p[y]\n if (p[y] == NULL) {\n root = x\n } else {\n if (y == left[p[y]]) {\n left[p[y]] = x\n } else {\n right[p[y]] = x\n }\n }\n if (y != z) {\n key[z] = key[y]\n }\n if (color[y] == BLACK) {\n fixAfterRemove(x)\n }\n // Swap with last\n if (y != size) {\n // copy fields\n key[y] = key[size]\n left[y] = left[size]\n right[y] = right[size]\n p[y] = p[size]\n color[y] = color[size]\n // fix the children's parents\n p[left[size]] = y\n p[right[size]] = y\n // fix one of the parent's children\n if (left[p[size]] == size) {\n left[p[size]] = y\n } else {\n right[p[size]] = y\n }\n // fix root\n if (root == size) {\n root = y\n }\n }\n size--\n }\n\n private fun successorNode(x: Int): Int {\n var x = x\n return if (right[x] != NULL) {\n x = right[x]\n while (left[x] != NULL) {\n x = left[x]\n }\n x\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n y\n }\n }\n\n private fun fixAfterAdd(z: Int) {\n var z = z\n while (color[p[z]] == RED) {\n if (p[z] == left[p[p[z]]]) {\n val y = right[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == right[p[z]]) {\n z = p[z]\n rotateLeft(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateRight(p[p[z]])\n }\n } else {\n val y = left[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == left[p[z]]) {\n z = p[z]\n rotateRight(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateLeft(p[p[z]])\n }\n }\n }\n color[root] = BLACK\n }\n\n private fun fixAfterRemove(x: Int) {\n var x = x\n while (x != root && color[x] == BLACK) {\n if (x == left[p[x]]) {\n var w = right[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateLeft(p[x])\n w = right[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[right[w]] == BLACK) {\n color[left[w]] = BLACK\n color[w] = RED\n rotateRight(w)\n w = right[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[right[w]] = BLACK\n rotateLeft(p[x])\n x = root\n }\n } else {\n var w = left[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateRight(p[x])\n w = left[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[left[w]] == BLACK) {\n color[right[w]] = BLACK\n color[w] = RED\n rotateLeft(w)\n w = left[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[left[w]] = BLACK\n rotateRight(p[x])\n x = root\n }\n }\n }\n color[x] = BLACK\n }\n\n private fun rotateLeft(x: Int) {\n val y = right[x]\n right[x] = left[y]\n if (left[y] != NULL) {\n p[left[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == left[p[x]]) {\n left[p[x]] = y\n } else {\n right[p[x]] = y\n }\n }\n left[y] = x\n p[x] = y\n }\n\n private fun rotateRight(x: Int) {\n val y = left[x]\n left[x] = right[y]\n if (right[y] != NULL) {\n p[right[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == right[p[x]]) {\n right[p[x]] = y\n } else {\n left[p[x]] = y\n }\n }\n right[y] = x\n p[x] = y\n }\n\n fun clear() {\n color[NULL] = BLACK\n size = 0\n root = NULL\n }\n\n private fun enlarge() {\n val newLength =\n Math.max(color.size + 1, (color.size * ENLARGE_SCALE).toInt())\n key = Arrays.copyOf(key, newLength)\n left = Arrays.copyOf(left, newLength)\n right = Arrays.copyOf(right, newLength)\n p = Arrays.copyOf(p, newLength)\n color = Arrays.copyOf(color, newLength)\n }\n\n private fun firstNode(): Int {\n var x = root\n while (left[x] != NULL) {\n x = left[x]\n }\n return x\n }\n\n private fun lastNode(): Int {\n var x = root\n while (right[x] != NULL) {\n x = right[x]\n }\n return x\n }\n\n /*C*/ /*C*/\n val first: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ /*C*/\n val last: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ fun /*C*/removeFirst(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/removeLast(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/floor( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/ceiling( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/lower( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/higher( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n fun returnedNull(): Boolean {\n return returnedNull\n }\n\n override fun equals(o: Any?): Boolean {\n if (this === o) return true\n if (o == null || javaClass != o.javaClass) return false\n val that = o as _Ez_Int_TreeSet\n if (size != that.size) {\n return false\n }\n var x = firstNode()\n var y = that.firstNode()\n while (x != NULL) {\n if (key[x] != that.key[y]) {\n return false\n }\n x = successorNode(x)\n y = that.successorNode(y)\n }\n return true\n }\n\n override fun toString(): String {\n val sb = StringBuilder()\n sb.append('[')\n var x = firstNode()\n while (x != NULL) {\n if (sb.length > 1) {\n sb.append(\", \")\n }\n sb.append(key[x])\n x = successorNode(x)\n }\n sb.append(']')\n return sb.toString()\n }\n\n private inner class _Ez_Int_TreeSetIterator constructor() : IntIterator() {\n private var x: Int\n override fun hasNext(): Boolean {\n return x != NULL\n }\n\n /*C*/ override fun /*C*/nextInt(): Int {\n if (x == NULL) {\n throw NoSuchElementException(\"Iterator doesn't have more elements\")\n }\n val /*C*/result = key[x]\n x = successorNode(x)\n return result\n }\n\n init {\n x = firstNode()\n }\n }\n\n companion object {\n private const val DEFAULT_CAPACITY = 10\n private const val ENLARGE_SCALE = 2.0\n private const val HASHCODE_INITIAL_VALUE = -0x7ee3623b\n private const val HASHCODE_MULTIPLIER = 0x01000193\n private const val BLACK = false\n private const val RED = true\n private const val NULL = 0\n private /*C*/ val /*C*/DEFAULT_NULL_ELEMENT = IntArray(1)[0]\n }\n\n init {\n var capacity = capacity\n require(capacity >= 0) { \"Capacity must be non-negative\" }\n capacity++\n key = IntArray(capacity)\n left = IntArray(capacity)\n right = IntArray(capacity)\n p = IntArray(capacity)\n color = BooleanArray(capacity)\n color[NULL] = BLACK\n size = 0\n root = NULL\n returnedNull = false\n }\n}\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "language": "Kotlin", "metadata": {"date": 1593557622, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Kotlin/s801041587.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s801041587", "user_id": "u596111103"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.File\nimport java.io.PrintWriter\nimport java.util.Arrays\nimport java.util.NoSuchElementException\nimport java.util.TreeSet\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\n\nfun PrintWriter.solve() {\n val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n object {\n val D = readInt()\n\n val C = readIntArray(26)\n val S = Array(D) { readIntArray(26) }\n\n var v = 0L\n val last = IntArray(26)\n val L = Array(26) {\n IntTreeSet().also {\n it.add(-1)\n it.add(D)\n }\n }\n val T = IntArray(D) { random.nextInt(26) }.also { T ->\n repeat(D) { d ->\n val t = T[d]\n\n v += S[d][t]\n last[t] = d + 1\n for (i in 0 until 26) {\n v -= C[i] * (d + 1 - last[i])\n }\n\n L[t].add(d)\n }\n }\n\n fun update(d: Int, q: Int) {\n val t = T[d]\n v += S[d][q] - S[d][t]\n\n L[t].remove(d)\n var a = L[t].floor(d)\n var b = L[t].ceiling(d)\n v -= C[t] * (d - a) * (b - d)\n\n a = L[q].floor(d)\n b = L[q].ceiling(d)\n v += C[q] * (d - a) * (b - d)\n L[q].add(d)\n\n T[d] = q\n }\n\n var score = max(0, 1e6.toLong() + v)\n var best = T.copyOf()\n\n fun prob(e0: Long, e1: Long, temp: Double) = if (e1 < e0) 1.0\n else exp(-(e1 - e0).toDouble() / (temp))\n\n init {\n while(true) {\n val time = System.nanoTime() - startTime\n if(time >= timeLimit) break\n val d = random.nextInt(D)\n val q = random.nextInt(26)\n val t = T[d]\n\n val e0 = -v\n update(d, q)\n\n val temp = T0 - (T0 - T1) * time / timeLimit\n if(random.nextDouble() >= prob(e0, -v, temp)) {\n update(d, t)\n }\n\n val newScore = max(0, 1e6.toLong() + v)\n if(newScore > score) {\n score = newScore\n best = T.copyOf()\n }\n }\n\n //System.err.println(\"Score: ${score}\")\n for(t in best) println(t+1)\n }\n }\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\nconst val T0 = 2e4\nconst val T1 = 6e2\nconst val timeLimit = 1.8e9.toLong()\n\ntypealias IntTreeSet = _Ez_Int_TreeSet\n\nclass _Ez_Int_TreeSet @JvmOverloads constructor(capacity: Int = DEFAULT_CAPACITY) {\n // Arrays are 1-indexed. Index 0 is a null node.\n private /*C*/ var key: IntArray\n private var left: IntArray\n private var right: IntArray\n private var p: IntArray\n private var color: BooleanArray\n private var size = 0\n private var root = 0\n private var returnedNull = false\n\n constructor( /*C*/\n srcArray: IntArray\n ) : this(srcArray.size) {\n for ( /*C*/\n /*C*/element in srcArray) {\n add(element)\n }\n }\n\n fun size(): Int {\n return size\n }\n\n val isEmpty: Boolean\n get() = size == 0\n\n operator fun contains( /*C*/\n /*C*/element: Int\n ): Boolean {\n var x = root\n while (x != NULL) {\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return true\n }\n }\n return false\n }\n\n operator fun iterator() = _Ez_Int_TreeSetIterator() as IntIterator\n\n /*C*/ fun toArray(): IntArray {\n /*C*/\n val result = IntArray(size)\n var i = 0\n var x = firstNode()\n while (x != NULL) {\n result[i] = key[x]\n x = successorNode(x)\n i++\n }\n return result\n }\n\n fun add( /*C*/\n /*C*/element: Int\n ): Boolean {\n var y = NULL\n var x = root\n while (x != NULL) {\n y = x\n x = if (element < key[x]) {\n left[x]\n } else if (element > key[x]) {\n right[x]\n } else {\n return false\n }\n }\n if (size == color.size - 1) {\n enlarge()\n }\n val z = ++size\n key[z] = element\n p[z] = y\n if (y == NULL) {\n root = z\n } else {\n if (element < key[y]) {\n left[y] = z\n } else {\n right[y] = z\n }\n }\n left[z] = NULL\n right[z] = NULL\n color[z] = RED\n fixAfterAdd(z)\n return true\n }\n\n fun remove( /*C*/\n /*C*/element: Int\n ): Boolean {\n var z = root\n while (z != NULL) {\n z = if (element < key[z]) {\n left[z]\n } else if (element > key[z]) {\n right[z]\n } else {\n removeNode(z)\n return true\n }\n }\n return false\n }\n\n private fun removeNode(z: Int) {\n val y =\n if (left[z] == NULL || right[z] == NULL) z else successorNode(\n z\n )\n val x = if (left[y] != NULL) left[y] else right[y]\n p[x] = p[y]\n if (p[y] == NULL) {\n root = x\n } else {\n if (y == left[p[y]]) {\n left[p[y]] = x\n } else {\n right[p[y]] = x\n }\n }\n if (y != z) {\n key[z] = key[y]\n }\n if (color[y] == BLACK) {\n fixAfterRemove(x)\n }\n // Swap with last\n if (y != size) {\n // copy fields\n key[y] = key[size]\n left[y] = left[size]\n right[y] = right[size]\n p[y] = p[size]\n color[y] = color[size]\n // fix the children's parents\n p[left[size]] = y\n p[right[size]] = y\n // fix one of the parent's children\n if (left[p[size]] == size) {\n left[p[size]] = y\n } else {\n right[p[size]] = y\n }\n // fix root\n if (root == size) {\n root = y\n }\n }\n size--\n }\n\n private fun successorNode(x: Int): Int {\n var x = x\n return if (right[x] != NULL) {\n x = right[x]\n while (left[x] != NULL) {\n x = left[x]\n }\n x\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n y\n }\n }\n\n private fun fixAfterAdd(z: Int) {\n var z = z\n while (color[p[z]] == RED) {\n if (p[z] == left[p[p[z]]]) {\n val y = right[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == right[p[z]]) {\n z = p[z]\n rotateLeft(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateRight(p[p[z]])\n }\n } else {\n val y = left[p[p[z]]]\n if (color[y] == RED) {\n color[p[z]] = BLACK\n color[y] = BLACK\n color[p[p[z]]] = RED\n z = p[p[z]]\n } else {\n if (z == left[p[z]]) {\n z = p[z]\n rotateRight(z)\n }\n color[p[z]] = BLACK\n color[p[p[z]]] = RED\n rotateLeft(p[p[z]])\n }\n }\n }\n color[root] = BLACK\n }\n\n private fun fixAfterRemove(x: Int) {\n var x = x\n while (x != root && color[x] == BLACK) {\n if (x == left[p[x]]) {\n var w = right[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateLeft(p[x])\n w = right[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[right[w]] == BLACK) {\n color[left[w]] = BLACK\n color[w] = RED\n rotateRight(w)\n w = right[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[right[w]] = BLACK\n rotateLeft(p[x])\n x = root\n }\n } else {\n var w = left[p[x]]\n if (color[w] == RED) {\n color[w] = BLACK\n color[p[x]] = RED\n rotateRight(p[x])\n w = left[p[x]]\n }\n if (color[left[w]] == BLACK && color[right[w]] == BLACK) {\n color[w] = RED\n x = p[x]\n } else {\n if (color[left[w]] == BLACK) {\n color[right[w]] = BLACK\n color[w] = RED\n rotateLeft(w)\n w = left[p[x]]\n }\n color[w] = color[p[x]]\n color[p[x]] = BLACK\n color[left[w]] = BLACK\n rotateRight(p[x])\n x = root\n }\n }\n }\n color[x] = BLACK\n }\n\n private fun rotateLeft(x: Int) {\n val y = right[x]\n right[x] = left[y]\n if (left[y] != NULL) {\n p[left[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == left[p[x]]) {\n left[p[x]] = y\n } else {\n right[p[x]] = y\n }\n }\n left[y] = x\n p[x] = y\n }\n\n private fun rotateRight(x: Int) {\n val y = left[x]\n left[x] = right[y]\n if (right[y] != NULL) {\n p[right[y]] = x\n }\n p[y] = p[x]\n if (p[x] == NULL) {\n root = y\n } else {\n if (x == right[p[x]]) {\n right[p[x]] = y\n } else {\n left[p[x]] = y\n }\n }\n right[y] = x\n p[x] = y\n }\n\n fun clear() {\n color[NULL] = BLACK\n size = 0\n root = NULL\n }\n\n private fun enlarge() {\n val newLength =\n Math.max(color.size + 1, (color.size * ENLARGE_SCALE).toInt())\n key = Arrays.copyOf(key, newLength)\n left = Arrays.copyOf(left, newLength)\n right = Arrays.copyOf(right, newLength)\n p = Arrays.copyOf(p, newLength)\n color = Arrays.copyOf(color, newLength)\n }\n\n private fun firstNode(): Int {\n var x = root\n while (left[x] != NULL) {\n x = left[x]\n }\n return x\n }\n\n private fun lastNode(): Int {\n var x = root\n while (right[x] != NULL) {\n x = right[x]\n }\n return x\n }\n\n /*C*/ /*C*/\n val first: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ /*C*/\n val last: Int\n get() {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n return key[x]\n }\n\n /*C*/ fun /*C*/removeFirst(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = firstNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/removeLast(): Int {\n if (root == NULL) {\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n val x = lastNode()\n returnedNull = false\n val /*C*/removedElement = key[x]\n removeNode(x)\n return removedElement\n }\n\n /*C*/ fun /*C*/floor( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/ceiling( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n } else {\n returnedNull = false\n return key[x]\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/lower( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element > key[x]) {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n var y = p[x]\n while (y != NULL && x == left[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n /*C*/ fun /*C*/higher( /*C*/\n /*C*/element: Int\n ): Int {\n var x = root\n while (x != NULL) {\n if (element < key[x]) {\n if (left[x] != NULL) {\n x = left[x]\n } else {\n returnedNull = false\n return key[x]\n }\n } else {\n if (right[x] != NULL) {\n x = right[x]\n } else {\n var y = p[x]\n while (y != NULL && x == right[y]) {\n x = y\n y = p[y]\n }\n return if (y == NULL) {\n returnedNull = true\n DEFAULT_NULL_ELEMENT\n } else {\n returnedNull = false\n key[y]\n }\n }\n }\n }\n returnedNull = true\n return DEFAULT_NULL_ELEMENT\n }\n\n fun returnedNull(): Boolean {\n return returnedNull\n }\n\n override fun equals(o: Any?): Boolean {\n if (this === o) return true\n if (o == null || javaClass != o.javaClass) return false\n val that = o as _Ez_Int_TreeSet\n if (size != that.size) {\n return false\n }\n var x = firstNode()\n var y = that.firstNode()\n while (x != NULL) {\n if (key[x] != that.key[y]) {\n return false\n }\n x = successorNode(x)\n y = that.successorNode(y)\n }\n return true\n }\n\n override fun toString(): String {\n val sb = StringBuilder()\n sb.append('[')\n var x = firstNode()\n while (x != NULL) {\n if (sb.length > 1) {\n sb.append(\", \")\n }\n sb.append(key[x])\n x = successorNode(x)\n }\n sb.append(']')\n return sb.toString()\n }\n\n private inner class _Ez_Int_TreeSetIterator constructor() : IntIterator() {\n private var x: Int\n override fun hasNext(): Boolean {\n return x != NULL\n }\n\n /*C*/ override fun /*C*/nextInt(): Int {\n if (x == NULL) {\n throw NoSuchElementException(\"Iterator doesn't have more elements\")\n }\n val /*C*/result = key[x]\n x = successorNode(x)\n return result\n }\n\n init {\n x = firstNode()\n }\n }\n\n companion object {\n private const val DEFAULT_CAPACITY = 10\n private const val ENLARGE_SCALE = 2.0\n private const val HASHCODE_INITIAL_VALUE = -0x7ee3623b\n private const val HASHCODE_MULTIPLIER = 0x01000193\n private const val BLACK = false\n private const val RED = true\n private const val NULL = 0\n private /*C*/ val /*C*/DEFAULT_NULL_ELEMENT = IntArray(1)[0]\n }\n\n init {\n var capacity = capacity\n require(capacity >= 0) { \"Capacity must be non-negative\" }\n capacity++\n key = IntArray(capacity)\n left = IntArray(capacity)\n right = IntArray(capacity)\n p = IntArray(capacity)\n color = BooleanArray(capacity)\n color[NULL] = BLACK\n size = 0\n root = NULL\n returnedNull = false\n }\n}\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 23695, "cpu_time_ms": 1905, "memory_kb": 52108}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s783755441", "group_id": "codeNet:p02618", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val d = sc.nextInt()\n val c = (0 until 26).map { sc.next().toInt() }\n val s = (0 until d).map {\n (0 until 26).map { sc.next().toInt() }\n }\n println(problemintroduction_to_heuristics_contest(d, c, s))\n}\n\nfun problemintroduction_to_heuristics_contest(\n D: Int,\n c: List,\n s: List>\n): String {\n val last = LongArray(26) { 0 }\n val satisfactions = LongArray(26) { 0 }\n val ans = IntArray(D) { 1 }\n for (d in 0 until D) {\n var max = -Long.MAX_VALUE\n var maxIndex = 0\n for (i in 0 until 26) {\n val tmp = max\n max = Math.max(max, c[i] * ((d + 1) - last[i]))\n if (tmp != max) maxIndex = i\n }\n val selected = maxIndex\n ans[d] = selected + 1\n satisfactions[selected] += s[d][selected].toLong()\n last[selected] = d + 1L\n for (j in 0 until 26) {\n satisfactions[j] -= c[j] * ((d + 1) - last[j])\n }\n }\n// debugLog(satisfactions.sum())\n return ans.joinToString(\"\\n\")\n}", "language": "Kotlin", "metadata": {"date": 1593398755, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Kotlin/s783755441.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s783755441", "user_id": "u073232808"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val d = sc.nextInt()\n val c = (0 until 26).map { sc.next().toInt() }\n val s = (0 until d).map {\n (0 until 26).map { sc.next().toInt() }\n }\n println(problemintroduction_to_heuristics_contest(d, c, s))\n}\n\nfun problemintroduction_to_heuristics_contest(\n D: Int,\n c: List,\n s: List>\n): String {\n val last = LongArray(26) { 0 }\n val satisfactions = LongArray(26) { 0 }\n val ans = IntArray(D) { 1 }\n for (d in 0 until D) {\n var max = -Long.MAX_VALUE\n var maxIndex = 0\n for (i in 0 until 26) {\n val tmp = max\n max = Math.max(max, c[i] * ((d + 1) - last[i]))\n if (tmp != max) maxIndex = i\n }\n val selected = maxIndex\n ans[d] = selected + 1\n satisfactions[selected] += s[d][selected].toLong()\n last[selected] = d + 1L\n for (j in 0 until 26) {\n satisfactions[j] -= c[j] * ((d + 1) - last[j])\n }\n }\n// debugLog(satisfactions.sum())\n return ans.joinToString(\"\\n\")\n}", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1121, "cpu_time_ms": 249, "memory_kb": 47520}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s500833088", "group_id": "codeNet:p02618", "input_text": "import kotlin.random.Random\n\nfun main() {\n val d = readLine()!!.toInt()\n val c = readLine()!!.split(\" \").map { it.toInt() }\n val list = (0 until d).map { readLine()!!.split(\" \").map { it.toInt() } }\n\n fun score(examList: IntArray): Int {\n val executeDate = IntArray(26) { 0 }\n var last = 0\n return (1..d).map { date ->\n val exam = examList[date - 1]\n executeDate[exam] = date\n\n last += list[date - 1][exam] - (0 until 26).map { i ->\n c[i] * (date - executeDate[i])\n }.sum()\n\n last\n }.sum()\n }\n\n var result = IntArray(26) { it }\n var score = score(result)\n repeat(100) {\n val copy = result.clone()\n copy[Random.nextInt(25)] = Random.nextInt(25)\n val newScore = score(copy)\n if (newScore > score) {\n result = copy\n score = newScore\n }\n }\n\n result.forEach {\n println(it + 1)\n }\n}", "language": "Kotlin", "metadata": {"date": 1593396555, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Kotlin/s500833088.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s500833088", "user_id": "u897579945"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "import kotlin.random.Random\n\nfun main() {\n val d = readLine()!!.toInt()\n val c = readLine()!!.split(\" \").map { it.toInt() }\n val list = (0 until d).map { readLine()!!.split(\" \").map { it.toInt() } }\n\n fun score(examList: IntArray): Int {\n val executeDate = IntArray(26) { 0 }\n var last = 0\n return (1..d).map { date ->\n val exam = examList[date - 1]\n executeDate[exam] = date\n\n last += list[date - 1][exam] - (0 until 26).map { i ->\n c[i] * (date - executeDate[i])\n }.sum()\n\n last\n }.sum()\n }\n\n var result = IntArray(26) { it }\n var score = score(result)\n repeat(100) {\n val copy = result.clone()\n copy[Random.nextInt(25)] = Random.nextInt(25)\n val newScore = score(copy)\n if (newScore > score) {\n result = copy\n score = newScore\n }\n }\n\n result.forEach {\n println(it + 1)\n }\n}", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 971, "cpu_time_ms": 208, "memory_kb": 40440}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s802571902", "group_id": "codeNet:p02618", "input_text": "import java.util.*\nimport java.util.Random;\n\nfun main(args:Array){\n solve()\n}\n\nfun solve(){\n val d = readint()\n val c = readints()\n val s = Array(d){IntArray(26)}\n for(i in 0 until d){\n s[i] = readints().toIntArray()\n }\n val ans = IntArray(d)\n\n fun score() : Long{\n val t = IntArray(26)\n var sum = 0L\n for(i in 0 until d){\n sum += s[i][ans[i]]\n t[ans[i]] = i\n for(j in 0 until 26){\n sum -= c[j] * (i - t[j])\n }\n }\n return sum\n }\n\n for(i in 0 until d){\n var ma = 0\n var mai = 0\n for(j in 0 until 26){\n if(ma < s[i][j]){\n ma = s[i][j]\n mai = j\n }\n }\n ans[i] = mai\n }\n\n var ma = score()\n val rand = Random()\n\n repeat(3000){\n val k = rand.nextInt(d)\n var curma = ma\n var curmai = ans[k]\n for(i in 0 until 26){\n ans[k] = i\n val m = score()\n if(m > curma){\n curma = m\n curmai = i\n }\n }\n ans[k] = curmai\n ma = curma\n }\n\n for(i in 0 until d){\n println(ans[i] + 1)\n }\n}\n\n\n\nfun read() = readLine()!!\nfun reads() = readLine()!!.split(\" \")\nfun readint() = readLine()!!.toInt()\nfun readints() = readLine()!!.split(\" \").map{it.toInt()}\nfun readlong() = readLine()!!.toLong()\nfun readlongs() = readLine()!!.split(\" \").map{it.toLong()}\n", "language": "Kotlin", "metadata": {"date": 1593396489, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Kotlin/s802571902.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s802571902", "user_id": "u480831358"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "import java.util.*\nimport java.util.Random;\n\nfun main(args:Array){\n solve()\n}\n\nfun solve(){\n val d = readint()\n val c = readints()\n val s = Array(d){IntArray(26)}\n for(i in 0 until d){\n s[i] = readints().toIntArray()\n }\n val ans = IntArray(d)\n\n fun score() : Long{\n val t = IntArray(26)\n var sum = 0L\n for(i in 0 until d){\n sum += s[i][ans[i]]\n t[ans[i]] = i\n for(j in 0 until 26){\n sum -= c[j] * (i - t[j])\n }\n }\n return sum\n }\n\n for(i in 0 until d){\n var ma = 0\n var mai = 0\n for(j in 0 until 26){\n if(ma < s[i][j]){\n ma = s[i][j]\n mai = j\n }\n }\n ans[i] = mai\n }\n\n var ma = score()\n val rand = Random()\n\n repeat(3000){\n val k = rand.nextInt(d)\n var curma = ma\n var curmai = ans[k]\n for(i in 0 until 26){\n ans[k] = i\n val m = score()\n if(m > curma){\n curma = m\n curmai = i\n }\n }\n ans[k] = curmai\n ma = curma\n }\n\n for(i in 0 until d){\n println(ans[i] + 1)\n }\n}\n\n\n\nfun read() = readLine()!!\nfun reads() = readLine()!!.split(\" \")\nfun readint() = readLine()!!.toInt()\nfun readints() = readLine()!!.split(\" \").map{it.toInt()}\nfun readlong() = readLine()!!.toLong()\nfun readlongs() = readLine()!!.split(\" \").map{it.toLong()}\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1497, "cpu_time_ms": 1510, "memory_kb": 49040}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s678592673", "group_id": "codeNet:p02618", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val d = sc.nextInt()\n val c = (0 until 26).map { sc.next().toInt() }\n val s = (0 until d).map {\n (0 until 26).map { sc.next().toInt() }\n }\n println(problemintroduction_to_heuristics_contest(d, c, s))\n}\n\nfun problemintroduction_to_heuristics_contest(\n d: Int,\n c: List,\n s: List>\n): String {\n val list = IntArray(26) { 0 }\n val ans = IntArray(d) { 1 }\n for (i in 0 until d) {\n ans[i] = s[i].indexOf(s[i].max()) + 1\n }\n return ans.joinToString(\"\\n\")\n}", "language": "Kotlin", "metadata": {"date": 1593395252, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Kotlin/s678592673.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s678592673", "user_id": "u073232808"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val d = sc.nextInt()\n val c = (0 until 26).map { sc.next().toInt() }\n val s = (0 until d).map {\n (0 until 26).map { sc.next().toInt() }\n }\n println(problemintroduction_to_heuristics_contest(d, c, s))\n}\n\nfun problemintroduction_to_heuristics_contest(\n d: Int,\n c: List,\n s: List>\n): String {\n val list = IntArray(26) { 0 }\n val ans = IntArray(d) { 1 }\n for (i in 0 until d) {\n ans[i] = s[i].indexOf(s[i].max()) + 1\n }\n return ans.joinToString(\"\\n\")\n}", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 604, "cpu_time_ms": 266, "memory_kb": 47996}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s720598704", "group_id": "codeNet:p02618", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n lateinit var calc: (IntArray) -> Unit\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val D = sc.next().toInt()\n val c = IntArray(26) { sc.next().toInt() }\n val s = Array(D) { IntArray(26) { sc.next().toInt() } }\n// val t = IntArray(D) { sc.next().toInt() }\n// val M = sc.next().toInt()\n// val dq = Array(M) { Pair(sc.next().toInt(), sc.next().toInt()) }\n\n // calc result\n calc = { t: IntArray ->\n val d = IntArray(26)\n var ans = 0L\n for (i in 0 until D) {\n ans += s[i][t[i] - 1]\n d[t[i] - 1] = i + 1\n for (j in 0 until 26) {\n ans -= c[j] * (i + 1 - d[j])\n }\n pw.println(ans)\n }\n }\n\n val ans = (0 until D).map { it % 26 + 1 }.toIntArray()\n pw.println(ans.joinToString(\"\\n\"))\n\n //calc(ans)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1593394507, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Kotlin/s720598704.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s720598704", "user_id": "u297767059"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n lateinit var calc: (IntArray) -> Unit\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val D = sc.next().toInt()\n val c = IntArray(26) { sc.next().toInt() }\n val s = Array(D) { IntArray(26) { sc.next().toInt() } }\n// val t = IntArray(D) { sc.next().toInt() }\n// val M = sc.next().toInt()\n// val dq = Array(M) { Pair(sc.next().toInt(), sc.next().toInt()) }\n\n // calc result\n calc = { t: IntArray ->\n val d = IntArray(26)\n var ans = 0L\n for (i in 0 until D) {\n ans += s[i][t[i] - 1]\n d[t[i] - 1] = i + 1\n for (j in 0 until 26) {\n ans -= c[j] * (i + 1 - d[j])\n }\n pw.println(ans)\n }\n }\n\n val ans = (0 until D).map { it % 26 + 1 }.toIntArray()\n pw.println(ans.joinToString(\"\\n\"))\n\n //calc(ans)\n }\n}\n", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1107, "cpu_time_ms": 259, "memory_kb": 47124}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s316251577", "group_id": "codeNet:p02618", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val d = sc.nextInt()\n val c = Array(26) { sc.nextInt() }\n val s = Array(d) { Array(26) { sc.nextInt() } }\n val last = Array(26) { -1 }\n var score = 0L\n for (i in 0 until d) {\n val arr = Array(26) { 0 }\n for (t in 0 until 26) {\n arr[t] += s[i][t]\n for (j in 0 until 26) {\n if (j == t) continue\n arr[t] -= c[j] * (i - last[j])\n }\n }\n val max = arr.max()!!\n if (d % 50 == 0) {\n val rnd = Random()\n val r = rnd.nextInt(26)\n arr[r] = max\n }\n for (t in 0 until 26) {\n if (arr[t] == max) {\n println(t + 1)\n last[t] = i\n break\n }\n }\n }\n}\n\nfun main() {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}", "language": "Kotlin", "metadata": {"date": 1593393851, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02618.html", "problem_id": "p02618", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02618/input.txt", "sample_output_relpath": "derived/input_output/data/p02618/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02618/Kotlin/s316251577.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s316251577", "user_id": "u190507186"}, "prompt_components": {"gold_output": "1\n17\n13\n14\n13\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val d = sc.nextInt()\n val c = Array(26) { sc.nextInt() }\n val s = Array(d) { Array(26) { sc.nextInt() } }\n val last = Array(26) { -1 }\n var score = 0L\n for (i in 0 until d) {\n val arr = Array(26) { 0 }\n for (t in 0 until 26) {\n arr[t] += s[i][t]\n for (j in 0 until 26) {\n if (j == t) continue\n arr[t] -= c[j] * (i - last[j])\n }\n }\n val max = arr.max()!!\n if (d % 50 == 0) {\n val rnd = Random()\n val r = rnd.nextInt(26)\n arr[r] = max\n }\n for (t in 0 until 26) {\n if (arr[t] == max) {\n println(t + 1)\n last[t] = i\n break\n }\n }\n }\n}\n\nfun main() {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}", "problem_context": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "sample_input": "5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n"}, "reference_outputs": ["1\n17\n13\n14\n13\n"], "source_document_id": "p02618", "source_text": "Problem Statement\n\nAtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for D days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.\n\nThe satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.\n\nHolding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type i on day d will increase the satisfaction by s_{d,i}.\n\nIf a particular type of contest is not held for a while, the satisfaction decreases. Each contest type i has an integer c_i, and at the end of each day d=1,2,...,D, the satisfaction decreases as follows. Let \\mathrm{last}(d,i) be the last day before day d (including d) on which a contest of type i was held. If contests of type i have never been held yet, we define \\mathrm{last}(d,i)=0. At the end of day d, the satisfaction decreases by \\sum _{i=1}^{26}c_i \\times (d-\\mathrm{last}(d,i)).\n\nPlease schedule contests on behalf of AtCoder.\nIf the satisfaction at the end of day D is S, you will get a score of \\max(10^6 + S, 0).\nThere are 50 test cases, and the score of a submission is the total scores for each test case.\nYou can make submissions multiple times, and the highest score among your submissions will be your score.\n\nConstraints\n\nD = 365\n\nEach c_i is an integer satisfying 0\\leq c_i \\leq 100.\n\nEach s_{d,i} is an integer satisfying 0\\leq s_{d,i} \\leq 20000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\nc_1 c_2 \\cdots c_{26}\ns_{1,1} s_{1,2} \\cdots s_{1,26}\n\\vdots\ns_{D,1} s_{D,2} \\cdots s_{D,26}\n\nOutput\n\nLet t_d (1\\leq t_d \\leq 26) be the type of the contest that will be held at day d.\nPrint D integers t_d to Standard Output in the following format:\n\nt_1\nt_2\n\\vdots\nt_D\n\nAny output that does not follow the above format may result in 0 pointsWA for that test case.\n\nInput Generation\n\nEach integer c_i and s_{d,i} is generated independently and uniformly at random from the integers in the range described in the problem statement.\n\nSample Input 1\n\n5\n86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82\n19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424\n6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570\n6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256\n8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452\n19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192\n\nSample Output 1\n\n1\n17\n13\n14\n13\n\nNote that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.\n\nInput generator, score calculator, and visualizer\n\nBeginner's Guide\n\nIf you don't know what to do, proceed to problem B or C.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1525, "cpu_time_ms": 193, "memory_kb": 45040}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s535653011", "group_id": "codeNet:p02623", "input_text": "import java.io.BufferedReader\nimport java.io.IOException\nimport java.io.InputStreamReader\nimport java.util.*\nimport kotlin.collections.*\nimport kotlin.math.*\nfun main(){\n var fs = CodeForces.FastReader()\n var n = fs.nextInt()\n var m = fs.nextInt()\n var k = fs.nextLong()\n var a = fs.readLongArray(n)\n var b = fs.readLongArray(m)\n var sumsA = LongArray(n+1)\n for(i in 1 until sumsA.size) sumsA[i] += sumsA[i-1] + a[i-1]\n var best = 0\n for (i in 0 until sumsA.size) {\n if(k-sumsA[i] < 0) break;\n var ans = i\n var sumj:Long = 0\n for (j in 0 until b.size) {\n if(k-sumsA[i]-sumj-b[j] < 0) break;\n else{\n sumj += b[j]\n ans++\n }\n }\n best = max(best,ans)\n }\n println(best)\n}\n\nclass CodeForces {\n internal class FastReader {\n private var br: BufferedReader = BufferedReader(InputStreamReader(System.`in`))\n private var st: StringTokenizer? = null\n\n operator fun next(): String {\n while (st == null || !st!!.hasMoreElements()) {\n try {\n st = StringTokenizer(br.readLine())\n } catch (e: IOException) {\n e.printStackTrace()\n }\n\n }\n return st!!.nextToken()\n }\n\n fun nextInt(): Int {\n return Integer.parseInt(next())\n }\n\n fun nextLong(): Long {\n return java.lang.Long.parseLong(next())\n }\n\n fun nextDouble(): Double {\n return java.lang.Double.parseDouble(next())\n }\n\n fun nextLine(): String {\n var str = \"\"\n try {\n str = br.readLine()\n } catch (e: IOException) {\n e.printStackTrace()\n }\n return str\n }\n\n fun readIntArray(n: Int): IntArray {\n val a = IntArray(n)\n for (i in 0 until n) a[i] = nextInt()\n return a\n }\n fun readLongArray(n: Int): LongArray {\n val a = LongArray(n)\n for (i in 0 until n) a[i] = nextLong()\n return a\n }\n\n fun readDoubleArray(n: Int): DoubleArray {\n val a = DoubleArray(n)\n for (i in 0 until n) a[i] = nextDouble()\n return a\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1599186308, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s535653011.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s535653011", "user_id": "u843609965"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.IOException\nimport java.io.InputStreamReader\nimport java.util.*\nimport kotlin.collections.*\nimport kotlin.math.*\nfun main(){\n var fs = CodeForces.FastReader()\n var n = fs.nextInt()\n var m = fs.nextInt()\n var k = fs.nextLong()\n var a = fs.readLongArray(n)\n var b = fs.readLongArray(m)\n var sumsA = LongArray(n+1)\n for(i in 1 until sumsA.size) sumsA[i] += sumsA[i-1] + a[i-1]\n var best = 0\n for (i in 0 until sumsA.size) {\n if(k-sumsA[i] < 0) break;\n var ans = i\n var sumj:Long = 0\n for (j in 0 until b.size) {\n if(k-sumsA[i]-sumj-b[j] < 0) break;\n else{\n sumj += b[j]\n ans++\n }\n }\n best = max(best,ans)\n }\n println(best)\n}\n\nclass CodeForces {\n internal class FastReader {\n private var br: BufferedReader = BufferedReader(InputStreamReader(System.`in`))\n private var st: StringTokenizer? = null\n\n operator fun next(): String {\n while (st == null || !st!!.hasMoreElements()) {\n try {\n st = StringTokenizer(br.readLine())\n } catch (e: IOException) {\n e.printStackTrace()\n }\n\n }\n return st!!.nextToken()\n }\n\n fun nextInt(): Int {\n return Integer.parseInt(next())\n }\n\n fun nextLong(): Long {\n return java.lang.Long.parseLong(next())\n }\n\n fun nextDouble(): Double {\n return java.lang.Double.parseDouble(next())\n }\n\n fun nextLine(): String {\n var str = \"\"\n try {\n str = br.readLine()\n } catch (e: IOException) {\n e.printStackTrace()\n }\n return str\n }\n\n fun readIntArray(n: Int): IntArray {\n val a = IntArray(n)\n for (i in 0 until n) a[i] = nextInt()\n return a\n }\n fun readLongArray(n: Int): LongArray {\n val a = LongArray(n)\n for (i in 0 until n) a[i] = nextLong()\n return a\n }\n\n fun readDoubleArray(n: Int): DoubleArray {\n val a = DoubleArray(n)\n for (i in 0 until n) a[i] = nextDouble()\n return a\n }\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2350, "cpu_time_ms": 2208, "memory_kb": 64760}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s824991338", "group_id": "codeNet:p02623", "input_text": "import java.io.BufferedReader\nimport java.io.IOException\nimport java.io.InputStreamReader\nimport java.util.*\nimport kotlin.collections.*\nimport kotlin.math.*\nfun main(){\n var fs = CodeForces.FastReader()\n var n = fs.nextInt()\n var m = fs.nextInt()\n var k = fs.nextInt()\n var a = fs.readIntArray(n)\n var b = fs.readIntArray(m)\n var best = 0\n var sumi = 0\n for (i in 0 until a.size) {\n if(k-(sumi + a[i]) < 0)break\n else sumi += a[i]\n var ans = i+1\n var sumj = 0\n for (j in 0 until b.size) {\n if(k-sumi-(sumj+b[j]) < 0) break;\n else{\n sumj += b[j]\n ans++\n }\n }\n best = max(best,ans)\n }\n println(best)\n}\n\nclass CodeForces {\n internal class FastReader {\n private var br: BufferedReader = BufferedReader(InputStreamReader(System.`in`))\n private var st: StringTokenizer? = null\n\n operator fun next(): String {\n while (st == null || !st!!.hasMoreElements()) {\n try {\n st = StringTokenizer(br.readLine())\n } catch (e: IOException) {\n e.printStackTrace()\n }\n\n }\n return st!!.nextToken()\n }\n\n fun nextInt(): Int {\n return Integer.parseInt(next())\n }\n\n fun nextLong(): Long {\n return java.lang.Long.parseLong(next())\n }\n\n fun nextDouble(): Double {\n return java.lang.Double.parseDouble(next())\n }\n\n fun nextLine(): String {\n var str = \"\"\n try {\n str = br.readLine()\n } catch (e: IOException) {\n e.printStackTrace()\n }\n return str\n }\n\n fun readIntArray(n: Int): IntArray {\n val a = IntArray(n)\n for (i in 0 until n) a[i] = nextInt()\n return a\n }\n fun readLongArray(n: Int): LongArray {\n val a = LongArray(n)\n for (i in 0 until n) a[i] = nextLong()\n return a\n }\n\n fun readDoubleArray(n: Int): DoubleArray {\n val a = DoubleArray(n)\n for (i in 0 until n) a[i] = nextDouble()\n return a\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1599182102, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s824991338.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s824991338", "user_id": "u843609965"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.IOException\nimport java.io.InputStreamReader\nimport java.util.*\nimport kotlin.collections.*\nimport kotlin.math.*\nfun main(){\n var fs = CodeForces.FastReader()\n var n = fs.nextInt()\n var m = fs.nextInt()\n var k = fs.nextInt()\n var a = fs.readIntArray(n)\n var b = fs.readIntArray(m)\n var best = 0\n var sumi = 0\n for (i in 0 until a.size) {\n if(k-(sumi + a[i]) < 0)break\n else sumi += a[i]\n var ans = i+1\n var sumj = 0\n for (j in 0 until b.size) {\n if(k-sumi-(sumj+b[j]) < 0) break;\n else{\n sumj += b[j]\n ans++\n }\n }\n best = max(best,ans)\n }\n println(best)\n}\n\nclass CodeForces {\n internal class FastReader {\n private var br: BufferedReader = BufferedReader(InputStreamReader(System.`in`))\n private var st: StringTokenizer? = null\n\n operator fun next(): String {\n while (st == null || !st!!.hasMoreElements()) {\n try {\n st = StringTokenizer(br.readLine())\n } catch (e: IOException) {\n e.printStackTrace()\n }\n\n }\n return st!!.nextToken()\n }\n\n fun nextInt(): Int {\n return Integer.parseInt(next())\n }\n\n fun nextLong(): Long {\n return java.lang.Long.parseLong(next())\n }\n\n fun nextDouble(): Double {\n return java.lang.Double.parseDouble(next())\n }\n\n fun nextLine(): String {\n var str = \"\"\n try {\n str = br.readLine()\n } catch (e: IOException) {\n e.printStackTrace()\n }\n return str\n }\n\n fun readIntArray(n: Int): IntArray {\n val a = IntArray(n)\n for (i in 0 until n) a[i] = nextInt()\n return a\n }\n fun readLongArray(n: Int): LongArray {\n val a = LongArray(n)\n for (i in 0 until n) a[i] = nextLong()\n return a\n }\n\n fun readDoubleArray(n: Int): DoubleArray {\n val a = DoubleArray(n)\n for (i in 0 until n) a[i] = nextDouble()\n return a\n }\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2288, "cpu_time_ms": 2207, "memory_kb": 61772}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s505651842", "group_id": "codeNet:p02623", "input_text": "import java.io.BufferedReader\nimport java.io.IOException\nimport java.io.InputStreamReader\nimport java.util.*\nimport kotlin.collections.HashSet\nimport kotlin.math.*\nfun main(){\n var fs = CodeForces.FastReader()\n var n = fs.nextInt()\n var m = fs.nextInt()\n var k = fs.nextInt()\n var a = PriorityQueue()\n var b = PriorityQueue()\n for(i in 0 until n) a.add(fs.nextInt())\n for(i in 0 until m) b.add(fs.nextInt())\n var ans = 0 \n while ((a.isNotEmpty() && k >= a.first()) || (b.isNotEmpty() && k >= b.first())) {\n if(a.isNotEmpty() && a.first() < b.first()) k -= a.remove()\n else k -= b.remove()\n ans++\n }\n println(ans)\n}\n\nclass CodeForces {\n internal class FastReader {\n private var br: BufferedReader = BufferedReader(InputStreamReader(System.`in`))\n private var st: StringTokenizer? = null\n\n operator fun next(): String {\n while (st == null || !st!!.hasMoreElements()) {\n try {\n st = StringTokenizer(br.readLine())\n } catch (e: IOException) {\n e.printStackTrace()\n }\n\n }\n return st!!.nextToken()\n }\n\n fun nextInt(): Int {\n return Integer.parseInt(next())\n }\n\n fun nextLong(): Long {\n return java.lang.Long.parseLong(next())\n }\n\n fun nextDouble(): Double {\n return java.lang.Double.parseDouble(next())\n }\n\n fun nextLine(): String {\n var str = \"\"\n try {\n str = br.readLine()\n } catch (e: IOException) {\n e.printStackTrace()\n }\n return str\n }\n\n fun readIntArray(n: Int): IntArray {\n val a = IntArray(n)\n for (i in 0 until n) a[i] = nextInt()\n return a\n }\n fun readLongArray(n: Int): LongArray {\n val a = LongArray(n)\n for (i in 0 until n) a[i] = nextLong()\n return a\n }\n\n fun readDoubleArray(n: Int): DoubleArray {\n val a = DoubleArray(n)\n for (i in 0 until n) a[i] = nextDouble()\n return a\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1599179016, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s505651842.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s505651842", "user_id": "u843609965"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.IOException\nimport java.io.InputStreamReader\nimport java.util.*\nimport kotlin.collections.HashSet\nimport kotlin.math.*\nfun main(){\n var fs = CodeForces.FastReader()\n var n = fs.nextInt()\n var m = fs.nextInt()\n var k = fs.nextInt()\n var a = PriorityQueue()\n var b = PriorityQueue()\n for(i in 0 until n) a.add(fs.nextInt())\n for(i in 0 until m) b.add(fs.nextInt())\n var ans = 0 \n while ((a.isNotEmpty() && k >= a.first()) || (b.isNotEmpty() && k >= b.first())) {\n if(a.isNotEmpty() && a.first() < b.first()) k -= a.remove()\n else k -= b.remove()\n ans++\n }\n println(ans)\n}\n\nclass CodeForces {\n internal class FastReader {\n private var br: BufferedReader = BufferedReader(InputStreamReader(System.`in`))\n private var st: StringTokenizer? = null\n\n operator fun next(): String {\n while (st == null || !st!!.hasMoreElements()) {\n try {\n st = StringTokenizer(br.readLine())\n } catch (e: IOException) {\n e.printStackTrace()\n }\n\n }\n return st!!.nextToken()\n }\n\n fun nextInt(): Int {\n return Integer.parseInt(next())\n }\n\n fun nextLong(): Long {\n return java.lang.Long.parseLong(next())\n }\n\n fun nextDouble(): Double {\n return java.lang.Double.parseDouble(next())\n }\n\n fun nextLine(): String {\n var str = \"\"\n try {\n str = br.readLine()\n } catch (e: IOException) {\n e.printStackTrace()\n }\n return str\n }\n\n fun readIntArray(n: Int): IntArray {\n val a = IntArray(n)\n for (i in 0 until n) a[i] = nextInt()\n return a\n }\n fun readLongArray(n: Int): LongArray {\n val a = LongArray(n)\n for (i in 0 until n) a[i] = nextLong()\n return a\n }\n\n fun readDoubleArray(n: Int): DoubleArray {\n val a = DoubleArray(n)\n for (i in 0 until n) a[i] = nextDouble()\n return a\n }\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2224, "cpu_time_ms": 706, "memory_kb": 68636}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s501846709", "group_id": "codeNet:p02623", "input_text": "import kotlin.math.max\n\n//\n\nfun main() {\n abc172c()\n}\n\nfun abc172c() {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toLong() }\n val a = readLine()!!.split(\" \").map { it.toLong() }\n val b = readLine()!!.split(\" \").map { it.toLong() }\n var max_count = 0\n val times = LongArray((m + 1).toInt()) { 0L }\n val ni = n.toInt()\n val mi = m.toInt()\n var max_j = 0\n for (j in 0 until mi) {\n times[j + 1] = times[j] + b[j]\n if (times[j + 1] <= k) {\n max_count = max(max_count, j + 1)\n max_j = j + 1\n } else {\n break\n }\n }\n for (i in 1..ni) {\n for (j in max_j downTo 0) {\n times[j] += a[i - 1]\n if (times[j] <= k) {\n max_count = max(max_count, i + j)\n break\n }\n }\n }\n println(max_count)\n}\n", "language": "Kotlin", "metadata": {"date": 1593317337, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s501846709.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s501846709", "user_id": "u628907033"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import kotlin.math.max\n\n//\n\nfun main() {\n abc172c()\n}\n\nfun abc172c() {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toLong() }\n val a = readLine()!!.split(\" \").map { it.toLong() }\n val b = readLine()!!.split(\" \").map { it.toLong() }\n var max_count = 0\n val times = LongArray((m + 1).toInt()) { 0L }\n val ni = n.toInt()\n val mi = m.toInt()\n var max_j = 0\n for (j in 0 until mi) {\n times[j + 1] = times[j] + b[j]\n if (times[j + 1] <= k) {\n max_count = max(max_count, j + 1)\n max_j = j + 1\n } else {\n break\n }\n }\n for (i in 1..ni) {\n for (j in max_j downTo 0) {\n times[j] += a[i - 1]\n if (times[j] <= k) {\n max_count = max(max_count, i + j)\n break\n }\n }\n }\n println(max_count)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 861, "cpu_time_ms": 673, "memory_kb": 83424}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s934200371", "group_id": "codeNet:p02623", "input_text": "import java.lang.Exception\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val m = sc.nextInt()\n val k = sc.nextLong()\n val a = (0 until n).map { sc.next().toLong() }\n val b = (0 until m).map { sc.next().toLong() }\n println(problem172c(n, m, k, a, b))\n}\n\nfun problem172c(\n n: Int,\n m: Int,\n k: Long,\n a: List,\n b: List\n): Int {\n /**\n * 二分探索を使いkeyに一番近いkey未満のindex + 1を返す\n */\n fun lowerBound(list: List, key: Long): Int {\n var ng = -1\n var ok = list.size\n\n while (ok - ng > 1) {\n val mid = (ok + ng) / 2\n if (list[mid] >= key) ok = mid else ng = mid\n }\n return ok\n }\n\n val aS = mutableListOf()\n aS.add(0)\n for (i in 0 until n) {\n aS.add(aS[i] + a[i])\n }\n val bS = mutableListOf()\n bS.add(0)\n for (i in 0 until m) {\n bS.add(bS[i] + b[i])\n }\n var max = 0\n for (i in 0 until aS.size) {\n val aC = k - aS[i]\n if (aC < 0) break\n val se = bS.binarySearch(aC)\n val j = if (se > 0 && se < bS.size) {\n se\n } else {\n Math.abs(lowerBound(bS, aC)) - 1\n }\n try {\n if (aS[i] + bS[j] > k) continue\n max = Math.max(max, i + j)\n } catch (e: Exception) {\n\n }\n }\n return max\n}", "language": "Kotlin", "metadata": {"date": 1593315575, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s934200371.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s934200371", "user_id": "u073232808"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.lang.Exception\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val m = sc.nextInt()\n val k = sc.nextLong()\n val a = (0 until n).map { sc.next().toLong() }\n val b = (0 until m).map { sc.next().toLong() }\n println(problem172c(n, m, k, a, b))\n}\n\nfun problem172c(\n n: Int,\n m: Int,\n k: Long,\n a: List,\n b: List\n): Int {\n /**\n * 二分探索を使いkeyに一番近いkey未満のindex + 1を返す\n */\n fun lowerBound(list: List, key: Long): Int {\n var ng = -1\n var ok = list.size\n\n while (ok - ng > 1) {\n val mid = (ok + ng) / 2\n if (list[mid] >= key) ok = mid else ng = mid\n }\n return ok\n }\n\n val aS = mutableListOf()\n aS.add(0)\n for (i in 0 until n) {\n aS.add(aS[i] + a[i])\n }\n val bS = mutableListOf()\n bS.add(0)\n for (i in 0 until m) {\n bS.add(bS[i] + b[i])\n }\n var max = 0\n for (i in 0 until aS.size) {\n val aC = k - aS[i]\n if (aC < 0) break\n val se = bS.binarySearch(aC)\n val j = if (se > 0 && se < bS.size) {\n se\n } else {\n Math.abs(lowerBound(bS, aC)) - 1\n }\n try {\n if (aS[i] + bS[j] > k) continue\n max = Math.max(max, i + j)\n } catch (e: Exception) {\n\n }\n }\n return max\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1477, "cpu_time_ms": 727, "memory_kb": 84060}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s242182379", "group_id": "codeNet:p02623", "input_text": "import java.lang.Integer.max\n\nfun main() {\n val input = readLine()!!.split(\" \")\n val n = input[0].toInt()\n val m = input[1].toInt()\n val k = input[2].toLong()\n val A = readLine()!!.split(\" \").map { it.toLong() }\n val B = readLine()!!.split(\" \").map { it.toLong() }\n\n val a = mutableListOf(0)\n for (i in 0 until n) {\n a.add(a[i] + A[i])\n }\n println(a)\n\n val b = mutableListOf(0)\n for (i in 0 until m) {\n b.add(b[i] + B[i])\n }\n\n var answer = 0\n var j = m\n\n\n for (i in 0 until (n + 1)) {\n if (a[i] > k) {\n break\n }\n\n while (b[j] > k - a[i]) {\n j -= 1\n }\n\n answer = max(answer, i + j)\n\n }\n\n print(answer)\n}", "language": "Kotlin", "metadata": {"date": 1593315051, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s242182379.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s242182379", "user_id": "u542748657"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.lang.Integer.max\n\nfun main() {\n val input = readLine()!!.split(\" \")\n val n = input[0].toInt()\n val m = input[1].toInt()\n val k = input[2].toLong()\n val A = readLine()!!.split(\" \").map { it.toLong() }\n val B = readLine()!!.split(\" \").map { it.toLong() }\n\n val a = mutableListOf(0)\n for (i in 0 until n) {\n a.add(a[i] + A[i])\n }\n println(a)\n\n val b = mutableListOf(0)\n for (i in 0 until m) {\n b.add(b[i] + B[i])\n }\n\n var answer = 0\n var j = m\n\n\n for (i in 0 until (n + 1)) {\n if (a[i] > k) {\n break\n }\n\n while (b[j] > k - a[i]) {\n j -= 1\n }\n\n answer = max(answer, i + j)\n\n }\n\n print(answer)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 739, "cpu_time_ms": 859, "memory_kb": 99028}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s942951088", "group_id": "codeNet:p02623", "input_text": "import kotlin.math.max\n\n//\n\nfun main() {\n abc172c()\n}\n\nfun abc172c() {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toLong() }\n val a = readLine()!!.split(\" \").map { it.toLong() }\n val b = readLine()!!.split(\" \").map { it.toLong() }\n var max_count = 0\n // REの理由はメモリの限界を超えてるから\n val times = LongArray((m + 1).toInt()) { 0L }\n val ni = n.toInt()\n val mi = m.toInt()\n for (j in 0 until mi) {\n times[j + 1] = times[j] + b[j]\n if (times[j + 1] <= k) {\n max_count = max(max_count, j + 1)\n } else {\n break\n }\n }\n for (i in 1..ni) {\n for (j in 0 .. mi) {\n times[j] += a[i - 1]\n if (times[j] <= k) {\n max_count = max(max_count, i + j)\n } else {\n break\n }\n }\n }\n println(max_count)\n}\n", "language": "Kotlin", "metadata": {"date": 1593314598, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s942951088.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s942951088", "user_id": "u628907033"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import kotlin.math.max\n\n//\n\nfun main() {\n abc172c()\n}\n\nfun abc172c() {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toLong() }\n val a = readLine()!!.split(\" \").map { it.toLong() }\n val b = readLine()!!.split(\" \").map { it.toLong() }\n var max_count = 0\n // REの理由はメモリの限界を超えてるから\n val times = LongArray((m + 1).toInt()) { 0L }\n val ni = n.toInt()\n val mi = m.toInt()\n for (j in 0 until mi) {\n times[j + 1] = times[j] + b[j]\n if (times[j + 1] <= k) {\n max_count = max(max_count, j + 1)\n } else {\n break\n }\n }\n for (i in 1..ni) {\n for (j in 0 .. mi) {\n times[j] += a[i - 1]\n if (times[j] <= k) {\n max_count = max(max_count, i + j)\n } else {\n break\n }\n }\n }\n println(max_count)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 892, "cpu_time_ms": 2208, "memory_kb": 82264}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s083989647", "group_id": "codeNet:p02623", "input_text": "import kotlin.math.max\n\nprivate const val chunk = 10000\n\nfun main() {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toLong() }\n val a = readLine()!!.split(\" \").map { it.toLong() }.chunked(10000)\n val b = readLine()!!.split(\" \").map { it.toLong() }.chunked(10000)\n\n fun dfs(aPosition: Long, bPosition: Long, spentTime: Long): Long {\n if (spentTime > k) return aPosition + bPosition - 1\n if (spentTime == k) return aPosition + bPosition\n if (aPosition == n && bPosition == m) return n + m\n\n if (aPosition == n) {\n return dfs(aPosition, bPosition + 1L, spentTime + b[(bPosition / chunk).toInt()][(bPosition % chunk).toInt()])\n }\n if (bPosition == m) {\n return dfs(aPosition + 1L, bPosition, spentTime + a[(aPosition / chunk).toInt()][(aPosition % chunk).toInt()])\n }\n return max(\n dfs(aPosition + 1L, bPosition, spentTime + a[(aPosition / chunk).toInt()][(aPosition % chunk).toInt()]),\n dfs(aPosition, bPosition + 1L, spentTime + b[(bPosition / chunk).toInt()][(bPosition % chunk).toInt()])\n )\n }\n\n println(dfs(0, 0, 0))\n}\n", "language": "Kotlin", "metadata": {"date": 1593313235, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s083989647.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s083989647", "user_id": "u897579945"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import kotlin.math.max\n\nprivate const val chunk = 10000\n\nfun main() {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toLong() }\n val a = readLine()!!.split(\" \").map { it.toLong() }.chunked(10000)\n val b = readLine()!!.split(\" \").map { it.toLong() }.chunked(10000)\n\n fun dfs(aPosition: Long, bPosition: Long, spentTime: Long): Long {\n if (spentTime > k) return aPosition + bPosition - 1\n if (spentTime == k) return aPosition + bPosition\n if (aPosition == n && bPosition == m) return n + m\n\n if (aPosition == n) {\n return dfs(aPosition, bPosition + 1L, spentTime + b[(bPosition / chunk).toInt()][(bPosition % chunk).toInt()])\n }\n if (bPosition == m) {\n return dfs(aPosition + 1L, bPosition, spentTime + a[(aPosition / chunk).toInt()][(aPosition % chunk).toInt()])\n }\n return max(\n dfs(aPosition + 1L, bPosition, spentTime + a[(aPosition / chunk).toInt()][(aPosition % chunk).toInt()]),\n dfs(aPosition, bPosition + 1L, spentTime + b[(bPosition / chunk).toInt()][(bPosition % chunk).toInt()])\n )\n }\n\n println(dfs(0, 0, 0))\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1149, "cpu_time_ms": 699, "memory_kb": 82324}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s120893880", "group_id": "codeNet:p02623", "input_text": "import kotlin.math.max\n\n//\n\nfun main() {\n abc172c()\n}\n\nfun abc172c() {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toLong() }\n val a = readLine()!!.split(\" \").map { it.toLong() }\n val b = readLine()!!.split(\" \").map { it.toLong() }\n var max_count = 0\n val times = List((n + 1).toInt()) {LongArray((m + 1).toInt()) { 0L } }\n for (i in 0..n.toInt()) {\n if (i != 0) {\n times[i][0] = times[i - 1][0] + a[i - 1]\n }\n if (times[i][0] > k) {\n continue\n }\n for (j in 0..m.toInt()) {\n if (j != 0) {\n times[i][j] = times[i][j - 1] + b[j - 1]\n }\n if (times[i][j] <= k) {\n max_count = max(max_count, i + j)\n }\n }\n }\n println(max_count)\n}\n", "language": "Kotlin", "metadata": {"date": 1593312375, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s120893880.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s120893880", "user_id": "u628907033"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import kotlin.math.max\n\n//\n\nfun main() {\n abc172c()\n}\n\nfun abc172c() {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toLong() }\n val a = readLine()!!.split(\" \").map { it.toLong() }\n val b = readLine()!!.split(\" \").map { it.toLong() }\n var max_count = 0\n val times = List((n + 1).toInt()) {LongArray((m + 1).toInt()) { 0L } }\n for (i in 0..n.toInt()) {\n if (i != 0) {\n times[i][0] = times[i - 1][0] + a[i - 1]\n }\n if (times[i][0] > k) {\n continue\n }\n for (j in 0..m.toInt()) {\n if (j != 0) {\n times[i][j] = times[i][j - 1] + b[j - 1]\n }\n if (times[i][j] <= k) {\n max_count = max(max_count, i + j)\n }\n }\n }\n println(max_count)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 796, "cpu_time_ms": 1705, "memory_kb": 973416}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s817491434", "group_id": "codeNet:p02623", "input_text": "import java.util.*\nimport kotlin.math.max\n\nfun main() {\n val scanner = Scanner(System.`in`)\n val (n, m, k) = scanner.nextLine().split(\" \").map { it.toInt() }\n\n val a = scanner.nextLine().split(\" \").map { it.toInt() }.toIntArray()\n val b = scanner.nextLine().split(\" \").map { it.toInt() }.toIntArray()\n\n println(maxBooks(a, b, k.toLong()))\n}\n\n\nfun maxBooks(a: IntArray, b: IntArray, k: Long): Int {\n val n = a.size\n val m = b.size\n\n val sumA = LongArray(a.size)\n var currSum = 0L\n for (i in a.indices) {\n currSum += a[i]\n sumA[i] = currSum\n }\n\n val sumB = LongArray(b.size)\n currSum = 0L\n for (i in b.indices) {\n currSum += b[i]\n sumB[i] = currSum\n }\n\n var maxBooks = 0\n\n if (sumA[0] > k) {\n val searchIndex = sumB.binarySearch(k)\n val sumBIndex = if (searchIndex >= 0) {\n if (sumB[searchIndex] == k) searchIndex\n else searchIndex - 1\n } else {\n -sumB.binarySearch(k)-2\n }\n\n if (sumBIndex >= 0) maxBooks = sumBIndex + 1\n } else {\n for (i in sumA.indices) {\n val curr = sumA[i]\n val searchIndex = sumB.binarySearch(k - curr)\n\n val sumBIndex = if (searchIndex >= 0) {\n if (sumB[searchIndex] == k - curr) searchIndex\n else searchIndex - 1\n } else {\n -sumB.binarySearch(k - curr) - 2\n }\n\n if (sumBIndex >= 0 && curr + sumB[sumBIndex] <= k) {\n maxBooks = max(maxBooks, i + sumBIndex + 2)\n } else if (sumBIndex < 0 && curr <= k) {\n maxBooks = max(maxBooks, i + 1)\n }\n }\n }\n\n return maxBooks\n}", "language": "Kotlin", "metadata": {"date": 1593311974, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s817491434.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s817491434", "user_id": "u660467600"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\nimport kotlin.math.max\n\nfun main() {\n val scanner = Scanner(System.`in`)\n val (n, m, k) = scanner.nextLine().split(\" \").map { it.toInt() }\n\n val a = scanner.nextLine().split(\" \").map { it.toInt() }.toIntArray()\n val b = scanner.nextLine().split(\" \").map { it.toInt() }.toIntArray()\n\n println(maxBooks(a, b, k.toLong()))\n}\n\n\nfun maxBooks(a: IntArray, b: IntArray, k: Long): Int {\n val n = a.size\n val m = b.size\n\n val sumA = LongArray(a.size)\n var currSum = 0L\n for (i in a.indices) {\n currSum += a[i]\n sumA[i] = currSum\n }\n\n val sumB = LongArray(b.size)\n currSum = 0L\n for (i in b.indices) {\n currSum += b[i]\n sumB[i] = currSum\n }\n\n var maxBooks = 0\n\n if (sumA[0] > k) {\n val searchIndex = sumB.binarySearch(k)\n val sumBIndex = if (searchIndex >= 0) {\n if (sumB[searchIndex] == k) searchIndex\n else searchIndex - 1\n } else {\n -sumB.binarySearch(k)-2\n }\n\n if (sumBIndex >= 0) maxBooks = sumBIndex + 1\n } else {\n for (i in sumA.indices) {\n val curr = sumA[i]\n val searchIndex = sumB.binarySearch(k - curr)\n\n val sumBIndex = if (searchIndex >= 0) {\n if (sumB[searchIndex] == k - curr) searchIndex\n else searchIndex - 1\n } else {\n -sumB.binarySearch(k - curr) - 2\n }\n\n if (sumBIndex >= 0 && curr + sumB[sumBIndex] <= k) {\n maxBooks = max(maxBooks, i + sumBIndex + 2)\n } else if (sumBIndex < 0 && curr <= k) {\n maxBooks = max(maxBooks, i + 1)\n }\n }\n }\n\n return maxBooks\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1718, "cpu_time_ms": 760, "memory_kb": 96608}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s449493445", "group_id": "codeNet:p02623", "input_text": "import java.util.*\nimport kotlin.math.max\n\nfun main() {\n val scanner = Scanner(System.`in`)\n val (n, m, k) = scanner.nextLine().split(\" \").map { it.toInt() }\n\n val a = scanner.nextLine().split(\" \").map { it.toInt() }.toIntArray()\n val b = scanner.nextLine().split(\" \").map { it.toInt() }.toIntArray()\n\n println(maxBooks(a, b, k.toLong()))\n}\n\n\nfun maxBooks(a: IntArray, b: IntArray, k: Long): Int {\n val n = a.size\n val m = b.size\n\n val sumA = LongArray(a.size)\n var currSum = 0L\n for (i in a.indices) {\n currSum += a[i]\n sumA[i] = currSum\n }\n\n val sumB = LongArray(b.size)\n currSum = 0L\n for (i in b.indices) {\n currSum += b[i]\n sumB[i] = currSum\n }\n\n var maxBooks = 0\n\n if (sumA[0] > k) {\n val searchIndex = sumB.binarySearch(k)\n val sumBIndex = if (searchIndex >= 0) {\n if (sumB[searchIndex] == k) searchIndex\n else searchIndex - 1\n } else {\n -sumB.binarySearch(k)-2\n }\n\n if (sumBIndex >= 0) maxBooks = sumBIndex + 1\n } else {\n for (i in sumA.indices) {\n val curr = sumA[i]\n val searchIndex = sumB.binarySearch(k - curr)\n\n val sumBIndex = if (searchIndex >= 0) {\n if (sumB[searchIndex] == k - curr) searchIndex\n else searchIndex - 1\n } else {\n -sumB.binarySearch(k - curr) - 2\n }\n\n if (sumBIndex >= 0 && curr + sumB[sumBIndex] <= k) {\n maxBooks = max(maxBooks, i + sumBIndex + 2)\n }\n }\n }\n\n return maxBooks\n}", "language": "Kotlin", "metadata": {"date": 1593311744, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s449493445.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s449493445", "user_id": "u660467600"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\nimport kotlin.math.max\n\nfun main() {\n val scanner = Scanner(System.`in`)\n val (n, m, k) = scanner.nextLine().split(\" \").map { it.toInt() }\n\n val a = scanner.nextLine().split(\" \").map { it.toInt() }.toIntArray()\n val b = scanner.nextLine().split(\" \").map { it.toInt() }.toIntArray()\n\n println(maxBooks(a, b, k.toLong()))\n}\n\n\nfun maxBooks(a: IntArray, b: IntArray, k: Long): Int {\n val n = a.size\n val m = b.size\n\n val sumA = LongArray(a.size)\n var currSum = 0L\n for (i in a.indices) {\n currSum += a[i]\n sumA[i] = currSum\n }\n\n val sumB = LongArray(b.size)\n currSum = 0L\n for (i in b.indices) {\n currSum += b[i]\n sumB[i] = currSum\n }\n\n var maxBooks = 0\n\n if (sumA[0] > k) {\n val searchIndex = sumB.binarySearch(k)\n val sumBIndex = if (searchIndex >= 0) {\n if (sumB[searchIndex] == k) searchIndex\n else searchIndex - 1\n } else {\n -sumB.binarySearch(k)-2\n }\n\n if (sumBIndex >= 0) maxBooks = sumBIndex + 1\n } else {\n for (i in sumA.indices) {\n val curr = sumA[i]\n val searchIndex = sumB.binarySearch(k - curr)\n\n val sumBIndex = if (searchIndex >= 0) {\n if (sumB[searchIndex] == k - curr) searchIndex\n else searchIndex - 1\n } else {\n -sumB.binarySearch(k - curr) - 2\n }\n\n if (sumBIndex >= 0 && curr + sumB[sumBIndex] <= k) {\n maxBooks = max(maxBooks, i + sumBIndex + 2)\n }\n }\n }\n\n return maxBooks\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1617, "cpu_time_ms": 731, "memory_kb": 98128}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s693058128", "group_id": "codeNet:p02623", "input_text": "import java.util.ArrayDeque\nimport kotlin.Comparator\nimport kotlin.String\n\nfun main(args: Array) {\n val (n, m, k) = readIntList()\n val a = readLongList()\n val b = readLongList()\n\n val dist = MutableList(n.toInt() + 1) { MutableList(m.toInt() + 1) { -1L } }\n dist[0][0] = 0L\n val q = ArrayDeque>()\n q.addLast(Pair(0, 0))\n var ans = 0\n\n while (!q.isEmpty()) {\n var (ap, bp) = q.removeFirst()\n if (dist[ap][bp] <= k && ap + bp > ans) {\n ans = ap + bp\n }\n\n if (ap + 1 <= n && dist[ap + 1][bp] == -1L) {\n dist[ap + 1][bp] = dist[ap][bp] + a[ap]\n q.addLast(Pair(ap + 1, bp))\n }\n\n if (bp + 1 <= m && dist[ap][bp + 1] == -1L) {\n dist[ap][bp + 1] = dist[ap][bp] + b[bp]\n q.addLast(Pair(ap, bp + 1))\n }\n }\n\n println(ans)\n}\n\n// Tools\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)", "language": "Kotlin", "metadata": {"date": 1593311640, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s693058128.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s693058128", "user_id": "u697467902"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.ArrayDeque\nimport kotlin.Comparator\nimport kotlin.String\n\nfun main(args: Array) {\n val (n, m, k) = readIntList()\n val a = readLongList()\n val b = readLongList()\n\n val dist = MutableList(n.toInt() + 1) { MutableList(m.toInt() + 1) { -1L } }\n dist[0][0] = 0L\n val q = ArrayDeque>()\n q.addLast(Pair(0, 0))\n var ans = 0\n\n while (!q.isEmpty()) {\n var (ap, bp) = q.removeFirst()\n if (dist[ap][bp] <= k && ap + bp > ans) {\n ans = ap + bp\n }\n\n if (ap + 1 <= n && dist[ap + 1][bp] == -1L) {\n dist[ap + 1][bp] = dist[ap][bp] + a[ap]\n q.addLast(Pair(ap + 1, bp))\n }\n\n if (bp + 1 <= m && dist[ap][bp + 1] == -1L) {\n dist[ap][bp + 1] = dist[ap][bp] + b[bp]\n q.addLast(Pair(ap, bp + 1))\n }\n }\n\n println(ans)\n}\n\n// Tools\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1165, "cpu_time_ms": 2228, "memory_kb": 726972}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s883489187", "group_id": "codeNet:p02623", "input_text": "fun main(args : Array) {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toInt() }\n val aa = readLine()!!.split(\" \").map { it.toLong() }\n val bb = readLine()!!.split(\" \").map { it.toLong() }\n\n val aTime = mutableListOf()\n aTime.add(aa[0])\n for (i in 1 until aa.size) {\n aTime.add(aTime[i-1] + aa[i])\n }\n aTime.add(0, 0)\n\n val bTime = mutableListOf()\n bTime.add(bb[0])\n for (i in 1 until bb.size) {\n bTime.add(bTime[i-1] + bb[i])\n }\n bTime.add(0, 0)\n\n var cnt = 0\n var lastBIdx = m\n\n for (i in 0..n) {\n val at = aTime[i]\n if (at > k) break\n\n val rest = k - at\n var tmpCnt = i\n\n inner@for (j in lastBIdx downTo 0) {\n if (bTime[j] <= rest) {\n tmpCnt += j\n lastBIdx = j\n break@inner\n }\n }\n\n cnt = Math.max(cnt, tmpCnt)\n }\n\n println(cnt)\n}", "language": "Kotlin", "metadata": {"date": 1593311600, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s883489187.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s883489187", "user_id": "u262403099"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args : Array) {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toInt() }\n val aa = readLine()!!.split(\" \").map { it.toLong() }\n val bb = readLine()!!.split(\" \").map { it.toLong() }\n\n val aTime = mutableListOf()\n aTime.add(aa[0])\n for (i in 1 until aa.size) {\n aTime.add(aTime[i-1] + aa[i])\n }\n aTime.add(0, 0)\n\n val bTime = mutableListOf()\n bTime.add(bb[0])\n for (i in 1 until bb.size) {\n bTime.add(bTime[i-1] + bb[i])\n }\n bTime.add(0, 0)\n\n var cnt = 0\n var lastBIdx = m\n\n for (i in 0..n) {\n val at = aTime[i]\n if (at > k) break\n\n val rest = k - at\n var tmpCnt = i\n\n inner@for (j in lastBIdx downTo 0) {\n if (bTime[j] <= rest) {\n tmpCnt += j\n lastBIdx = j\n break@inner\n }\n }\n\n cnt = Math.max(cnt, tmpCnt)\n }\n\n println(cnt)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 940, "cpu_time_ms": 730, "memory_kb": 91132}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s670489308", "group_id": "codeNet:p02623", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val m = sc.nextInt()\n val k = sc.nextLong()\n val a = (0 until n).map { sc.next().toLong() }\n val b = (0 until m).map { sc.next().toLong() }\n println(problem172c(n, m, k, a, b))\n}\n\nfun problem172c(\n n: Int,\n m: Int,\n k: Long,\n a: List,\n b: List\n): Int {\n val aS = mutableListOf()\n aS.add(0)\n for (i in 0 until n) {\n if (aS[i] + a[i] > k) break\n aS.add(aS[i] + a[i])\n }\n val bS = mutableListOf()\n bS.add(0)\n for (i in 0 until m) {\n if (bS[i] + b[i] > k) break\n bS.add(bS[i] + b[i])\n }\n var max = 0\n if (bS.last() + aS.last() <= k) return n + m\n for (i in aS.size - 1 downTo 0) {\n for (j in bS.size - 1 downTo 0) {\n if (aS[i] + bS[j] > k) continue\n val tmp = max\n max = Math.max(max, i + j)\n if (tmp != max) break\n }\n }\n return max\n}", "language": "Kotlin", "metadata": {"date": 1593311458, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s670489308.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s670489308", "user_id": "u073232808"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val m = sc.nextInt()\n val k = sc.nextLong()\n val a = (0 until n).map { sc.next().toLong() }\n val b = (0 until m).map { sc.next().toLong() }\n println(problem172c(n, m, k, a, b))\n}\n\nfun problem172c(\n n: Int,\n m: Int,\n k: Long,\n a: List,\n b: List\n): Int {\n val aS = mutableListOf()\n aS.add(0)\n for (i in 0 until n) {\n if (aS[i] + a[i] > k) break\n aS.add(aS[i] + a[i])\n }\n val bS = mutableListOf()\n bS.add(0)\n for (i in 0 until m) {\n if (bS[i] + b[i] > k) break\n bS.add(bS[i] + b[i])\n }\n var max = 0\n if (bS.last() + aS.last() <= k) return n + m\n for (i in aS.size - 1 downTo 0) {\n for (j in bS.size - 1 downTo 0) {\n if (aS[i] + bS[j] > k) continue\n val tmp = max\n max = Math.max(max, i + j)\n if (tmp != max) break\n }\n }\n return max\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1021, "cpu_time_ms": 2209, "memory_kb": 73304}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s161868472", "group_id": "codeNet:p02623", "input_text": "fun main(args: Array) {\n var (n, m, k) = readLine()!!.split(' ').map { it.toLong() }\n val a = readLine()!!.split(\" \").map { it.toLong() }\n val b = readLine()!!.split(\" \").map { it.toLong() }\n\n var result = 0\n\n var nFlg = true\n var mFlg = true\n\n val array = if (a.size > b.size) {\n a\n } else {\n b\n }\n\n array.forEachIndexed { i, value ->\n if (k >= a.getOrNull(i) ?: Long.MAX_VALUE && nFlg) {\n k -= a[i]\n result++\n } else {\n nFlg = false\n }\n\n if (k >= b.getOrNull(i) ?: Long.MAX_VALUE && mFlg) {\n k -= b[i]\n result++\n } else {\n mFlg = false\n }\n }\n\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1593311207, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s161868472.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s161868472", "user_id": "u366280250"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n var (n, m, k) = readLine()!!.split(' ').map { it.toLong() }\n val a = readLine()!!.split(\" \").map { it.toLong() }\n val b = readLine()!!.split(\" \").map { it.toLong() }\n\n var result = 0\n\n var nFlg = true\n var mFlg = true\n\n val array = if (a.size > b.size) {\n a\n } else {\n b\n }\n\n array.forEachIndexed { i, value ->\n if (k >= a.getOrNull(i) ?: Long.MAX_VALUE && nFlg) {\n k -= a[i]\n result++\n } else {\n nFlg = false\n }\n\n if (k >= b.getOrNull(i) ?: Long.MAX_VALUE && mFlg) {\n k -= b[i]\n result++\n } else {\n mFlg = false\n }\n }\n\n println(result)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 729, "cpu_time_ms": 685, "memory_kb": 82144}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s797262175", "group_id": "codeNet:p02623", "input_text": "import java.util.ArrayDeque\nimport kotlin.Comparator\nimport kotlin.String\n\nfun main(args: Array) {\n val (n, m, k) = readIntList()\n val a = readLongList()\n val b = readLongList()\n\n val dist = MutableList(n.toInt() + 1) { MutableList(m.toInt() + 1) { -1L } }\n dist[0][0] = 0L\n val q = ArrayDeque>()\n q.addLast(Pair(0, 0))\n\n while (!q.isEmpty()) {\n var (ap, bp) = q.removeFirst()\n\n if (ap + 1 <= n && dist[ap+1][bp] == -1L) {\n dist[ap + 1][bp] = dist[ap][bp] + a[ap]\n q.addLast(Pair(ap + 1, bp))\n }\n\n if (bp + 1 <= m && dist[ap][bp+1] == -1L) {\n dist[ap][bp + 1] = dist[ap][bp] + b[bp]\n q.addLast(Pair(ap, bp + 1))\n }\n }\n\n var ans = 0\n for (i in 0..n.toInt()) {\n for (j in 0..m.toInt()) {\n if (dist[i][j] <= k && i + j > ans) {\n ans = i + j\n }\n }\n }\n println(ans)\n}\n\n// Tools\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\n", "language": "Kotlin", "metadata": {"date": 1593311091, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s797262175.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s797262175", "user_id": "u697467902"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.ArrayDeque\nimport kotlin.Comparator\nimport kotlin.String\n\nfun main(args: Array) {\n val (n, m, k) = readIntList()\n val a = readLongList()\n val b = readLongList()\n\n val dist = MutableList(n.toInt() + 1) { MutableList(m.toInt() + 1) { -1L } }\n dist[0][0] = 0L\n val q = ArrayDeque>()\n q.addLast(Pair(0, 0))\n\n while (!q.isEmpty()) {\n var (ap, bp) = q.removeFirst()\n\n if (ap + 1 <= n && dist[ap+1][bp] == -1L) {\n dist[ap + 1][bp] = dist[ap][bp] + a[ap]\n q.addLast(Pair(ap + 1, bp))\n }\n\n if (bp + 1 <= m && dist[ap][bp+1] == -1L) {\n dist[ap][bp + 1] = dist[ap][bp] + b[bp]\n q.addLast(Pair(ap, bp + 1))\n }\n }\n\n var ans = 0\n for (i in 0..n.toInt()) {\n for (j in 0..m.toInt()) {\n if (dist[i][j] <= k && i + j > ans) {\n ans = i + j\n }\n }\n }\n println(ans)\n}\n\n// Tools\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1248, "cpu_time_ms": 2228, "memory_kb": 705640}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s968051646", "group_id": "codeNet:p02623", "input_text": "import kotlin.math.max\n\nprivate const val chunk = 10000\n\nfun main() {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toLong() }\n val a = readLine()!!.split(\" \").map { it.toLong() }.chunked(10000)\n val b = readLine()!!.split(\" \").map { it.toLong() }.chunked(10000)\n\n fun dfs(aPosition: Long, bPosition: Long, spentTime: Long): Long {\n if (spentTime > k) return aPosition + bPosition - 1\n if (spentTime == k) return aPosition + bPosition\n if (aPosition == (n - 1L) && bPosition == (m - 1L)) return n + m\n\n if (aPosition == (n - 1L)) {\n return dfs(\n aPosition,\n bPosition + 1L,\n spentTime + b[(bPosition / chunk).toInt()][(bPosition % chunk).toInt()]\n )\n }\n if (bPosition == (m - 1L)) {\n return dfs(\n aPosition + 1L,\n bPosition,\n spentTime + a[(aPosition / chunk).toInt()][(aPosition % chunk).toInt()]\n )\n }\n return max(\n dfs(aPosition + 1L, bPosition, spentTime + a[(aPosition / chunk).toInt()][(aPosition % chunk).toInt()]),\n dfs(aPosition + 1L, bPosition, spentTime + b[(bPosition / chunk).toInt()][(bPosition % chunk).toInt()])\n )\n }\n\n println(dfs(0, 0, 0))\n}\n", "language": "Kotlin", "metadata": {"date": 1593309799, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s968051646.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s968051646", "user_id": "u897579945"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import kotlin.math.max\n\nprivate const val chunk = 10000\n\nfun main() {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toLong() }\n val a = readLine()!!.split(\" \").map { it.toLong() }.chunked(10000)\n val b = readLine()!!.split(\" \").map { it.toLong() }.chunked(10000)\n\n fun dfs(aPosition: Long, bPosition: Long, spentTime: Long): Long {\n if (spentTime > k) return aPosition + bPosition - 1\n if (spentTime == k) return aPosition + bPosition\n if (aPosition == (n - 1L) && bPosition == (m - 1L)) return n + m\n\n if (aPosition == (n - 1L)) {\n return dfs(\n aPosition,\n bPosition + 1L,\n spentTime + b[(bPosition / chunk).toInt()][(bPosition % chunk).toInt()]\n )\n }\n if (bPosition == (m - 1L)) {\n return dfs(\n aPosition + 1L,\n bPosition,\n spentTime + a[(aPosition / chunk).toInt()][(aPosition % chunk).toInt()]\n )\n }\n return max(\n dfs(aPosition + 1L, bPosition, spentTime + a[(aPosition / chunk).toInt()][(aPosition % chunk).toInt()]),\n dfs(aPosition + 1L, bPosition, spentTime + b[(bPosition / chunk).toInt()][(bPosition % chunk).toInt()])\n )\n }\n\n println(dfs(0, 0, 0))\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1301, "cpu_time_ms": 705, "memory_kb": 82120}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s725532947", "group_id": "codeNet:p02623", "input_text": "import kotlin.math.max\n\nfun main() {\n val (n, m, k) = readLine()!!.split(' ').map { it.toInt() }\n val a = readLine()!!.split(' ').map { it.toInt() }\n val b = readLine()!!.split(' ').map { it.toInt() }\n\n val sa = LongArray(n + 1)\n val sb = LongArray(m + 1)\n\n for (i in 0 until n) {\n sa[i + 1] = sa[i] + a[i]\n }\n\n for (i in 0 until m) {\n sb[i + 1] = sb[i] + b[i]\n }\n\n var ans = 0\n\n for (i in 0..n) {\n if (sa[i] > k) continue\n val j = sb.binarySearch(k - sa[i])\n if (j < 0) {\n ans = max(i - (j + 1) - 1, ans)\n } else {\n ans = max(i + j, ans)\n }\n }\n\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1593309392, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s725532947.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s725532947", "user_id": "u863309603"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import kotlin.math.max\n\nfun main() {\n val (n, m, k) = readLine()!!.split(' ').map { it.toInt() }\n val a = readLine()!!.split(' ').map { it.toInt() }\n val b = readLine()!!.split(' ').map { it.toInt() }\n\n val sa = LongArray(n + 1)\n val sb = LongArray(m + 1)\n\n for (i in 0 until n) {\n sa[i + 1] = sa[i] + a[i]\n }\n\n for (i in 0 until m) {\n sb[i + 1] = sb[i] + b[i]\n }\n\n var ans = 0\n\n for (i in 0..n) {\n if (sa[i] > k) continue\n val j = sb.binarySearch(k - sa[i])\n if (j < 0) {\n ans = max(i - (j + 1) - 1, ans)\n } else {\n ans = max(i + j, ans)\n }\n }\n\n println(ans)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 671, "cpu_time_ms": 701, "memory_kb": 81608}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s171545728", "group_id": "codeNet:p02623", "input_text": "fun main(args: Array) {\n\tval k = readLine()!!.split(\" \")[2].toLong()\n \tval a = readLine()!!.split(\" \").map{it.toLong()}\n \tval b = readLine()!!.split(\" \").map{it.toLong()}\n\t\n\tvar i = 0L\n\tvar cn = 0L\n\tvar an = 0\n\tvar bn = 0\n\tvar l = 0L\n\twhile (true) {\n\t\tif(an < a.size) {\n\t\t\tif (k >= i+a[an]) {\n\t\t\t\tcn += 1\n\t\t\ti += a[an]\n\t\t\tan+=1\n }\n }\n\t\tif (bn < b.size) {\n\t\t\tif (k >= i+b[bn]) {\n\t\t\tcn += 1\n\t\t\ti += b[bn]\n\t bn+=1\n }\n }\n\t\tl += 1\n\t\tif (l == a.size.toLong() + b.size.toLong()) break\n }\n\tprintln(cn)\n}", "language": "Kotlin", "metadata": {"date": 1593309201, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s171545728.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s171545728", "user_id": "u405972483"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n\tval k = readLine()!!.split(\" \")[2].toLong()\n \tval a = readLine()!!.split(\" \").map{it.toLong()}\n \tval b = readLine()!!.split(\" \").map{it.toLong()}\n\t\n\tvar i = 0L\n\tvar cn = 0L\n\tvar an = 0\n\tvar bn = 0\n\tvar l = 0L\n\twhile (true) {\n\t\tif(an < a.size) {\n\t\t\tif (k >= i+a[an]) {\n\t\t\t\tcn += 1\n\t\t\ti += a[an]\n\t\t\tan+=1\n }\n }\n\t\tif (bn < b.size) {\n\t\t\tif (k >= i+b[bn]) {\n\t\t\tcn += 1\n\t\t\ti += b[bn]\n\t bn+=1\n }\n }\n\t\tl += 1\n\t\tif (l == a.size.toLong() + b.size.toLong()) break\n }\n\tprintln(cn)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 551, "cpu_time_ms": 699, "memory_kb": 82148}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s719149044", "group_id": "codeNet:p02623", "input_text": "fun main(args: Array) {\n var (_, _, k) = readLine()!!.split(\" \").map { it.toLong() }\n val aList = readLine()!!.split(\" \").map { it.toLong() }.toMutableList()\n val bList = readLine()!!.split(\" \").map { it.toLong() }.toMutableList()\n\n var count = 0\n while (k > 0) {\n\n if (aList.isNotEmpty() && bList.isNotEmpty()) {\n if (k < aList.first() && k < bList.first()) {\n break\n } else {\n }\n } else {\n if (aList.isNotEmpty()) {\n if (k < aList.first()) {\n break\n }\n } else if (bList.isNotEmpty()) {\n if (k < bList.first()) {\n break\n }\n }\n }\n\n if (aList.isNotEmpty() && bList.isNotEmpty()) {\n if (aList.first() < bList.first()) {\n if (k >= aList.first()) {\n k -= aList.first()\n aList.removeAt(0)\n count++\n }\n } else {\n if (k >= bList.first()) {\n k -= bList.first()\n bList.removeAt(0)\n count++\n }\n }\n } else {\n if (aList.isNotEmpty()) {\n if (k >= aList.first()) {\n k -= aList.first()\n aList.removeAt(0)\n count++\n }\n } else if (bList.isNotEmpty()) {\n if (k >= bList.first()) {\n k -= bList.first()\n bList.removeAt(0)\n count++\n }\n }\n }\n }\n\n println(count)\n}", "language": "Kotlin", "metadata": {"date": 1593308931, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s719149044.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s719149044", "user_id": "u621958170"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n var (_, _, k) = readLine()!!.split(\" \").map { it.toLong() }\n val aList = readLine()!!.split(\" \").map { it.toLong() }.toMutableList()\n val bList = readLine()!!.split(\" \").map { it.toLong() }.toMutableList()\n\n var count = 0\n while (k > 0) {\n\n if (aList.isNotEmpty() && bList.isNotEmpty()) {\n if (k < aList.first() && k < bList.first()) {\n break\n } else {\n }\n } else {\n if (aList.isNotEmpty()) {\n if (k < aList.first()) {\n break\n }\n } else if (bList.isNotEmpty()) {\n if (k < bList.first()) {\n break\n }\n }\n }\n\n if (aList.isNotEmpty() && bList.isNotEmpty()) {\n if (aList.first() < bList.first()) {\n if (k >= aList.first()) {\n k -= aList.first()\n aList.removeAt(0)\n count++\n }\n } else {\n if (k >= bList.first()) {\n k -= bList.first()\n bList.removeAt(0)\n count++\n }\n }\n } else {\n if (aList.isNotEmpty()) {\n if (k >= aList.first()) {\n k -= aList.first()\n aList.removeAt(0)\n count++\n }\n } else if (bList.isNotEmpty()) {\n if (k >= bList.first()) {\n k -= bList.first()\n bList.removeAt(0)\n count++\n }\n }\n }\n }\n\n println(count)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1705, "cpu_time_ms": 2209, "memory_kb": 82312}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s700982450", "group_id": "codeNet:p02623", "input_text": "import kotlin.math.* \nfun main(args: Array) {\n var (N, M, K) = readLine()!!.split(\" \").map{ it.toLong() }\n var AList = readLine()!!.split(\" \").map(String::toLong)\n var BList = readLine()!!.split(\" \").map(String::toLong)\n var acount = 0\n var bcount = 0\n \n while(true) {\n if ((acount.toLong() != N) && (bcount.toLong() != M)){\n if (AList[acount] <= BList[bcount]) {\n if ((K - AList[acount]) < 0) break\n K -= AList[acount]\n acount++\n } else {\n if ((K - BList[bcount]) < 0) break\n K -= BList[bcount]\n bcount++\n }\n } else if ((acount.toLong() == N) && (bcount.toLong() == M)) {\n break\n } else if (acount.toLong() == N) {\n if ((K - BList[bcount]) < 0) break\n K -= BList[bcount]\n bcount++\n } else if (bcount.toLong() == M) {\n if ((K - AList[acount]) < 0) break\n K -= AList[acount]\n acount++\n }\n }\n \n println((acount + bcount).toInt())\n}\n", "language": "Kotlin", "metadata": {"date": 1593308618, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s700982450.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s700982450", "user_id": "u952914882"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import kotlin.math.* \nfun main(args: Array) {\n var (N, M, K) = readLine()!!.split(\" \").map{ it.toLong() }\n var AList = readLine()!!.split(\" \").map(String::toLong)\n var BList = readLine()!!.split(\" \").map(String::toLong)\n var acount = 0\n var bcount = 0\n \n while(true) {\n if ((acount.toLong() != N) && (bcount.toLong() != M)){\n if (AList[acount] <= BList[bcount]) {\n if ((K - AList[acount]) < 0) break\n K -= AList[acount]\n acount++\n } else {\n if ((K - BList[bcount]) < 0) break\n K -= BList[bcount]\n bcount++\n }\n } else if ((acount.toLong() == N) && (bcount.toLong() == M)) {\n break\n } else if (acount.toLong() == N) {\n if ((K - BList[bcount]) < 0) break\n K -= BList[bcount]\n bcount++\n } else if (bcount.toLong() == M) {\n if ((K - AList[acount]) < 0) break\n K -= AList[acount]\n acount++\n }\n }\n \n println((acount + bcount).toInt())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1104, "cpu_time_ms": 658, "memory_kb": 83416}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s772888775", "group_id": "codeNet:p02623", "input_text": "fun main(args: Array) {\n val input = readLine()!!.split(\" \")\n val N = input[0].toInt()\n val M = input[1].toInt()\n val K = input[2].toLong()\n val aList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n val bList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n\n var counter = 0\n var totalMinutes = 0L\n val loopCount = N + M\n for (i in 0 until loopCount) {\n val a = if (aList.isNotEmpty()) aList[0] else Int.MAX_VALUE\n val b = if (bList.isNotEmpty()) bList[0] else Int.MAX_VALUE\n\n totalMinutes += if (a > b) {\n bList.removeAt(0)\n } else {\n aList.removeAt(0)\n }\n\n if (totalMinutes <= K) {\n counter++\n } else {\n break\n }\n }\n\n println(counter)\n}\n", "language": "Kotlin", "metadata": {"date": 1593308206, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s772888775.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s772888775", "user_id": "u932970230"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val input = readLine()!!.split(\" \")\n val N = input[0].toInt()\n val M = input[1].toInt()\n val K = input[2].toLong()\n val aList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n val bList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n\n var counter = 0\n var totalMinutes = 0L\n val loopCount = N + M\n for (i in 0 until loopCount) {\n val a = if (aList.isNotEmpty()) aList[0] else Int.MAX_VALUE\n val b = if (bList.isNotEmpty()) bList[0] else Int.MAX_VALUE\n\n totalMinutes += if (a > b) {\n bList.removeAt(0)\n } else {\n aList.removeAt(0)\n }\n\n if (totalMinutes <= K) {\n counter++\n } else {\n break\n }\n }\n\n println(counter)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 810, "cpu_time_ms": 2208, "memory_kb": 80600}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s983784136", "group_id": "codeNet:p02623", "input_text": "fun main(args: Array) {\n var (n, m, k) = readLine()!!.split(\" \").map{it.toLong()}\n var a = readLine()!!.split(\" \").map{it.toLong()}\n var b = readLine()!!.split(\" \").map{it.toLong()}\n\n var aIndex = 0;\n var bIndex = 0;\n while(true) {\n if(aIndex < a.size && bIndex < b.size) {\n if (k - b[bIndex] >= 0 && a[aIndex] > b[bIndex]) {\n k -= b[bIndex]\n bIndex++\n } else {\n if (k - a[aIndex] >= 0) {\n k -= a[aIndex]\n aIndex++\n } else if (k - b[bIndex] >= 0) {\n k -= b[bIndex]\n bIndex++\n } else {\n break\n }\n }\n } else if(aIndex < a.size) {\n if (k - a[aIndex] >= 0) {\n k -= a[aIndex]\n aIndex++\n } else break\n } else if(bIndex < b.size) {\n if (k - b[bIndex] >= 0) {\n k -= b[bIndex]\n bIndex++\n } else break\n } else {\n break;\n }\n }\n println(aIndex + bIndex)\n}", "language": "Kotlin", "metadata": {"date": 1593307850, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s983784136.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s983784136", "user_id": "u527280956"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n var (n, m, k) = readLine()!!.split(\" \").map{it.toLong()}\n var a = readLine()!!.split(\" \").map{it.toLong()}\n var b = readLine()!!.split(\" \").map{it.toLong()}\n\n var aIndex = 0;\n var bIndex = 0;\n while(true) {\n if(aIndex < a.size && bIndex < b.size) {\n if (k - b[bIndex] >= 0 && a[aIndex] > b[bIndex]) {\n k -= b[bIndex]\n bIndex++\n } else {\n if (k - a[aIndex] >= 0) {\n k -= a[aIndex]\n aIndex++\n } else if (k - b[bIndex] >= 0) {\n k -= b[bIndex]\n bIndex++\n } else {\n break\n }\n }\n } else if(aIndex < a.size) {\n if (k - a[aIndex] >= 0) {\n k -= a[aIndex]\n aIndex++\n } else break\n } else if(bIndex < b.size) {\n if (k - b[bIndex] >= 0) {\n k -= b[bIndex]\n bIndex++\n } else break\n } else {\n break;\n }\n }\n println(aIndex + bIndex)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1143, "cpu_time_ms": 648, "memory_kb": 83864}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s872955876", "group_id": "codeNet:p02623", "input_text": "import java.util.*\n\nfun main(args : Array) {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toInt() }\n val aa = readLine()!!.split(\" \").map { it.toInt() }\n val bb = readLine()!!.split(\" \").map { it.toInt() }\n\n var ans = 0\n\n val dfs = Stack()\n dfs.push(Item(-1, -1, 0, 0))\n\n while (dfs.isNotEmpty()) {\n val item = dfs.pop()\n\n if (item.time >= k) {\n ans = Math.max(ans, item.cnt)\n continue\n }\n\n if (item.aIdx + 1 < n) {\n val nextAIdx = item.aIdx+1\n val nextTime = item.time + aa[nextAIdx]\n val nextCnt = if (nextTime <= k) item.cnt+1 else item.cnt\n dfs.push(Item(nextAIdx, item.bIdx, nextCnt, nextTime))\n }\n if (item.bIdx + 1 < m) {\n val nextBIdx = item.bIdx+1\n val nextTime = item.time + bb[nextBIdx]\n val nextCnt = if (nextTime <= k) item.cnt+1 else item.cnt\n dfs.push(Item(item.aIdx, nextBIdx, nextCnt, nextTime))\n }\n }\n\n println(ans)\n}\n\ndata class Item(val aIdx: Int, val bIdx: Int, val cnt: Int, val time: Long)", "language": "Kotlin", "metadata": {"date": 1593307677, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s872955876.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s872955876", "user_id": "u262403099"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\nfun main(args : Array) {\n val (n, m, k) = readLine()!!.split(\" \").map { it.toInt() }\n val aa = readLine()!!.split(\" \").map { it.toInt() }\n val bb = readLine()!!.split(\" \").map { it.toInt() }\n\n var ans = 0\n\n val dfs = Stack()\n dfs.push(Item(-1, -1, 0, 0))\n\n while (dfs.isNotEmpty()) {\n val item = dfs.pop()\n\n if (item.time >= k) {\n ans = Math.max(ans, item.cnt)\n continue\n }\n\n if (item.aIdx + 1 < n) {\n val nextAIdx = item.aIdx+1\n val nextTime = item.time + aa[nextAIdx]\n val nextCnt = if (nextTime <= k) item.cnt+1 else item.cnt\n dfs.push(Item(nextAIdx, item.bIdx, nextCnt, nextTime))\n }\n if (item.bIdx + 1 < m) {\n val nextBIdx = item.bIdx+1\n val nextTime = item.time + bb[nextBIdx]\n val nextCnt = if (nextTime <= k) item.cnt+1 else item.cnt\n dfs.push(Item(item.aIdx, nextBIdx, nextCnt, nextTime))\n }\n }\n\n println(ans)\n}\n\ndata class Item(val aIdx: Int, val bIdx: Int, val cnt: Int, val time: Long)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1117, "cpu_time_ms": 2209, "memory_kb": 88228}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s202530859", "group_id": "codeNet:p02623", "input_text": "import java.util.*\nimport kotlin.math.*\n\nfun str() = readLine()!!\nfun int() = str().toInt()\nfun long() = str().toLong()\n\nfun read(d:String = \" \") = str().split(d)\nfun list(d:String = \" \",f:String.()->T) = read(d).map {f(it)}\nfun list() = list {toInt()}\n\nfun T.print() = println(this)\n\nconst val mod = 998244353L\n\nfun main() {\n\tabc000X()\n}\n\nfun abc000X() {\n\tvar (n,m,k) = list {toLong()}\n\tval a = list {toLong()*2}.toLongArray()\n\tval b = list {toLong()*2}.toLongArray()\n\n\tArrays.parallelPrefix(a) {i,j-> i+j}\n\tArrays.parallelPrefix(b) {i,j-> i+j}\n\n\tk = k*2+1\n\n\tprintln(a.indices.map {if(a[it]>k) 0 else it+1+Arrays.binarySearch(b,k-a[it]).inv()}.max())\n}\n", "language": "Kotlin", "metadata": {"date": 1593307384, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s202530859.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s202530859", "user_id": "u059234158"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\nimport kotlin.math.*\n\nfun str() = readLine()!!\nfun int() = str().toInt()\nfun long() = str().toLong()\n\nfun read(d:String = \" \") = str().split(d)\nfun list(d:String = \" \",f:String.()->T) = read(d).map {f(it)}\nfun list() = list {toInt()}\n\nfun T.print() = println(this)\n\nconst val mod = 998244353L\n\nfun main() {\n\tabc000X()\n}\n\nfun abc000X() {\n\tvar (n,m,k) = list {toLong()}\n\tval a = list {toLong()*2}.toLongArray()\n\tval b = list {toLong()*2}.toLongArray()\n\n\tArrays.parallelPrefix(a) {i,j-> i+j}\n\tArrays.parallelPrefix(b) {i,j-> i+j}\n\n\tk = k*2+1\n\n\tprintln(a.indices.map {if(a[it]>k) 0 else it+1+Arrays.binarySearch(b,k-a[it]).inv()}.max())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 662, "cpu_time_ms": 824, "memory_kb": 80356}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s068034787", "group_id": "codeNet:p02623", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val scan = Scanner(System.`in`)\n var (m,n,k) = scan.nextLine().split(\" \").map{ it.trim().toLong() }.toTypedArray()\n var a = scan.nextLine().split(\" \").map{ it.trim().toLong() }.toTypedArray()\n var b = scan.nextLine().split(\" \").map{ it.trim().toLong() }.toTypedArray()\n var i = 0\n var j = 0\n var ans = 0\n var total = k\n\n while(total>0) {\n if (i < m && j < n) {\n if (a[i] < b[j]) {\n total -= a[i]\n if (total < 0)\n break\n ans++\n i++\n } else {\n total -= b[j]\n if (total < 0)\n break\n ans++\n j++\n }\n }\n else\n {\n if (i < m) {\n total -= a[i]\n if (total < 0)\n break\n ans++\n i++\n }\n else if(j) {\n val scan = Scanner(System.`in`)\n var (m,n,k) = scan.nextLine().split(\" \").map{ it.trim().toLong() }.toTypedArray()\n var a = scan.nextLine().split(\" \").map{ it.trim().toLong() }.toTypedArray()\n var b = scan.nextLine().split(\" \").map{ it.trim().toLong() }.toTypedArray()\n var i = 0\n var j = 0\n var ans = 0\n var total = k\n\n while(total>0) {\n if (i < m && j < n) {\n if (a[i] < b[j]) {\n total -= a[i]\n if (total < 0)\n break\n ans++\n i++\n } else {\n total -= b[j]\n if (total < 0)\n break\n ans++\n j++\n }\n }\n else\n {\n if (i < m) {\n total -= a[i]\n if (total < 0)\n break\n ans++\n i++\n }\n else if(j) {\n val (n, m, k) = longList()\n val a = longList()\n val b = longList()\n var ai = 0\n var bi = 0\n var t = 0L\n var count = 0\n while (t <= k) {\n if (ai >= a.size && bi >= b.size) {\n println(\"${a.size + b.size}\")\n return\n }\n val am = a.getOrNull(ai) ?: Long.MAX_VALUE\n val bm = b.getOrNull(bi) ?: Long.MAX_VALUE\n if (am < bm) {\n t += am\n ai++\n } else {\n t += bm\n bi++\n }\n count++\n }\n println((count - 1).toString())\n}\n", "language": "Kotlin", "metadata": {"date": 1593306794, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s868017099.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s868017099", "user_id": "u979429407"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun longList() = readLine()?.split(\" \")?.map(String::toLong) ?: TODO()\nfun main(args: Array) {\n val (n, m, k) = longList()\n val a = longList()\n val b = longList()\n var ai = 0\n var bi = 0\n var t = 0L\n var count = 0\n while (t <= k) {\n if (ai >= a.size && bi >= b.size) {\n println(\"${a.size + b.size}\")\n return\n }\n val am = a.getOrNull(ai) ?: Long.MAX_VALUE\n val bm = b.getOrNull(bi) ?: Long.MAX_VALUE\n if (am < bm) {\n t += am\n ai++\n } else {\n t += bm\n bi++\n }\n count++\n }\n println((count - 1).toString())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 665, "cpu_time_ms": 667, "memory_kb": 81932}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s068870437", "group_id": "codeNet:p02623", "input_text": "import kotlin.math.max\n\nfun main() {\n val (n, m, k) = readLine()!!.split(' ').map { it.toInt() }\n val a = (listOf(0L) + readLine()!!.split(' ').map { it.toLong() }).toLongArray()\n val b = (listOf(0L) + readLine()!!.split(' ').map { it.toLong() }).toLongArray()\n for (i in 1 .. n) {\n a[i] += a[i - 1]\n }\n for (i in 1 .. m) {\n b[i] += b[i - 1]\n }\n var answer = 0\n var i = 0\n var j = m\n while (i <= n && a[i] <= k) {\n while (a[i] + b[j] > k) {\n j--\n }\n answer = max(answer, i + j)\n i++\n }\n println(answer)\n}", "language": "Kotlin", "metadata": {"date": 1593306673, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02623.html", "problem_id": "p02623", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02623/input.txt", "sample_output_relpath": "derived/input_output/data/p02623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02623/Kotlin/s068870437.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s068870437", "user_id": "u496795059"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import kotlin.math.max\n\nfun main() {\n val (n, m, k) = readLine()!!.split(' ').map { it.toInt() }\n val a = (listOf(0L) + readLine()!!.split(' ').map { it.toLong() }).toLongArray()\n val b = (listOf(0L) + readLine()!!.split(' ').map { it.toLong() }).toLongArray()\n for (i in 1 .. n) {\n a[i] += a[i - 1]\n }\n for (i in 1 .. m) {\n b[i] += b[i - 1]\n }\n var answer = 0\n var i = 0\n var j = m\n while (i <= n && a[i] <= k) {\n while (a[i] + b[j] > k) {\n j--\n }\n answer = max(answer, i + j)\n i++\n }\n println(answer)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "sample_input": "3 4 240\n60 90 120\n80 150 80 150\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02623", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two desks: A and B. Desk A has a vertical stack of N books on it, and Desk B similarly has M books on it.\n\nIt takes us A_i minutes to read the i-th book from the top on Desk A (1 \\leq i \\leq N), and B_i minutes to read the i-th book from the top on Desk B (1 \\leq i \\leq M).\n\nConsider the following action:\n\nChoose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.\n\nHow many books can we read at most by repeating this action so that it takes us at most K minutes in total? We ignore the time it takes to do anything other than reading.\n\nConstraints\n\n1 \\leq N, M \\leq 200000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i, B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 \\ldots A_N\nB_1 B_2 \\ldots B_M\n\nOutput\n\nPrint an integer representing the maximum number of books that can be read.\n\nSample Input 1\n\n3 4 240\n60 90 120\n80 150 80 150\n\nSample Output 1\n\n3\n\nIn this case, it takes us 60, 90, 120 minutes to read the 1-st, 2-nd, 3-rd books from the top on Desk A, and 80, 150, 80, 150 minutes to read the 1-st, 2-nd, 3-rd, 4-th books from the top on Desk B, respectively.\n\nWe can read three books in 230 minutes, as shown below, and this is the maximum number of books we can read within 240 minutes.\n\nRead the topmost book on Desk A in 60 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk B in 80 minutes, and remove that book from the desk.\n\nRead the topmost book on Desk A in 90 minutes, and remove that book from the desk.\n\nSample Input 2\n\n3 4 730\n60 90 120\n80 150 80 150\n\nSample Output 2\n\n7\n\nSample Input 3\n\n5 4 1\n1000000000 1000000000 1000000000 1000000000 1000000000\n1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n0\n\nWatch out for integer overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 540, "cpu_time_ms": 657, "memory_kb": 88704}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s626491431", "group_id": "codeNet:p02624", "input_text": "fun main() {\n val n = readLine()!!.toInt()\n\n var s = 0L\n for (d in 1..n) {\n val x = (n / d).toLong()\n s += d * x * (x + 1) / 2\n }\n println(s)\n}", "language": "Kotlin", "metadata": {"date": 1600480367, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Kotlin/s626491431.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s626491431", "user_id": "u178770699"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "fun main() {\n val n = readLine()!!.toInt()\n\n var s = 0L\n for (d in 1..n) {\n val x = (n / d).toLong()\n s += d * x * (x + 1) / 2\n }\n println(s)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 172, "cpu_time_ms": 132, "memory_kb": 34524}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s532272207", "group_id": "codeNet:p02624", "input_text": "fun main() {\n val N = readLine()!!.toLong()\n\n var ans = 0L\n for(x in 1..N){\n val y = N / x\n val g = y*(y+1)*x/2\n ans += g\n }\n\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1595667075, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Kotlin/s532272207.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s532272207", "user_id": "u531770859"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "fun main() {\n val N = readLine()!!.toLong()\n\n var ans = 0L\n for(x in 1..N){\n val y = N / x\n val g = y*(y+1)*x/2\n ans += g\n }\n\n println(ans)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 177, "cpu_time_ms": 192, "memory_kb": 34608}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s629515469", "group_id": "codeNet:p02624", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val n = sc.nextLong()\n var ans = 0L\n for (d in 1..n) {\n val l = n / d\n ans += d * l * (l + 1) / 2\n }\n println(ans)\n}\n\nfun main() {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}", "language": "Kotlin", "metadata": {"date": 1593319595, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Kotlin/s629515469.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s629515469", "user_id": "u190507186"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val n = sc.nextLong()\n var ans = 0L\n for (d in 1..n) {\n val l = n / d\n ans += d * l * (l + 1) / 2\n }\n println(ans)\n}\n\nfun main() {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 901, "cpu_time_ms": 185, "memory_kb": 34436}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s816722300", "group_id": "codeNet:p02624", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n\n val baisuu = LongArray(n+1) { 1L }\n for (i in 2..n) {\n var j = i\n while(j <= n) {\n baisuu[j]++\n j += i\n }\n }\n\n var ans = 0L\n for (i in 1..n) {\n ans += i * baisuu[i]\n }\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1593315947, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Kotlin/s816722300.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s816722300", "user_id": "u288435405"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n\n val baisuu = LongArray(n+1) { 1L }\n for (i in 2..n) {\n var j = i\n while(j <= n) {\n baisuu[j]++\n j += i\n }\n }\n\n var ans = 0L\n for (i in 1..n) {\n ans += i * baisuu[i]\n }\n println(ans)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 322, "cpu_time_ms": 1554, "memory_kb": 114576}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s723174630", "group_id": "codeNet:p02624", "input_text": "import kotlin.system.measureTimeMillis\nimport kotlin.time.measureTime\n\nclass Sieve(n: Int) {\n private val f = IntArray(n + 1)\n private val primes = mutableListOf()\n\n init {\n f[0] = -1\n f[1] = -1\n for (i in 2..n) {\n if (f[i] > 0) continue\n primes.add(i)\n f[i] = i\n if (i.toLong() * i.toLong() > n) continue\n for (j in i * i..n step i) {\n if (f[j] == 0) f[j] = i\n }\n }\n }\n\n fun factor(x: Int): MutableMap {\n val r = mutableMapOf()\n var x1 = x\n while (x1 != 1) {\n r[f[x1]] = r.getOrElse(f[x1]) { 0 } + 1\n x1 /= f[x1]\n }\n return r\n }\n}\n\nfun main() {\n val sieve = Sieve(10000000)\n val n = readLine()!!.toInt()\n var ans = 0L\n for (i in 1..n) {\n var x = 1L\n for ((k, v) in sieve.factor(i)) {\n x *= (v + 1)\n }\n ans += i * x\n }\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1593310249, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Kotlin/s723174630.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s723174630", "user_id": "u863309603"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "import kotlin.system.measureTimeMillis\nimport kotlin.time.measureTime\n\nclass Sieve(n: Int) {\n private val f = IntArray(n + 1)\n private val primes = mutableListOf()\n\n init {\n f[0] = -1\n f[1] = -1\n for (i in 2..n) {\n if (f[i] > 0) continue\n primes.add(i)\n f[i] = i\n if (i.toLong() * i.toLong() > n) continue\n for (j in i * i..n step i) {\n if (f[j] == 0) f[j] = i\n }\n }\n }\n\n fun factor(x: Int): MutableMap {\n val r = mutableMapOf()\n var x1 = x\n while (x1 != 1) {\n r[f[x1]] = r.getOrElse(f[x1]) { 0 } + 1\n x1 /= f[x1]\n }\n return r\n }\n}\n\nfun main() {\n val sieve = Sieve(10000000)\n val n = readLine()!!.toInt()\n var ans = 0L\n for (i in 1..n) {\n var x = 1L\n for ((k, v) in sieve.factor(i)) {\n x *= (v + 1)\n }\n ans += i * x\n }\n println(ans)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1001, "cpu_time_ms": 2195, "memory_kb": 126872}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s995336087", "group_id": "codeNet:p02624", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.util.*\nimport kotlin.math.abs\nimport kotlin.math.max\nimport kotlin.math.min\n\nval MOD = 1_000_000_007L\n\nclass Solver(stream: InputStream, private val out: java.io.PrintWriter) {\n fun solve() {\n val MAX = 10_000_000\n val C = LongArray(MAX + 1)\n for (i in 2 .. MAX) {\n var j = i\n while (j <= MAX) {\n C[j]++\n j += i\n }\n }\n// debug(C)\n var ans = 0L\n for (i in 1 .. ni()) {\n ans += (C[i] + 1) * i\n }\n out.println(ans)\n }\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n private val isDebug = try {\n // なんか本番でエラーでる\n System.getenv(\"MY_DEBUG\") != null\n } catch (t: Throwable) {\n false\n }\n\n private var tokenizer: StringTokenizer? = null\n private val reader = BufferedReader(InputStreamReader(stream), 32768)\n private fun next(): String {\n while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n private fun ni() = next().toInt()\n private fun nl() = next().toLong()\n private fun ns() = next()\n private fun na(n: Int, offset: Int = 0): IntArray {\n return map(n) { ni() + offset }\n }\n private fun nal(n: Int, offset: Int = 0): LongArray {\n val res = LongArray(n)\n for (i in 0 until n) {\n res[i] = nl() + offset\n }\n return res\n }\n\n private fun na2(n: Int, offset: Int = 0): Array {\n val a = Array(2){IntArray(n)}\n for (i in 0 until n) {\n for (e in a) {\n e[i] = ni() + offset\n }\n }\n return a\n }\n\n private inline fun map(n: Int, f: (Int) -> Int): IntArray {\n val res = IntArray(n)\n for (i in 0 until n) {\n res[i] = f(i)\n }\n return res\n }\n\n private inline fun debug(msg: () -> String) {\n if (isDebug) System.err.println(msg())\n }\n\n private fun debug(a: LongArray) {\n debug { a.joinToString(\" \") }\n }\n\n private fun debug(a: IntArray) {\n debug { a.joinToString(\" \") }\n }\n\n private fun debug(a: BooleanArray) {\n debug { a.map { if (it) 1 else 0 }.joinToString(\"\") }\n }\n\n private fun debugDim(A: Array) {\n if (isDebug) {\n for (a in A) {\n debug(a)\n }\n }\n }\n private fun debugDim(A: Array) {\n if (isDebug) {\n for (a in A) {\n debug(a)\n }\n }\n }\n\n /**\n * 勝手にimport消されるのを防ぎたい\n */\n private fun hoge() {\n min(1, 2)\n max(1, 2)\n abs(-10)\n }\n}\n\nfun main() {\n val out = java.io.PrintWriter(System.out)\n Solver(System.`in`, out).solve()\n out.flush()\n}", "language": "Kotlin", "metadata": {"date": 1593306943, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02624.html", "problem_id": "p02624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02624/input.txt", "sample_output_relpath": "derived/input_output/data/p02624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02624/Kotlin/s995336087.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s995336087", "user_id": "u460609472"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.util.*\nimport kotlin.math.abs\nimport kotlin.math.max\nimport kotlin.math.min\n\nval MOD = 1_000_000_007L\n\nclass Solver(stream: InputStream, private val out: java.io.PrintWriter) {\n fun solve() {\n val MAX = 10_000_000\n val C = LongArray(MAX + 1)\n for (i in 2 .. MAX) {\n var j = i\n while (j <= MAX) {\n C[j]++\n j += i\n }\n }\n// debug(C)\n var ans = 0L\n for (i in 1 .. ni()) {\n ans += (C[i] + 1) * i\n }\n out.println(ans)\n }\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n private val isDebug = try {\n // なんか本番でエラーでる\n System.getenv(\"MY_DEBUG\") != null\n } catch (t: Throwable) {\n false\n }\n\n private var tokenizer: StringTokenizer? = null\n private val reader = BufferedReader(InputStreamReader(stream), 32768)\n private fun next(): String {\n while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n private fun ni() = next().toInt()\n private fun nl() = next().toLong()\n private fun ns() = next()\n private fun na(n: Int, offset: Int = 0): IntArray {\n return map(n) { ni() + offset }\n }\n private fun nal(n: Int, offset: Int = 0): LongArray {\n val res = LongArray(n)\n for (i in 0 until n) {\n res[i] = nl() + offset\n }\n return res\n }\n\n private fun na2(n: Int, offset: Int = 0): Array {\n val a = Array(2){IntArray(n)}\n for (i in 0 until n) {\n for (e in a) {\n e[i] = ni() + offset\n }\n }\n return a\n }\n\n private inline fun map(n: Int, f: (Int) -> Int): IntArray {\n val res = IntArray(n)\n for (i in 0 until n) {\n res[i] = f(i)\n }\n return res\n }\n\n private inline fun debug(msg: () -> String) {\n if (isDebug) System.err.println(msg())\n }\n\n private fun debug(a: LongArray) {\n debug { a.joinToString(\" \") }\n }\n\n private fun debug(a: IntArray) {\n debug { a.joinToString(\" \") }\n }\n\n private fun debug(a: BooleanArray) {\n debug { a.map { if (it) 1 else 0 }.joinToString(\"\") }\n }\n\n private fun debugDim(A: Array) {\n if (isDebug) {\n for (a in A) {\n debug(a)\n }\n }\n }\n private fun debugDim(A: Array) {\n if (isDebug) {\n for (a in A) {\n debug(a)\n }\n }\n }\n\n /**\n * 勝手にimport消されるのを防ぎたい\n */\n private fun hoge() {\n min(1, 2)\n max(1, 2)\n abs(-10)\n }\n}\n\nfun main() {\n val out = java.io.PrintWriter(System.out)\n Solver(System.`in`, out).solve()\n out.flush()\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "sample_input": "4\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02624", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor a positive integer X, let f(X) be the number of positive divisors of X.\n\nGiven a positive integer N, find \\sum_{K=1}^N K\\times f(K).\n\nConstraints\n\n1 \\leq N \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the value \\sum_{K=1}^N K\\times f(K).\n\nSample Input 1\n\n4\n\nSample Output 1\n\n23\n\nWe have f(1)=1, f(2)=2, f(3)=2, and f(4)=3, so the answer is 1\\times 1 + 2\\times 2 + 3\\times 2 + 4\\times 3 =23.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n26879\n\nSample Input 3\n\n10000000\n\nSample Output 3\n\n838627288460105\n\nWatch out for overflows.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2648, "cpu_time_ms": 1540, "memory_kb": 115708}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s450353679", "group_id": "codeNet:p02642", "input_text": "fun main() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map(String::toInt).toList().sorted()\n \n val boolArr = BooleanArray(a.size) { true }\n \n val aSize = a.size\n for (i in 0 until aSize) {\n if(!boolArr[i]) continue\n \n if(i!=aSize-1 && a[i]==a.last()) {\n for(i in i until aSize) boolArr[i] = false\n break\n }\n if(a[i] > a.last().div(0.5)) break\n \n \n \n for (j in i+1 until aSize) {\n \n if(!boolArr[j]) continue\n \n if(a[j] % a[i] == 0) {\n boolArr[j] = false\n if(boolArr[i] && a[j] == a[i]) {\n boolArr[i] = false\n }\n }\n \n \n }\n }\n \n println(boolArr.filter { bool -> bool }.size)\n \n}", "language": "Kotlin", "metadata": {"date": 1597533589, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s450353679.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s450353679", "user_id": "u966836999"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map(String::toInt).toList().sorted()\n \n val boolArr = BooleanArray(a.size) { true }\n \n val aSize = a.size\n for (i in 0 until aSize) {\n if(!boolArr[i]) continue\n \n if(i!=aSize-1 && a[i]==a.last()) {\n for(i in i until aSize) boolArr[i] = false\n break\n }\n if(a[i] > a.last().div(0.5)) break\n \n \n \n for (j in i+1 until aSize) {\n \n if(!boolArr[j]) continue\n \n if(a[j] % a[i] == 0) {\n boolArr[j] = false\n if(boolArr[i] && a[j] == a[i]) {\n boolArr[i] = false\n }\n }\n \n \n }\n }\n \n println(boolArr.filter { bool -> bool }.size)\n \n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 716, "cpu_time_ms": 2207, "memory_kb": 67200}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s085655283", "group_id": "codeNet:p02642", "input_text": "fun main() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map(String::toInt).toList().sorted()\n \n val boolArr = BooleanArray(a.size) { true }\n \n val aSize = a.size\n for (i in 0 until aSize) {\n if(!boolArr[i]) continue\n \n for (j in i+1 until a.size) {\n if(a[i]!=a[j] && a[i] > a[j].div(0.5)) break\n \n if(!boolArr[j]) continue\n \n if(a[j] % a[i] == 0) {\n boolArr[j] = false\n if(boolArr[i] && a[j] == a[i]) {\n boolArr[i] = false\n }\n }\n \n \n }\n }\n \n println(boolArr.filter { bool -> bool }.size)\n \n}", "language": "Kotlin", "metadata": {"date": 1597530601, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s085655283.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s085655283", "user_id": "u966836999"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map(String::toInt).toList().sorted()\n \n val boolArr = BooleanArray(a.size) { true }\n \n val aSize = a.size\n for (i in 0 until aSize) {\n if(!boolArr[i]) continue\n \n for (j in i+1 until a.size) {\n if(a[i]!=a[j] && a[i] > a[j].div(0.5)) break\n \n if(!boolArr[j]) continue\n \n if(a[j] % a[i] == 0) {\n boolArr[j] = false\n if(boolArr[i] && a[j] == a[i]) {\n boolArr[i] = false\n }\n }\n \n \n }\n }\n \n println(boolArr.filter { bool -> bool }.size)\n \n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 608, "cpu_time_ms": 2207, "memory_kb": 67148}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s175024202", "group_id": "codeNet:p02642", "input_text": "fun main() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map(String::toInt).toList().sorted()\n \n val boolArr = BooleanArray(a.size) { true }\n \n for (i in 0 until a.size) {\n if(!boolArr[i]) continue\n for (j in i+1 until a.size) {\n if(boolArr[i] && a[j] == a[i]) boolArr[i] = false\n if(!boolArr[j]) continue\n if(a[j] % a[i] == 0) boolArr[j] = false\n }\n }\n \n println(boolArr.filter { bool -> bool }.size)\n \n}", "language": "Kotlin", "metadata": {"date": 1597525360, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s175024202.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s175024202", "user_id": "u966836999"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map(String::toInt).toList().sorted()\n \n val boolArr = BooleanArray(a.size) { true }\n \n for (i in 0 until a.size) {\n if(!boolArr[i]) continue\n for (j in i+1 until a.size) {\n if(boolArr[i] && a[j] == a[i]) boolArr[i] = false\n if(!boolArr[j]) continue\n if(a[j] % a[i] == 0) boolArr[j] = false\n }\n }\n \n println(boolArr.filter { bool -> bool }.size)\n \n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 460, "cpu_time_ms": 2207, "memory_kb": 67064}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s543659387", "group_id": "codeNet:p02642", "input_text": "fun main() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map(String::toInt).toList()\n \n a.sorted()\n var ans = 0\n for (i in 0 until a.size) {\n var exp = false\n for (j in 0 until i) {\n if(a[i] % a[j] == 0) {\n exp = true\n break\n }\n }\n if(!exp) ans++\n exp = false\n }\n}", "language": "Kotlin", "metadata": {"date": 1597367240, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s543659387.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s543659387", "user_id": "u966836999"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map(String::toInt).toList()\n \n a.sorted()\n var ans = 0\n for (i in 0 until a.size) {\n var exp = false\n for (j in 0 until i) {\n if(a[i] % a[j] == 0) {\n exp = true\n break\n }\n }\n if(!exp) ans++\n exp = false\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 329, "cpu_time_ms": 2208, "memory_kb": 66896}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s558749463", "group_id": "codeNet:p02642", "input_text": "import java.util.*\n\n// https://atcoder.jp/contests/abc170/tasks/abc170_d\n\nfun main() {\n abc170d()\n}\n\nfun abc170d() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val sorted = a.sorted()\n val max = a.max()!!\n val primes = BooleanArray(max + 1) { false }\n for (i in sorted) {\n if (primes[i]) continue\n var j = 2\n while (i * j <= max) {\n primes[i * j] = true\n j++\n }\n }\n val orig = mutableSetOf()\n val dup = mutableSetOf()\n for (i in sorted) {\n if (i in orig) dup.add(i)\n if (!primes[i]) orig.add(i)\n }\n println(orig.count() - dup.count())\n}\n", "language": "Kotlin", "metadata": {"date": 1596745133, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s558749463.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s558749463", "user_id": "u628907033"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\n// https://atcoder.jp/contests/abc170/tasks/abc170_d\n\nfun main() {\n abc170d()\n}\n\nfun abc170d() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val sorted = a.sorted()\n val max = a.max()!!\n val primes = BooleanArray(max + 1) { false }\n for (i in sorted) {\n if (primes[i]) continue\n var j = 2\n while (i * j <= max) {\n primes[i * j] = true\n j++\n }\n }\n val orig = mutableSetOf()\n val dup = mutableSetOf()\n for (i in sorted) {\n if (i in orig) dup.add(i)\n if (!primes[i]) orig.add(i)\n }\n println(orig.count() - dup.count())\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 690, "cpu_time_ms": 849, "memory_kb": 74868}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s156807837", "group_id": "codeNet:p02642", "input_text": "fun intList() = readLine()?.split(\" \")?.map(String::toInt) ?: TODO()\nfun main(args: Array) {\n val n = readLine()?.toInt() ?: return\n val a = intList().sorted()\n val max = a.last()\n val flags = Array(max + 1) { true }\n val proceed = hashMapOf()\n a.forEach { i ->\n var v = if (proceed[i] == true) {\n i\n } else {\n i + i\n }\n proceed[i] = true\n while (v <= max) {\n flags[v] = false\n v += i\n }\n }\n println(a.count { flags[it] }.toString())\n}", "language": "Kotlin", "metadata": {"date": 1592709809, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s156807837.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s156807837", "user_id": "u979429407"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun intList() = readLine()?.split(\" \")?.map(String::toInt) ?: TODO()\nfun main(args: Array) {\n val n = readLine()?.toInt() ?: return\n val a = intList().sorted()\n val max = a.last()\n val flags = Array(max + 1) { true }\n val proceed = hashMapOf()\n a.forEach { i ->\n var v = if (proceed[i] == true) {\n i\n } else {\n i + i\n }\n proceed[i] = true\n while (v <= max) {\n flags[v] = false\n v += i\n }\n }\n println(a.count { flags[it] }.toString())\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 567, "cpu_time_ms": 845, "memory_kb": 82776}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s002930614", "group_id": "codeNet:p02642", "input_text": "import java.util.*\nimport java.lang.Math.*\n\n\nval readString: ()->String = {readLine()!!}\nval readInt: ()->Int = {readLine()!!.toInt()}\nval readLong: ()->Long = {readLine()!!.toLong()}\nval readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nval readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nval errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nval MOD = 1_000_000_007L\nval INF = Int.MAX_VALUE/2\nval LINF = Long.MAX_VALUE/2\ndata class IntPair(val first: Int, val second: Int)\ndata class To(val idx: Int, val cost: Long)\n\n\nfun solve(A: IntArray): Int {\n val N = A.size\n if (N == 1) return 1\n\n when (A.count{it == 1}) {\n 2-> { return 0 }\n 1-> { return 1 }\n else -> {\n val fc = BooleanArray(N){true}\n\n var B = A.sorted()\n if (B[0] == B.last()) return 0\n\n for (i in 0 until N-1) {\n if (!fc[i]) continue\n\n for (j in i+1 until N) {\n if (!fc[j]) continue\n\n if (B[j]%B[i] == 0) fc[j] = false\n }\n }\n\n return fc.count{ it }\n }\n }\n}\n\n\nfun main(args: Array) {\n val N = readInt()\n val A = readIntArray()\n\n val ans = solve(A)\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1592700992, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s002930614.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s002930614", "user_id": "u404244809"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\nimport java.lang.Math.*\n\n\nval readString: ()->String = {readLine()!!}\nval readInt: ()->Int = {readLine()!!.toInt()}\nval readLong: ()->Long = {readLine()!!.toLong()}\nval readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nval readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nval errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nval MOD = 1_000_000_007L\nval INF = Int.MAX_VALUE/2\nval LINF = Long.MAX_VALUE/2\ndata class IntPair(val first: Int, val second: Int)\ndata class To(val idx: Int, val cost: Long)\n\n\nfun solve(A: IntArray): Int {\n val N = A.size\n if (N == 1) return 1\n\n when (A.count{it == 1}) {\n 2-> { return 0 }\n 1-> { return 1 }\n else -> {\n val fc = BooleanArray(N){true}\n\n var B = A.sorted()\n if (B[0] == B.last()) return 0\n\n for (i in 0 until N-1) {\n if (!fc[i]) continue\n\n for (j in i+1 until N) {\n if (!fc[j]) continue\n\n if (B[j]%B[i] == 0) fc[j] = false\n }\n }\n\n return fc.count{ it }\n }\n }\n}\n\n\nfun main(args: Array) {\n val N = readInt()\n val A = readIntArray()\n\n val ans = solve(A)\n\n println(ans)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1323, "cpu_time_ms": 2207, "memory_kb": 72516}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s171791907", "group_id": "codeNet:p02642", "input_text": "import java.util.*\nimport java.lang.Math.*\nimport kotlin.collections.ArrayList\n\nval readString: ()->String = {readLine()!!}\nval readInt: ()->Int = {readLine()!!.toInt()}\nval readLong: ()->Long = {readLine()!!.toLong()}\nval readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nval readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nval errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nval MOD = 1_000_000_007L\nval INF = Int.MAX_VALUE/2\nval LINF = Long.MAX_VALUE/2\ndata class IntPair(val first: Int, val second: Int)\ndata class To(val idx: Int, val cost: Long)\n\n\nfun solve(A: IntArray): Int {\n val N = A.size\n if (N == 1) return 1\n\n when (A.count{it == 1}) {\n 2-> { return 0 }\n 1-> { return 1 }\n else -> {\n var B = A.sorted()\n if (B[0] == B.last()) return 0\n val hist = IntArray(1_000_002){0}\n\n for (i in 0 until N) {\n hist[B[i]] += 1\n }\n\n var res = ArrayList()\n\n while (B.isNotEmpty()) {\n if (hist[B[0]] == 1) {\n res.add(B[0])\n }\n B = B.filter { it%B[0] != 0 }\n }\n\n return res.size\n }\n }\n}\n\n\nfun main(args: Array) {\n val N = readInt()\n val A = readIntArray()\n\n val ans = solve(A)\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1592690807, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s171791907.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s171791907", "user_id": "u404244809"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\nimport java.lang.Math.*\nimport kotlin.collections.ArrayList\n\nval readString: ()->String = {readLine()!!}\nval readInt: ()->Int = {readLine()!!.toInt()}\nval readLong: ()->Long = {readLine()!!.toLong()}\nval readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nval readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nval errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nval MOD = 1_000_000_007L\nval INF = Int.MAX_VALUE/2\nval LINF = Long.MAX_VALUE/2\ndata class IntPair(val first: Int, val second: Int)\ndata class To(val idx: Int, val cost: Long)\n\n\nfun solve(A: IntArray): Int {\n val N = A.size\n if (N == 1) return 1\n\n when (A.count{it == 1}) {\n 2-> { return 0 }\n 1-> { return 1 }\n else -> {\n var B = A.sorted()\n if (B[0] == B.last()) return 0\n val hist = IntArray(1_000_002){0}\n\n for (i in 0 until N) {\n hist[B[i]] += 1\n }\n\n var res = ArrayList()\n\n while (B.isNotEmpty()) {\n if (hist[B[0]] == 1) {\n res.add(B[0])\n }\n B = B.filter { it%B[0] != 0 }\n }\n\n return res.size\n }\n }\n}\n\n\nfun main(args: Array) {\n val N = readInt()\n val A = readIntArray()\n\n val ans = solve(A)\n\n println(ans)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1420, "cpu_time_ms": 2209, "memory_kb": 78768}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s705481045", "group_id": "codeNet:p02642", "input_text": "import java.util.*\n\nfun main(args:Array) {\n val N = 1000000\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (0 until n).map { sc.next().toInt() }\n val ac = a.groupBy { it }.toSortedMap()\n val erato : MutableList = MutableList(N+1) { false }\n var ans = 0\n ac.forEach {\n if (it.value.size == 1 && !erato[it.key]) ans += 1\n for (i in it.key..N step it.key) erato[i] = true\n }\n\n println(ans)\n\n}", "language": "Kotlin", "metadata": {"date": 1592369598, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s705481045.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s705481045", "user_id": "u330661451"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\nfun main(args:Array) {\n val N = 1000000\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (0 until n).map { sc.next().toInt() }\n val ac = a.groupBy { it }.toSortedMap()\n val erato : MutableList = MutableList(N+1) { false }\n var ans = 0\n ac.forEach {\n if (it.value.size == 1 && !erato[it.key]) ans += 1\n for (i in it.key..N step it.key) erato[i] = true\n }\n\n println(ans)\n\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 465, "cpu_time_ms": 959, "memory_kb": 108836}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s052251367", "group_id": "codeNet:p02642", "input_text": "fun main(args: Array) {\n Program().solve()\n}\n\nclass Program {\n fun solve() {\n\n val maxA = 1000000\n val sc = MyScanner()\n val n = sc.nextInt()\n val a = sc.intList()\n val map = mutableMapOf()\n for (i in 0 until n) {\n map[a[i]] = (map[a[i]] ?: 0) + 1\n }\n\n var ans = 0\n for (i in 0 until n) {\n if ((map[a[i]] ?: 0) >= 2) continue\n var d = 1\n var flag = true\n while (d * d <= a[i]) {\n if (a[i] % d == 0) {\n if (map.containsKey(d) || (d != 1 && map.containsKey(a[i] / d))) {\n flag = false\n break\n }\n }\n d++\n }\n if (flag) ans++\n }\n println(ans)\n }\n}\n\nclass MyScanner {\n private var ptr = 0\n private var l = listOf()\n\n fun next(): String {\n while (l.size <= ptr) {\n l = readLine()!!.split(' ')\n ptr = 0\n }\n return l[ptr++]\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextDouble() = next().toDouble()\n fun nextCharArray() = next().toCharArray()\n fun nextChar() = next()[0]\n\n fun list(): List {\n ptr = l.size\n return readLine()!!.split(' ')\n }\n\n fun intList() = list().map { s -> s.toInt() }\n fun longList() = list().map { s -> s.toLong() }\n fun doubleList() = list().map { s -> s.toDouble() }\n\n fun array() = list().toTypedArray()\n fun intArray() = intList().toIntArray()\n fun longArray() = longList().toLongArray()\n fun doubleArray() = doubleList().toDoubleArray()\n}\n", "language": "Kotlin", "metadata": {"date": 1592364601, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s052251367.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s052251367", "user_id": "u194412908"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n Program().solve()\n}\n\nclass Program {\n fun solve() {\n\n val maxA = 1000000\n val sc = MyScanner()\n val n = sc.nextInt()\n val a = sc.intList()\n val map = mutableMapOf()\n for (i in 0 until n) {\n map[a[i]] = (map[a[i]] ?: 0) + 1\n }\n\n var ans = 0\n for (i in 0 until n) {\n if ((map[a[i]] ?: 0) >= 2) continue\n var d = 1\n var flag = true\n while (d * d <= a[i]) {\n if (a[i] % d == 0) {\n if (map.containsKey(d) || (d != 1 && map.containsKey(a[i] / d))) {\n flag = false\n break\n }\n }\n d++\n }\n if (flag) ans++\n }\n println(ans)\n }\n}\n\nclass MyScanner {\n private var ptr = 0\n private var l = listOf()\n\n fun next(): String {\n while (l.size <= ptr) {\n l = readLine()!!.split(' ')\n ptr = 0\n }\n return l[ptr++]\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextDouble() = next().toDouble()\n fun nextCharArray() = next().toCharArray()\n fun nextChar() = next()[0]\n\n fun list(): List {\n ptr = l.size\n return readLine()!!.split(' ')\n }\n\n fun intList() = list().map { s -> s.toInt() }\n fun longList() = list().map { s -> s.toLong() }\n fun doubleList() = list().map { s -> s.toDouble() }\n\n fun array() = list().toTypedArray()\n fun intArray() = intList().toIntArray()\n fun longArray() = longList().toLongArray()\n fun doubleArray() = doubleList().toDoubleArray()\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1727, "cpu_time_ms": 1693, "memory_kb": 79852}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s353489746", "group_id": "codeNet:p02642", "input_text": "fun main() {\n val n = readLine()!!.toInt()\n val arr = readLine()!!.split(\" \").map { it.toInt() }.sorted().toIntArray()\n val s = HashSet()\n val dup = HashMap()\n for(d in arr) {\n dup[d] = (dup[d]?:0) + 1\n }\n var ans = 0\n\n for(i in 0 until n) {\n val v = arr[i]\n var c = v\n val primes = ArrayList()\n var d = 2\n val cnt = (dup[v]?:0)\n val isDup = cnt > 1\n\n while(d * d <= v) {\n if(c % d != 0) {\n ++d\n continue\n }\n if(c == 1) break\n while(c % d != 0) {\n c /= d\n }\n primes.add(d)\n ++d\n }\n\n if(c != 1) {\n primes.add(c)\n }\n\n fun dfs(idx:Int, v:Int): Boolean {\n if(idx >= primes.size) {\n if(s.contains(v))\n return true\n return false\n }\n if(dfs(idx + 1, v * primes[idx]) || dfs(idx + 1 , v))\n return true\n return false\n }\n\n if( !isDup && !dfs(0, 1)) {\n ++ans\n }\n\n var m = 1\n for(p in primes) {\n m *= p\n }\n s.add(m)\n }\n print(ans)\n\n\n}", "language": "Kotlin", "metadata": {"date": 1592348963, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s353489746.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s353489746", "user_id": "u682597394"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val n = readLine()!!.toInt()\n val arr = readLine()!!.split(\" \").map { it.toInt() }.sorted().toIntArray()\n val s = HashSet()\n val dup = HashMap()\n for(d in arr) {\n dup[d] = (dup[d]?:0) + 1\n }\n var ans = 0\n\n for(i in 0 until n) {\n val v = arr[i]\n var c = v\n val primes = ArrayList()\n var d = 2\n val cnt = (dup[v]?:0)\n val isDup = cnt > 1\n\n while(d * d <= v) {\n if(c % d != 0) {\n ++d\n continue\n }\n if(c == 1) break\n while(c % d != 0) {\n c /= d\n }\n primes.add(d)\n ++d\n }\n\n if(c != 1) {\n primes.add(c)\n }\n\n fun dfs(idx:Int, v:Int): Boolean {\n if(idx >= primes.size) {\n if(s.contains(v))\n return true\n return false\n }\n if(dfs(idx + 1, v * primes[idx]) || dfs(idx + 1 , v))\n return true\n return false\n }\n\n if( !isDup && !dfs(0, 1)) {\n ++ans\n }\n\n var m = 1\n for(p in primes) {\n m *= p\n }\n s.add(m)\n }\n print(ans)\n\n\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1267, "cpu_time_ms": 2209, "memory_kb": 90684}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s321469760", "group_id": "codeNet:p02642", "input_text": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun Iterable.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\nfun Array.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\nfun main() {\n val N = nextInt()\n val A = nextIntList()\n val B = IntArray(1000001) { 0 }\n for (i in A) {\n B[i]++\n if (B[i] > 1) continue\n for (j in i * 2..1000000 step i) {\n B[j]++\n }\n }\n println(A.count { B[it] == 1 })\n}", "language": "Kotlin", "metadata": {"date": 1592193644, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s321469760.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s321469760", "user_id": "u860789370"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun Iterable.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\nfun Array.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\nfun main() {\n val N = nextInt()\n val A = nextIntList()\n val B = IntArray(1000001) { 0 }\n for (i in A) {\n B[i]++\n if (B[i] > 1) continue\n for (j in i * 2..1000000 step i) {\n B[j]++\n }\n }\n println(A.count { B[it] == 1 })\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1107, "cpu_time_ms": 453, "memory_kb": 72824}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s405187694", "group_id": "codeNet:p02642", "input_text": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun Iterable.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\nfun Array.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\nfun main() {\n val N = nextInt()\n val A = nextIntList()\n val B = IntArray(1000001) { 0 }\n for (i in A) {\n B[i]++\n if (B[i] != 1) continue\n for (j in i * 2..100000 step i) {\n B[j]++\n }\n }\n println(A.count { B[it] == 1 })\n}", "language": "Kotlin", "metadata": {"date": 1592192993, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s405187694.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s405187694", "user_id": "u860789370"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun Iterable.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\nfun Array.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\nfun main() {\n val N = nextInt()\n val A = nextIntList()\n val B = IntArray(1000001) { 0 }\n for (i in A) {\n B[i]++\n if (B[i] != 1) continue\n for (j in i * 2..100000 step i) {\n B[j]++\n }\n }\n println(A.count { B[it] == 1 })\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1107, "cpu_time_ms": 442, "memory_kb": 72884}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s443053932", "group_id": "codeNet:p02642", "input_text": "fun main(args: Array) {\n var tmpLine = readLine()\n var tmps = tmpLine!!.split(\"\\\\s+\".toRegex())\n var n = tmps[0].toInt() \n\n tmpLine = readLine()\n tmps = tmpLine!!.split(\"\\\\s+\".toRegex())\n var aarray = tmps.map {it.toInt()}\n var result = 0\n for (i in 0..n-1) {\n var tmpCount = 0\n for (j in 0..n-1) {\n if (i == j) continue\n val ai = aarray[i]\n val aj = aarray[j]\n if (ai % aj == 0) {\n tmpCount++\n break\n }\n\n }\n if (tmpCount == 0) result++\n }\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1592190071, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s443053932.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s443053932", "user_id": "u294297802"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n var tmpLine = readLine()\n var tmps = tmpLine!!.split(\"\\\\s+\".toRegex())\n var n = tmps[0].toInt() \n\n tmpLine = readLine()\n tmps = tmpLine!!.split(\"\\\\s+\".toRegex())\n var aarray = tmps.map {it.toInt()}\n var result = 0\n for (i in 0..n-1) {\n var tmpCount = 0\n for (j in 0..n-1) {\n if (i == j) continue\n val ai = aarray[i]\n val aj = aarray[j]\n if (ai % aj == 0) {\n tmpCount++\n break\n }\n\n }\n if (tmpCount == 0) result++\n }\n println(result)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 609, "cpu_time_ms": 2208, "memory_kb": 66440}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s410768226", "group_id": "codeNet:p02642", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (0 until n).map { sc.next().toInt() }\n println(problem170d(n, a))\n}\n\nfun problem170d(n: Int, a: List): Int {\n val set = hashSetOf()\n for (i in 0 until n) {\n var flag = true\n for (j in i until n) {\n if (i == j) continue\n if (a[i] % a[j] == 0) {\n flag = false\n }\n }\n if (flag) set.add(i + 1)\n }\n return set.size - 1\n}", "language": "Kotlin", "metadata": {"date": 1592188768, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s410768226.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s410768226", "user_id": "u073232808"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (0 until n).map { sc.next().toInt() }\n println(problem170d(n, a))\n}\n\nfun problem170d(n: Int, a: List): Int {\n val set = hashSetOf()\n for (i in 0 until n) {\n var flag = true\n for (j in i until n) {\n if (i == j) continue\n if (a[i] % a[j] == 0) {\n flag = false\n }\n }\n if (flag) set.add(i + 1)\n }\n return set.size - 1\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 539, "cpu_time_ms": 2208, "memory_kb": 64884}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s159783725", "group_id": "codeNet:p02642", "input_text": "fun main() {\n val n = readLine()!!.toInt()\n if (n == 1) {\n println(1)\n return\n }\n\n val list = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n val mList = list.toMutableList()\n list.toSet()\n .asSequence()\n .filter { x -> list.count { it == x } > 1 }\n .forEach { x -> mList.removeIf { it % x == 0 } }\n var result = 0\n while (mList.isNotEmpty()) {\n val x = mList.removeAt(0)\n mList.removeIf { it % x == 0 }\n result += 1\n if (mList.isEmpty()) {\n break\n } else if (mList.size == 1) {\n result += 1\n break\n }\n\n if (mList.first() * 2 > mList.last()) {\n result += mList.size\n break\n }\n }\n\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1592188741, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s159783725.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s159783725", "user_id": "u897579945"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val n = readLine()!!.toInt()\n if (n == 1) {\n println(1)\n return\n }\n\n val list = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n val mList = list.toMutableList()\n list.toSet()\n .asSequence()\n .filter { x -> list.count { it == x } > 1 }\n .forEach { x -> mList.removeIf { it % x == 0 } }\n var result = 0\n while (mList.isNotEmpty()) {\n val x = mList.removeAt(0)\n mList.removeIf { it % x == 0 }\n result += 1\n if (mList.isEmpty()) {\n break\n } else if (mList.size == 1) {\n result += 1\n break\n }\n\n if (mList.first() * 2 > mList.last()) {\n result += mList.size\n break\n }\n }\n\n println(result)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 779, "cpu_time_ms": 2208, "memory_kb": 78760}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s516067642", "group_id": "codeNet:p02642", "input_text": "import kotlin.math.sqrt\n\nfun main(){\n val n = readLine()!!.split(\" \")[0].toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n val ansList = mutableListOf()\n var ans = 0\n for (i in 0 until n){\n if (i != n - 1 && a[i] == a[i + 1]){\n ansList.add(a[i])\n continue\n } else {\n val yakusu = mutableListOf()\n for (j in 2 until sqrt(a[i].toFloat()).toInt() + 1){\n if (a[i] % j == 0) {\n yakusu += j\n if (j != a[i] / j){\n yakusu.add(a[i] / j)\n }\n }\n }\n yakusu.add(a[i])\n val kosuu = yakusu.size\n fun binary_search(key: Int) :Int {\n var left = -1\n var right = ansList.size\n while (right - left > 1){\n var mid = (right + left) / 2\n if (ansList[mid] <= key) left = mid\n else right = mid\n }\n return left\n }\n var flag = 0\n for (j in 0 until kosuu){\n val x = binary_search(yakusu[j])\n if (x != -1 && ansList[x] == yakusu[j]){\n flag = 1\n break\n } else if (x != ansList.size - 1 && ansList[x + 1] == yakusu[j]){\n flag = 1\n break\n }\n }\n if (flag == 1){\n continue\n } else {\n ansList.add(a[i])\n ans++\n }\n }\n }\n println(ans)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1592188502, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s516067642.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s516067642", "user_id": "u385678999"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import kotlin.math.sqrt\n\nfun main(){\n val n = readLine()!!.split(\" \")[0].toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n val ansList = mutableListOf()\n var ans = 0\n for (i in 0 until n){\n if (i != n - 1 && a[i] == a[i + 1]){\n ansList.add(a[i])\n continue\n } else {\n val yakusu = mutableListOf()\n for (j in 2 until sqrt(a[i].toFloat()).toInt() + 1){\n if (a[i] % j == 0) {\n yakusu += j\n if (j != a[i] / j){\n yakusu.add(a[i] / j)\n }\n }\n }\n yakusu.add(a[i])\n val kosuu = yakusu.size\n fun binary_search(key: Int) :Int {\n var left = -1\n var right = ansList.size\n while (right - left > 1){\n var mid = (right + left) / 2\n if (ansList[mid] <= key) left = mid\n else right = mid\n }\n return left\n }\n var flag = 0\n for (j in 0 until kosuu){\n val x = binary_search(yakusu[j])\n if (x != -1 && ansList[x] == yakusu[j]){\n flag = 1\n break\n } else if (x != ansList.size - 1 && ansList[x + 1] == yakusu[j]){\n flag = 1\n break\n }\n }\n if (flag == 1){\n continue\n } else {\n ansList.add(a[i])\n ans++\n }\n }\n }\n println(ans)\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1661, "cpu_time_ms": 1762, "memory_kb": 75644}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s532522310", "group_id": "codeNet:p02642", "input_text": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val AList = readLine()!!.split(\" \").map(String::toInt)\n \n var judgCount = 0\n \n for (n in 0 until N) {\n var judg = 0\n for (i in 0 until N) {\n if (n != i) {\n if (AList[n] % AList[i] == 0) {\n judg = 1\n break\n }\n }\n }\n \n judgCount += judg\n }\n println(N - judgCount)\n}\n", "language": "Kotlin", "metadata": {"date": 1592188322, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s532522310.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s532522310", "user_id": "u952914882"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val AList = readLine()!!.split(\" \").map(String::toInt)\n \n var judgCount = 0\n \n for (n in 0 until N) {\n var judg = 0\n for (i in 0 until N) {\n if (n != i) {\n if (AList[n] % AList[i] == 0) {\n judg = 1\n break\n }\n }\n }\n \n judgCount += judg\n }\n println(N - judgCount)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 476, "cpu_time_ms": 2208, "memory_kb": 65188}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s854532310", "group_id": "codeNet:p02642", "input_text": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val AList = readLine()!!.split(\" \")\n \n var judgCount = 0\n \n for (n in 0 until N) {\n var judg = 0\n for (i in 0 until N) {\n if (n != i) {\n if (AList[n].toInt() % AList[i].toInt() == 0) {\n judg = 1\n break\n }\n }\n }\n \n judgCount += judg\n }\n println(N - judgCount)\n}\n", "language": "Kotlin", "metadata": {"date": 1592187856, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s854532310.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s854532310", "user_id": "u952914882"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val AList = readLine()!!.split(\" \")\n \n var judgCount = 0\n \n for (n in 0 until N) {\n var judg = 0\n for (i in 0 until N) {\n if (n != i) {\n if (AList[n].toInt() % AList[i].toInt() == 0) {\n judg = 1\n break\n }\n }\n }\n \n judgCount += judg\n }\n println(N - judgCount)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 473, "cpu_time_ms": 2208, "memory_kb": 64456}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s183607774", "group_id": "codeNet:p02642", "input_text": "fun main() {\n val n = readLine()!!.toInt()\n\n val aList = readLine()!!.split(\" \").map { it.toInt() }\n\n var result = 0\n for (i in 0 until aList.size) {\n var tmp = false\n for (j in 0 until aList.size) {\n if (i == j) {\n continue\n }\n\n if ( aList[i] % aList[j] == 0) {\n tmp = true\n }\n }\n\n if (!tmp) {\n result += 1\n }\n }\n\n print(result)\n}", "language": "Kotlin", "metadata": {"date": 1592187627, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s183607774.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s183607774", "user_id": "u542748657"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val n = readLine()!!.toInt()\n\n val aList = readLine()!!.split(\" \").map { it.toInt() }\n\n var result = 0\n for (i in 0 until aList.size) {\n var tmp = false\n for (j in 0 until aList.size) {\n if (i == j) {\n continue\n }\n\n if ( aList[i] % aList[j] == 0) {\n tmp = true\n }\n }\n\n if (!tmp) {\n result += 1\n }\n }\n\n print(result)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 469, "cpu_time_ms": 2208, "memory_kb": 65516}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s341141213", "group_id": "codeNet:p02642", "input_text": "fun main() {\n var x = readLine()!!.toInt()\n var arr = readLine()!!.split(\" \").map { it.toInt() }.toIntArray().sorted()\n var count = 0\n \n arr.forEachIndexed { i,_ ->\n var yes = true\n arr.forEachIndexed { j, _ ->\n if (j < i && arr[i] % arr[j] == 0)\n yes = false\n }\n if (yes)\n count++\n }\n \n println(count)\n}", "language": "Kotlin", "metadata": {"date": 1592187598, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s341141213.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s341141213", "user_id": "u702770355"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n var x = readLine()!!.toInt()\n var arr = readLine()!!.split(\" \").map { it.toInt() }.toIntArray().sorted()\n var count = 0\n \n arr.forEachIndexed { i,_ ->\n var yes = true\n arr.forEachIndexed { j, _ ->\n if (j < i && arr[i] % arr[j] == 0)\n yes = false\n }\n if (yes)\n count++\n }\n \n println(count)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 387, "cpu_time_ms": 2208, "memory_kb": 72180}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s178450474", "group_id": "codeNet:p02642", "input_text": "fun main() {\n val n = readLine()!!.toInt()\n if (n == 1) {\n println(1)\n return\n }\n\n val list = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n val mList = list.toMutableList()\n var result = 0\n while (mList.isNotEmpty()) {\n val x = mList.removeAt(0)\n val isDuplicate = x == mList[1]\n mList.removeIf { it % x == 0 }\n if (isDuplicate) {\n break\n }\n result += 1\n if (mList.size == 1) {\n result += 1\n break\n }\n\n if (mList.first() * 2 > mList.last()) {\n result += mList.size\n break\n }\n }\n\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1592187197, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s178450474.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s178450474", "user_id": "u897579945"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val n = readLine()!!.toInt()\n if (n == 1) {\n println(1)\n return\n }\n\n val list = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n val mList = list.toMutableList()\n var result = 0\n while (mList.isNotEmpty()) {\n val x = mList.removeAt(0)\n val isDuplicate = x == mList[1]\n mList.removeIf { it % x == 0 }\n if (isDuplicate) {\n break\n }\n result += 1\n if (mList.size == 1) {\n result += 1\n break\n }\n\n if (mList.first() * 2 > mList.last()) {\n result += mList.size\n break\n }\n }\n\n println(result)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 670, "cpu_time_ms": 2207, "memory_kb": 66244}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s626136387", "group_id": "codeNet:p02642", "input_text": "import java.util.ArrayDeque\n\n//\n\nfun main() {\n abc170d()\n}\n\nfun abc170d() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val unique = a.toSet()\n val sortedUnique = unique.sorted()\n val queue = ArrayDeque(sortedUnique)\n val itemCount = a.groupingBy { it }.eachCount()\n var count = 0\n while (queue.isNotEmpty()) {\n val t = queue.poll()\n if (itemCount[t] == 1) count++\n val size = queue.size\n repeat(size) {\n val j = queue.poll()\n if (j % t != 0) {\n queue.add(j)\n }\n }\n }\n println(count)\n}", "language": "Kotlin", "metadata": {"date": 1592187180, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s626136387.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s626136387", "user_id": "u628907033"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.ArrayDeque\n\n//\n\nfun main() {\n abc170d()\n}\n\nfun abc170d() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val unique = a.toSet()\n val sortedUnique = unique.sorted()\n val queue = ArrayDeque(sortedUnique)\n val itemCount = a.groupingBy { it }.eachCount()\n var count = 0\n while (queue.isNotEmpty()) {\n val t = queue.poll()\n if (itemCount[t] == 1) count++\n val size = queue.size\n repeat(size) {\n val j = queue.poll()\n if (j % t != 0) {\n queue.add(j)\n }\n }\n }\n println(count)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 640, "cpu_time_ms": 2209, "memory_kb": 92784}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s925236019", "group_id": "codeNet:p02642", "input_text": "private fun readLn() = readLine()!!\nprivate fun readInt() = readLn().toInt()\nprivate fun readStrings() = readLn().split(\" \")\nprivate fun readInts() = readStrings().map(String::toInt)\nprivate fun readStrings2() = readLn().split(\"\").filter { it.isNotEmpty() }\nprivate fun readInts2() = readStrings2().map(String::toInt)\nprivate fun initArray(n:Int, v:String) = Array(n) { v }\nprivate fun initIntArray(n:Int, v:Int) = IntArray(n) { v }\n\nfun main(args: Array) {\n val N = readInt()\n val A = readInts().sorted().reversed()\n var count = 0\n\n for (i in 0 until N-1) {\n var flag = true\n for (j in i+1 until N) {\n val tmp = A[i]%A[j]\n if(tmp == 0) {\n flag = false\n break\n }\n }\n if (flag) {\n count += 1\n }\n }\n if(A[N-2] != A[N-1]) {\n count += 1\n }\n println(count)\n}", "language": "Kotlin", "metadata": {"date": 1592186733, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s925236019.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s925236019", "user_id": "u371560174"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "private fun readLn() = readLine()!!\nprivate fun readInt() = readLn().toInt()\nprivate fun readStrings() = readLn().split(\" \")\nprivate fun readInts() = readStrings().map(String::toInt)\nprivate fun readStrings2() = readLn().split(\"\").filter { it.isNotEmpty() }\nprivate fun readInts2() = readStrings2().map(String::toInt)\nprivate fun initArray(n:Int, v:String) = Array(n) { v }\nprivate fun initIntArray(n:Int, v:Int) = IntArray(n) { v }\n\nfun main(args: Array) {\n val N = readInt()\n val A = readInts().sorted().reversed()\n var count = 0\n\n for (i in 0 until N-1) {\n var flag = true\n for (j in i+1 until N) {\n val tmp = A[i]%A[j]\n if(tmp == 0) {\n flag = false\n break\n }\n }\n if (flag) {\n count += 1\n }\n }\n if(A[N-2] != A[N-1]) {\n count += 1\n }\n println(count)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 901, "cpu_time_ms": 2208, "memory_kb": 66392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s928434542", "group_id": "codeNet:p02642", "input_text": "fun main(args: Array) {\n val numCount = readLine()!!.toInt()\n var numbers = readLine()!!.split(' ').map { it.toInt() }.toIntArray()\n\n var ans = 0\n numbers.forEachIndexed numLoop@ {i, num ->\n numbers.forEachIndexed checkLoop@ { j, check ->\n if(i == j) return@checkLoop\n if(num % check == 0) {\n ans++\n return@numLoop\n }\n }\n }\n println(numCount - ans)\n }", "language": "Kotlin", "metadata": {"date": 1592186267, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s928434542.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s928434542", "user_id": "u157933935"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val numCount = readLine()!!.toInt()\n var numbers = readLine()!!.split(' ').map { it.toInt() }.toIntArray()\n\n var ans = 0\n numbers.forEachIndexed numLoop@ {i, num ->\n numbers.forEachIndexed checkLoop@ { j, check ->\n if(i == j) return@checkLoop\n if(num % check == 0) {\n ans++\n return@numLoop\n }\n }\n }\n println(numCount - ans)\n }", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 510, "cpu_time_ms": 2208, "memory_kb": 65196}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s605722307", "group_id": "codeNet:p02642", "input_text": "import java.io.*\nimport java.util.*\nimport kotlin.math.*\n\nfun main(){\n\tval f = BufferedReader(InputStreamReader(System.`in`))\n\n\tval n = f.readLine().toInt()\n\tval array = f.readLine().split(\" \").map{it.toInt()}.toIntArray().sorted()\n\n\tval MAXA = 1000005\n\tval remaining = BooleanArray(MAXA){true}\n\n\tvar answer = 0\n\tfor(k in 0 until n){\n\t\tif(remaining[array[k]] && !(k < n-1 && array[k+1] == array[k])) answer++\n\t\tif(k > 0 && array[k-1] == array[k]) continue\n\t\tfor(j in array[k] until MAXA step array[k]) remaining[j] = false\n\t}\n\n\tprintln(answer)\n\n}\n", "language": "Kotlin", "metadata": {"date": 1592186036, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s605722307.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s605722307", "user_id": "u140923503"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.*\nimport java.util.*\nimport kotlin.math.*\n\nfun main(){\n\tval f = BufferedReader(InputStreamReader(System.`in`))\n\n\tval n = f.readLine().toInt()\n\tval array = f.readLine().split(\" \").map{it.toInt()}.toIntArray().sorted()\n\n\tval MAXA = 1000005\n\tval remaining = BooleanArray(MAXA){true}\n\n\tvar answer = 0\n\tfor(k in 0 until n){\n\t\tif(remaining[array[k]] && !(k < n-1 && array[k+1] == array[k])) answer++\n\t\tif(k > 0 && array[k-1] == array[k]) continue\n\t\tfor(j in array[k] until MAXA step array[k]) remaining[j] = false\n\t}\n\n\tprintln(answer)\n\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 547, "cpu_time_ms": 710, "memory_kb": 70468}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s814850610", "group_id": "codeNet:p02642", "input_text": "//\n\nfun main() {\n abc170d()\n}\n\nfun abc170d() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val unique = a.toSet()\n val sortedUnique = unique.sorted()\n val itemCount = a.groupingBy { it }.eachCount()\n var count = 0\n for (i in sortedUnique.lastIndex downTo 0) {\n if (itemCount[sortedUnique[i]] != 1) continue\n var found = false\n for (j in 0 until i) {\n if (sortedUnique[i] % sortedUnique[j] == 0) {\n found = true\n break\n }\n }\n if (!found) count += itemCount[sortedUnique[i]]!!\n }\n println(count)\n}", "language": "Kotlin", "metadata": {"date": 1592185677, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s814850610.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s814850610", "user_id": "u628907033"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "//\n\nfun main() {\n abc170d()\n}\n\nfun abc170d() {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val unique = a.toSet()\n val sortedUnique = unique.sorted()\n val itemCount = a.groupingBy { it }.eachCount()\n var count = 0\n for (i in sortedUnique.lastIndex downTo 0) {\n if (itemCount[sortedUnique[i]] != 1) continue\n var found = false\n for (j in 0 until i) {\n if (sortedUnique[i] % sortedUnique[j] == 0) {\n found = true\n break\n }\n }\n if (!found) count += itemCount[sortedUnique[i]]!!\n }\n println(count)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 651, "cpu_time_ms": 2209, "memory_kb": 92480}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s934818850", "group_id": "codeNet:p02642", "input_text": "fun main() {\n val N = readLine()!!.toInt()\n val A = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n\n if (N == 1) {\n println(0)\n return\n }\n\n val a = mutableListOf()\n val b = mutableListOf()\n a.add(A[0])\n var flag2 = A[0] == 2\n for (i in 1 until N) {\n if (A[i] == 2) flag2 = true\n if (a.all { A[i] % it != 0 }) {\n a.add(A[i])\n } else if (a.contains(A[i])) {\n b.add(A[i])\n }\n }\n println(a.count { !b.contains(it) })\n}", "language": "Kotlin", "metadata": {"date": 1592185541, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s934818850.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s934818850", "user_id": "u771276989"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val N = readLine()!!.toInt()\n val A = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n\n if (N == 1) {\n println(0)\n return\n }\n\n val a = mutableListOf()\n val b = mutableListOf()\n a.add(A[0])\n var flag2 = A[0] == 2\n for (i in 1 until N) {\n if (A[i] == 2) flag2 = true\n if (a.all { A[i] % it != 0 }) {\n a.add(A[i])\n } else if (a.contains(A[i])) {\n b.add(A[i])\n }\n }\n println(a.count { !b.contains(it) })\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 526, "cpu_time_ms": 2208, "memory_kb": 70216}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s383040061", "group_id": "codeNet:p02642", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n var one = 0\n val a = readLine()!!.split(' ').map {\n val num = it.toInt()\n if (num == 1) one++\n num\n }.sortedDescending()\n\n if (one == 0) {\n var ans = n\n for (i in 0 until n) {\n for (j in i + 1 until n) {\n if (a[i] % a[j] == 0) {\n ans--\n break\n }\n }\n }\n println(ans)\n } else {\n if (one == 1) println(1)\n else println(0)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1592185239, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s383040061.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s383040061", "user_id": "u288435405"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n var one = 0\n val a = readLine()!!.split(' ').map {\n val num = it.toInt()\n if (num == 1) one++\n num\n }.sortedDescending()\n\n if (one == 0) {\n var ans = n\n for (i in 0 until n) {\n for (j in i + 1 until n) {\n if (a[i] % a[j] == 0) {\n ans--\n break\n }\n }\n }\n println(ans)\n } else {\n if (one == 1) println(1)\n else println(0)\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 561, "cpu_time_ms": 2208, "memory_kb": 66352}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s369276608", "group_id": "codeNet:p02642", "input_text": "import java.util.Scanner\n\nfun main(args: Array) {\n val cin = Scanner(System.`in`)\n val n = cin.nextInt()\n var a = Array(n + 5, {0})\n\n for (i in 0 until n) {\n a[i] = cin.nextInt()\n }\n\n var ct = 0\n for (i in 0 until n) {\n var f = false\n for (j in 0 until n) {\n if (a[i] != a[j] && a[i] % a[j] == 0) {\n f = true\n break\n }\n }\n\n if (!f) {\n ct++\n }\n }\n\n println(ct)\n\n cin.close()\n}", "language": "Kotlin", "metadata": {"date": 1592185170, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s369276608.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s369276608", "user_id": "u194575259"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.Scanner\n\nfun main(args: Array) {\n val cin = Scanner(System.`in`)\n val n = cin.nextInt()\n var a = Array(n + 5, {0})\n\n for (i in 0 until n) {\n a[i] = cin.nextInt()\n }\n\n var ct = 0\n for (i in 0 until n) {\n var f = false\n for (j in 0 until n) {\n if (a[i] != a[j] && a[i] % a[j] == 0) {\n f = true\n break\n }\n }\n\n if (!f) {\n ct++\n }\n }\n\n println(ct)\n\n cin.close()\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 445, "cpu_time_ms": 2209, "memory_kb": 63640}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s889607820", "group_id": "codeNet:p02642", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n var count = n\n for (i in 1..n) {\n for (j in 1..n) {\n if (i == j) continue\n if (a[i-1] % a[j-1] == 0) {\n count--\n break\n }\n }\n }\n println(count)\n}\n", "language": "Kotlin", "metadata": {"date": 1592184488, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s889607820.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s889607820", "user_id": "u172820018"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n var count = n\n for (i in 1..n) {\n for (j in 1..n) {\n if (i == j) continue\n if (a[i-1] % a[j-1] == 0) {\n count--\n break\n }\n }\n }\n println(count)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 356, "cpu_time_ms": 2208, "memory_kb": 65016}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s973519040", "group_id": "codeNet:p02642", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val n = sc.nextInt()\n val a = Array(n) { sc.nextInt() }\n val count = mutableMapOf()\n for (i in 0 until n) {\n count[a[i]] = (count[a[i]] ?: 0) + 1\n }\n val ok = BitSet(1000005)\n for (i in 0 until n) {\n ok[a[i]] = true\n }\n a.sort()\n var ans = 0\n for (i in 0 until n) {\n if (ok[a[i]] && count[a[i]]!! == 1) {\n ans++\n }\n if (ok[a[i]]) {\n var j = 2\n while (a[i] * j < 1000005) {\n ok[a[i] * j] = false\n j++\n }\n }\n }\n println(ans)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}", "language": "Kotlin", "metadata": {"date": 1592183723, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s973519040.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s973519040", "user_id": "u190507186"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val n = sc.nextInt()\n val a = Array(n) { sc.nextInt() }\n val count = mutableMapOf()\n for (i in 0 until n) {\n count[a[i]] = (count[a[i]] ?: 0) + 1\n }\n val ok = BitSet(1000005)\n for (i in 0 until n) {\n ok[a[i]] = true\n }\n a.sort()\n var ans = 0\n for (i in 0 until n) {\n if (ok[a[i]] && count[a[i]]!! == 1) {\n ans++\n }\n if (ok[a[i]]) {\n var j = 2\n while (a[i] * j < 1000005) {\n ok[a[i] * j] = false\n j++\n }\n }\n }\n println(ans)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1395, "cpu_time_ms": 2207, "memory_kb": 72524}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s529004651", "group_id": "codeNet:p02642", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val n = sc.nextInt()\n val a = Array(n) { sc.nextInt() }\n val count = mutableMapOf()\n for (i in 0 until n) {\n count[a[i]] = (count[a[i]] ?: 0) + 1\n }\n val ok = BitSet(1000005)\n for (i in 0 until n) {\n ok[a[i]] = true\n }\n a.sort()\n var ans = 0\n for (i in 0 until n) {\n if (ok[a[i]] && count[a[i]]!! == 1) {\n ans++\n }\n var j = 2\n while (a[i] * j < 1000005) {\n ok[a[i] * j] = false\n j++\n }\n }\n println(ans)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}", "language": "Kotlin", "metadata": {"date": 1592183631, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02642.html", "problem_id": "p02642", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02642/input.txt", "sample_output_relpath": "derived/input_output/data/p02642/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02642/Kotlin/s529004651.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s529004651", "user_id": "u190507186"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val n = sc.nextInt()\n val a = Array(n) { sc.nextInt() }\n val count = mutableMapOf()\n for (i in 0 until n) {\n count[a[i]] = (count[a[i]] ?: 0) + 1\n }\n val ok = BitSet(1000005)\n for (i in 0 until n) {\n ok[a[i]] = true\n }\n a.sort()\n var ans = 0\n for (i in 0 until n) {\n if (ok[a[i]] && count[a[i]]!! == 1) {\n ans++\n }\n var j = 2\n while (a[i] * j < 1000005) {\n ok[a[i] * j] = false\n j++\n }\n }\n println(ans)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "sample_input": "5\n24 11 8 3 16\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02642", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a number sequence A of length N.\n\nFind the number of integers i \\left(1 \\leq i \\leq N\\right) with the following property:\n\nFor every integer j \\left(1 \\leq j \\leq N\\right) such that i \\neq j , A_j does not divide A_i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n24 11 8 3 16\n\nSample Output 1\n\n3\n\nThe integers with the property are 2, 3, and 4.\n\nSample Input 2\n\n4\n5 5 5 5\n\nSample Output 2\n\n0\n\nNote that there can be multiple equal numbers.\n\nSample Input 3\n\n10\n33 18 45 28 8 19 89 86 2 4\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1341, "cpu_time_ms": 2207, "memory_kb": 72228}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s975075346", "group_id": "codeNet:p02658", "input_text": "import kotlin.math.*\n\nfun main() {\n\n val n = readLine()!!.toInt()\n\n val list = readLine()!!.split(\" \").map(String::toLong)\n\n var ans: Long = 1\n\n val limit = 10.0.pow(18).toLong()\n\n for (i in 0..n-1){\n ans *= list[i]\n }\n\n if (ans > limit){\n ans = -1\n }\n\n println(ans)\n\n}", "language": "Kotlin", "metadata": {"date": 1597255812, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s975075346.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s975075346", "user_id": "u592533051"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import kotlin.math.*\n\nfun main() {\n\n val n = readLine()!!.toInt()\n\n val list = readLine()!!.split(\" \").map(String::toLong)\n\n var ans: Long = 1\n\n val limit = 10.0.pow(18).toLong()\n\n for (i in 0..n-1){\n ans *= list[i]\n }\n\n if (ans > limit){\n ans = -1\n }\n\n println(ans)\n\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 310, "cpu_time_ms": 363, "memory_kb": 61624}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s377238712", "group_id": "codeNet:p02658", "input_text": "fun main() {\n val n: Int = readLine()!!.toInt()\n val list: List = readLine()!!.split(\" \").map { it.toLong() }\n var ans: Long = 1\n for (i in list) {\n ans *= i\n }\n if (ans <= Math.pow(10.0, 18.0).toLong()) {\n println(ans)\n }\n else {\n println(-1)\n }\n}", "language": "Kotlin", "metadata": {"date": 1594866868, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s377238712.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s377238712", "user_id": "u693945629"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main() {\n val n: Int = readLine()!!.toInt()\n val list: List = readLine()!!.split(\" \").map { it.toLong() }\n var ans: Long = 1\n for (i in list) {\n ans *= i\n }\n if (ans <= Math.pow(10.0, 18.0).toLong()) {\n println(ans)\n }\n else {\n println(-1)\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 302, "cpu_time_ms": 355, "memory_kb": 61772}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s237447157", "group_id": "codeNet:p02658", "input_text": "fun main() {\n val n: Int = readLine()!!.toInt()\n val list: List = readLine()!!.split(\" \").map { it.toLong() }\n var ans: Long = 1\n for (i in list) {\n ans *= i\n }\n if (ans > Math.pow(10.0, 18.0).toLong()) {\n println(-1)\n }\n else {\n println(ans)\n }\n}", "language": "Kotlin", "metadata": {"date": 1594866221, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s237447157.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s237447157", "user_id": "u693945629"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main() {\n val n: Int = readLine()!!.toInt()\n val list: List = readLine()!!.split(\" \").map { it.toLong() }\n var ans: Long = 1\n for (i in list) {\n ans *= i\n }\n if (ans > Math.pow(10.0, 18.0).toLong()) {\n println(-1)\n }\n else {\n println(ans)\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 301, "cpu_time_ms": 359, "memory_kb": 61316}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s075371074", "group_id": "codeNet:p02658", "input_text": "fun main (args:Array) {\n val n = readLine()!!.toInt()\n val list = readLine()!!.split(\" \").map(String::toLong)\n var ans = 1L\n if(0 in list) {\n print(0)\n return\n }\n for (i in 0..n-1){\n if(list[i] <= 1000000000000000000/ans){\n ans *= list[i]\n }\n else{\n print(\"-1\")\n return\n }\n }\n// list.forEach{\n// if(ans * it <= 1000000000000000000/1){\n// ans *= it\n// }\n// else{\n// print(\"-1\")\n// return\n// }\n// }\n print(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1593797457, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s075371074.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s075371074", "user_id": "u800824593"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main (args:Array) {\n val n = readLine()!!.toInt()\n val list = readLine()!!.split(\" \").map(String::toLong)\n var ans = 1L\n if(0 in list) {\n print(0)\n return\n }\n for (i in 0..n-1){\n if(list[i] <= 1000000000000000000/ans){\n ans *= list[i]\n }\n else{\n print(\"-1\")\n return\n }\n }\n// list.forEach{\n// if(ans * it <= 1000000000000000000/1){\n// ans *= it\n// }\n// else{\n// print(\"-1\")\n// return\n// }\n// }\n print(ans)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 585, "cpu_time_ms": 367, "memory_kb": 61616}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s067603994", "group_id": "codeNet:p02658", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toLong() }\n if (0L in a) return println(0)\n var answer = 1L\n for (i in 0 until n) {\n val j = answer\n answer *= a[i]\n if (answer > 1_000_000_000_000_000_000 || answer / a[i] != j) return println(-1)\n }\n println(answer)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1592272657, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s067603994.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s067603994", "user_id": "u172820018"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toLong() }\n if (0L in a) return println(0)\n var answer = 1L\n for (i in 0 until n) {\n val j = answer\n answer *= a[i]\n if (answer > 1_000_000_000_000_000_000 || answer / a[i] != j) return println(-1)\n }\n println(answer)\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 367, "cpu_time_ms": 361, "memory_kb": 61524}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s783324041", "group_id": "codeNet:p02658", "input_text": "import java.math.BigInteger\n\nfun main(){\n readLine()\n val input = readLine()!!.split(\" \").map { it.toLong() }\n var result:BigInteger = BigInteger.valueOf(1)\n val max:BigInteger = BigInteger.valueOf( 1000000000000000000)\n\n if (input.isEmpty()){\n println(0)\n return\n }\n if (input.contains(0)) {\n println(0)\n return\n }\n input.forEach {\n result = result.multiply(BigInteger.valueOf(it))\n if (result > max) {\n println(-1)\n return\n }\n }\n println(result)\n}\n", "language": "Kotlin", "metadata": {"date": 1591638478, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s783324041.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s783324041", "user_id": "u856032619"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.math.BigInteger\n\nfun main(){\n readLine()\n val input = readLine()!!.split(\" \").map { it.toLong() }\n var result:BigInteger = BigInteger.valueOf(1)\n val max:BigInteger = BigInteger.valueOf( 1000000000000000000)\n\n if (input.isEmpty()){\n println(0)\n return\n }\n if (input.contains(0)) {\n println(0)\n return\n }\n input.forEach {\n result = result.multiply(BigInteger.valueOf(it))\n if (result > max) {\n println(-1)\n return\n }\n }\n println(result)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 554, "cpu_time_ms": 354, "memory_kb": 63176}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s731833422", "group_id": "codeNet:p02658", "input_text": "fun main(){\n readLine()\n val input = readLine()!!.split(\" \").map { it.toLong() }\n var result:Long = 1\n val max:Long = 1000000000000000000\n\n if (input.isEmpty()){\n println(0)\n return\n }\n if (input.contains(0)) {\n println(0)\n return\n }\n input.forEach {\n result *= it\n if (result > max) {\n println(-1)\n return\n }\n }\n println(result)\n}\n", "language": "Kotlin", "metadata": {"date": 1591637387, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s731833422.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s731833422", "user_id": "u856032619"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main(){\n readLine()\n val input = readLine()!!.split(\" \").map { it.toLong() }\n var result:Long = 1\n val max:Long = 1000000000000000000\n\n if (input.isEmpty()){\n println(0)\n return\n }\n if (input.contains(0)) {\n println(0)\n return\n }\n input.forEach {\n result *= it\n if (result > max) {\n println(-1)\n return\n }\n }\n println(result)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 436, "cpu_time_ms": 373, "memory_kb": 62964}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s382914799", "group_id": "codeNet:p02658", "input_text": "import java.math.BigInteger\nimport kotlin.math.pow\n\nfun main() {\n val n = readInt()\n val aList = readListLong()\n var result = BigInteger.ONE\n aList.forEach {\n result = result.multiply(BigInteger.valueOf(it))\n if (result > BigInteger.valueOf((10.0.pow(18)).toLong())) {\n println(\"-1\")\n return\n }\n }\n println(result)\n}\n\nprivate fun read() = readLine()!!\n\nprivate fun readInt() = read().toInt()\n\nprivate fun readLong() = read().toLong()\n\nprivate fun readDouble() = read().toDouble()\n\nprivate fun readListString() = read().split(\" \")\n\nprivate fun readListInt() = readListString().map { it.toInt() }\n\nprivate fun readListLong() = readListString().map { it.toLong() }\n\nprivate fun readListDouble() = readListString().map { it.toDouble() }\n\nprivate fun readMatrixString(n: Int): List> {\n val matrix = mutableListOf>()\n for (i in 0 until n) {\n val list = readListString()\n matrix.add(list)\n }\n return matrix\n}\n\nprivate fun readMatrixInt(n: Int): List> {\n val matrix = mutableListOf>()\n for (i in 0 until n) {\n val list = readListInt()\n matrix.add(list)\n }\n return matrix\n}\n\nprivate fun readMatrixDouble(n: Int): List> {\n val matrix = mutableListOf>()\n for (i in 0 until n) {\n val list = readListDouble()\n matrix.add(list)\n }\n return matrix\n}\n\nprivate fun readMatrixLong(n: Int): List> {\n val matrix = mutableListOf>()\n for (i in 0 until n) {\n val list = readListLong()\n matrix.add(list)\n }\n return matrix\n}\n\n", "language": "Kotlin", "metadata": {"date": 1591596100, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s382914799.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s382914799", "user_id": "u698000453"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.math.BigInteger\nimport kotlin.math.pow\n\nfun main() {\n val n = readInt()\n val aList = readListLong()\n var result = BigInteger.ONE\n aList.forEach {\n result = result.multiply(BigInteger.valueOf(it))\n if (result > BigInteger.valueOf((10.0.pow(18)).toLong())) {\n println(\"-1\")\n return\n }\n }\n println(result)\n}\n\nprivate fun read() = readLine()!!\n\nprivate fun readInt() = read().toInt()\n\nprivate fun readLong() = read().toLong()\n\nprivate fun readDouble() = read().toDouble()\n\nprivate fun readListString() = read().split(\" \")\n\nprivate fun readListInt() = readListString().map { it.toInt() }\n\nprivate fun readListLong() = readListString().map { it.toLong() }\n\nprivate fun readListDouble() = readListString().map { it.toDouble() }\n\nprivate fun readMatrixString(n: Int): List> {\n val matrix = mutableListOf>()\n for (i in 0 until n) {\n val list = readListString()\n matrix.add(list)\n }\n return matrix\n}\n\nprivate fun readMatrixInt(n: Int): List> {\n val matrix = mutableListOf>()\n for (i in 0 until n) {\n val list = readListInt()\n matrix.add(list)\n }\n return matrix\n}\n\nprivate fun readMatrixDouble(n: Int): List> {\n val matrix = mutableListOf>()\n for (i in 0 until n) {\n val list = readListDouble()\n matrix.add(list)\n }\n return matrix\n}\n\nprivate fun readMatrixLong(n: Int): List> {\n val matrix = mutableListOf>()\n for (i in 0 until n) {\n val list = readListLong()\n matrix.add(list)\n }\n return matrix\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1659, "cpu_time_ms": 366, "memory_kb": 63096}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s972842912", "group_id": "codeNet:p02658", "input_text": "import kotlin.math.pow\n\nfun main() {\n val amount = readLine()\n val numbers = readLine()\n val numbers2 = numbers?.split(\" \")?.map { it.toLong() }?.toList()\n\n if (numbers2 != null) {\n var result = 1L\n for (item in numbers2) {\n result *= item\n }\n if (result > 1000000000000000000)\n println(\"0\")\n else\n println(result)\n }\n}", "language": "Kotlin", "metadata": {"date": 1591562256, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s972842912.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s972842912", "user_id": "u124420353"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import kotlin.math.pow\n\nfun main() {\n val amount = readLine()\n val numbers = readLine()\n val numbers2 = numbers?.split(\" \")?.map { it.toLong() }?.toList()\n\n if (numbers2 != null) {\n var result = 1L\n for (item in numbers2) {\n result *= item\n }\n if (result > 1000000000000000000)\n println(\"0\")\n else\n println(result)\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 402, "cpu_time_ms": 358, "memory_kb": 63036}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s053878850", "group_id": "codeNet:p02658", "input_text": "import kotlin.math.pow\nimport kotlin.system.exitProcess\n\nfun main() {\n val numberOfNumbers = readLine()?.toInt()\n\n if (numberOfNumbers != null) {\n if(numberOfNumbers <= 2 || numberOfNumbers > 10.0.pow(15.0)) {\n println(\"0\")\n } else {\n val numbers = readLine()\n val numbers2 = numbers?.split(\" \")?.map { it.toLong() }\n multiply(numbers2)\n }\n }\n}\n\nfun multiply(numbersToBeMultiplied: List?) {\n var result = 1L\n\n if (numbersToBeMultiplied != null) {\n for (item in numbersToBeMultiplied) {\n result *= item\n }\n }\n\n return if (result > 10.0.pow(18.0))\n println(\"-1\")\n else\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1591561030, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s053878850.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s053878850", "user_id": "u124420353"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import kotlin.math.pow\nimport kotlin.system.exitProcess\n\nfun main() {\n val numberOfNumbers = readLine()?.toInt()\n\n if (numberOfNumbers != null) {\n if(numberOfNumbers <= 2 || numberOfNumbers > 10.0.pow(15.0)) {\n println(\"0\")\n } else {\n val numbers = readLine()\n val numbers2 = numbers?.split(\" \")?.map { it.toLong() }\n multiply(numbers2)\n }\n }\n}\n\nfun multiply(numbersToBeMultiplied: List?) {\n var result = 1L\n\n if (numbersToBeMultiplied != null) {\n for (item in numbersToBeMultiplied) {\n result *= item\n }\n }\n\n return if (result > 10.0.pow(18.0))\n println(\"-1\")\n else\n println(result)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 718, "cpu_time_ms": 360, "memory_kb": 63252}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s898373454", "group_id": "codeNet:p02658", "input_text": "fun main(args: Array) {\n val line = readLine()!!.trim()\n val n: Long = line.toLong()\n val line2 = readLine()!!.trim()\n val nums: List = line2.split(\" \").map {it.toLong()}.take(n.toInt())\n\n var prod: Long = 1L\n\n var maxNum: Long = 1L\n for (i in (0..17)) {\n maxNum *= 10L\n }\n\n if (nums.size == 0 || nums.contains(0L)) {\n prod = 0L\n } else {\n for (i in nums) {\n\n // val resultKeta: Int = result.toString().length\n // val iKeta: Int = i.toString().length\n\n if (i > maxNum / prod) {\n prod = -1\n break\n }\n\n prod *= i\n }\n\n }\n\n\n println(prod)\n}", "language": "Kotlin", "metadata": {"date": 1591489604, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s898373454.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s898373454", "user_id": "u146343951"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main(args: Array) {\n val line = readLine()!!.trim()\n val n: Long = line.toLong()\n val line2 = readLine()!!.trim()\n val nums: List = line2.split(\" \").map {it.toLong()}.take(n.toInt())\n\n var prod: Long = 1L\n\n var maxNum: Long = 1L\n for (i in (0..17)) {\n maxNum *= 10L\n }\n\n if (nums.size == 0 || nums.contains(0L)) {\n prod = 0L\n } else {\n for (i in nums) {\n\n // val resultKeta: Int = result.toString().length\n // val iKeta: Int = i.toString().length\n\n if (i > maxNum / prod) {\n prod = -1\n break\n }\n\n prod *= i\n }\n\n }\n\n\n println(prod)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 699, "cpu_time_ms": 352, "memory_kb": 63324}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s224699271", "group_id": "codeNet:p02658", "input_text": "fun main() = Thread(null, ::abc169b, \"(^o^)\", 128 * 1024 * 1024).apply { start() }.join()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc169b() {\n readLine()\n val aList = readLine()!!.split(' ').map { it.toLong() }\n\n if (0L in aList) return println(0)\n\n val cap = pow(10L, 18)\n\n val answer = runCatching {\n aList.fold(1L) { acc, l -> Math.multiplyExact(acc, l) }\n }.fold({ it }, { Long.MAX_VALUE }).takeIf { it <= cap } ?: -1\n\n println(answer)\n}\n\nprivate fun pow(n: Long, p: Long): Long {\n var x = n\n var y = p\n var result = 1L\n while (y > 0) {\n if (y % 2 == 1L)\n result = (result * x)\n y = y shr 1\n x = (x * x)\n }\n return result\n}\n", "language": "Kotlin", "metadata": {"date": 1591291221, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s224699271.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s224699271", "user_id": "u139478771"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main() = Thread(null, ::abc169b, \"(^o^)\", 128 * 1024 * 1024).apply { start() }.join()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc169b() {\n readLine()\n val aList = readLine()!!.split(' ').map { it.toLong() }\n\n if (0L in aList) return println(0)\n\n val cap = pow(10L, 18)\n\n val answer = runCatching {\n aList.fold(1L) { acc, l -> Math.multiplyExact(acc, l) }\n }.fold({ it }, { Long.MAX_VALUE }).takeIf { it <= cap } ?: -1\n\n println(answer)\n}\n\nprivate fun pow(n: Long, p: Long): Long {\n var x = n\n var y = p\n var result = 1L\n while (y > 0) {\n if (y % 2 == 1L)\n result = (result * x)\n y = y shr 1\n x = (x * x)\n }\n return result\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 708, "cpu_time_ms": 358, "memory_kb": 63196}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s432687071", "group_id": "codeNet:p02658", "input_text": "import java.math.BigInteger\n\nfun main() = Thread(null, ::abc169b, \"(^o^)\", 128 * 1024 * 1024).apply { start() }.join()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc169b() {\n readLine()\n val aList = readLine()!!.split(' ').map { it.toBigInteger() }\n\n if (BigInteger.ZERO in aList) return println(0)\n\n var answer = BigInteger.ONE\n val max = BigInteger.valueOf(1000000000000000000L)\n\n for (a in aList) {\n answer = answer.multiply(a)\n if (answer > max) return println(-1)\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1591067345, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s432687071.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s432687071", "user_id": "u139478771"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.math.BigInteger\n\nfun main() = Thread(null, ::abc169b, \"(^o^)\", 128 * 1024 * 1024).apply { start() }.join()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc169b() {\n readLine()\n val aList = readLine()!!.split(' ').map { it.toBigInteger() }\n\n if (BigInteger.ZERO in aList) return println(0)\n\n var answer = BigInteger.ONE\n val max = BigInteger.valueOf(1000000000000000000L)\n\n for (a in aList) {\n answer = answer.multiply(a)\n if (answer > max) return println(-1)\n }\n\n println(answer)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 529, "cpu_time_ms": 428, "memory_kb": 72148}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s267956162", "group_id": "codeNet:p02658", "input_text": "fun main(){\n readLine()!!.toInt()\n var A = readLine()!!.split(\" \").map{it.toLong()}\n\n var mul: Long = 1L\n\n if(A.contains(0L)){ mul = 0L ;println(mul); return}\n for(a in A) {\n try {\n mul = Math.multiplyExact(mul, a)\n if (mul > Math.pow(10.0, 18.0).toLong()) {\n println(-1)\n return\n }\n } catch(e: Exception) {\n println(-1)\n return\n }\n }\n println(mul)\n}", "language": "Kotlin", "metadata": {"date": 1590981697, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s267956162.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s267956162", "user_id": "u209053759"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main(){\n readLine()!!.toInt()\n var A = readLine()!!.split(\" \").map{it.toLong()}\n\n var mul: Long = 1L\n\n if(A.contains(0L)){ mul = 0L ;println(mul); return}\n for(a in A) {\n try {\n mul = Math.multiplyExact(mul, a)\n if (mul > Math.pow(10.0, 18.0).toLong()) {\n println(-1)\n return\n }\n } catch(e: Exception) {\n println(-1)\n return\n }\n }\n println(mul)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 477, "cpu_time_ms": 351, "memory_kb": 63236}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s701414507", "group_id": "codeNet:p02658", "input_text": "fun main(){\n readLine()!!.toInt()\n var A = readLine()!!.split(\" \").map{it.toLong()}\n\n var mul: Long = 1L\n\n if(A.contains(0L)){ mul = 0L ;println(mul); return}\n for(a in A) {\n try {\n Math.multiplyExact(mul, a)\n if (mul > Math.pow(10.0, 18.0).toLong()) {\n println(-1)\n return\n }\n } catch(e: Exception) {\n println(-1)\n return\n }\n println(mul)\n }\n}", "language": "Kotlin", "metadata": {"date": 1590980442, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s701414507.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s701414507", "user_id": "u209053759"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main(){\n readLine()!!.toInt()\n var A = readLine()!!.split(\" \").map{it.toLong()}\n\n var mul: Long = 1L\n\n if(A.contains(0L)){ mul = 0L ;println(mul); return}\n for(a in A) {\n try {\n Math.multiplyExact(mul, a)\n if (mul > Math.pow(10.0, 18.0).toLong()) {\n println(-1)\n return\n }\n } catch(e: Exception) {\n println(-1)\n return\n }\n println(mul)\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 475, "cpu_time_ms": 797, "memory_kb": 65144}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s162344340", "group_id": "codeNet:p02658", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (1..n).map { sc.nextLong() }\n\n val ans = calc(n, a)\n\n println(ans)\n}\n \nprivate fun calc(n: Int, a: List): Long {\n if (a.contains(0L)) return 0L\n val max = 1_000_000_000_000_000_000\n\n var ret = 1L\n for (ai in a) {\n ret *= ai\n if (ret > max) return -1\n if (ret < 0) return -1\n }\n\n return ret\n}\n", "language": "Kotlin", "metadata": {"date": 1590978704, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s162344340.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s162344340", "user_id": "u323522006"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (1..n).map { sc.nextLong() }\n\n val ans = calc(n, a)\n\n println(ans)\n}\n \nprivate fun calc(n: Int, a: List): Long {\n if (a.contains(0L)) return 0L\n val max = 1_000_000_000_000_000_000\n\n var ret = 1L\n for (ai in a) {\n ret *= ai\n if (ret > max) return -1\n if (ret < 0) return -1\n }\n\n return ret\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 432, "cpu_time_ms": 530, "memory_kb": 62280}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s600730485", "group_id": "codeNet:p02658", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (0 until n).map { sc.next().toLong() }\n println(problem169b(n, a))\n}\n\nfun problem169b(n: Int, a: List): Long {\n var multi = 1L\n for (i in 0 until n) {\n multi = Math.multiplyExact(multi, a[i])\n }\n return if (multi > 1000000000000000000L) -1 else multi.toLong()\n}", "language": "Kotlin", "metadata": {"date": 1590977633, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s600730485.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s600730485", "user_id": "u073232808"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (0 until n).map { sc.next().toLong() }\n println(problem169b(n, a))\n}\n\nfun problem169b(n: Int, a: List): Long {\n var multi = 1L\n for (i in 0 until n) {\n multi = Math.multiplyExact(multi, a[i])\n }\n return if (multi > 1000000000000000000L) -1 else multi.toLong()\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 412, "cpu_time_ms": 380, "memory_kb": 62916}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s128692106", "group_id": "codeNet:p02658", "input_text": "import kotlin.math.log10\n\nfun main() {\n readLine()\n val xs = readLine()!!.split(\" \")\n var result = 1L\n var over = false\n xs.forEach { v ->\n val a = v.toLong()\n if (a == 0L) {\n result = 0\n return@forEach\n }\n if (over) return@forEach\n if (log10(result.toDouble()) + log10(a.toDouble()) > 18) {\n over = true\n return@forEach\n }\n result *= a\n }\n if (result != 0L && over) result = -1L\n println(result)\n}\n", "language": "Kotlin", "metadata": {"date": 1590977203, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s128692106.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s128692106", "user_id": "u153253722"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import kotlin.math.log10\n\nfun main() {\n readLine()\n val xs = readLine()!!.split(\" \")\n var result = 1L\n var over = false\n xs.forEach { v ->\n val a = v.toLong()\n if (a == 0L) {\n result = 0\n return@forEach\n }\n if (over) return@forEach\n if (log10(result.toDouble()) + log10(a.toDouble()) > 18) {\n over = true\n return@forEach\n }\n result *= a\n }\n if (result != 0L && over) result = -1L\n println(result)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 516, "cpu_time_ms": 337, "memory_kb": 54056}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s555332769", "group_id": "codeNet:p02658", "input_text": "import kotlin.math.pow\n\nval MAX = 10.0.pow(18).toLong()\n\nfun main() {\n readLine()\n val xs = readLine()!!.split(\" \")\n val (_, result) = xs.fold(false to 1L) { (b, acc), a ->\n val aa = a.toLong()\n if (aa == 0L) return@fold false to 0L\n if (b) b to -1 else {\n val temp = acc * a.toLong()\n if (temp > MAX) true to -1L else false to temp\n }\n }\n println(result)\n}\n", "language": "Kotlin", "metadata": {"date": 1590976790, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s555332769.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s555332769", "user_id": "u153253722"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import kotlin.math.pow\n\nval MAX = 10.0.pow(18).toLong()\n\nfun main() {\n readLine()\n val xs = readLine()!!.split(\" \")\n val (_, result) = xs.fold(false to 1L) { (b, acc), a ->\n val aa = a.toLong()\n if (aa == 0L) return@fold false to 0L\n if (b) b to -1 else {\n val temp = acc * a.toLong()\n if (temp > MAX) true to -1L else false to temp\n }\n }\n println(result)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 423, "cpu_time_ms": 346, "memory_kb": 62800}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s622715956", "group_id": "codeNet:p02658", "input_text": "import java.math.BigDecimal\n\nfun main(args: Array) {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toBigDecimal() }\n\n var answer = a[0]\n for (i in 1 until n) {\n answer *= a[i]\n if (answer > BigDecimal(10).pow(18)) {\n answer = BigDecimal(-1)\n break\n }\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1590976407, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s622715956.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s622715956", "user_id": "u381359012"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.math.BigDecimal\n\nfun main(args: Array) {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toBigDecimal() }\n\n var answer = a[0]\n for (i in 1 until n) {\n answer *= a[i]\n if (answer > BigDecimal(10).pow(18)) {\n answer = BigDecimal(-1)\n break\n }\n }\n\n println(answer)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 369, "cpu_time_ms": 426, "memory_kb": 65984}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s196655092", "group_id": "codeNet:p02658", "input_text": "import java.util.*\nfun main(args : Array){\n val sc=Scanner(System.`in`)\n var n=sc.nextLine().toLong()\n val arr = sc.nextLine().split(\"\").map{it.trim().toLong()}.toTypedArray()\n var ans:Long=1\n for(i in arr)\n {\n ans=ans*i\n }\n if(ans>1000000000000000000)\n {\n println(-1)\n }\n else\n {\n println(ans)\n }\n \n }\n", "language": "Kotlin", "metadata": {"date": 1590976116, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s196655092.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s196655092", "user_id": "u867045157"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.util.*\nfun main(args : Array){\n val sc=Scanner(System.`in`)\n var n=sc.nextLine().toLong()\n val arr = sc.nextLine().split(\"\").map{it.trim().toLong()}.toTypedArray()\n var ans:Long=1\n for(i in arr)\n {\n ans=ans*i\n }\n if(ans>1000000000000000000)\n {\n println(-1)\n }\n else\n {\n println(ans)\n }\n \n }\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 372, "cpu_time_ms": 940, "memory_kb": 198236}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s901155880", "group_id": "codeNet:p02658", "input_text": "import java.lang.Math.pow\nimport java.math.BigInteger\n\nprivate fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map { it.toInt() } // list of ints\n\nprivate fun readLong() = readLn().toLong() // single int\nprivate fun readLongs() = readStrings().map { it.toLong() }\n\nfun main(){\n val n = readInt()\n val numList = readLongs()\n\n //var ans: Long = 1\n var ans: BigInteger = BigInteger.valueOf(1)\n val limit: Long = pow(10.0, 18.0).toLong()\n\n if(numList.contains(0)){\n ans = BigInteger.valueOf(0)\n }else{\n for(i in numList){\n ans *= BigInteger.valueOf(i)\n if(ans > BigInteger.valueOf(limit)){\n ans = BigInteger.valueOf(-1)\n break\n }\n }\n }\n\n println(ans)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1590976108, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s901155880.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s901155880", "user_id": "u059982665"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.lang.Math.pow\nimport java.math.BigInteger\n\nprivate fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map { it.toInt() } // list of ints\n\nprivate fun readLong() = readLn().toLong() // single int\nprivate fun readLongs() = readStrings().map { it.toLong() }\n\nfun main(){\n val n = readInt()\n val numList = readLongs()\n\n //var ans: Long = 1\n var ans: BigInteger = BigInteger.valueOf(1)\n val limit: Long = pow(10.0, 18.0).toLong()\n\n if(numList.contains(0)){\n ans = BigInteger.valueOf(0)\n }else{\n for(i in numList){\n ans *= BigInteger.valueOf(i)\n if(ans > BigInteger.valueOf(limit)){\n ans = BigInteger.valueOf(-1)\n break\n }\n }\n }\n\n println(ans)\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 917, "cpu_time_ms": 348, "memory_kb": 63492}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s104706100", "group_id": "codeNet:p02658", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (0 until n).map { sc.next().toLong() }\n println(problem169b(n, a))\n}\n\nfun problem169b(n: Int, a: List): Long {\n var multi = 1L\n for (i in 0 until n) {\n multi *= (a[i])\n if (multi.toBigDecimal().compareTo(1000000000000000000.toBigDecimal()) > 1) -1\n }\n return if (multi.toBigDecimal() > 1000000000000000000.toBigDecimal()) -1 else multi.toLong()\n}", "language": "Kotlin", "metadata": {"date": 1590976084, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s104706100.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s104706100", "user_id": "u073232808"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (0 until n).map { sc.next().toLong() }\n println(problem169b(n, a))\n}\n\nfun problem169b(n: Int, a: List): Long {\n var multi = 1L\n for (i in 0 until n) {\n multi *= (a[i])\n if (multi.toBigDecimal().compareTo(1000000000000000000.toBigDecimal()) > 1) -1\n }\n return if (multi.toBigDecimal() > 1000000000000000000.toBigDecimal()) -1 else multi.toLong()\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 504, "cpu_time_ms": 397, "memory_kb": 64340}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s245124611", "group_id": "codeNet:p02658", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toLong() }\n if(a.contains(0L)) {\n println(0); return\n }\n var ans = 1L\n var d = 1.0\n a.forEach {\n d *= it.toDouble()\n ans *= it\n if(d > 2e18){\n println(-1); return\n }\n }\n if(ans > 1e18.toLong()) println(-1) else println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1590976068, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s245124611.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s245124611", "user_id": "u693133807"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toLong() }\n if(a.contains(0L)) {\n println(0); return\n }\n var ans = 1L\n var d = 1.0\n a.forEach {\n d *= it.toDouble()\n ans *= it\n if(d > 2e18){\n println(-1); return\n }\n }\n if(ans > 1e18.toLong()) println(-1) else println(ans)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 402, "cpu_time_ms": 342, "memory_kb": 61624}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s213421150", "group_id": "codeNet:p02658", "input_text": "import kotlin.math.* \nfun main(args: Array) {\n var n = readLine()!!.toInt()\n var a = readLine()!!\n val a_list = a.split(\" \").map { it.toLong() }\n var num = a_list[0]\n \n for (i in 1 until n) {\n num *= a_list[i]\n }\n if (num > 10.toDouble().pow(18).toLong()) {\n println(-1)\n } else {\n println(num)\n }\n}", "language": "Kotlin", "metadata": {"date": 1590975834, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s213421150.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s213421150", "user_id": "u952914882"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import kotlin.math.* \nfun main(args: Array) {\n var n = readLine()!!.toInt()\n var a = readLine()!!\n val a_list = a.split(\" \").map { it.toLong() }\n var num = a_list[0]\n \n for (i in 1 until n) {\n num *= a_list[i]\n }\n if (num > 10.toDouble().pow(18).toLong()) {\n println(-1)\n } else {\n println(num)\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 327, "cpu_time_ms": 352, "memory_kb": 63328}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s041593116", "group_id": "codeNet:p02658", "input_text": "fun main(args: Array) {\n \tval n = next()\n val an = nextLongList().sortedDescending()\n var res = 1L\n if(an.last() == 0L){\n res = 0\n }\n for(i in 0 until an.size){\n if(an[i] == 0L){\n res = 0\n break\n }\n if(res > 1000000000000000000L){\n res = -1\n break\n }\n res *= an[i]\n }\n println(res)\n}\nfun next() = readLine()!!\nfun nextLongList() = next().split(\" \").map{ it.toLong() }", "language": "Kotlin", "metadata": {"date": 1590975511, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s041593116.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s041593116", "user_id": "u259342586"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main(args: Array) {\n \tval n = next()\n val an = nextLongList().sortedDescending()\n var res = 1L\n if(an.last() == 0L){\n res = 0\n }\n for(i in 0 until an.size){\n if(an[i] == 0L){\n res = 0\n break\n }\n if(res > 1000000000000000000L){\n res = -1\n break\n }\n res *= an[i]\n }\n println(res)\n}\nfun next() = readLine()!!\nfun nextLongList() = next().split(\" \").map{ it.toLong() }", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 481, "cpu_time_ms": 465, "memory_kb": 64012}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s846178584", "group_id": "codeNet:p02658", "input_text": "fun main() {\n readLine()\n var result = 1L\n val limit = 1e18.toLong()\n val items = readLine()!!.split(' ').map { it.toLong() }\n if (items.contains(0)) {\n println(0)\n return\n }\n items.forEach {\n result *= it\n if (result > limit || result <= 0) {\n result = -1\n return@forEach\n }\n }\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1590975410, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s846178584.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s846178584", "user_id": "u108745033"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main() {\n readLine()\n var result = 1L\n val limit = 1e18.toLong()\n val items = readLine()!!.split(' ').map { it.toLong() }\n if (items.contains(0)) {\n println(0)\n return\n }\n items.forEach {\n result *= it\n if (result > limit || result <= 0) {\n result = -1\n return@forEach\n }\n }\n println(result)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 381, "cpu_time_ms": 363, "memory_kb": 63080}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s981189556", "group_id": "codeNet:p02658", "input_text": "fun main() {\n readLine()\n val list = readLine()!!.split(\" \").map { it.toLong() }\n if (list.contains(0L)) {\n println(0)\n return\n }\n\n var result = 1.toBigInteger()\n list.map { it.toBigInteger() }.forEach {\n result *= it\n if (result > 1000000000000000000.toBigInteger()) {\n println(-1)\n return\n }\n }\n\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1590975338, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s981189556.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s981189556", "user_id": "u897579945"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main() {\n readLine()\n val list = readLine()!!.split(\" \").map { it.toLong() }\n if (list.contains(0L)) {\n println(0)\n return\n }\n\n var result = 1.toBigInteger()\n list.map { it.toBigInteger() }.forEach {\n result *= it\n if (result > 1000000000000000000.toBigInteger()) {\n println(-1)\n return\n }\n }\n\n println(result)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 397, "cpu_time_ms": 374, "memory_kb": 63464}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s558708757", "group_id": "codeNet:p02658", "input_text": "fun main(args: Array) {\n \tval n = next()\n val an = nextLongList().sortedDescending()\n var res = 1L\n if(an.last() == 0L){\n res = 0\n }\n for(i in 0 until an.size){\n if(an[i] == 0L){\n res = 0\n break\n }\n if(res > 1000000000000000000L){\n res = -1\n }\n res *= an[i]\n }\n println(res)\n}\nfun next() = readLine()!!\nfun nextLongList() = next().split(\" \").map{ it.toLong() }", "language": "Kotlin", "metadata": {"date": 1590975335, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s558708757.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s558708757", "user_id": "u259342586"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main(args: Array) {\n \tval n = next()\n val an = nextLongList().sortedDescending()\n var res = 1L\n if(an.last() == 0L){\n res = 0\n }\n for(i in 0 until an.size){\n if(an[i] == 0L){\n res = 0\n break\n }\n if(res > 1000000000000000000L){\n res = -1\n }\n res *= an[i]\n }\n println(res)\n}\nfun next() = readLine()!!\nfun nextLongList() = next().split(\" \").map{ it.toLong() }", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 465, "cpu_time_ms": 498, "memory_kb": 63992}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s654505750", "group_id": "codeNet:p02658", "input_text": "import java.math.BigInteger\nimport java.util.*\nimport kotlin.math.pow\n\nfun main() {\n val scanner = Scanner(System.`in`)\n var ans: BigInteger = BigInteger.ONE\n val limit = 10.0.pow(18.0).toBigDecimal().toBigInteger()\n\n repeat(scanner.nextInt()) {\n ans *= scanner.nextBigInteger(10)\n }\n\n println(\n if (ans > limit) {\n -1\n } else {\n ans\n }\n )\n}\n\n", "language": "Kotlin", "metadata": {"date": 1590975325, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s654505750.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s654505750", "user_id": "u396421675"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.math.BigInteger\nimport java.util.*\nimport kotlin.math.pow\n\nfun main() {\n val scanner = Scanner(System.`in`)\n var ans: BigInteger = BigInteger.ONE\n val limit = 10.0.pow(18.0).toBigDecimal().toBigInteger()\n\n repeat(scanner.nextInt()) {\n ans *= scanner.nextBigInteger(10)\n }\n\n println(\n if (ans > limit) {\n -1\n } else {\n ans\n }\n )\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 414, "cpu_time_ms": 2208, "memory_kb": 60888}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s649540594", "group_id": "codeNet:p02658", "input_text": "import kotlin.math.* \nfun main(args: Array) {\n var n = readLine()!!.toInt()\n var a = readLine()!!\n val a_list = a.split(\" \").map { it.toLong() }\n var num = a_list[0]\n \n for (i in 1 until n) {\n num *= a_list[i]\n }\n if (num > 10.toDouble().pow(18)) {\n println(\"-1\")\n } else {\n println(num.toString())\n }\n}", "language": "Kotlin", "metadata": {"date": 1590975146, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s649540594.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s649540594", "user_id": "u952914882"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import kotlin.math.* \nfun main(args: Array) {\n var n = readLine()!!.toInt()\n var a = readLine()!!\n val a_list = a.split(\" \").map { it.toLong() }\n var num = a_list[0]\n \n for (i in 1 until n) {\n num *= a_list[i]\n }\n if (num > 10.toDouble().pow(18)) {\n println(\"-1\")\n } else {\n println(num.toString())\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 331, "cpu_time_ms": 363, "memory_kb": 63156}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s668569799", "group_id": "codeNet:p02658", "input_text": "import java.io.PrintWriter\nimport kotlin.math.pow\n\n// Helper\nprivate val pw = PrintWriter(System.out)\nprivate fun readLn() = readLine()!!\nprivate fun readInt() = readLn().toInt()\nprivate fun readStrings() = readLn().split(\" \")\nprivate fun readInts() = readStrings().map(String::toInt)\nprivate fun readLongs() = readStrings().map(String::toLong)\nprivate fun readDoubles() = readStrings().map(String::toDouble)\nprivate fun readStrings2() = readLn().split(\"\").filter { it.isNotEmpty() }\nprivate fun readInts2() = readStrings2().map(String::toInt)\nprivate fun initArray(n:Int, v:String) = Array(n) { v }\nprivate fun initIntArray(n:Int, v:Int) = IntArray(n) { v }\nprivate fun println(value : Any) = pw.println(value)\n\ninternal fun abc169b() {\n val N = readInt()\n val A = readDoubles()\n val sup = 10.0.pow(18.0)\n val ans = A.reduce { tmp, value ->\n tmp * value\n }\n if (ans > sup) {\n println(-1)\n } else {\n println(ans.toLong().toString())\n }\n}\n\nfun main(args: Array) {\n abc169b()\n pw.flush()\n}\n", "language": "Kotlin", "metadata": {"date": 1590975128, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s668569799.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s668569799", "user_id": "u371560174"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.io.PrintWriter\nimport kotlin.math.pow\n\n// Helper\nprivate val pw = PrintWriter(System.out)\nprivate fun readLn() = readLine()!!\nprivate fun readInt() = readLn().toInt()\nprivate fun readStrings() = readLn().split(\" \")\nprivate fun readInts() = readStrings().map(String::toInt)\nprivate fun readLongs() = readStrings().map(String::toLong)\nprivate fun readDoubles() = readStrings().map(String::toDouble)\nprivate fun readStrings2() = readLn().split(\"\").filter { it.isNotEmpty() }\nprivate fun readInts2() = readStrings2().map(String::toInt)\nprivate fun initArray(n:Int, v:String) = Array(n) { v }\nprivate fun initIntArray(n:Int, v:Int) = IntArray(n) { v }\nprivate fun println(value : Any) = pw.println(value)\n\ninternal fun abc169b() {\n val N = readInt()\n val A = readDoubles()\n val sup = 10.0.pow(18.0)\n val ans = A.reduce { tmp, value ->\n tmp * value\n }\n if (ans > sup) {\n println(-1)\n } else {\n println(ans.toLong().toString())\n }\n}\n\nfun main(args: Array) {\n abc169b()\n pw.flush()\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1047, "cpu_time_ms": 523, "memory_kb": 72652}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s414346878", "group_id": "codeNet:p02658", "input_text": "import kotlin.system.exitProcess\n\nfun main(args: Array) {\n readLine()\n val nums = readLine()!!.split(\" \").map { it.toBigDecimal() }.toMutableList()\n\n var ans = 1.toBigDecimal()\n\n // 0考慮\n if (nums.contains(0.toBigDecimal())) {\n print(\"0\")\n exitProcess(0)\n }\n\n for (num in nums) {\n ans *= num\n\n // 早めに切り上げる\n if (ans > 1000000000000000000.toBigDecimal()) {\n println(\"-1\")\n exitProcess(0)\n }\n }\n\n if (ans > 1000000000000000000.toBigDecimal()) {\n println(\"-1\")\n } else {\n println(ans)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1590974746, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s414346878.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s414346878", "user_id": "u621958170"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import kotlin.system.exitProcess\n\nfun main(args: Array) {\n readLine()\n val nums = readLine()!!.split(\" \").map { it.toBigDecimal() }.toMutableList()\n\n var ans = 1.toBigDecimal()\n\n // 0考慮\n if (nums.contains(0.toBigDecimal())) {\n print(\"0\")\n exitProcess(0)\n }\n\n for (num in nums) {\n ans *= num\n\n // 早めに切り上げる\n if (ans > 1000000000000000000.toBigDecimal()) {\n println(\"-1\")\n exitProcess(0)\n }\n }\n\n if (ans > 1000000000000000000.toBigDecimal()) {\n println(\"-1\")\n } else {\n println(ans)\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 624, "cpu_time_ms": 425, "memory_kb": 67296}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s987020989", "group_id": "codeNet:p02658", "input_text": "import java.util.*\n\nfun main() {\n val scanner = Scanner(System.`in`)\n var ans: Long = 1\n\n repeat(scanner.nextInt()) {\n ans *= scanner.nextLong()\n }\n\n println(\n if (ans > 1_000_000_000_000_000_000) {\n -1\n } else {\n ans\n }\n )\n}\n\n", "language": "Kotlin", "metadata": {"date": 1590974596, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s987020989.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s987020989", "user_id": "u396421675"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.util.*\n\nfun main() {\n val scanner = Scanner(System.`in`)\n var ans: Long = 1\n\n repeat(scanner.nextInt()) {\n ans *= scanner.nextLong()\n }\n\n println(\n if (ans > 1_000_000_000_000_000_000) {\n -1\n } else {\n ans\n }\n )\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 295, "cpu_time_ms": 479, "memory_kb": 60252}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s036647671", "group_id": "codeNet:p02658", "input_text": "fun main() {\n readLine()\n var result = 1L\n val limit = 1e18.toLong()\n readLine()!!.split(' ').map { it.toLong() }.forEach {\n result *= it\n if (result > limit || result < 0) {\n result = -1\n return@forEach\n }\n }\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1590974228, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s036647671.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s036647671", "user_id": "u108745033"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main() {\n readLine()\n var result = 1L\n val limit = 1e18.toLong()\n readLine()!!.split(' ').map { it.toLong() }.forEach {\n result *= it\n if (result > limit || result < 0) {\n result = -1\n return@forEach\n }\n }\n println(result)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 289, "cpu_time_ms": 355, "memory_kb": 63092}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s075438773", "group_id": "codeNet:p02658", "input_text": "import java.io.PrintWriter\nimport java.lang.Math.*\nimport java.util.*\n\nval pw = PrintWriter(System.out)\nval sc = Scanner(System.`in`)\n\n\nfun main(args: Array) {\n val n = nextInt()\n val arr = nextListOfLong()\n var sum = 1L\n for(i in 0 until n){\n sum *= arr[i]\n }\n if(sum > 1000000000000000000) sum = -1L\n println(sum)\n}\n\nfun abc000a() {\n}\n\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextListOfString() = next().split(\" \")\nfun nextListOfInt() = nextListOfString().map { it.toInt() }\nfun nextListOfLong() = nextListOfString().map { it.toLong() }\nfun nextListOfDouble() = nextListOfString().map { it.toDouble() }", "language": "Kotlin", "metadata": {"date": 1590974196, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s075438773.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s075438773", "user_id": "u240901574"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.lang.Math.*\nimport java.util.*\n\nval pw = PrintWriter(System.out)\nval sc = Scanner(System.`in`)\n\n\nfun main(args: Array) {\n val n = nextInt()\n val arr = nextListOfLong()\n var sum = 1L\n for(i in 0 until n){\n sum *= arr[i]\n }\n if(sum > 1000000000000000000) sum = -1L\n println(sum)\n}\n\nfun abc000a() {\n}\n\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextListOfString() = next().split(\" \")\nfun nextListOfInt() = nextListOfString().map { it.toInt() }\nfun nextListOfLong() = nextListOfString().map { it.toLong() }\nfun nextListOfDouble() = nextListOfString().map { it.toDouble() }", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 732, "cpu_time_ms": 383, "memory_kb": 65328}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s088867801", "group_id": "codeNet:p02658", "input_text": "fun main() {\n readLine()\n var result = 1L\n val limit = 1e18.toLong()\n readLine()!!.split(' ').map { it.toLong() }.forEach {\n result *= it\n if (result > limit) {\n result = -1\n return@forEach\n }\n }\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1590974082, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s088867801.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s088867801", "user_id": "u108745033"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main() {\n readLine()\n var result = 1L\n val limit = 1e18.toLong()\n readLine()!!.split(' ').map { it.toLong() }.forEach {\n result *= it\n if (result > limit) {\n result = -1\n return@forEach\n }\n }\n println(result)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 275, "cpu_time_ms": 350, "memory_kb": 61692}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s221000655", "group_id": "codeNet:p02658", "input_text": "fun main() = Thread(null, ::abc169b, \"(^o^)\", 128 * 1024 * 1024).apply { start() }.join()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc169b() {\n val n = readLine()!!.toInt()\n val aList = readLine()!!.split(' ').map { it.toLong() }\n\n if (aList.contains(0)) return println(0)\n\n val max = 1000000000000000000L\n\n var answer = aList.first()\n\n for (a in aList.drop(1)) {\n if (answer > 0 && max / answer < a && max / a < answer)\n return println(-1)\n answer *= a\n if (answer > max)\n return println(-1)\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1590973971, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s221000655.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s221000655", "user_id": "u139478771"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main() = Thread(null, ::abc169b, \"(^o^)\", 128 * 1024 * 1024).apply { start() }.join()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc169b() {\n val n = readLine()!!.toInt()\n val aList = readLine()!!.split(' ').map { it.toLong() }\n\n if (aList.contains(0)) return println(0)\n\n val max = 1000000000000000000L\n\n var answer = aList.first()\n\n for (a in aList.drop(1)) {\n if (answer > 0 && max / answer < a && max / a < answer)\n return println(-1)\n answer *= a\n if (answer > max)\n return println(-1)\n }\n\n println(answer)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 584, "cpu_time_ms": 350, "memory_kb": 63392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s831374766", "group_id": "codeNet:p02658", "input_text": "fun str() = readLine()!!\nfun int() = str().toInt()\nfun long() = str().toLong()\n\nfun read(d:String = \" \") = str().split(d)\nfun list(d:String = \" \",f:String.()->T) = read(d).map {f(it)}\nfun list() = list {toInt()}.toIntArray()\n\nfun T.print() = this.also(::println)\n\nfun main() {\n\tabc000X()\n}\n\nfun abc000X() {\n\tval n = int()\n\tval a = list {toLong()}\n\tvar r = 1L\n\tif(a.contains(0L)) {\n\t\tprintln(0)\n\t\treturn\n\t}\n\tfor(i in a) {\n\t\tr *= i\n\t\tif(r<0||r>1000_000_000_000_000_000L){\n\t\t\tprintln(-1)\n\t\t\treturn\n\t\t}\n\t}\n\tprintln(r)\n}\n", "language": "Kotlin", "metadata": {"date": 1590973919, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s831374766.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s831374766", "user_id": "u059234158"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun str() = readLine()!!\nfun int() = str().toInt()\nfun long() = str().toLong()\n\nfun read(d:String = \" \") = str().split(d)\nfun list(d:String = \" \",f:String.()->T) = read(d).map {f(it)}\nfun list() = list {toInt()}.toIntArray()\n\nfun T.print() = this.also(::println)\n\nfun main() {\n\tabc000X()\n}\n\nfun abc000X() {\n\tval n = int()\n\tval a = list {toLong()}\n\tvar r = 1L\n\tif(a.contains(0L)) {\n\t\tprintln(0)\n\t\treturn\n\t}\n\tfor(i in a) {\n\t\tr *= i\n\t\tif(r<0||r>1000_000_000_000_000_000L){\n\t\t\tprintln(-1)\n\t\t\treturn\n\t\t}\n\t}\n\tprintln(r)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 524, "cpu_time_ms": 348, "memory_kb": 63140}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s000088400", "group_id": "codeNet:p02658", "input_text": "fun main() {\n readLine()\n var result = 1L\n readLine()!!.split(' ').map { it.toLong() }.forEach {\n result *= it\n }\n println(if (result > 1e18.toLong()) -1 else result)\n}", "language": "Kotlin", "metadata": {"date": 1590973835, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s000088400.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s000088400", "user_id": "u108745033"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun main() {\n readLine()\n var result = 1L\n readLine()!!.split(' ').map { it.toLong() }.forEach {\n result *= it\n }\n println(if (result > 1e18.toLong()) -1 else result)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 190, "cpu_time_ms": 342, "memory_kb": 61636}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s763820739", "group_id": "codeNet:p02658", "input_text": "import java.math.BigDecimal\n\nfun main(args : Array) {\n val n = readLine()!!.toInt()\n val aa = readLine()!!.split(\" \").map { it.toLong() }\n\n if (aa.contains(0)) {\n println(0)\n return\n }\n\n var current = BigDecimal.ONE\n\n aa.forEach {\n current *= BigDecimal(it)\n\n if (current > BigDecimal(1000000000000000000)) {\n println(-1)\n return\n }\n }\n\n println(current)\n}", "language": "Kotlin", "metadata": {"date": 1590973675, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s763820739.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s763820739", "user_id": "u262403099"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.math.BigDecimal\n\nfun main(args : Array) {\n val n = readLine()!!.toInt()\n val aa = readLine()!!.split(\" \").map { it.toLong() }\n\n if (aa.contains(0)) {\n println(0)\n return\n }\n\n var current = BigDecimal.ONE\n\n aa.forEach {\n current *= BigDecimal(it)\n\n if (current > BigDecimal(1000000000000000000)) {\n println(-1)\n return\n }\n }\n\n println(current)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 445, "cpu_time_ms": 369, "memory_kb": 63464}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s271538507", "group_id": "codeNet:p02658", "input_text": "fun longList() = readLine()?.split(\" \")?.map(String::toLong) ?: TODO()\nfun main(args: Array) {\n val n = readLine()?.toInt() ?: return\n val a = longList()\n if (a.find { it == 0L } != null) {\n println(\"0\")\n return\n }\n var t = 1L\n val max = 1e18.toLong()\n var prev = 1L\n a.forEach {\n t *= it\n if(prev > t) {\n println(\"-1\")\n return\n }\n if (max < t) {\n println(\"-1\")\n return\n }\n prev = t\n }\n println(t.toString())\n}\n", "language": "Kotlin", "metadata": {"date": 1590973647, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s271538507.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s271538507", "user_id": "u979429407"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "fun longList() = readLine()?.split(\" \")?.map(String::toLong) ?: TODO()\nfun main(args: Array) {\n val n = readLine()?.toInt() ?: return\n val a = longList()\n if (a.find { it == 0L } != null) {\n println(\"0\")\n return\n }\n var t = 1L\n val max = 1e18.toLong()\n var prev = 1L\n a.forEach {\n t *= it\n if(prev > t) {\n println(\"-1\")\n return\n }\n if (max < t) {\n println(\"-1\")\n return\n }\n prev = t\n }\n println(t.toString())\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 549, "cpu_time_ms": 348, "memory_kb": 63016}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s793121429", "group_id": "codeNet:p02658", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val n = sc.nextInt()\n val a = Array(n) { sc.nextLong().toBigInteger() }\n var ans = 1.toBigInteger()\n for (i in 0 until n) {\n ans *= a[i]\n }\n if (ans > 1000000000000000000.toBigInteger()) {\n println(-1)\n return\n }\n println(ans)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "language": "Kotlin", "metadata": {"date": 1590973332, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02658.html", "problem_id": "p02658", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02658/input.txt", "sample_output_relpath": "derived/input_output/data/p02658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02658/Kotlin/s793121429.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s793121429", "user_id": "u190507186"}, "prompt_components": {"gold_output": "1000000000000000000\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val n = sc.nextInt()\n val a = Array(n) { sc.nextLong().toBigInteger() }\n var ans = 1.toBigInteger()\n for (i in 0 until n) {\n ans *= a[i]\n }\n if (ans > 1000000000000000000.toBigInteger()) {\n println(-1)\n return\n }\n println(ans)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "sample_input": "2\n1000000000 1000000000\n"}, "reference_outputs": ["1000000000000000000\n"], "source_document_id": "p02658", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven N integers A_1, ..., A_N, compute A_1 \\times ... \\times A_N.\n\nHowever, if the result exceeds 10^{18}, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the value A_1 \\times ... \\times A_N as an integer, or -1 if the value exceeds 10^{18}.\n\nSample Input 1\n\n2\n1000000000 1000000000\n\nSample Output 1\n\n1000000000000000000\n\nWe have 1000000000 \\times 1000000000 = 1000000000000000000.\n\nSample Input 2\n\n3\n101 9901 999999000001\n\nSample Output 2\n\n-1\n\nWe have 101 \\times 9901 \\times 999999000001 = 1000000000000000001, which exceeds 10^{18}, so we should print -1 instead.\n\nSample Input 3\n\n31\n4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1080, "cpu_time_ms": 2207, "memory_kb": 67392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s576104356", "group_id": "codeNet:p02659", "input_text": "import java.util.Scanner;\n\nfun main (args : Array) {\n val input = Scanner(System.`in`)\n \n while (input.hasNext()) {\n val A = input.nextLong()\n val B = input.next()\n val ans = ((A * ((B[0] - '0') * 100)) + (A * B.substring(2).toLong())) / 100\n \n println(ans)\n }\n}", "language": "Kotlin", "metadata": {"date": 1601346060, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s576104356.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s576104356", "user_id": "u920836104"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.util.Scanner;\n\nfun main (args : Array) {\n val input = Scanner(System.`in`)\n \n while (input.hasNext()) {\n val A = input.nextLong()\n val B = input.next()\n val ans = ((A * ((B[0] - '0') * 100)) + (A * B.substring(2).toLong())) / 100\n \n println(ans)\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 291, "cpu_time_ms": 124, "memory_kb": 36392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s300628025", "group_id": "codeNet:p02659", "input_text": "fun main(args: Array) {\n val (A, B) = readLine()!!.split(\" \").map { it.toFloat() }\n println((A * B).toInt())\n}\n", "language": "Kotlin", "metadata": {"date": 1600047275, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s300628025.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s300628025", "user_id": "u496449946"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "fun main(args: Array) {\n val (A, B) = readLine()!!.split(\" \").map { it.toFloat() }\n println((A * B).toInt())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 125, "cpu_time_ms": 126, "memory_kb": 36532}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s988507380", "group_id": "codeNet:p02659", "input_text": "import kotlin.math.*\nimport java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.util.*\n\n\nprivate var fs = BufferedReader(InputStreamReader(System.`in`))\nprivate fun readLn() = fs.readLine()!! // string line\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readLong() = readLn().toLong()\nprivate fun readLongs() = readStrings().map { it.toLong() } // list of ints\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readInts() = readStrings().map { it.toInt() } // list of ints\n\nfun main() {\n solveAtc()\n}\nfun solveAtc() {\n var input = Scanner(System.`in`)\n input.useLocale(Locale.US)\n var a = input.nextLong()\n var b = input.nextDouble()\n var c = b.toLong()\n\n println((((((b-c)*100)*a)/100L) + c*a).toLong())\n}\n", "language": "Kotlin", "metadata": {"date": 1599736523, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s988507380.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s988507380", "user_id": "u843609965"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import kotlin.math.*\nimport java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.util.*\n\n\nprivate var fs = BufferedReader(InputStreamReader(System.`in`))\nprivate fun readLn() = fs.readLine()!! // string line\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readLong() = readLn().toLong()\nprivate fun readLongs() = readStrings().map { it.toLong() } // list of ints\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readInts() = readStrings().map { it.toInt() } // list of ints\n\nfun main() {\n solveAtc()\n}\nfun solveAtc() {\n var input = Scanner(System.`in`)\n input.useLocale(Locale.US)\n var a = input.nextLong()\n var b = input.nextDouble()\n var c = b.toLong()\n\n println((((((b-c)*100)*a)/100L) + c*a).toLong())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 793, "cpu_time_ms": 140, "memory_kb": 37812}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s386112736", "group_id": "codeNet:p02659", "input_text": "import kotlin.math.*\nimport java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.util.*\n\n\nprivate var fs = BufferedReader(InputStreamReader(System.`in`))\nprivate fun readLn() = fs.readLine()!! // string line\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readLong() = readLn().toLong()\nprivate fun readLongs() = readStrings().map { it.toLong() } // list of ints\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readInts() = readStrings().map { it.toInt() } // list of ints\n\nfun main() {\n solveAtc()\n}\nfun solveAtc() {\n var (x,y) = readStrings()\n var a = x.toLong()\n var int = y.toDouble().toInt()\n var b = ((y.toDouble() - int) *100).toLong()\n println((a*b)/100L + a*int)\n}", "language": "Kotlin", "metadata": {"date": 1599735393, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s386112736.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s386112736", "user_id": "u843609965"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import kotlin.math.*\nimport java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.util.*\n\n\nprivate var fs = BufferedReader(InputStreamReader(System.`in`))\nprivate fun readLn() = fs.readLine()!! // string line\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readLong() = readLn().toLong()\nprivate fun readLongs() = readStrings().map { it.toLong() } // list of ints\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readInts() = readStrings().map { it.toInt() } // list of ints\n\nfun main() {\n solveAtc()\n}\nfun solveAtc() {\n var (x,y) = readStrings()\n var a = x.toLong()\n var int = y.toDouble().toInt()\n var b = ((y.toDouble() - int) *100).toLong()\n println((a*b)/100L + a*int)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 756, "cpu_time_ms": 104, "memory_kb": 35784}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s882001224", "group_id": "codeNet:p02659", "input_text": "fun main() {\n val AB = readLine()!!.split(\" \")\n val A = AB[0].toLong()\n val B = (AB[1].toFloat() * 100).toLong()\n val ans = A * B / 100\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1596981537, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s882001224.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s882001224", "user_id": "u437444592"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "fun main() {\n val AB = readLine()!!.split(\" \")\n val A = AB[0].toLong()\n val B = (AB[1].toFloat() * 100).toLong()\n val ans = A * B / 100\n println(ans)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 166, "cpu_time_ms": 111, "memory_kb": 35852}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s544685006", "group_id": "codeNet:p02659", "input_text": "fun main(){\n\tvar (a,b) = readLine()!!.split(\" \").map{it.toDouble()}\n \tvar c = (b*100).toInt()\n \tprintln((a*c/100).toLong())\n \t\n}\n", "language": "Kotlin", "metadata": {"date": 1593908385, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s544685006.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s544685006", "user_id": "u424241608"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "fun main(){\n\tvar (a,b) = readLine()!!.split(\" \").map{it.toDouble()}\n \tvar c = (b*100).toInt()\n \tprintln((a*c/100).toLong())\n \t\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 132, "cpu_time_ms": 115, "memory_kb": 36524}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s440237268", "group_id": "codeNet:p02659", "input_text": "fun main(args: Array) {\n val (a,b) = readLine()!!.split(\" \")\n println((a.toLong() * b.toDouble()).toInt())\n}\n", "language": "Kotlin", "metadata": {"date": 1592272999, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s440237268.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s440237268", "user_id": "u172820018"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "fun main(args: Array) {\n val (a,b) = readLine()!!.split(\" \")\n println((a.toLong() * b.toDouble()).toInt())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 123, "cpu_time_ms": 109, "memory_kb": 35856}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s637459955", "group_id": "codeNet:p02659", "input_text": "import java.math.BigDecimal\n\nfun main(){\n val input = readLine()!!.split(\" \")\n val A = BigDecimal.valueOf(input[0].toLong())\n val B = input[1].toBigDecimal()\n\n val AB = A.multiply(B)\n println(AB.toLong())\n}", "language": "Kotlin", "metadata": {"date": 1591639224, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s637459955.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s637459955", "user_id": "u856032619"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.math.BigDecimal\n\nfun main(){\n val input = readLine()!!.split(\" \")\n val A = BigDecimal.valueOf(input[0].toLong())\n val B = input[1].toBigDecimal()\n\n val AB = A.multiply(B)\n println(AB.toLong())\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 221, "cpu_time_ms": 94, "memory_kb": 35936}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s123538076", "group_id": "codeNet:p02659", "input_text": "fun main(){\n val input = readLine()!!.split(\" \")\n val A = input[0].toLong()\n val B = input[1].toDouble()\n\n val AB = A * B\n println(Math.floor(AB).toLong())\n}\n", "language": "Kotlin", "metadata": {"date": 1591639054, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s123538076.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s123538076", "user_id": "u856032619"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "fun main(){\n val input = readLine()!!.split(\" \")\n val A = input[0].toLong()\n val B = input[1].toDouble()\n\n val AB = A * B\n println(Math.floor(AB).toLong())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 173, "cpu_time_ms": 95, "memory_kb": 35840}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s587859911", "group_id": "codeNet:p02659", "input_text": "import java.math.BigDecimal\n\nfun main(args: Array) {\n val (a, b) = readLine()!!.split(\" \").map(String::toDouble)\n\n println((BigDecimal.valueOf(a) * BigDecimal.valueOf(b)).setScale(0, BigDecimal.ROUND_DOWN).toPlainString())\n}", "language": "Kotlin", "metadata": {"date": 1591119551, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s587859911.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s587859911", "user_id": "u620053468"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.math.BigDecimal\n\nfun main(args: Array) {\n val (a, b) = readLine()!!.split(\" \").map(String::toDouble)\n\n println((BigDecimal.valueOf(a) * BigDecimal.valueOf(b)).setScale(0, BigDecimal.ROUND_DOWN).toPlainString())\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 238, "cpu_time_ms": 103, "memory_kb": 36812}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s100536653", "group_id": "codeNet:p02659", "input_text": "package abc169\n\nimport java.math.BigDecimal\nimport java.math.RoundingMode\n\nfun main() {\n val (A, B) = readLine()!!.split(\" \").map { BigDecimal(it) }\n println(A.multiply(B).setScale(0, RoundingMode.DOWN).toPlainString())\n}", "language": "Kotlin", "metadata": {"date": 1591054478, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s100536653.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s100536653", "user_id": "u531770859"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "package abc169\n\nimport java.math.BigDecimal\nimport java.math.RoundingMode\n\nfun main() {\n val (A, B) = readLine()!!.split(\" \").map { BigDecimal(it) }\n println(A.multiply(B).setScale(0, RoundingMode.DOWN).toPlainString())\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 227, "cpu_time_ms": 92, "memory_kb": 35304}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s978255364", "group_id": "codeNet:p02659", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val a = sc.nextLong()\n val b = sc.nextDouble()\n val c = Math.round(100 * b)\n println((a * c) / 100)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "language": "Kotlin", "metadata": {"date": 1591034062, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s978255364.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s978255364", "user_id": "u190507186"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val a = sc.nextLong()\n val b = sc.nextDouble()\n val c = Math.round(100 * b)\n println((a * c) / 100)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 920, "cpu_time_ms": 89, "memory_kb": 34592}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s126043102", "group_id": "codeNet:p02659", "input_text": "import java.math.BigDecimal\n\nfun main() = Thread(null, ::abc169c, \"(^o^)\", 128 * 1024 * 1024).apply { start() }.join()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc169c() {\n val (a, b) = readLine()!!.split(' ').map { it.toDouble() }\n\n val answer = BigDecimal.valueOf(a).multiply(BigDecimal.valueOf(b)).toLong()\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1590989577, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s126043102.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s126043102", "user_id": "u139478771"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.math.BigDecimal\n\nfun main() = Thread(null, ::abc169c, \"(^o^)\", 128 * 1024 * 1024).apply { start() }.join()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc169c() {\n val (a, b) = readLine()!!.split(' ').map { it.toDouble() }\n\n val answer = BigDecimal.valueOf(a).multiply(BigDecimal.valueOf(b)).toLong()\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 340, "cpu_time_ms": 107, "memory_kb": 37128}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s666052245", "group_id": "codeNet:p02659", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val a = sc.nextLong()\n val b = sc.nextDouble()\n val c = (b * 1000).toLong() / 10\n println((a * c) / 100)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "language": "Kotlin", "metadata": {"date": 1590980847, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s666052245.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s666052245", "user_id": "u190507186"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val a = sc.nextLong()\n val b = sc.nextDouble()\n val c = (b * 1000).toLong() / 10\n println((a * c) / 100)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 925, "cpu_time_ms": 81, "memory_kb": 34468}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s981042022", "group_id": "codeNet:p02659", "input_text": "import java.io.PrintWriter\nimport java.math.BigDecimal\nimport kotlin.math.floor\n\n// Helper\nprivate val pw = PrintWriter(System.out)\nprivate fun readLn() = readLine()!!\nprivate fun readInt() = readLn().toInt()\nprivate fun readStrings() = readLn().split(\" \")\nprivate fun readInts() = readStrings().map(String::toInt)\nprivate fun readLongs() = readStrings().map(String::toLong)\nprivate fun readDoubles() = readStrings().map(String::toDouble)\nprivate fun readStrings2() = readLn().split(\"\").filter { it.isNotEmpty() }\nprivate fun readInts2() = readStrings2().map(String::toInt)\nprivate fun initArray(n:Int, v:String) = Array(n) { v }\nprivate fun initIntArray(n:Int, v:Int) = IntArray(n) { v }\nprivate fun println(value : Any) = pw.println(value)\n\ninternal fun abc169c() {\n val (A, B) = readStrings()\n val aNum = A.toBigDecimal()\n val bNum = B.replace(\".\", \"\").toBigDecimal()\n println(aNum.multiply(bNum).divide(BigDecimal(100)).toLong())\n}\n\nfun main(args: Array) {\n abc169c()\n pw.flush()\n}\n", "language": "Kotlin", "metadata": {"date": 1590979950, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s981042022.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s981042022", "user_id": "u371560174"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.math.BigDecimal\nimport kotlin.math.floor\n\n// Helper\nprivate val pw = PrintWriter(System.out)\nprivate fun readLn() = readLine()!!\nprivate fun readInt() = readLn().toInt()\nprivate fun readStrings() = readLn().split(\" \")\nprivate fun readInts() = readStrings().map(String::toInt)\nprivate fun readLongs() = readStrings().map(String::toLong)\nprivate fun readDoubles() = readStrings().map(String::toDouble)\nprivate fun readStrings2() = readLn().split(\"\").filter { it.isNotEmpty() }\nprivate fun readInts2() = readStrings2().map(String::toInt)\nprivate fun initArray(n:Int, v:String) = Array(n) { v }\nprivate fun initIntArray(n:Int, v:Int) = IntArray(n) { v }\nprivate fun println(value : Any) = pw.println(value)\n\ninternal fun abc169c() {\n val (A, B) = readStrings()\n val aNum = A.toBigDecimal()\n val bNum = B.replace(\".\", \"\").toBigDecimal()\n println(aNum.multiply(bNum).divide(BigDecimal(100)).toLong())\n}\n\nfun main(args: Array) {\n abc169c()\n pw.flush()\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1012, "cpu_time_ms": 129, "memory_kb": 40232}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s282198528", "group_id": "codeNet:p02659", "input_text": "\nimport kotlin.math.floor\n\n\nfun main(args: Array) {\n val (a, b) = readLine()?.split(\" \") ?: return\n\n println((floor(a.toLong() * b.toDouble() * 100).toLong() / 100).toString())\n}", "language": "Kotlin", "metadata": {"date": 1590979500, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s282198528.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s282198528", "user_id": "u979429407"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "\nimport kotlin.math.floor\n\n\nfun main(args: Array) {\n val (a, b) = readLine()?.split(\" \") ?: return\n\n println((floor(a.toLong() * b.toDouble() * 100).toLong() / 100).toString())\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 192, "cpu_time_ms": 95, "memory_kb": 35840}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s854386435", "group_id": "codeNet:p02659", "input_text": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\nval readString: ()->String = {readLine()!!}\nval readInt: ()->Int = {readLine()!!.toInt()}\nval readLong: ()->Long = {readLine()!!.toLong()}\nval readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nval readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nval errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nval MOD = 1e9.toLong()+7\nval INF = Int.MAX_VALUE/2\nval LINF = Long.MAX_VALUE/2\n\n\nfun main(args: Array) {\n val (SA, SB) = readString().split(' ')\n val A = SA.toULong() // [0, 1e15]\n //val B = SB.toDouble() // [0.00, 9.99]\n //val BUL = (B * 100).toULong() // [0, 999]\n\n var BUL = 0L\n BUL += (SB[0]-'0')*100L\n BUL += (SB[2]-'0')*10L\n BUL += (SB[3]-'0')\n\n\n if (A==0UL || BUL==0L) {\n println(0)\n return\n }\n\n val ans = A * BUL.toULong() / 100UL\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1590978725, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s854386435.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s854386435", "user_id": "u404244809"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\nval readString: ()->String = {readLine()!!}\nval readInt: ()->Int = {readLine()!!.toInt()}\nval readLong: ()->Long = {readLine()!!.toLong()}\nval readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nval readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nval errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nval MOD = 1e9.toLong()+7\nval INF = Int.MAX_VALUE/2\nval LINF = Long.MAX_VALUE/2\n\n\nfun main(args: Array) {\n val (SA, SB) = readString().split(' ')\n val A = SA.toULong() // [0, 1e15]\n //val B = SB.toDouble() // [0.00, 9.99]\n //val BUL = (B * 100).toULong() // [0, 999]\n\n var BUL = 0L\n BUL += (SB[0]-'0')*100L\n BUL += (SB[2]-'0')*10L\n BUL += (SB[3]-'0')\n\n\n if (A==0UL || BUL==0L) {\n println(0)\n return\n }\n\n val ans = A * BUL.toULong() / 100UL\n\n println(ans)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 964, "cpu_time_ms": 97, "memory_kb": 36108}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s379490367", "group_id": "codeNet:p02659", "input_text": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\nval readString: ()->String = {readLine()!!}\nval readInt: ()->Int = {readLine()!!.toInt()}\nval readLong: ()->Long = {readLine()!!.toLong()}\nval readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nval readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nval errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nval MOD = 1e9.toLong()+7\nval INF = Int.MAX_VALUE/2\nval LINF = Long.MAX_VALUE/2\n\n\nfun main(args: Array) {\n val (SA, SB) = readString().split(' ')\n val A = SA.toLong() // [0, 1e15]\n val B = SB.toDouble() // [0.00, 9.99]\n val BL = (B * 100).toLong() // [0, 999]\n\n if (A==0L || BL==0L) {\n println(0)\n return\n }\n assert(A>0 && B>0){\"A>0 && B>0\"}\n val ans = if (A/100L > 1e18.toLong()/BL) A / 100L * BL else A * BL / 100\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1590978110, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s379490367.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s379490367", "user_id": "u404244809"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\nval readString: ()->String = {readLine()!!}\nval readInt: ()->Int = {readLine()!!.toInt()}\nval readLong: ()->Long = {readLine()!!.toLong()}\nval readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nval readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nval errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nval MOD = 1e9.toLong()+7\nval INF = Int.MAX_VALUE/2\nval LINF = Long.MAX_VALUE/2\n\n\nfun main(args: Array) {\n val (SA, SB) = readString().split(' ')\n val A = SA.toLong() // [0, 1e15]\n val B = SB.toDouble() // [0.00, 9.99]\n val BL = (B * 100).toLong() // [0, 999]\n\n if (A==0L || BL==0L) {\n println(0)\n return\n }\n assert(A>0 && B>0){\"A>0 && B>0\"}\n val ans = if (A/100L > 1e18.toLong()/BL) A / 100L * BL else A * BL / 100\n\n println(ans)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 932, "cpu_time_ms": 93, "memory_kb": 35940}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s703626948", "group_id": "codeNet:p02659", "input_text": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\nval readString: ()->String = {readLine()!!}\nval readInt: ()->Int = {readLine()!!.toInt()}\nval readLong: ()->Long = {readLine()!!.toLong()}\nval readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nval readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nval errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nval MOD = 1e9.toLong()+7\nval INF = Int.MAX_VALUE/2\nval LINF = Long.MAX_VALUE/2\n\n\nfun main(args: Array) {\n val (SA, SB) = readString().split(' ')\n val A = SA.toDouble() // [0, 1e15]\n val B = SB.toDouble() // [0.00, 9.99]\n //val BL = (B * 100).toLong() // [0, 999]\n\n if (A==0.0 || B==0.0) {\n println(0)\n return\n }\n\n val ans = A * B\n\n println(\"%d\".format(ans.toLong()))\n}\n", "language": "Kotlin", "metadata": {"date": 1590977787, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s703626948.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s703626948", "user_id": "u404244809"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\nval readString: ()->String = {readLine()!!}\nval readInt: ()->Int = {readLine()!!.toInt()}\nval readLong: ()->Long = {readLine()!!.toLong()}\nval readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nval readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nval errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nval MOD = 1e9.toLong()+7\nval INF = Int.MAX_VALUE/2\nval LINF = Long.MAX_VALUE/2\n\n\nfun main(args: Array) {\n val (SA, SB) = readString().split(' ')\n val A = SA.toDouble() // [0, 1e15]\n val B = SB.toDouble() // [0.00, 9.99]\n //val BL = (B * 100).toLong() // [0, 999]\n\n if (A==0.0 || B==0.0) {\n println(0)\n return\n }\n\n val ans = A * B\n\n println(\"%d\".format(ans.toLong()))\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 865, "cpu_time_ms": 110, "memory_kb": 36904}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s060688851", "group_id": "codeNet:p02659", "input_text": "import kotlin.math.* \nfun main(args: Array) {\n var (a, b) = readLine()!!.split(\" \").map{ it.trim().toDouble() }\n \n println(\"%.0f\".format(Math.floor(a * b)))\n}", "language": "Kotlin", "metadata": {"date": 1590977434, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s060688851.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s060688851", "user_id": "u952914882"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import kotlin.math.* \nfun main(args: Array) {\n var (a, b) = readLine()!!.split(\" \").map{ it.trim().toDouble() }\n \n println(\"%.0f\".format(Math.floor(a * b)))\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 170, "cpu_time_ms": 120, "memory_kb": 37640}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s020660635", "group_id": "codeNet:p02659", "input_text": "import kotlin.math.floor\n\nfun main(args: Array) {\n var (a, b) = readLine()!!.split(\" \").map(String::toDouble)\n val al = a.toLong()\n val x = floor(b).toLong()\n val y = ((b - x) * 100).toLong()\n\n val ans = (al * x * 100 + al * y).toString().dropLast(2)\n if (ans.isEmpty()) println(0)\n else println(ans)\n\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\nfun Array>.print() {\n this.forEach {\n println(it.joinToString(\" \"))\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1590977195, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s020660635.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s020660635", "user_id": "u697467902"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import kotlin.math.floor\n\nfun main(args: Array) {\n var (a, b) = readLine()!!.split(\" \").map(String::toDouble)\n val al = a.toLong()\n val x = floor(b).toLong()\n val y = ((b - x) * 100).toLong()\n\n val ans = (al * x * 100 + al * y).toString().dropLast(2)\n if (ans.isEmpty()) println(0)\n else println(ans)\n\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\nfun Array>.print() {\n this.forEach {\n println(it.joinToString(\" \"))\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 669, "cpu_time_ms": 111, "memory_kb": 36752}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s947200070", "group_id": "codeNet:p02659", "input_text": "import java.math.BigDecimal\n\nfun main() {\n val builder = StringBuilder()\n\n val (a, b) = readInputLine().split(\" \").map { BigDecimal(it) }\n\n builder.appendln(a.multiply(b).toLong())\n\n print(builder.toString())\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "language": "Kotlin", "metadata": {"date": 1590977113, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s947200070.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s947200070", "user_id": "u505558493"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.math.BigDecimal\n\nfun main() {\n val builder = StringBuilder()\n\n val (a, b) = readInputLine().split(\" \").map { BigDecimal(it) }\n\n builder.appendln(a.multiply(b).toLong())\n\n print(builder.toString())\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 280, "cpu_time_ms": 101, "memory_kb": 36584}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s608582877", "group_id": "codeNet:p02659", "input_text": "fun main(args : Array) {\n val (a, b) = readLine()!!.split(\" \")\n val aa = a.toLong()\n val bb = b.toDouble()\n\n println(Math.floor(aa * bb).toLong())\n}", "language": "Kotlin", "metadata": {"date": 1590976732, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s608582877.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s608582877", "user_id": "u262403099"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "fun main(args : Array) {\n val (a, b) = readLine()!!.split(\" \")\n val aa = a.toLong()\n val bb = b.toDouble()\n\n println(Math.floor(aa * bb).toLong())\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 168, "cpu_time_ms": 92, "memory_kb": 35876}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s183935135", "group_id": "codeNet:p02659", "input_text": "fun main(args : Array) {\n val (a, b) = readLine()!!.split(\" \").map { it.toDouble() }\n val result = a * b\n\n println((Math.floor(result*100)/100).toLong())\n}", "language": "Kotlin", "metadata": {"date": 1590976090, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s183935135.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s183935135", "user_id": "u262403099"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "fun main(args : Array) {\n val (a, b) = readLine()!!.split(\" \").map { it.toDouble() }\n val result = a * b\n\n println((Math.floor(result*100)/100).toLong())\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 172, "cpu_time_ms": 100, "memory_kb": 36532}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s384636936", "group_id": "codeNet:p02659", "input_text": "import java.math.BigDecimal\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextDouble()\n val b = sc.nextDouble()\n println(problem169c(a, b))\n}\n\nfun problem169c(a: Double, b: Double): String {\n return BigDecimal(a).multiply(BigDecimal(b).multiply(100.toBigDecimal())).div(100.toBigDecimal()).toString().split(\".\")[0]\n}", "language": "Kotlin", "metadata": {"date": 1590975732, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s384636936.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s384636936", "user_id": "u073232808"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.math.BigDecimal\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextDouble()\n val b = sc.nextDouble()\n println(problem169c(a, b))\n}\n\nfun problem169c(a: Double, b: Double): String {\n return BigDecimal(a).multiply(BigDecimal(b).multiply(100.toBigDecimal())).div(100.toBigDecimal()).toString().split(\".\")[0]\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 380, "cpu_time_ms": 142, "memory_kb": 40072}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s282437709", "group_id": "codeNet:p02659", "input_text": "fun main(args: Array) {\n val inputs = readLine()!!.split(\" \")\n\n val A = inputs[0].toLong()\n val B = inputs[1].toDouble()\n val result = (A * B).toLong()\n\n println(result)\n}\n", "language": "Kotlin", "metadata": {"date": 1590975299, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s282437709.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s282437709", "user_id": "u932970230"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "fun main(args: Array) {\n val inputs = readLine()!!.split(\" \")\n\n val A = inputs[0].toLong()\n val B = inputs[1].toDouble()\n val result = (A * B).toLong()\n\n println(result)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 195, "cpu_time_ms": 92, "memory_kb": 35860}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s333725144", "group_id": "codeNet:p02659", "input_text": "import java.math.BigDecimal\nimport java.math.RoundingMode\n\nfun main(args: Array) {\n val (a, b) = readLine()!!.split(' ').map{ BigDecimal(it) }\n val ab = a*b\n println(ab.setScale(0, RoundingMode.DOWN).toPlainString())\n}\n", "language": "Kotlin", "metadata": {"date": 1590975115, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s333725144.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s333725144", "user_id": "u288435405"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.math.BigDecimal\nimport java.math.RoundingMode\n\nfun main(args: Array) {\n val (a, b) = readLine()!!.split(' ').map{ BigDecimal(it) }\n val ab = a*b\n println(ab.setScale(0, RoundingMode.DOWN).toPlainString())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 236, "cpu_time_ms": 102, "memory_kb": 36684}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s434163816", "group_id": "codeNet:p02659", "input_text": "import java.math.BigDecimal\n\nfun main(args: Array) {\n val inputs = readLine()!!.split(\" \").map(String::toDouble)\n\n var sum: BigDecimal = BigDecimal.valueOf(inputs[0]).multiply(BigDecimal.valueOf(inputs[1]))\n\n println(sum.toLong())\n}\n", "language": "Kotlin", "metadata": {"date": 1590974893, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s434163816.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s434163816", "user_id": "u143634246"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.math.BigDecimal\n\nfun main(args: Array) {\n val inputs = readLine()!!.split(\" \").map(String::toDouble)\n\n var sum: BigDecimal = BigDecimal.valueOf(inputs[0]).multiply(BigDecimal.valueOf(inputs[1]))\n\n println(sum.toLong())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 250, "cpu_time_ms": 103, "memory_kb": 36816}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s302701119", "group_id": "codeNet:p02659", "input_text": "import kotlin.math.floor\nfun doubleList() = readLine()?.split(\" \")?.map(String::toDouble) ?: TODO()\nfun main(args: Array) {\n val (a, b) = doubleList()\n println(floor(a * b).toLong())\n}", "language": "Kotlin", "metadata": {"date": 1590974506, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s302701119.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s302701119", "user_id": "u979429407"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import kotlin.math.floor\nfun doubleList() = readLine()?.split(\" \")?.map(String::toDouble) ?: TODO()\nfun main(args: Array) {\n val (a, b) = doubleList()\n println(floor(a * b).toLong())\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 198, "cpu_time_ms": 97, "memory_kb": 36520}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s285079122", "group_id": "codeNet:p02659", "input_text": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\nval readString: ()->String = {readLine()!!}\nval readInt: ()->Int = {readLine()!!.toInt()}\nval readLong: ()->Long = {readLine()!!.toLong()}\nval readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nval readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nval errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nval MOD = 1e9.toLong()+7\nval INF = Int.MAX_VALUE/2\nval LINF = Long.MAX_VALUE/2\ndata class IntPair(val first: Int, val second: Int)\ndata class To(val idx: Int, val cost: Long)\n\n\nfun solve(): Int {\n var res = 0\n return res\n}\n\n\nfun main(args: Array) {\n val (SA, SB) = readString().split(\" \")\n val A = SA.toLong()\n val B = SB.toDouble()\n val BL = (B * 100).toLong()\n //val ans = solve()\n val ans = A * BL / 100\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1590974439, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s285079122.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s285079122", "user_id": "u404244809"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\nval readString: ()->String = {readLine()!!}\nval readInt: ()->Int = {readLine()!!.toInt()}\nval readLong: ()->Long = {readLine()!!.toLong()}\nval readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nval readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nval errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nval MOD = 1e9.toLong()+7\nval INF = Int.MAX_VALUE/2\nval LINF = Long.MAX_VALUE/2\ndata class IntPair(val first: Int, val second: Int)\ndata class To(val idx: Int, val cost: Long)\n\n\nfun solve(): Int {\n var res = 0\n return res\n}\n\n\nfun main(args: Array) {\n val (SA, SB) = readString().split(\" \")\n val A = SA.toLong()\n val B = SB.toDouble()\n val BL = (B * 100).toLong()\n //val ans = solve()\n val ans = A * BL / 100\n\n println(ans)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 907, "cpu_time_ms": 97, "memory_kb": 35976}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s790216512", "group_id": "codeNet:p02659", "input_text": "fun main(){\n val ab = readLine()!!.split(\" \")\n val a = ab[0].toLong()\n val b = ab[1].toDouble()\n val bb = b * 100 \n val ans = a * bb.toLong() / 100\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1590974314, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s790216512.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s790216512", "user_id": "u385678999"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "fun main(){\n val ab = readLine()!!.split(\" \")\n val a = ab[0].toLong()\n val b = ab[1].toDouble()\n val bb = b * 100 \n val ans = a * bb.toLong() / 100\n println(ans)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 181, "cpu_time_ms": 90, "memory_kb": 35888}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s435585968", "group_id": "codeNet:p02659", "input_text": "fun main() = Thread(null, ::abc169c, \"(^o^)\", 128 * 1024 * 1024).apply { start() }.join()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc169c() {\n val (a, b) = readLine()!!.split(' ').map { it.toDouble() }\n\n val answer = (a * b).toLong()\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1590974041, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s435585968.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s435585968", "user_id": "u139478771"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "fun main() = Thread(null, ::abc169c, \"(^o^)\", 128 * 1024 * 1024).apply { start() }.join()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc169c() {\n val (a, b) = readLine()!!.split(' ').map { it.toDouble() }\n\n val answer = (a * b).toLong()\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 265, "cpu_time_ms": 108, "memory_kb": 36768}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s676228173", "group_id": "codeNet:p02659", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextLong()\n val b = sc.nextDouble()\n println(problem169c(a, b))\n}\n\nfun problem169c(a: Long, b: Double): Long {\n return (a * b).toLong()\n}", "language": "Kotlin", "metadata": {"date": 1590974030, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s676228173.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s676228173", "user_id": "u073232808"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextLong()\n val b = sc.nextDouble()\n println(problem169c(a, b))\n}\n\nfun problem169c(a: Long, b: Double): Long {\n return (a * b).toLong()\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 247, "cpu_time_ms": 126, "memory_kb": 37976}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s449549872", "group_id": "codeNet:p02659", "input_text": "fun main(args: Array) {\n val (a, b) = readLine()!!.split(\" \").map { it.toBigDecimal() }\n\n val ans = (a * b).toLong()\n\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1590973963, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s449549872.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s449549872", "user_id": "u621958170"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "fun main(args: Array) {\n val (a, b) = readLine()!!.split(\" \").map { it.toBigDecimal() }\n\n val ans = (a * b).toLong()\n\n println(ans)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 150, "cpu_time_ms": 107, "memory_kb": 36580}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s468446028", "group_id": "codeNet:p02659", "input_text": "import java.util.*\n\nfun main(args : Array) {\n val sc = Scanner(System.`in`)\n val A = sc.nextDouble()\n val B = sc.nextDouble()\n println((A*B).toInt())\n}\n", "language": "Kotlin", "metadata": {"date": 1590973804, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s468446028.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s468446028", "user_id": "u209749609"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.util.*\n\nfun main(args : Array) {\n val sc = Scanner(System.`in`)\n val A = sc.nextDouble()\n val B = sc.nextDouble()\n println((A*B).toInt())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 172, "cpu_time_ms": 129, "memory_kb": 37988}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s456302176", "group_id": "codeNet:p02659", "input_text": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n\nimport java.io.PrintWriter\nimport java.math.MathContext\nimport java.math.RoundingMode\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\nfun PrintWriter.solve() {\n val numCases = 1//readInt()\n for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n val a = read().toBigDecimal()\n val b = read().toBigDecimal()\n\n val ans = (a * b).toLong()\n println(ans)\n }\n}\n\nconst val lim = 1e18.toLong()\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(true) {\n when(c) {\n '\\n', Char.MIN_VALUE -> return@buildString\n else -> {\n append(c)\n c = readChar()\n }\n }\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "language": "Kotlin", "metadata": {"date": 1590973787, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s456302176.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s456302176", "user_id": "u596111103"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n\nimport java.io.PrintWriter\nimport java.math.MathContext\nimport java.math.RoundingMode\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\nfun PrintWriter.solve() {\n val numCases = 1//readInt()\n for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n val a = read().toBigDecimal()\n val b = read().toBigDecimal()\n\n val ans = (a * b).toLong()\n println(ans)\n }\n}\n\nconst val lim = 1e18.toLong()\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(true) {\n when(c) {\n '\\n', Char.MIN_VALUE -> return@buildString\n else -> {\n append(c)\n c = readChar()\n }\n }\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4533, "cpu_time_ms": 82, "memory_kb": 34632}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s517168657", "group_id": "codeNet:p02659", "input_text": "fun main(){\n val (A, B) = readLine()!!.split(\" \").map { it.toDouble() }\n println((A*B).toLong())\n}", "language": "Kotlin", "metadata": {"date": 1590973748, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s517168657.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s517168657", "user_id": "u531770859"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "fun main(){\n val (A, B) = readLine()!!.split(\" \").map { it.toDouble() }\n println((A*B).toLong())\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 104, "cpu_time_ms": 101, "memory_kb": 36532}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s155662974", "group_id": "codeNet:p02659", "input_text": "import java.util.*\n\nfun str() = readLine()!!\nfun int() = str().toInt()\nfun long() = str().toLong()\n\nfun read(d:String = \" \") = str().split(d)\nfun list(d:String = \" \",f:String.()->T) = read(d).map {f(it)}\nfun list() = list {toInt()}.toIntArray()\n\nfun T.print() = this.also(::println)\n\nfun main() {\n\tabc000X()\n}\n\nfun abc000X() {\n\tval s = Scanner(System.`in`)\n\tval a = s.nextLong()\n\tval b = s.next().replace(\".\",\"\").toLong()\n\tprintln(a*b/100)\n}\n", "language": "Kotlin", "metadata": {"date": 1590973672, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s155662974.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s155662974", "user_id": "u059234158"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.util.*\n\nfun str() = readLine()!!\nfun int() = str().toInt()\nfun long() = str().toLong()\n\nfun read(d:String = \" \") = str().split(d)\nfun list(d:String = \" \",f:String.()->T) = read(d).map {f(it)}\nfun list() = list {toInt()}.toIntArray()\n\nfun T.print() = this.also(::println)\n\nfun main() {\n\tabc000X()\n}\n\nfun abc000X() {\n\tval s = Scanner(System.`in`)\n\tval a = s.nextLong()\n\tval b = s.next().replace(\".\",\"\").toLong()\n\tprintln(a*b/100)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 450, "cpu_time_ms": 158, "memory_kb": 41896}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s970190378", "group_id": "codeNet:p02659", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val a = sc.nextLong()\n val b = sc.nextDouble()\n val c = (b * 100).toLong()\n println((a * c) / 100)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "language": "Kotlin", "metadata": {"date": 1590973430, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02659.html", "problem_id": "p02659", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02659/input.txt", "sample_output_relpath": "derived/input_output/data/p02659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02659/Kotlin/s970190378.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s970190378", "user_id": "u190507186"}, "prompt_components": {"gold_output": "217\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val a = sc.nextLong()\n val b = sc.nextDouble()\n val c = (b * 100).toLong()\n println((a * c) / 100)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "sample_input": "198 1.10\n"}, "reference_outputs": ["217\n"], "source_document_id": "p02659", "source_text": "Score : 300 points\n\nProblem Statement\n\nCompute A \\times B, truncate its fractional part, and print the result as an integer.\n\nConstraints\n\n0 \\leq A \\leq 10^{15}\n\n0 \\leq B < 10\n\nA is an integer.\n\nB is a number with two digits after the decimal point.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n198 1.10\n\nSample Output 1\n\n217\n\nWe have 198 \\times 1.10 = 217.8. After truncating the fractional part, we have the answer: 217.\n\nSample Input 2\n\n1 0.01\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1000000000000000 9.99\n\nSample Output 3\n\n9990000000000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 919, "cpu_time_ms": 84, "memory_kb": 34600}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s186686895", "group_id": "codeNet:p02684", "input_text": "import java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.util.*\nimport kotlin.math.abs\nimport kotlin.math.max\nimport kotlin.math.min\n\nval br = BufferedReader(InputStreamReader(System.`in`))\nval out = PrintWriter(System.out)\n\nfun main() {\n br.use { out.use {\n solve()\n out.flush()\n } }\n}\n\nfun solve() {\n val (n, k) = readLongList()\n val aList = readIntegerList().map { it - 1 }\n\n val counts = IntArray(n.toInt())\n var current = 0\n var i = 0\n while (counts[current] == 0) {\n counts[current] = i\n val next = aList[current]\n current = next\n i++\n }\n\n val ans = if (k <= counts[current]) {\n current = 0\n repeat(k.toInt()) { current = aList[current] }\n current + 1\n } else {\n val tmp = k - counts[current]\n val loopCount = counts.max()!! - counts[current] + 1\n val ansIndex = tmp % loopCount\n repeat(ansIndex.toInt()) { current = aList[current] }\n current + 1\n }\n out.println(ans)\n}\n\nfun readInteger() = Integer.parseInt(br.readLine())\nfun readLong() = java.lang.Long.parseLong(br.readLine())\nfun readStringList() = br.readLine()!!.split(' ')\nfun readIntegerList() = readStringList().map(Integer::parseInt)\nfun readLongList() = readStringList().map(java.lang.Long::parseLong)\nfun readDoubleList() = readStringList().map(java.lang.Double::parseDouble)\n", "language": "Kotlin", "metadata": {"date": 1598814433, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s186686895.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s186686895", "user_id": "u784448849"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.util.*\nimport kotlin.math.abs\nimport kotlin.math.max\nimport kotlin.math.min\n\nval br = BufferedReader(InputStreamReader(System.`in`))\nval out = PrintWriter(System.out)\n\nfun main() {\n br.use { out.use {\n solve()\n out.flush()\n } }\n}\n\nfun solve() {\n val (n, k) = readLongList()\n val aList = readIntegerList().map { it - 1 }\n\n val counts = IntArray(n.toInt())\n var current = 0\n var i = 0\n while (counts[current] == 0) {\n counts[current] = i\n val next = aList[current]\n current = next\n i++\n }\n\n val ans = if (k <= counts[current]) {\n current = 0\n repeat(k.toInt()) { current = aList[current] }\n current + 1\n } else {\n val tmp = k - counts[current]\n val loopCount = counts.max()!! - counts[current] + 1\n val ansIndex = tmp % loopCount\n repeat(ansIndex.toInt()) { current = aList[current] }\n current + 1\n }\n out.println(ans)\n}\n\nfun readInteger() = Integer.parseInt(br.readLine())\nfun readLong() = java.lang.Long.parseLong(br.readLine())\nfun readStringList() = br.readLine()!!.split(' ')\nfun readIntegerList() = readStringList().map(Integer::parseInt)\nfun readLongList() = readStringList().map(java.lang.Long::parseLong)\nfun readDoubleList() = readStringList().map(java.lang.Double::parseDouble)\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1426, "cpu_time_ms": 351, "memory_kb": 65352}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s285107847", "group_id": "codeNet:p02684", "input_text": "//package abc167.D\n\nimport java.io.*\nimport java.math.*\nimport java.util.*\nimport kotlin.math.*\n\nvar reader: BufferedReader = System.`in`.bufferedReader()\nvar writer: PrintWriter = PrintWriter(System.`out`)\n\nfun next() = reader.readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextStrings() = next().split(\" \")\nfun nextInts() = nextStrings().map { it.toInt() }\nfun nextLongs() = nextStrings().map { it.toLong() }\nfun nextDoubles() = nextStrings().map { it.toDouble() }\n\nfun put(v: Any?) = writer.print(v)\nfun puts() = writer.println()\nfun puts(v: Any?) = writer.println(v)\n\nvar debug = false\nfun dp(v: Any?) {\n if (debug) println(v)\n}\nfun dp() {\n if (debug) println()\n}\n\nfun test(case: Int, input: String, expected: String) {\n reader = input.trimIndent().reader().buffered()\n\n val stringWriter = StringWriter()\n writer = PrintWriter(stringWriter)\n\n solve()\n writer.flush()\n\n val actual = stringWriter.toString()\n\n println(\"[test $case]\")\n if (\"${expected}\" == actual) {\n println(\"OK\")\n } else {\n println(\"NG\")\n println()\n println(\"expected: \\\"${expected}\\\"\")\n println(\"actual: \\\"${actual}\\\"\")\n }\n println()\n}\n\nfun main(args: Array) {\n if ((args.size == 1) && (args[0] == \"test\")) {\n testAll()\n } else {\n solve()\n writer.flush()\n }\n}\n\n///////////////////////////////////////////////////////////\n\nfun testAll() {\n debug = true\n\n test(1,\n \"\"\"\n 4 5\n 3 2 4 1\n \"\"\",\n \"4\")\n test(2,\n \"\"\"\n 6 727202214173249351\n 6 5 2 5 3 2\n \"\"\",\n \"2\")\n}\n\nfun solve() {\n val (_, K) = nextLongs()\n val towns = nextInts()\n\n val visited = mutableMapOf()\n var t = 1\n var first = 0L\n var second = 0L\n for (i in 0 until K) {\n if (visited.containsKey(t)) {\n first = visited[t]!!\n second = i\n break;\n }\n visited.put(t, i)\n t = towns[t-1]\n }\n\n val len = second - first\n val remain = (K - first) % len\n for (i in 0 until remain) {\n t = towns[t-1]\n }\n\n put(t)\n}\n", "language": "Kotlin", "metadata": {"date": 1590808773, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s285107847.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s285107847", "user_id": "u116752827"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "//package abc167.D\n\nimport java.io.*\nimport java.math.*\nimport java.util.*\nimport kotlin.math.*\n\nvar reader: BufferedReader = System.`in`.bufferedReader()\nvar writer: PrintWriter = PrintWriter(System.`out`)\n\nfun next() = reader.readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextStrings() = next().split(\" \")\nfun nextInts() = nextStrings().map { it.toInt() }\nfun nextLongs() = nextStrings().map { it.toLong() }\nfun nextDoubles() = nextStrings().map { it.toDouble() }\n\nfun put(v: Any?) = writer.print(v)\nfun puts() = writer.println()\nfun puts(v: Any?) = writer.println(v)\n\nvar debug = false\nfun dp(v: Any?) {\n if (debug) println(v)\n}\nfun dp() {\n if (debug) println()\n}\n\nfun test(case: Int, input: String, expected: String) {\n reader = input.trimIndent().reader().buffered()\n\n val stringWriter = StringWriter()\n writer = PrintWriter(stringWriter)\n\n solve()\n writer.flush()\n\n val actual = stringWriter.toString()\n\n println(\"[test $case]\")\n if (\"${expected}\" == actual) {\n println(\"OK\")\n } else {\n println(\"NG\")\n println()\n println(\"expected: \\\"${expected}\\\"\")\n println(\"actual: \\\"${actual}\\\"\")\n }\n println()\n}\n\nfun main(args: Array) {\n if ((args.size == 1) && (args[0] == \"test\")) {\n testAll()\n } else {\n solve()\n writer.flush()\n }\n}\n\n///////////////////////////////////////////////////////////\n\nfun testAll() {\n debug = true\n\n test(1,\n \"\"\"\n 4 5\n 3 2 4 1\n \"\"\",\n \"4\")\n test(2,\n \"\"\"\n 6 727202214173249351\n 6 5 2 5 3 2\n \"\"\",\n \"2\")\n}\n\nfun solve() {\n val (_, K) = nextLongs()\n val towns = nextInts()\n\n val visited = mutableMapOf()\n var t = 1\n var first = 0L\n var second = 0L\n for (i in 0 until K) {\n if (visited.containsKey(t)) {\n first = visited[t]!!\n second = i\n break;\n }\n visited.put(t, i)\n t = towns[t-1]\n }\n\n val len = second - first\n val remain = (K - first) % len\n for (i in 0 until remain) {\n t = towns[t-1]\n }\n\n put(t)\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2165, "cpu_time_ms": 402, "memory_kb": 77360}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s749941217", "group_id": "codeNet:p02684", "input_text": "import java.io.PrintWriter\nimport java.util.ArrayDeque\n\nfun main() {\n PrintWriter(System.out).use { out ->\n solve(out)\n out.flush()\n }\n}\n\nfun solve(out: PrintWriter) {\n val (n, k) = readLongList()\n val aList = readIntegerList().map { it - 1 }\n val count = IntArray(n.toInt()) { -1 }\n var cur = 0\n var i = 0\n while (true) {\n if (count[cur] != -1) {\n break\n }\n\n count[cur] = i\n i++\n cur = aList[cur]\n }\n\n if (k - count[cur] < 0) {\n cur = 0\n repeat(k.toInt()) {\n cur = aList[cur]\n }\n println(cur + 1)\n } else {\n val tmp = i - count[cur]\n val tmp2 = (k - count[cur]) % tmp\n\n repeat(tmp2.toInt()) {\n cur = aList[cur]\n }\n println(cur + 1)\n }\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\nfun readDoubleList() = readStringList().map(String::toDouble)\n", "language": "Kotlin", "metadata": {"date": 1590383583, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s749941217.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s749941217", "user_id": "u784448849"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.ArrayDeque\n\nfun main() {\n PrintWriter(System.out).use { out ->\n solve(out)\n out.flush()\n }\n}\n\nfun solve(out: PrintWriter) {\n val (n, k) = readLongList()\n val aList = readIntegerList().map { it - 1 }\n val count = IntArray(n.toInt()) { -1 }\n var cur = 0\n var i = 0\n while (true) {\n if (count[cur] != -1) {\n break\n }\n\n count[cur] = i\n i++\n cur = aList[cur]\n }\n\n if (k - count[cur] < 0) {\n cur = 0\n repeat(k.toInt()) {\n cur = aList[cur]\n }\n println(cur + 1)\n } else {\n val tmp = i - count[cur]\n val tmp2 = (k - count[cur]) % tmp\n\n repeat(tmp2.toInt()) {\n cur = aList[cur]\n }\n println(cur + 1)\n }\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\nfun readDoubleList() = readStringList().map(String::toDouble)\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1127, "cpu_time_ms": 406, "memory_kb": 64116}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s942401614", "group_id": "codeNet:p02684", "input_text": "fun readList(del:String = \" \",f:String.()->T) = readLine()!!.split(del).map {f(it)}\n\nfun main() {\n\tvar (n,k) = readList {toLong()}\n\tval a = readList {toInt()-1}\n\tval c = Array(a.size) {-1}\n\n\tvar i = 0\n\tvar t = 0\n\twhile(k>=0) {\n\t\tif(c[i]>=0)\n\t\t\tk %= t-c[i]\n\n\t\tif(k==0L) {\n\t\t\tprintln(i+1)\n\t\t\treturn\n\t\t}\n\t\t--k\n\t\tc[i] = t++\n\t\ti = a[i]\n\t}\n}\n", "language": "Kotlin", "metadata": {"date": 1589860684, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s942401614.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s942401614", "user_id": "u059234158"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun readList(del:String = \" \",f:String.()->T) = readLine()!!.split(del).map {f(it)}\n\nfun main() {\n\tvar (n,k) = readList {toLong()}\n\tval a = readList {toInt()-1}\n\tval c = Array(a.size) {-1}\n\n\tvar i = 0\n\tvar t = 0\n\twhile(k>=0) {\n\t\tif(c[i]>=0)\n\t\t\tk %= t-c[i]\n\n\t\tif(k==0L) {\n\t\t\tprintln(i+1)\n\t\t\treturn\n\t\t}\n\t\t--k\n\t\tc[i] = t++\n\t\ti = a[i]\n\t}\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 340, "cpu_time_ms": 393, "memory_kb": 64040}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s710630586", "group_id": "codeNet:p02684", "input_text": "fun main() {\n val (n, K) = run {\n val (n, k) = readLine()!!.split(' ').map { it.toLong() }\n n.toInt() to k\n }\n\n val t = Array(60) { IntArray(n + 1) }\n t[0] = IntArray(1) + readLine()!!.split(' ').map { it.toInt() }.toIntArray()\n\n for (i in 0 until 59) {\n for (j in 1..n) {\n t[i + 1][j] = t[i][t[i][j]]\n }\n }\n\n val ans = run {\n var k = K\n var v = 1\n for (i in (0 until 60).reversed()) {\n val l = 1L shl i\n if (l <= k) {\n v = t[i][v]\n k -= l\n }\n }\n v\n }\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1589752366, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s710630586.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s710630586", "user_id": "u863309603"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main() {\n val (n, K) = run {\n val (n, k) = readLine()!!.split(' ').map { it.toLong() }\n n.toInt() to k\n }\n\n val t = Array(60) { IntArray(n + 1) }\n t[0] = IntArray(1) + readLine()!!.split(' ').map { it.toInt() }.toIntArray()\n\n for (i in 0 until 59) {\n for (j in 1..n) {\n t[i + 1][j] = t[i][t[i][j]]\n }\n }\n\n val ans = run {\n var k = K\n var v = 1\n for (i in (0 until 60).reversed()) {\n val l = 1L shl i\n if (l <= k) {\n v = t[i][v]\n k -= l\n }\n }\n v\n }\n\n println(ans)\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 633, "cpu_time_ms": 508, "memory_kb": 116260}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s869139602", "group_id": "codeNet:p02684", "input_text": "fun main() {\n val (n, k) = run {\n val (n, k) = readLine()!!.split(' ').map { it.toLong() }\n n.toInt() to k\n }\n val a = readLine()!!.split(' ').map { it.toInt() }\n\n val (s, l, c) = run {\n val r = mutableListOf()\n val visited = IntArray(n + 1) { -1 }\n\n var v = 1\n while (visited[v] == -1) {\n visited[v] = r.size\n r.add(v)\n v = a[v - 1]\n }\n\n val l = visited[v]\n val c = r.size - visited[v]\n Triple(r, l, c)\n }\n\n val i = if (k < l) {\n k.toInt()\n } else {\n ((k - l) % c).toInt() + l\n }\n\n println(s[i])\n}\n", "language": "Kotlin", "metadata": {"date": 1589750110, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s869139602.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s869139602", "user_id": "u863309603"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main() {\n val (n, k) = run {\n val (n, k) = readLine()!!.split(' ').map { it.toLong() }\n n.toInt() to k\n }\n val a = readLine()!!.split(' ').map { it.toInt() }\n\n val (s, l, c) = run {\n val r = mutableListOf()\n val visited = IntArray(n + 1) { -1 }\n\n var v = 1\n while (visited[v] == -1) {\n visited[v] = r.size\n r.add(v)\n v = a[v - 1]\n }\n\n val l = visited[v]\n val c = r.size - visited[v]\n Triple(r, l, c)\n }\n\n val i = if (k < l) {\n k.toInt()\n } else {\n ((k - l) % c).toInt() + l\n }\n\n println(s[i])\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 648, "cpu_time_ms": 389, "memory_kb": 64468}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s579489222", "group_id": "codeNet:p02684", "input_text": "fun main(){\n val nk = readLine()!!.split(\" \").map { it.toLong() }\n val n = nk[0].toInt()\n val k = nk[1]\n val a = readLine()!!.split(\" \").map { it.toInt() }\n var count:Long = 0\n val flagList = List(n){ 0 }.toMutableList()\n val countFlag = MutableList(n){ 0 }\n countFlag[0] = a[0]\n flagList[0] = 1\n\n fun mytereport(y: Int) {\n count++\n if (flagList[a[y] - 1] != 0){\n val mae = flagList[a[y] - 1]\n count -= mae\n count += 1\n return\n } else {\n flagList[a[y] - 1] = count.toInt() + 1\n countFlag[count.toInt()] = a[y]\n mytereport(a[y] - 1)\n }\n }\n mytereport(0)\n\n val x = k % count\n println(countFlag[x.toInt()])\n}\n\n\n", "language": "Kotlin", "metadata": {"date": 1589338930, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s579489222.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s579489222", "user_id": "u385678999"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(){\n val nk = readLine()!!.split(\" \").map { it.toLong() }\n val n = nk[0].toInt()\n val k = nk[1]\n val a = readLine()!!.split(\" \").map { it.toInt() }\n var count:Long = 0\n val flagList = List(n){ 0 }.toMutableList()\n val countFlag = MutableList(n){ 0 }\n countFlag[0] = a[0]\n flagList[0] = 1\n\n fun mytereport(y: Int) {\n count++\n if (flagList[a[y] - 1] != 0){\n val mae = flagList[a[y] - 1]\n count -= mae\n count += 1\n return\n } else {\n flagList[a[y] - 1] = count.toInt() + 1\n countFlag[count.toInt()] = a[y]\n mytereport(a[y] - 1)\n }\n }\n mytereport(0)\n\n val x = k % count\n println(countFlag[x.toInt()])\n}\n\n\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 755, "cpu_time_ms": 430, "memory_kb": 65332}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s088104435", "group_id": "codeNet:p02684", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val k = sc.nextLong()\n val a = (0 until n).map { sc.next().toInt() }\n println(problem167d(n, k, a))\n}\n\nfun problem167d(n: Int, k: Long, a: List): Int {\n val visited = hashMapOf()\n visited[1] = 1\n var loopPoint = -1 to -1\n var current = 1\n for (i in 0 until n) {\n val next = a[current - 1]\n if (i.toLong() >= k - 1) {\n return next\n }\n if (visited.contains(next)) {\n loopPoint = next to i + 1 - visited[next]!!\n break\n }\n visited[next] = i + 1\n current = next\n }\n\n val loopIndex = (k - visited[loopPoint.first]!!) % loopPoint.second\n current = loopPoint.first\n for (i in 0 until loopIndex) {\n current = a[current - 1]\n }\n return current\n}", "language": "Kotlin", "metadata": {"date": 1589244591, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s088104435.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s088104435", "user_id": "u073232808"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val k = sc.nextLong()\n val a = (0 until n).map { sc.next().toInt() }\n println(problem167d(n, k, a))\n}\n\nfun problem167d(n: Int, k: Long, a: List): Int {\n val visited = hashMapOf()\n visited[1] = 1\n var loopPoint = -1 to -1\n var current = 1\n for (i in 0 until n) {\n val next = a[current - 1]\n if (i.toLong() >= k - 1) {\n return next\n }\n if (visited.contains(next)) {\n loopPoint = next to i + 1 - visited[next]!!\n break\n }\n visited[next] = i + 1\n current = next\n }\n\n val loopIndex = (k - visited[loopPoint.first]!!) % loopPoint.second\n current = loopPoint.first\n for (i in 0 until loopIndex) {\n current = a[current - 1]\n }\n return current\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 894, "cpu_time_ms": 535, "memory_kb": 66984}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s495793156", "group_id": "codeNet:p02684", "input_text": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\n////////////////////////////////////////////////////////////////////////\n\n////////////////////////////////////////////////////////////////////////\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val K = sc.next().toLong()\n val A = IntArray(N) { sc.next().toInt() - 1 }\n val to = Array(N) { IntArray(60) }\n for (i in 0 until N) to[i][0] = A[i]\n repeat(59) { r ->\n repeat(N) { i ->\n to[i][r + 1] = to[to[i][r]][r]\n }\n }\n //to.forEach { println(it.joinToString(\" \"))}\n\n var k = K\n var ans = 0\n for (r in 59 downTo 0) {\n val l = 1L shl r\n if (k >= l) {\n ans = to[ans][r]\n k -= l\n }\n }\n pw.println(ans + 1)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1589235251, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s495793156.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s495793156", "user_id": "u297767059"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\n////////////////////////////////////////////////////////////////////////\n\n////////////////////////////////////////////////////////////////////////\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val K = sc.next().toLong()\n val A = IntArray(N) { sc.next().toInt() - 1 }\n val to = Array(N) { IntArray(60) }\n for (i in 0 until N) to[i][0] = A[i]\n repeat(59) { r ->\n repeat(N) { i ->\n to[i][r + 1] = to[to[i][r]][r]\n }\n }\n //to.forEach { println(it.joinToString(\" \"))}\n\n var k = K\n var ans = 0\n for (r in 59 downTo 0) {\n val l = 1L shl r\n if (k >= l) {\n ans = to[ans][r]\n k -= l\n }\n }\n pw.println(ans + 1)\n }\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1546, "cpu_time_ms": 722, "memory_kb": 104268}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s622951196", "group_id": "codeNet:p02684", "input_text": "import java.io.IOException\nimport java.io.InputStream\nimport java.util.NoSuchElementException\n\nval scanner = FastScanner()\n\nfun main() {\n val N = scanner.nextInt()\n val K = scanner.nextLong()\n val A = scanner.readIntArray(N).map { it - 1 }\n val visitedA = IntArray(N)\n\n var current = 0\n var shuuki = 0\n var currentTime = 0\n var flag = false\n for (i in 1..N) {\n current = A[current]\n\n if (i >= K) {\n flag = true\n break\n }\n\n if (visitedA[current] != 0) {\n shuuki = i - visitedA[current]\n currentTime = i\n break\n }\n\n visitedA[current] = i\n }\n\n if (!flag) {\n val amari = (K - currentTime) % shuuki\n for (i in 0 until amari) {\n current = A[current]\n }\n }\n\n println(current + 1)\n}\n\n@Suppress(\"MemberVisibilityCanBePrivate\")\nclass FastScanner {\n private val `in`: InputStream = System.`in`\n private val buffer = ByteArray(1024)\n private var ptr = 0\n private var buflen = 0\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n\n private fun readByte(): Int {\n return if (hasNextByte()) buffer[ptr++].toInt() else -1\n }\n\n operator fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n operator fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n\n return buildString {\n var b = readByte()\n\n while (isPrintableChar(b)) {\n appendCodePoint(b)\n b = readByte()\n }\n }\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByte()\n\n if (b == '-'.toInt()) {\n minus = true\n b = readByte()\n }\n\n if (b < '0'.toInt() || '9'.toInt() < b) {\n throw NumberFormatException()\n }\n\n while (true) {\n if ('0'.toInt() <= b && b <= '9'.toInt()) {\n n *= 10\n n += b - '0'.toInt().toLong()\n } else if (b == -1 || !isPrintableChar(b)) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl < Int.MIN_VALUE || nl > Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun nextDouble(): Double {\n return next().toDouble()\n }\n\n fun readIntArray(n: Int): IntArray {\n val arr = IntArray(n)\n\n for (i in 0 until n) {\n arr[i] = nextInt()\n }\n\n return arr\n }\n\n companion object {\n private fun isPrintableChar(c: Int): Boolean {\n return c in 33..126\n }\n }\n}\n\ninline fun IntArray.map(transform: (Int) -> Int): IntArray {\n for (i in indices) {\n this[i] = transform(this[i])\n }\n\n return this\n}\n", "language": "Kotlin", "metadata": {"date": 1589212811, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s622951196.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s622951196", "user_id": "u996672406"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.IOException\nimport java.io.InputStream\nimport java.util.NoSuchElementException\n\nval scanner = FastScanner()\n\nfun main() {\n val N = scanner.nextInt()\n val K = scanner.nextLong()\n val A = scanner.readIntArray(N).map { it - 1 }\n val visitedA = IntArray(N)\n\n var current = 0\n var shuuki = 0\n var currentTime = 0\n var flag = false\n for (i in 1..N) {\n current = A[current]\n\n if (i >= K) {\n flag = true\n break\n }\n\n if (visitedA[current] != 0) {\n shuuki = i - visitedA[current]\n currentTime = i\n break\n }\n\n visitedA[current] = i\n }\n\n if (!flag) {\n val amari = (K - currentTime) % shuuki\n for (i in 0 until amari) {\n current = A[current]\n }\n }\n\n println(current + 1)\n}\n\n@Suppress(\"MemberVisibilityCanBePrivate\")\nclass FastScanner {\n private val `in`: InputStream = System.`in`\n private val buffer = ByteArray(1024)\n private var ptr = 0\n private var buflen = 0\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n\n private fun readByte(): Int {\n return if (hasNextByte()) buffer[ptr++].toInt() else -1\n }\n\n operator fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n operator fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n\n return buildString {\n var b = readByte()\n\n while (isPrintableChar(b)) {\n appendCodePoint(b)\n b = readByte()\n }\n }\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByte()\n\n if (b == '-'.toInt()) {\n minus = true\n b = readByte()\n }\n\n if (b < '0'.toInt() || '9'.toInt() < b) {\n throw NumberFormatException()\n }\n\n while (true) {\n if ('0'.toInt() <= b && b <= '9'.toInt()) {\n n *= 10\n n += b - '0'.toInt().toLong()\n } else if (b == -1 || !isPrintableChar(b)) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl < Int.MIN_VALUE || nl > Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun nextDouble(): Double {\n return next().toDouble()\n }\n\n fun readIntArray(n: Int): IntArray {\n val arr = IntArray(n)\n\n for (i in 0 until n) {\n arr[i] = nextInt()\n }\n\n return arr\n }\n\n companion object {\n private fun isPrintableChar(c: Int): Boolean {\n return c in 33..126\n }\n }\n}\n\ninline fun IntArray.map(transform: (Int) -> Int): IntArray {\n for (i in indices) {\n this[i] = transform(this[i])\n }\n\n return this\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3405, "cpu_time_ms": 133, "memory_kb": 37796}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s316526525", "group_id": "codeNet:p02684", "input_text": "import kotlin.math.*\nimport java.util.*\n\ndata class Visit(var seq: Int = 0, var visited: Boolean = false)\n\nfun main(args: Array) {\n val (_n, _k) = readLine()!!.split(' ')\n val n = _n.toInt()\n val k = _k.toLong()\n val a = readLine()!!.split(' ').map(String::toInt)\n\n val v = Array(n) { Visit() }\n val r = mutableListOf()\n var cur = 1\n var seq = 0\n while (!v[cur - 1].visited) {\n val visit = v[cur - 1]\n visit.seq = seq++\n visit.visited = true\n r += cur\n cur = a[cur - 1]\n }\n val p = v[cur - 1]\n val len = r.size - p.seq\n println(r[p.seq + ((k - p.seq) % len).toInt()])\n}\n", "language": "Kotlin", "metadata": {"date": 1589186338, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s316526525.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s316526525", "user_id": "u051841332"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import kotlin.math.*\nimport java.util.*\n\ndata class Visit(var seq: Int = 0, var visited: Boolean = false)\n\nfun main(args: Array) {\n val (_n, _k) = readLine()!!.split(' ')\n val n = _n.toInt()\n val k = _k.toLong()\n val a = readLine()!!.split(' ').map(String::toInt)\n\n val v = Array(n) { Visit() }\n val r = mutableListOf()\n var cur = 1\n var seq = 0\n while (!v[cur - 1].visited) {\n val visit = v[cur - 1]\n visit.seq = seq++\n visit.visited = true\n r += cur\n cur = a[cur - 1]\n }\n val p = v[cur - 1]\n val len = r.size - p.seq\n println(r[p.seq + ((k - p.seq) % len).toInt()])\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 611, "cpu_time_ms": 425, "memory_kb": 75640}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s680814933", "group_id": "codeNet:p02684", "input_text": "import java.io.PrintWriter\n\nfun main() = abc167d()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc167d() = IO_abc167d().exec {\n val (n, k) = readLongList(2)\n val aList = readIntList(n.toInt()).map { it - 1 }.toIntArray()\n\n val visited = mutableSetOf(0)\n val indices = mutableListOf(0)\n var outerLoopLength = 0\n var currIndex = 0\n\n while (true) {\n currIndex = aList[currIndex]\n if (!visited.add(currIndex)) break\n\n outerLoopLength++\n indices.add(currIndex)\n }\n\n if (outerLoopLength >= k) return@exec println(indices[k.toInt()] + 1)\n\n val visitedInLoop = mutableSetOf()\n var loopLength = 0L\n val path = LongArray(n.toInt()) { -1L }\n\n while (true) {\n if (!visitedInLoop.add(currIndex)) break\n path[currIndex] = loopLength\n loopLength++\n currIndex = aList[currIndex]\n }\n\n val answer = path.indexOfFirst { it == (k - outerLoopLength - 1) % loopLength } + 1\n\n println(answer)\n}\n\n//region\n@Suppress(\"unused\", \"ClassName\", \"SpellCheckingInspection\", \"ConvertToStringTemplate\")\nprivate class IO_abc167d {\n private val input = System.`in`\n private val buffer = ByteArray(1024)\n private var pointer = 0\n private var bufferLength = 0\n private val pw = PrintWriter(System.out)\n private fun Byte.isPrintable() = this in 33..126\n private fun Byte.isNumeric() = this in '0'.toByte()..'9'.toByte()\n private fun Byte.toNumVal() =\n if (this.isNumeric()) this - '0'.toByte() else error(this.toString() + \" is not numeric\")\n\n private fun hasNextByte(): Boolean {\n return if (pointer < bufferLength) true else {\n pointer = 0\n bufferLength = input.read(buffer)\n bufferLength > 0\n }\n }\n\n private fun readByte(): Byte = if (hasNextByte()) buffer[pointer++] else -1\n private fun skipUnprintable() = run { while (hasNextByte() && !buffer[pointer].isPrintable()) pointer++ }\n private fun hasNext(): Boolean = run { skipUnprintable() }.run { hasNextByte() }\n private fun hasNextOrError() = if (!hasNext()) error(\"has no next element.\") else Unit\n\n fun readString(): String {\n hasNextOrError()\n val sb = StringBuilder()\n var b = readByte()\n while (b.isPrintable()) {\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun readLong(): Long {\n hasNextOrError()\n var n = 0L\n var negative = false\n var b = readByte()\n if (b == '-'.toByte()) {\n negative = true\n b = readByte()\n }\n if (!b.isNumeric()) error(b.toString() + \" is not numeric.\")\n while (true) {\n when {\n b.isNumeric() -> n = n * 10 + b.toNumVal()\n b.toInt() == -1 || !b.isPrintable() -> return if (negative) -n else n\n else -> error(\"failed to parse. [n=\" + n + \", b=\" + b + \"]\")\n }\n b = readByte()\n }\n }\n\n fun readInt() = readLong()\n .let { if (it in Int.MIN_VALUE..Int.MAX_VALUE) it.toInt() else error(it.toString() + \" is not in range of Int.\") }\n\n fun readDouble(): Double {\n var n = 0.0\n var div = 1.0\n var negative = false\n var b = readByte()\n if (b == '-'.toByte()) {\n negative = true\n b = readByte()\n }\n do n = n * 10 + b.toNumVal()\n while (run { b = readByte() }.run { b.isNumeric() })\n if (b == '.'.toByte()) {\n while (run { b = readByte() }.run { b.isNumeric() })\n n += b.toNumVal() / (run { div *= 10 }.run { div })\n }\n return if (negative) -n else n\n }\n\n fun readStringList(size: Int) = readList(size) { readString() }\n fun readIntList(size: Int) = readList(size) { readInt() }\n fun readLongList(size: Int) = readList(size) { readLong() }\n fun readDoubleList(size: Int) = readList(size) { readDouble() }\n fun readIntArray(size: Int) = IntArray(size) { readInt() }\n fun readLongArray(size: Int) = LongArray(size) { readLong() }\n fun readDoubleArray(size: Int) = DoubleArray(size) { readDouble() }\n inline fun readArray(size: Int, init: () -> T) = Array(size) { init() }\n inline fun readList(size: Int, init: () -> T) = List(size) { init() }\n fun println() = pw.println()\n fun print(o: Any?) = pw.print(o)\n fun println(o: Any?) = pw.println(o)\n fun exec(code: IO_abc167d.() -> Unit) = run { code() }.run { pw.flush() }\n}\n// endregion\n", "language": "Kotlin", "metadata": {"date": 1589184895, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s680814933.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s680814933", "user_id": "u139478771"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun main() = abc167d()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc167d() = IO_abc167d().exec {\n val (n, k) = readLongList(2)\n val aList = readIntList(n.toInt()).map { it - 1 }.toIntArray()\n\n val visited = mutableSetOf(0)\n val indices = mutableListOf(0)\n var outerLoopLength = 0\n var currIndex = 0\n\n while (true) {\n currIndex = aList[currIndex]\n if (!visited.add(currIndex)) break\n\n outerLoopLength++\n indices.add(currIndex)\n }\n\n if (outerLoopLength >= k) return@exec println(indices[k.toInt()] + 1)\n\n val visitedInLoop = mutableSetOf()\n var loopLength = 0L\n val path = LongArray(n.toInt()) { -1L }\n\n while (true) {\n if (!visitedInLoop.add(currIndex)) break\n path[currIndex] = loopLength\n loopLength++\n currIndex = aList[currIndex]\n }\n\n val answer = path.indexOfFirst { it == (k - outerLoopLength - 1) % loopLength } + 1\n\n println(answer)\n}\n\n//region\n@Suppress(\"unused\", \"ClassName\", \"SpellCheckingInspection\", \"ConvertToStringTemplate\")\nprivate class IO_abc167d {\n private val input = System.`in`\n private val buffer = ByteArray(1024)\n private var pointer = 0\n private var bufferLength = 0\n private val pw = PrintWriter(System.out)\n private fun Byte.isPrintable() = this in 33..126\n private fun Byte.isNumeric() = this in '0'.toByte()..'9'.toByte()\n private fun Byte.toNumVal() =\n if (this.isNumeric()) this - '0'.toByte() else error(this.toString() + \" is not numeric\")\n\n private fun hasNextByte(): Boolean {\n return if (pointer < bufferLength) true else {\n pointer = 0\n bufferLength = input.read(buffer)\n bufferLength > 0\n }\n }\n\n private fun readByte(): Byte = if (hasNextByte()) buffer[pointer++] else -1\n private fun skipUnprintable() = run { while (hasNextByte() && !buffer[pointer].isPrintable()) pointer++ }\n private fun hasNext(): Boolean = run { skipUnprintable() }.run { hasNextByte() }\n private fun hasNextOrError() = if (!hasNext()) error(\"has no next element.\") else Unit\n\n fun readString(): String {\n hasNextOrError()\n val sb = StringBuilder()\n var b = readByte()\n while (b.isPrintable()) {\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun readLong(): Long {\n hasNextOrError()\n var n = 0L\n var negative = false\n var b = readByte()\n if (b == '-'.toByte()) {\n negative = true\n b = readByte()\n }\n if (!b.isNumeric()) error(b.toString() + \" is not numeric.\")\n while (true) {\n when {\n b.isNumeric() -> n = n * 10 + b.toNumVal()\n b.toInt() == -1 || !b.isPrintable() -> return if (negative) -n else n\n else -> error(\"failed to parse. [n=\" + n + \", b=\" + b + \"]\")\n }\n b = readByte()\n }\n }\n\n fun readInt() = readLong()\n .let { if (it in Int.MIN_VALUE..Int.MAX_VALUE) it.toInt() else error(it.toString() + \" is not in range of Int.\") }\n\n fun readDouble(): Double {\n var n = 0.0\n var div = 1.0\n var negative = false\n var b = readByte()\n if (b == '-'.toByte()) {\n negative = true\n b = readByte()\n }\n do n = n * 10 + b.toNumVal()\n while (run { b = readByte() }.run { b.isNumeric() })\n if (b == '.'.toByte()) {\n while (run { b = readByte() }.run { b.isNumeric() })\n n += b.toNumVal() / (run { div *= 10 }.run { div })\n }\n return if (negative) -n else n\n }\n\n fun readStringList(size: Int) = readList(size) { readString() }\n fun readIntList(size: Int) = readList(size) { readInt() }\n fun readLongList(size: Int) = readList(size) { readLong() }\n fun readDoubleList(size: Int) = readList(size) { readDouble() }\n fun readIntArray(size: Int) = IntArray(size) { readInt() }\n fun readLongArray(size: Int) = LongArray(size) { readLong() }\n fun readDoubleArray(size: Int) = DoubleArray(size) { readDouble() }\n inline fun readArray(size: Int, init: () -> T) = Array(size) { init() }\n inline fun readList(size: Int, init: () -> T) = List(size) { init() }\n fun println() = pw.println()\n fun print(o: Any?) = pw.print(o)\n fun println(o: Any?) = pw.println(o)\n fun exec(code: IO_abc167d.() -> Unit) = run { code() }.run { pw.flush() }\n}\n// endregion\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4537, "cpu_time_ms": 330, "memory_kb": 73124}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s500133520", "group_id": "codeNet:p02684", "input_text": "fun main() {\n val (n, k) = readLine()!!.split(\" \").map { it.toLong() }\n val list = readLine()!!.split(\" \").map { it.toInt() }\n\n val pointList = mutableListOf(1, list[0])\n var index = list[0] - 1\n\n var hasHead = false\n var head = 0\n for (i in 0..n) {\n val point = list[index]\n if (!hasHead && pointList.contains(point)) {\n head = pointList.indexOfFirst { it == point }\n hasHead = head != 0\n break\n }\n\n pointList.add(point)\n index = point - 1\n }\n\n if (hasHead) {\n if (k <= head) {\n println(list[head])\n } else {\n val subList = pointList.subList(head, pointList.size)\n val lastPosition = (k - head) % subList.size\n println(subList[lastPosition.toInt()])\n }\n } else {\n val lastPosition = k % pointList.size\n println(pointList[lastPosition.toInt()])\n }\n}", "language": "Kotlin", "metadata": {"date": 1589174117, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s500133520.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s500133520", "user_id": "u897579945"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main() {\n val (n, k) = readLine()!!.split(\" \").map { it.toLong() }\n val list = readLine()!!.split(\" \").map { it.toInt() }\n\n val pointList = mutableListOf(1, list[0])\n var index = list[0] - 1\n\n var hasHead = false\n var head = 0\n for (i in 0..n) {\n val point = list[index]\n if (!hasHead && pointList.contains(point)) {\n head = pointList.indexOfFirst { it == point }\n hasHead = head != 0\n break\n }\n\n pointList.add(point)\n index = point - 1\n }\n\n if (hasHead) {\n if (k <= head) {\n println(list[head])\n } else {\n val subList = pointList.subList(head, pointList.size)\n val lastPosition = (k - head) % subList.size\n println(subList[lastPosition.toInt()])\n }\n } else {\n val lastPosition = k % pointList.size\n println(pointList[lastPosition.toInt()])\n }\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 929, "cpu_time_ms": 2208, "memory_kb": 64480}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s511758295", "group_id": "codeNet:p02684", "input_text": "fun main() {\n val l = readLine()!!.split(' ').map { it.toLong() }\n val a = readLine()!!.split(' ').map { it.toInt() }\n val visited: MutableList = mutableListOf(0)\n\n var loopStart = 0\n fun teleport(x: Int) {\n if (!visited.contains(x)) {\n visited.add(x)\n teleport(a[x]-1)\n } else {\n loopStart = visited.indexOf(x)\n }\n }\n teleport(a[0]-1)\n\n val res = if (l[1] < visited[loopStart]!!) {\n visited[l[1].toInt()]\n } else {\n visited[((l[1]-loopStart)%(visited.size-loopStart)+loopStart).toInt()]\n }\n println(res+1)\n}\n", "language": "Kotlin", "metadata": {"date": 1589171705, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s511758295.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s511758295", "user_id": "u213256030"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main() {\n val l = readLine()!!.split(' ').map { it.toLong() }\n val a = readLine()!!.split(' ').map { it.toInt() }\n val visited: MutableList = mutableListOf(0)\n\n var loopStart = 0\n fun teleport(x: Int) {\n if (!visited.contains(x)) {\n visited.add(x)\n teleport(a[x]-1)\n } else {\n loopStart = visited.indexOf(x)\n }\n }\n teleport(a[0]-1)\n\n val res = if (l[1] < visited[loopStart]!!) {\n visited[l[1].toInt()]\n } else {\n visited[((l[1]-loopStart)%(visited.size-loopStart)+loopStart).toInt()]\n }\n println(res+1)\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 615, "cpu_time_ms": 445, "memory_kb": 65796}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s947288558", "group_id": "codeNet:p02684", "input_text": "private val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = { readLine()!!.toInt() }\nprivate val readLong: ()->Long = { readLine()!!.toLong() }\nprivate val readListInt: ()->List = { readLine()!!.split(' ').map(String::toInt) }\nprivate val readListLong: ()->List = { readLine()!!.split(' ').map(String::toLong) }\nprivate val errPrintln: (String)->Unit = { msg -> System.err.println(msg) }\nprivate const val MOD = 1_000_000_007L\n\nvar A = ArrayList()\nvar step = ArrayList()\n\nfun solveD(N: Int, K: Long): Int {\n\n for (i in 0 until N) {\n step.add(-1L)\n }\n\n fun dfs(x: Int, sp:Long): Pair {\n if (sp>=K) {\n return Pair(x, -1L);\n }\n\n if (step[x] >= 0L) {\n return Pair(x,sp)\n }\n\n step[x] = sp\n return dfs(A[x], sp + 1L)\n }\n\n var pos = dfs(0, 0L)\n if (pos.second < 0L) {\n return pos.first + 1;\n }\n\n errPrintln(\"pos: ${pos.first}\")\n errPrintln(\"step[start]: ${step[pos.first]}\")\n errPrintln(\"step[end]: ${pos.second}\")\n\n val move = (K - step[pos.first]) % (pos.second - step[pos.first])\n errPrintln(\"move: $move\")\n assert(move < K)\n\n fun dfs2(n: Long, x: Int): Int {\n if (n >= move) {\n return x\n }\n return dfs2(n + 1L, A[x])\n }\n\n return dfs2(0L, pos.first) + 1\n}\n\n\nfun main(args: Array) {\n val (n,K) = readListLong()\n val N = n.toInt()\n val a = readListInt()\n\n for(i in 0 until N) {\n A.add(a[i] - 1)\n }\n\n val ans = solveD(N, K)\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1589170073, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s947288558.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s947288558", "user_id": "u404244809"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "private val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = { readLine()!!.toInt() }\nprivate val readLong: ()->Long = { readLine()!!.toLong() }\nprivate val readListInt: ()->List = { readLine()!!.split(' ').map(String::toInt) }\nprivate val readListLong: ()->List = { readLine()!!.split(' ').map(String::toLong) }\nprivate val errPrintln: (String)->Unit = { msg -> System.err.println(msg) }\nprivate const val MOD = 1_000_000_007L\n\nvar A = ArrayList()\nvar step = ArrayList()\n\nfun solveD(N: Int, K: Long): Int {\n\n for (i in 0 until N) {\n step.add(-1L)\n }\n\n fun dfs(x: Int, sp:Long): Pair {\n if (sp>=K) {\n return Pair(x, -1L);\n }\n\n if (step[x] >= 0L) {\n return Pair(x,sp)\n }\n\n step[x] = sp\n return dfs(A[x], sp + 1L)\n }\n\n var pos = dfs(0, 0L)\n if (pos.second < 0L) {\n return pos.first + 1;\n }\n\n errPrintln(\"pos: ${pos.first}\")\n errPrintln(\"step[start]: ${step[pos.first]}\")\n errPrintln(\"step[end]: ${pos.second}\")\n\n val move = (K - step[pos.first]) % (pos.second - step[pos.first])\n errPrintln(\"move: $move\")\n assert(move < K)\n\n fun dfs2(n: Long, x: Int): Int {\n if (n >= move) {\n return x\n }\n return dfs2(n + 1L, A[x])\n }\n\n return dfs2(0L, pos.first) + 1\n}\n\n\nfun main(args: Array) {\n val (n,K) = readListLong()\n val N = n.toInt()\n val a = readListInt()\n\n for(i in 0 until N) {\n A.add(a[i] - 1)\n }\n\n val ans = solveD(N, K)\n\n println(ans)\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1584, "cpu_time_ms": 457, "memory_kb": 74480}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s928501600", "group_id": "codeNet:p02684", "input_text": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n\nimport java.io.PrintWriter\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\nfun PrintWriter.solve() {\n val n = readInt()\n val k = readLong()\n\n val A = IntArray(n) { readInt()-1 }\n\n val ans = run ans@{\n val H = IntList()\n val I = IntArray(n) { -1 }\n\n var i = 0\n var p = 0\n\n while(true) {\n if(i.toLong() == k) return@ans p\n H.add(p)\n if(I[p] == -1) {\n I[p] = i\n i++\n p = A[p]\n } else {\n val s = I[p]\n val x = s + ((k - s) % (i - s)).toInt()\n return@ans H[x]\n }\n }\n 0\n } + 1\n\n println(ans)\n}\n\nclass IntList(initialCapacity: Int = 12) {\n private var _arr = IntArray(initialCapacity)\n private val capacity get() = _arr.size\n var size = 0\n private set\n inline val lastIndex get() = size - 1\n inline val indices get() = 0 until size\n\n constructor(copyFrom: IntArray): this(copyFrom.size) { copyFrom.copyInto(_arr); size = copyFrom.size }\n constructor(copyFrom: Collection): this(copyFrom.size) { _arr = copyFrom.toIntArray(); size = copyFrom.size }\n\n fun contentEquals(other: IntList): Boolean {\n return this === other || size == other.size && indices.all { this[it] == other[it] }\n }\n\n private fun grow(minCapacity: Int = 8) {\n val newCapacity = maxOf(minCapacity, capacity + (capacity shr 1))\n _arr = _arr.copyOf(newCapacity)\n }\n\n fun ensureCapacity(minCapacity: Int) { if(capacity < minCapacity) grow(minCapacity) }\n\n operator fun get(index: Int): Int {\n require(index in 0 until size)\n return _arr[index]\n }\n\n operator fun set(index: Int, value: Int) {\n require(index in 0 until size)\n _arr[index] = value\n }\n\n fun add(value: Int) {\n if(size == capacity) grow()\n _arr[size++] = value\n }\n\n fun add(index: Int, element: Int) {\n if(size == capacity) grow()\n _arr.copyInto(_arr, index + 1, index, size)\n size++\n set(index, element)\n }\n\n fun clear() { size = 0 }\n\n fun removeAt(index: Int): Int {\n val e = get(index)\n _arr.copyInto(_arr, index, index + 1, size)\n size--\n return e\n }\n\n operator fun iterator() = object: IntIterator() {\n private var pos = 0\n override fun hasNext() = pos < size\n override fun nextInt() = get(pos++)\n }\n\n inline fun isEmpty() = size == 0\n inline fun isNotEmpty() = size != 0\n\n fun pop() = _arr[--size]\n\n fun swap(i: Int, j: Int) { val t = this[i]; this[i] = this[j]; this[j] = t }\n fun reverse() {\n for(i in 0 until size / 2) swap(i, lastIndex - i)\n }\n\n fun shuffle(rnd: Random = random) = _shuffle(rnd, _arr::get, _arr::set, size)\n fun sort() { shuffle(); _arr._sort(0, size) }\n fun sortDescending() { sort(); reverse() }\n\n fun joinToString(separator: CharSequence) = if(size == 0) \"\" else let {\n buildString {\n append(it[0])\n for (i in 1 until size) {\n append(separator).append(it[i])\n }\n }\n }\n\n override fun toString() = \"[\" + joinToString(\", \") + \"]\"\n\n fun toIntArray() = _arr.copyOf(size)\n fun toList() = List(size, ::get)\n\n inline fun first() = get(0)\n inline fun last() = get(lastIndex)\n}\n\ninline fun IntList(size: Int, init: (Int) -> Int) = IntList(size).apply {\n for(i in 0 until size) { add(init(i)) }\n}\ninline fun IntArray.toIntList() = IntList(this)\ninline fun Collection.toIntList() = IntList(this)\ninline fun intListOf(vararg values: Int) = IntList(values)\n\nfun IntList.max() = (1 until size).fold(this[0]) { acc, i -> max(acc, this[i]) }\nfun IntList.min() = (1 until size).fold(this[0]) { acc, i -> min(acc, this[i]) }\nfun IntList.getOrNull(i: Int) = if(i in indices) get(i) else null\ninline fun IntList.count(predicate: (Int) -> Boolean) = indices.count { predicate(this[it]) }\nfun IntList.copyOf() = IntList(size, ::get)\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\n@JvmField val _reader = INPUT.bufferedReader()\nfun readLine(): String? = _reader.readLine()\nfun readLn() = _reader.readLine()!!\n@JvmField var _ln = \"\"\n@JvmField var _lnPtr = 0\nfun read(): String {\n while (_lnPtr >= _ln.length) {\n _ln = readLine() ?: return \"\"\n _lnPtr = 0\n }\n var j = _ln.indexOf(' ', _lnPtr)\n if(j < 0) j = _ln.length\n val res = _ln.substring(_lnPtr, j)\n _lnPtr = j + 1\n return res\n}\nfun readRem(): String /* reads remainder of current line */ =\n _ln.substring(min(_lnPtr, _ln.length)).also { _lnPtr = _ln.length }\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "language": "Kotlin", "metadata": {"date": 1589168347, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s928501600.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s928501600", "user_id": "u596111103"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n\nimport java.io.PrintWriter\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\nfun PrintWriter.solve() {\n val n = readInt()\n val k = readLong()\n\n val A = IntArray(n) { readInt()-1 }\n\n val ans = run ans@{\n val H = IntList()\n val I = IntArray(n) { -1 }\n\n var i = 0\n var p = 0\n\n while(true) {\n if(i.toLong() == k) return@ans p\n H.add(p)\n if(I[p] == -1) {\n I[p] = i\n i++\n p = A[p]\n } else {\n val s = I[p]\n val x = s + ((k - s) % (i - s)).toInt()\n return@ans H[x]\n }\n }\n 0\n } + 1\n\n println(ans)\n}\n\nclass IntList(initialCapacity: Int = 12) {\n private var _arr = IntArray(initialCapacity)\n private val capacity get() = _arr.size\n var size = 0\n private set\n inline val lastIndex get() = size - 1\n inline val indices get() = 0 until size\n\n constructor(copyFrom: IntArray): this(copyFrom.size) { copyFrom.copyInto(_arr); size = copyFrom.size }\n constructor(copyFrom: Collection): this(copyFrom.size) { _arr = copyFrom.toIntArray(); size = copyFrom.size }\n\n fun contentEquals(other: IntList): Boolean {\n return this === other || size == other.size && indices.all { this[it] == other[it] }\n }\n\n private fun grow(minCapacity: Int = 8) {\n val newCapacity = maxOf(minCapacity, capacity + (capacity shr 1))\n _arr = _arr.copyOf(newCapacity)\n }\n\n fun ensureCapacity(minCapacity: Int) { if(capacity < minCapacity) grow(minCapacity) }\n\n operator fun get(index: Int): Int {\n require(index in 0 until size)\n return _arr[index]\n }\n\n operator fun set(index: Int, value: Int) {\n require(index in 0 until size)\n _arr[index] = value\n }\n\n fun add(value: Int) {\n if(size == capacity) grow()\n _arr[size++] = value\n }\n\n fun add(index: Int, element: Int) {\n if(size == capacity) grow()\n _arr.copyInto(_arr, index + 1, index, size)\n size++\n set(index, element)\n }\n\n fun clear() { size = 0 }\n\n fun removeAt(index: Int): Int {\n val e = get(index)\n _arr.copyInto(_arr, index, index + 1, size)\n size--\n return e\n }\n\n operator fun iterator() = object: IntIterator() {\n private var pos = 0\n override fun hasNext() = pos < size\n override fun nextInt() = get(pos++)\n }\n\n inline fun isEmpty() = size == 0\n inline fun isNotEmpty() = size != 0\n\n fun pop() = _arr[--size]\n\n fun swap(i: Int, j: Int) { val t = this[i]; this[i] = this[j]; this[j] = t }\n fun reverse() {\n for(i in 0 until size / 2) swap(i, lastIndex - i)\n }\n\n fun shuffle(rnd: Random = random) = _shuffle(rnd, _arr::get, _arr::set, size)\n fun sort() { shuffle(); _arr._sort(0, size) }\n fun sortDescending() { sort(); reverse() }\n\n fun joinToString(separator: CharSequence) = if(size == 0) \"\" else let {\n buildString {\n append(it[0])\n for (i in 1 until size) {\n append(separator).append(it[i])\n }\n }\n }\n\n override fun toString() = \"[\" + joinToString(\", \") + \"]\"\n\n fun toIntArray() = _arr.copyOf(size)\n fun toList() = List(size, ::get)\n\n inline fun first() = get(0)\n inline fun last() = get(lastIndex)\n}\n\ninline fun IntList(size: Int, init: (Int) -> Int) = IntList(size).apply {\n for(i in 0 until size) { add(init(i)) }\n}\ninline fun IntArray.toIntList() = IntList(this)\ninline fun Collection.toIntList() = IntList(this)\ninline fun intListOf(vararg values: Int) = IntList(values)\n\nfun IntList.max() = (1 until size).fold(this[0]) { acc, i -> max(acc, this[i]) }\nfun IntList.min() = (1 until size).fold(this[0]) { acc, i -> min(acc, this[i]) }\nfun IntList.getOrNull(i: Int) = if(i in indices) get(i) else null\ninline fun IntList.count(predicate: (Int) -> Boolean) = indices.count { predicate(this[it]) }\nfun IntList.copyOf() = IntList(size, ::get)\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\n@JvmField val _reader = INPUT.bufferedReader()\nfun readLine(): String? = _reader.readLine()\nfun readLn() = _reader.readLine()!!\n@JvmField var _ln = \"\"\n@JvmField var _lnPtr = 0\nfun read(): String {\n while (_lnPtr >= _ln.length) {\n _ln = readLine() ?: return \"\"\n _lnPtr = 0\n }\n var j = _ln.indexOf(' ', _lnPtr)\n if(j < 0) j = _ln.length\n val res = _ln.substring(_lnPtr, j)\n _lnPtr = j + 1\n return res\n}\nfun readRem(): String /* reads remainder of current line */ =\n _ln.substring(min(_lnPtr, _ln.length)).also { _lnPtr = _ln.length }\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7641, "cpu_time_ms": 252, "memory_kb": 56432}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s434552003", "group_id": "codeNet:p02684", "input_text": "private val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = { readLine()!!.toInt() }\nprivate val readLong: ()->Long = { readLine()!!.toLong() }\nprivate val readListInt: ()->List = { readLine()!!.split(' ').map(String::toInt) }\nprivate val readListLong: ()->List = { readLine()!!.split(' ').map(String::toLong) }\nprivate val errPrintln: (String)->Unit = { msg -> System.err.println(msg) }\nprivate const val MOD = 1_000_000_007L\n\n\nfun solveD(N: Int, K: Long, A:Array): Int {\n\n var step = Array(N){-1L}\n\n fun dfs(x: Int, sp:Long): Pair {\n if (sp>=K) {\n return Pair(x, -1);\n }\n\n if (step[x]>=0) {\n return Pair(x,sp)\n }\n\n step[x] = sp\n return dfs(A[x], sp+1)\n }\n\n var pos = dfs(0, 0L)\n if (pos.second<0) {\n return pos.first+1;\n }\n \n errPrintln(\"pos: ${pos.first}\")\n errPrintln(\"step[start]: ${step[pos.first]}\")\n errPrintln(\"step[end]: ${pos.second}\")\n\n val move = (K-step[pos.first])%(pos.second-step[pos.first])\n errPrintln(\"move: $move\")\n\n fun dfs2(n: Long, x: Int): Int {\n if (n>=move) {\n return x\n }\n return dfs2(n+1, A[x])\n }\n\n return dfs2(0L, pos.first) + 1\n}\n\n\nfun main(args: Array) {\n val (n,K) = readListLong()\n val N = n.toInt()\n val a = readListInt()\n var A = Array(N){0}\n for(i in 0 until N) {\n A[i] = a[i] - 1\n }\n\n val ans = solveD(N.toInt(), K, A)\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1589167338, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s434552003.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s434552003", "user_id": "u404244809"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "private val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = { readLine()!!.toInt() }\nprivate val readLong: ()->Long = { readLine()!!.toLong() }\nprivate val readListInt: ()->List = { readLine()!!.split(' ').map(String::toInt) }\nprivate val readListLong: ()->List = { readLine()!!.split(' ').map(String::toLong) }\nprivate val errPrintln: (String)->Unit = { msg -> System.err.println(msg) }\nprivate const val MOD = 1_000_000_007L\n\n\nfun solveD(N: Int, K: Long, A:Array): Int {\n\n var step = Array(N){-1L}\n\n fun dfs(x: Int, sp:Long): Pair {\n if (sp>=K) {\n return Pair(x, -1);\n }\n\n if (step[x]>=0) {\n return Pair(x,sp)\n }\n\n step[x] = sp\n return dfs(A[x], sp+1)\n }\n\n var pos = dfs(0, 0L)\n if (pos.second<0) {\n return pos.first+1;\n }\n \n errPrintln(\"pos: ${pos.first}\")\n errPrintln(\"step[start]: ${step[pos.first]}\")\n errPrintln(\"step[end]: ${pos.second}\")\n\n val move = (K-step[pos.first])%(pos.second-step[pos.first])\n errPrintln(\"move: $move\")\n\n fun dfs2(n: Long, x: Int): Int {\n if (n>=move) {\n return x\n }\n return dfs2(n+1, A[x])\n }\n\n return dfs2(0L, pos.first) + 1\n}\n\n\nfun main(args: Array) {\n val (n,K) = readListLong()\n val N = n.toInt()\n val a = readListInt()\n var A = Array(N){0}\n for(i in 0 until N) {\n A[i] = a[i] - 1\n }\n\n val ans = solveD(N.toInt(), K, A)\n\n println(ans)\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1523, "cpu_time_ms": 431, "memory_kb": 65288}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s751545162", "group_id": "codeNet:p02684", "input_text": "fun main() {\n val l = readLine()!!.split(\" \")\n val n = l[0].toInt()\n val k = l[1].toLong()\n val array = readLine()!!.split(\" \").map { it.toInt() - 1}\n val flags = Array(n){-1L}\n var current = 0\n var mod = 0L\n var remain = 0L\n for(i in 0..k-1){\n if(flags[current]!=-1L){\n mod = i-flags[current]\n remain = k-i\n break\n }\n flags[current] = i\n current = array[current]\n }\n if(mod==0L){\n println(current+1)\n return\n }\n val x = remain%mod\n if(x==0L) {\n println(current+1)\n }else{\n for(i in 0..x-1) {\n current = array[current]\n }\n println(current+1)\n }\n}", "language": "Kotlin", "metadata": {"date": 1589165351, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s751545162.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s751545162", "user_id": "u943726499"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main() {\n val l = readLine()!!.split(\" \")\n val n = l[0].toInt()\n val k = l[1].toLong()\n val array = readLine()!!.split(\" \").map { it.toInt() - 1}\n val flags = Array(n){-1L}\n var current = 0\n var mod = 0L\n var remain = 0L\n for(i in 0..k-1){\n if(flags[current]!=-1L){\n mod = i-flags[current]\n remain = k-i\n break\n }\n flags[current] = i\n current = array[current]\n }\n if(mod==0L){\n println(current+1)\n return\n }\n val x = remain%mod\n if(x==0L) {\n println(current+1)\n }else{\n for(i in 0..x-1) {\n current = array[current]\n }\n println(current+1)\n }\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 708, "cpu_time_ms": 428, "memory_kb": 64772}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s110826667", "group_id": "codeNet:p02684", "input_text": "fun main() {\n val (n, k) = readLine()!!.split(\" \")\n val list = readLine()!!.split(\" \").map(String::toInt)\n\n val pointList = mutableListOf(1, list[0])\n var index = list[0] - 1\n var diff = 0\n for (i in 0..n.toInt()) {\n val point = list[index]\n if (point == 1) {\n break\n }\n\n if (pointList.contains(point)) {\n val position = pointList.indexOfFirst { it == point }\n diff = pointList.size - position\n pointList.subList(0, position)\n break\n }\n\n pointList.add(point)\n index = point - 1\n }\n\n val last = ((k.toLong() - diff - 1) % pointList.size.toLong()).toInt()\n println(pointList[last])\n}", "language": "Kotlin", "metadata": {"date": 1589164814, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s110826667.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s110826667", "user_id": "u897579945"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main() {\n val (n, k) = readLine()!!.split(\" \")\n val list = readLine()!!.split(\" \").map(String::toInt)\n\n val pointList = mutableListOf(1, list[0])\n var index = list[0] - 1\n var diff = 0\n for (i in 0..n.toInt()) {\n val point = list[index]\n if (point == 1) {\n break\n }\n\n if (pointList.contains(point)) {\n val position = pointList.indexOfFirst { it == point }\n diff = pointList.size - position\n pointList.subList(0, position)\n break\n }\n\n pointList.add(point)\n index = point - 1\n }\n\n val last = ((k.toLong() - diff - 1) % pointList.size.toLong()).toInt()\n println(pointList[last])\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 712, "cpu_time_ms": 2208, "memory_kb": 64944}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s191012393", "group_id": "codeNet:p02684", "input_text": "fun main() {\n val l = readLine()!!.split(\" \")\n val n = l[0].toInt()\n val k = l[1].toLong()\n val array = readLine()!!.split(\" \").map { it.toInt() - 1}\n val flags = Array(n){-1L}\n var current = 0\n var mod = 0L\n var remain = 0L\n for(i in 0..k-1){\n if(flags[current]!=-1L){\n mod = i-flags[current]\n remain = k-i\n break\n }\n flags[current] = i\n current = array[current]\n }\n val x = remain%mod\n if(x==0L) {\n println(current+1)\n }else{\n for(i in 0..x-1) {\n current = array[current]\n }\n println(current+1)\n }\n}", "language": "Kotlin", "metadata": {"date": 1589164730, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s191012393.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s191012393", "user_id": "u943726499"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main() {\n val l = readLine()!!.split(\" \")\n val n = l[0].toInt()\n val k = l[1].toLong()\n val array = readLine()!!.split(\" \").map { it.toInt() - 1}\n val flags = Array(n){-1L}\n var current = 0\n var mod = 0L\n var remain = 0L\n for(i in 0..k-1){\n if(flags[current]!=-1L){\n mod = i-flags[current]\n remain = k-i\n break\n }\n flags[current] = i\n current = array[current]\n }\n val x = remain%mod\n if(x==0L) {\n println(current+1)\n }else{\n for(i in 0..x-1) {\n current = array[current]\n }\n println(current+1)\n }\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 643, "cpu_time_ms": 423, "memory_kb": 64608}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s317252172", "group_id": "codeNet:p02684", "input_text": "fun main() {\n val (n, k) = readLine()!!.split(\" \")\n val list = readLine()!!.split(\" \").map(String::toInt)\n\n val pointList = mutableListOf(1, list[0])\n var index = list[0] - 1\n for (i in 0..n.toInt()) {\n val point = list[index]\n if (point == 1) {\n break\n }\n\n pointList.add(point)\n index = point - 1\n }\n\n val last = (k.toLong() % pointList.size.toLong()).toInt()\n println(pointList[last])\n}", "language": "Kotlin", "metadata": {"date": 1589164404, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s317252172.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s317252172", "user_id": "u897579945"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main() {\n val (n, k) = readLine()!!.split(\" \")\n val list = readLine()!!.split(\" \").map(String::toInt)\n\n val pointList = mutableListOf(1, list[0])\n var index = list[0] - 1\n for (i in 0..n.toInt()) {\n val point = list[index]\n if (point == 1) {\n break\n }\n\n pointList.add(point)\n index = point - 1\n }\n\n val last = (k.toLong() % pointList.size.toLong()).toInt()\n println(pointList[last])\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 458, "cpu_time_ms": 388, "memory_kb": 64480}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s435624014", "group_id": "codeNet:p02684", "input_text": "//\n\nfun main() {\n abc167d()\n}\n\nfun abc167d() {\n val (n, k) = readLine()!!.split(\" \").map { it.toLong() }\n val town = readLine()!!.split(\" \").map { it.toInt() - 1 }\n var i = 0\n val visited = mutableSetOf(0)\n var isLooped = false\n var checkLooped = false\n var count = 0\n var loopReturnedNum = 0\n while (!checkLooped && count < n) {\n i = town[i]\n count++\n if (visited.contains(i)) {\n checkLooped = true\n loopReturnedNum = i\n } else {\n visited.add(i)\n }\n }\n val loopedCount = count\n var cycleCount = 0\n if (checkLooped) {\n count = 0\n while (!isLooped) {\n i = town[i]\n count ++\n if (i == loopReturnedNum) {\n cycleCount = count\n isLooped = true\n }\n }\n }\n val startCount = loopedCount - cycleCount\n val t = ((k - startCount) % cycleCount.toLong())\n i = 0\n if (startCount > k) {\n repeat(k.toInt()) {\n i = town[i]\n }\n println(i + 1)\n } else {\n repeat(t.toInt() + startCount) {\n i = town[i]\n }\n println(i + 1)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1589164355, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s435624014.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s435624014", "user_id": "u628907033"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "//\n\nfun main() {\n abc167d()\n}\n\nfun abc167d() {\n val (n, k) = readLine()!!.split(\" \").map { it.toLong() }\n val town = readLine()!!.split(\" \").map { it.toInt() - 1 }\n var i = 0\n val visited = mutableSetOf(0)\n var isLooped = false\n var checkLooped = false\n var count = 0\n var loopReturnedNum = 0\n while (!checkLooped && count < n) {\n i = town[i]\n count++\n if (visited.contains(i)) {\n checkLooped = true\n loopReturnedNum = i\n } else {\n visited.add(i)\n }\n }\n val loopedCount = count\n var cycleCount = 0\n if (checkLooped) {\n count = 0\n while (!isLooped) {\n i = town[i]\n count ++\n if (i == loopReturnedNum) {\n cycleCount = count\n isLooped = true\n }\n }\n }\n val startCount = loopedCount - cycleCount\n val t = ((k - startCount) % cycleCount.toLong())\n i = 0\n if (startCount > k) {\n repeat(k.toInt()) {\n i = town[i]\n }\n println(i + 1)\n } else {\n repeat(t.toInt() + startCount) {\n i = town[i]\n }\n println(i + 1)\n }\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1200, "cpu_time_ms": 492, "memory_kb": 76452}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s318901535", "group_id": "codeNet:p02684", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val (nl, k) = readListOfLong()\n val n = nl.toInt()\n val aList = readListOfInt().map { it-1 }\n var cur = 0\n var history = mutableListOf(cur)\n val visited = Array(n) { false }\n visited[0] = true\n for(i in 0 .. n) {\n cur = aList[cur]\n if(visited[cur]) break\n history.add(cur)\n visited[cur] = true\n }\n // println(\"cur: $cur\")\n val offset = history.indexOf(cur)\n // println(\"offset: $offset\")\n pw.flush()\n // println(history)\n if(offset > 0) {\n history = history.slice(offset until history.size).toMutableList()\n }\n // println(history)\n val loopSize = history.size.toLong()\n println(history[(Math.max(0L, k-offset.toLong()) % loopSize).toInt()] + 1)\n\tpw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n\t= this.groupBy { it }.mapValues { it.value.size }\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element >= this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn l\n}\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element <= this[mid]) { \n\t\t\tr = mid\n\t\t} else {\n\t\t\tl = mid + 1\n\t\t}\n\t}\n\treturn r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n\tval divisors = mutableListOf()\n\tfor(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n\t\tif(this % i == 0L) {\n\t\t\tdivisors.add(i)\n\t\t\tif(i != this/i) {\n\t\t\t\tdivisors.add(this/i)\n\t\t\t}\n\t\t}\n\t}\n\treturn divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n\tif(this==1L) return false\n\tfor(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n\t\tif(this % i == 0L && this != i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n\nfun permutations(src: List): List> {\n\tif(src.size == 1) return listOf(src)\n\tval perms = mutableListOf>()\n\tval insertElement = src[0]\n\tpermutations(src.drop(1)).forEach { perm ->\n\t\tfor(i in 0..perm.size) {\n\t\t\tval newPerm = perm.toMutableList()\n\t\t\tnewPerm.add(i, insertElement)\n\t\t\tperms.add(newPerm.toList())\n\t\t}\n\t}\n\treturn perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n\tval v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n\tfor(i in 0 until v.size) {\n\t\tv[i][0] = 1L\n\t\tv[i][i] = 1L\n\t}\n\tfor(i in 0 until v.size) {\n\t\tfor(j in 1 until i) {\n\t\t\tv[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n\t\t}\n\t}\n\treturn v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n\twhen {\n\t\tn == 0L -> 1L\n\t\tn == 1L -> a % mod\n\t\tn % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n\t\telse -> {\n\t\t\tval tmp = repeatedModPow(a, n / 2L, mod)\n\t\t\t(tmp * tmp) % mod\n\t\t}\n\t}\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n\tvar ret = 1L\n\tval min = Math.min(k, n-k)\n\t// まず分母の計算\n\tfor(i in n downTo (n - min + 1)) {\n\t\tret = ret * i % mod\n\t}\n\tfor(i in min downTo 1) {\n\t\tret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n\t}\n\treturn ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n\tval factorials = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval inverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval factorialInverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tfor(i in 2 .. n) {\n\t\tfactorials[i] = (factorials[i-1] * i.toLong() % mod)\n\t\tinverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n\t\tfactorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n\t}\n\n\treturn factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n\tif(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n\ta / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n\tvar num = num_\n\tvar rtn: Long = 0\n\twhile(num != 0.toLong()) {\n\t\tval tmp = num % 10\n\t\trtn += tmp\n\t\tnum /= 10\n\t}\n\treturn rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n\tprivate val parent: Array = Array(n) { 0 }\n\tprivate val rank: Array = Array(n) { 0 }\n\tprivate val size: Array = Array(n) { 0 }\n\n\tinit {\n\t\tfor(i in 0 until n) {\n\t\t\tparent[i] = i\n\t\t\trank[i] = 1\n\t\t\tsize[i] = 1\n\t\t}\n\t}\n\n\tfun union(u: Int, v: Int) {\n\t\tvar x = root(u)\n\t\tvar y = root(v)\n\t\tif(x != y) {\n\t\t\tif(rank[y] < rank[x]) {\n\t\t\t\tval tmp = y \n\t\t\t\ty = x\n\t\t\t\tx = tmp \n\t\t\t}\n\t\t\tparent[x] = y\n\t\t\trank[y] += rank[x]\n\t\t\trank[x] = -1\n\t\t\tval totalSize = size[x] + size[y]\n\t\t\tsize[x] = totalSize\n\t\t\tsize[y] = totalSize\n\t\t}\n\t}\n\n\tfun root(u: Int): Int {\n\t\tvar x = u\n\t\twhile(parent[x] != x) {\n\t\t\tx = parent[x]\n\t\t}\n\t\treturn x \n\t}\n\n\tfun size(u: Int): Int = size[root(u)]\n}\n", "language": "Kotlin", "metadata": {"date": 1589163957, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s318901535.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s318901535", "user_id": "u026686258"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val (nl, k) = readListOfLong()\n val n = nl.toInt()\n val aList = readListOfInt().map { it-1 }\n var cur = 0\n var history = mutableListOf(cur)\n val visited = Array(n) { false }\n visited[0] = true\n for(i in 0 .. n) {\n cur = aList[cur]\n if(visited[cur]) break\n history.add(cur)\n visited[cur] = true\n }\n // println(\"cur: $cur\")\n val offset = history.indexOf(cur)\n // println(\"offset: $offset\")\n pw.flush()\n // println(history)\n if(offset > 0) {\n history = history.slice(offset until history.size).toMutableList()\n }\n // println(history)\n val loopSize = history.size.toLong()\n println(history[(Math.max(0L, k-offset.toLong()) % loopSize).toInt()] + 1)\n\tpw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n\t= this.groupBy { it }.mapValues { it.value.size }\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element >= this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn l\n}\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element <= this[mid]) { \n\t\t\tr = mid\n\t\t} else {\n\t\t\tl = mid + 1\n\t\t}\n\t}\n\treturn r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n\tval divisors = mutableListOf()\n\tfor(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n\t\tif(this % i == 0L) {\n\t\t\tdivisors.add(i)\n\t\t\tif(i != this/i) {\n\t\t\t\tdivisors.add(this/i)\n\t\t\t}\n\t\t}\n\t}\n\treturn divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n\tif(this==1L) return false\n\tfor(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n\t\tif(this % i == 0L && this != i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n\nfun permutations(src: List): List> {\n\tif(src.size == 1) return listOf(src)\n\tval perms = mutableListOf>()\n\tval insertElement = src[0]\n\tpermutations(src.drop(1)).forEach { perm ->\n\t\tfor(i in 0..perm.size) {\n\t\t\tval newPerm = perm.toMutableList()\n\t\t\tnewPerm.add(i, insertElement)\n\t\t\tperms.add(newPerm.toList())\n\t\t}\n\t}\n\treturn perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n\tval v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n\tfor(i in 0 until v.size) {\n\t\tv[i][0] = 1L\n\t\tv[i][i] = 1L\n\t}\n\tfor(i in 0 until v.size) {\n\t\tfor(j in 1 until i) {\n\t\t\tv[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n\t\t}\n\t}\n\treturn v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n\twhen {\n\t\tn == 0L -> 1L\n\t\tn == 1L -> a % mod\n\t\tn % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n\t\telse -> {\n\t\t\tval tmp = repeatedModPow(a, n / 2L, mod)\n\t\t\t(tmp * tmp) % mod\n\t\t}\n\t}\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n\tvar ret = 1L\n\tval min = Math.min(k, n-k)\n\t// まず分母の計算\n\tfor(i in n downTo (n - min + 1)) {\n\t\tret = ret * i % mod\n\t}\n\tfor(i in min downTo 1) {\n\t\tret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n\t}\n\treturn ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n\tval factorials = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval inverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval factorialInverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tfor(i in 2 .. n) {\n\t\tfactorials[i] = (factorials[i-1] * i.toLong() % mod)\n\t\tinverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n\t\tfactorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n\t}\n\n\treturn factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n\tif(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n\ta / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n\tvar num = num_\n\tvar rtn: Long = 0\n\twhile(num != 0.toLong()) {\n\t\tval tmp = num % 10\n\t\trtn += tmp\n\t\tnum /= 10\n\t}\n\treturn rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n\tprivate val parent: Array = Array(n) { 0 }\n\tprivate val rank: Array = Array(n) { 0 }\n\tprivate val size: Array = Array(n) { 0 }\n\n\tinit {\n\t\tfor(i in 0 until n) {\n\t\t\tparent[i] = i\n\t\t\trank[i] = 1\n\t\t\tsize[i] = 1\n\t\t}\n\t}\n\n\tfun union(u: Int, v: Int) {\n\t\tvar x = root(u)\n\t\tvar y = root(v)\n\t\tif(x != y) {\n\t\t\tif(rank[y] < rank[x]) {\n\t\t\t\tval tmp = y \n\t\t\t\ty = x\n\t\t\t\tx = tmp \n\t\t\t}\n\t\t\tparent[x] = y\n\t\t\trank[y] += rank[x]\n\t\t\trank[x] = -1\n\t\t\tval totalSize = size[x] + size[y]\n\t\t\tsize[x] = totalSize\n\t\t\tsize[y] = totalSize\n\t\t}\n\t}\n\n\tfun root(u: Int): Int {\n\t\tvar x = u\n\t\twhile(parent[x] != x) {\n\t\t\tx = parent[x]\n\t\t}\n\t\treturn x \n\t}\n\n\tfun size(u: Int): Int = size[root(u)]\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5893, "cpu_time_ms": 434, "memory_kb": 71900}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s933688955", "group_id": "codeNet:p02684", "input_text": "fun main(args: Array) {\n val (Ns, Ks) = readStrings()\n val N = Ns.toInt()\n var K = Ks.toLong()\n val AN = readInts()\n\n val map = hashMapOf()\n val array = Array(N + 1) { 0 } // i 回目に到着する町がどこか\n array[0] = 1 // 始めは町１\n map[1] = 0\n\n var loopBegin = -1\n var loopEnd = -1\n\n for (i in 1..N) {\n val prev = array[i - 1]\n val current = AN[prev - 1]\n array[i] = current\n if (map.contains(array[i])) { // ループしたら終了\n loopBegin = current\n loopEnd = prev\n break\n }\n map[current] = i\n }\n\n// println(array.joinToString())\n// println(map)\n// println(\"$loopBegin $loopEnd\")\n\n if (K <= map.size) {\n println(array[K.toInt()])\n } else {\n val begin = map[loopBegin]!!\n val end = map[loopEnd]!!\n val loopSize = end - begin + 1\n K -= begin\n println(array[begin + (K % loopSize).toInt()])\n }\n}\n\nfun readString() = readLine()!!\nfun readStrings() = readString().split(\" \")\nfun readInt() = readString().toInt()\nfun readLong() = readString().toLong()\nfun readInts() = readStrings().map { it.toInt() }\nfun readLongs() = readStrings().map { it.toLong() }\n", "language": "Kotlin", "metadata": {"date": 1589162737, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s933688955.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s933688955", "user_id": "u979004569"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(args: Array) {\n val (Ns, Ks) = readStrings()\n val N = Ns.toInt()\n var K = Ks.toLong()\n val AN = readInts()\n\n val map = hashMapOf()\n val array = Array(N + 1) { 0 } // i 回目に到着する町がどこか\n array[0] = 1 // 始めは町１\n map[1] = 0\n\n var loopBegin = -1\n var loopEnd = -1\n\n for (i in 1..N) {\n val prev = array[i - 1]\n val current = AN[prev - 1]\n array[i] = current\n if (map.contains(array[i])) { // ループしたら終了\n loopBegin = current\n loopEnd = prev\n break\n }\n map[current] = i\n }\n\n// println(array.joinToString())\n// println(map)\n// println(\"$loopBegin $loopEnd\")\n\n if (K <= map.size) {\n println(array[K.toInt()])\n } else {\n val begin = map[loopBegin]!!\n val end = map[loopEnd]!!\n val loopSize = end - begin + 1\n K -= begin\n println(array[begin + (K % loopSize).toInt()])\n }\n}\n\nfun readString() = readLine()!!\nfun readStrings() = readString().split(\" \")\nfun readInt() = readString().toInt()\nfun readLong() = readString().toLong()\nfun readInts() = readStrings().map { it.toInt() }\nfun readLongs() = readStrings().map { it.toLong() }\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1157, "cpu_time_ms": 535, "memory_kb": 79640}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s988919747", "group_id": "codeNet:p02684", "input_text": "fun main(args: Array) = ABC167D.main()\n\nobject ABC167D {\n fun log(message: Any?) {\n println(message)// TODO: ←消す\n }\n\n fun main() {\n val (N, K) = readLongs()\n val A = listOf(-1) + readInts() // 1-indexed\n\n val visited = mutableSetOf(1)\n val dests = mutableListOf(1)\n\n var next = A[dests.last()]\n while (!visited.contains(next)) {\n dests.add(next)\n visited.add(next)\n next = A[dests.last()]\n }\n val loopStart = dests.indexOf(next)\n val loopRange = dests.size - loopStart\n\n val destIndex = if (K <= dests.lastIndex) K\n else ((K - loopStart) % loopRange) + loopStart\n\n val ans = dests[destIndex.toInt()]\n println(ans)\n }\n\n\n /*####################################################################################*/\n\n fun readString() = readLine()!!\n fun readStrings() = readLine()!!.split(\" \")\n fun readInt() = readLine()!!.toInt()\n fun readInts() = readLine()!!.split(\" \").map { it.toInt() }\n fun readLong() = readLine()!!.toLong()\n fun readLongs() = readLine()!!.split(\" \").map { it.toLong() }\n fun readMatrixRows(height: Int) = (1..height).map { readLine()!!.toList() }\n\n fun Boolean.yesOrNo() = if (this) \"Yes\" else \"No\"\n fun Double.toNaturalExpr() = println(\"%f\".format(this))\n}", "language": "Kotlin", "metadata": {"date": 1589162058, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s988919747.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s988919747", "user_id": "u981616728"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(args: Array) = ABC167D.main()\n\nobject ABC167D {\n fun log(message: Any?) {\n println(message)// TODO: ←消す\n }\n\n fun main() {\n val (N, K) = readLongs()\n val A = listOf(-1) + readInts() // 1-indexed\n\n val visited = mutableSetOf(1)\n val dests = mutableListOf(1)\n\n var next = A[dests.last()]\n while (!visited.contains(next)) {\n dests.add(next)\n visited.add(next)\n next = A[dests.last()]\n }\n val loopStart = dests.indexOf(next)\n val loopRange = dests.size - loopStart\n\n val destIndex = if (K <= dests.lastIndex) K\n else ((K - loopStart) % loopRange) + loopStart\n\n val ans = dests[destIndex.toInt()]\n println(ans)\n }\n\n\n /*####################################################################################*/\n\n fun readString() = readLine()!!\n fun readStrings() = readLine()!!.split(\" \")\n fun readInt() = readLine()!!.toInt()\n fun readInts() = readLine()!!.split(\" \").map { it.toInt() }\n fun readLong() = readLine()!!.toLong()\n fun readLongs() = readLine()!!.split(\" \").map { it.toLong() }\n fun readMatrixRows(height: Int) = (1..height).map { readLine()!!.toList() }\n\n fun Boolean.yesOrNo() = if (this) \"Yes\" else \"No\"\n fun Double.toNaturalExpr() = println(\"%f\".format(this))\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1364, "cpu_time_ms": 524, "memory_kb": 86680}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s777196617", "group_id": "codeNet:p02684", "input_text": "fun main() = abc167d()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc167d() {\n var (n, k) = readLine()!!.split(' ').map { it.toLong() }\n val aList = readLine()!!.split(' ').map { it.toInt() - 1 }.toIntArray()\n\n val visited = mutableSetOf(0)\n val indices = IntArray(n.toInt())\n indices[0] = 0\n\n var outerLoop = 0\n var curr = 0\n\n while (--k >= 0) {\n curr = aList[curr]\n if (!visited.add(curr)) break\n\n outerLoop++\n indices[curr] = outerLoop\n }\n\n if (k == -1L) return println(curr + 1)\n\n val visitedInLoop = mutableSetOf()\n var loopLength = 0\n val path = IntArray(n.toInt()) { -1 }\n\n repeat(n.toInt()) {\n if (visitedInLoop.add(curr)) {\n path[curr] = loopLength\n loopLength++\n curr = aList[curr]\n }\n }\n\n val answer = path.indexOf((k % loopLength).toInt()) + 1\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1589161997, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s777196617.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s777196617", "user_id": "u139478771"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main() = abc167d()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc167d() {\n var (n, k) = readLine()!!.split(' ').map { it.toLong() }\n val aList = readLine()!!.split(' ').map { it.toInt() - 1 }.toIntArray()\n\n val visited = mutableSetOf(0)\n val indices = IntArray(n.toInt())\n indices[0] = 0\n\n var outerLoop = 0\n var curr = 0\n\n while (--k >= 0) {\n curr = aList[curr]\n if (!visited.add(curr)) break\n\n outerLoop++\n indices[curr] = outerLoop\n }\n\n if (k == -1L) return println(curr + 1)\n\n val visitedInLoop = mutableSetOf()\n var loopLength = 0\n val path = IntArray(n.toInt()) { -1 }\n\n repeat(n.toInt()) {\n if (visitedInLoop.add(curr)) {\n path[curr] = loopLength\n loopLength++\n curr = aList[curr]\n }\n }\n\n val answer = path.indexOf((k % loopLength).toInt()) + 1\n\n println(answer)\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 906, "cpu_time_ms": 565, "memory_kb": 82660}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s573464057", "group_id": "codeNet:p02684", "input_text": "fun main() {\n val inp = readLine()!!.split(\" \")\n val N = inp[0].toInt()\n val K = inp[1].toLong()\n val A = readLine()!!.split(\" \").map { it.toInt() - 1 }\n val visitedA = IntArray(N)\n\n var current = 0\n var shuuki = 0\n var currentTime = 0\n for (i in 1..N) {\n current = A[current]\n if (visitedA[current] != 0) {\n shuuki = i - visitedA[current]\n currentTime = i\n break\n }\n visitedA[current] = i\n }\n\n val amari = (K - currentTime) % shuuki\n for (i in 0 until amari) {\n current = A[current]\n }\n println(current + 1)\n}\n", "language": "Kotlin", "metadata": {"date": 1589161509, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s573464057.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s573464057", "user_id": "u996672406"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main() {\n val inp = readLine()!!.split(\" \")\n val N = inp[0].toInt()\n val K = inp[1].toLong()\n val A = readLine()!!.split(\" \").map { it.toInt() - 1 }\n val visitedA = IntArray(N)\n\n var current = 0\n var shuuki = 0\n var currentTime = 0\n for (i in 1..N) {\n current = A[current]\n if (visitedA[current] != 0) {\n shuuki = i - visitedA[current]\n currentTime = i\n break\n }\n visitedA[current] = i\n }\n\n val amari = (K - currentTime) % shuuki\n for (i in 0 until amari) {\n current = A[current]\n }\n println(current + 1)\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 621, "cpu_time_ms": 389, "memory_kb": 64688}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s966889804", "group_id": "codeNet:p02684", "input_text": "fun main() {\n val (n, k) = readLine()!!.split(' ').let { it[0].toInt() to it[1].toLong() }\n val a = readLine()!!.split(' ').map { it.toInt() - 1 }\n val b = IntArray(n) { -1 }\n b[0] = 0\n\n var cur = 0\n var flag = false\n var x = k\n\n while (x > 0) {\n x--\n val next = a[cur]\n\n if (flag) {\n cur = next\n continue\n }\n\n if (b[next] == -1) {\n b[next] = b[cur] + 1\n cur = next\n continue\n }\n\n flag = true\n x %= (b[cur] + 1 - b[next])\n cur = next\n }\n\n println(cur + 1)\n}\n", "language": "Kotlin", "metadata": {"date": 1589161482, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s966889804.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s966889804", "user_id": "u863309603"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main() {\n val (n, k) = readLine()!!.split(' ').let { it[0].toInt() to it[1].toLong() }\n val a = readLine()!!.split(' ').map { it.toInt() - 1 }\n val b = IntArray(n) { -1 }\n b[0] = 0\n\n var cur = 0\n var flag = false\n var x = k\n\n while (x > 0) {\n x--\n val next = a[cur]\n\n if (flag) {\n cur = next\n continue\n }\n\n if (b[next] == -1) {\n b[next] = b[cur] + 1\n cur = next\n continue\n }\n\n flag = true\n x %= (b[cur] + 1 - b[next])\n cur = next\n }\n\n println(cur + 1)\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 606, "cpu_time_ms": 375, "memory_kb": 64564}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s915271121", "group_id": "codeNet:p02684", "input_text": "fun main(args: Array) {\n val (tmp, k) = readLine()!!.split(\" \").map { it.toLong() }\n val n = tmp.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt()-1 }.toIntArray()\n val count = LongArray(n) { -1L }\n var v = 0\n var c = 0L\n while (true) {\n if (count[v] >= 0) break\n count[v] = c\n v = a[v]\n c++\n if (c == k) {\n println(v+1)\n return\n }\n }\n val period = c-count[v]\n val rem = (k-count[v])%period\n for (i in count.indices) {\n if (count[i]-count[v] == rem) {\n println(i+1)\n return\n }\n }\n}", "language": "Kotlin", "metadata": {"date": 1589160503, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02684.html", "problem_id": "p02684", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02684/input.txt", "sample_output_relpath": "derived/input_output/data/p02684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02684/Kotlin/s915271121.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s915271121", "user_id": "u506403362"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(args: Array) {\n val (tmp, k) = readLine()!!.split(\" \").map { it.toLong() }\n val n = tmp.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt()-1 }.toIntArray()\n val count = LongArray(n) { -1L }\n var v = 0\n var c = 0L\n while (true) {\n if (count[v] >= 0) break\n count[v] = c\n v = a[v]\n c++\n if (c == k) {\n println(v+1)\n return\n }\n }\n val period = c-count[v]\n val rem = (k-count[v])%period\n for (i in count.indices) {\n if (count[i]-count[v] == rem) {\n println(i+1)\n return\n }\n }\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "sample_input": "4 5\n3 2 4 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02684", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Kingdom of Takahashi has N towns, numbered 1 through N.\n\nThere is one teleporter in each town. The teleporter in Town i (1 \\leq i \\leq N) sends you to Town A_i.\n\nTakahashi, the king, loves the positive integer K. The selfish king wonders what town he will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nHelp the king by writing a program that answers this question.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\n1 \\leq K \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the integer representing the town the king will be in if he starts at Town 1 and uses a teleporter exactly K times from there.\n\nSample Input 1\n\n4 5\n3 2 4 1\n\nSample Output 1\n\n4\n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as follows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\nSample Input 2\n\n6 727202214173249351\n6 5 2 5 3 2\n\nSample Output 2\n\n2", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 553, "cpu_time_ms": 417, "memory_kb": 64264}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s463226756", "group_id": "codeNet:p02700", "input_text": "fun main (args:Array) {\n var (tAct , tHp,aAct , aHp) = readLine()!!.split(\" \").map(String::toInt)\n\n while(tHp > 0 && aHp > 0){\n aHp -= tAct\n tHp -= aAct\n }\n if(tHp > aHp){\n print(\"Yes\")\n return\n }\n print(\"No\")\n}", "language": "Kotlin", "metadata": {"date": 1593206248, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s463226756.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s463226756", "user_id": "u800824593"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main (args:Array) {\n var (tAct , tHp,aAct , aHp) = readLine()!!.split(\" \").map(String::toInt)\n\n while(tHp > 0 && aHp > 0){\n aHp -= tAct\n tHp -= aAct\n }\n if(tHp > aHp){\n print(\"Yes\")\n return\n }\n print(\"No\")\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 265, "cpu_time_ms": 113, "memory_kb": 36324}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s093822429", "group_id": "codeNet:p02700", "input_text": "import kotlin.math.*\nimport java.util.*\n\nfun main(args: Array) {\n var (a, b, c, d) = readLine()!!.split(' ').map(String::toInt)\n while (true) {\n c -= b\n if (c <= 0) {\n println(\"Yes\")\n break\n }\n a -= d\n if (a <= 0) {\n println(\"No\")\n break\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1589425327, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s093822429.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s093822429", "user_id": "u051841332"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import kotlin.math.*\nimport java.util.*\n\nfun main(args: Array) {\n var (a, b, c, d) = readLine()!!.split(' ').map(String::toInt)\n while (true) {\n c -= b\n if (c <= 0) {\n println(\"Yes\")\n break\n }\n a -= d\n if (a <= 0) {\n println(\"No\")\n break\n }\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 295, "cpu_time_ms": 110, "memory_kb": 36316}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s370579435", "group_id": "codeNet:p02700", "input_text": "import kotlin.math.*\n\nprivate fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() // single long\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map(String::toInt) // list of ints\nprivate fun readLongs() = readStrings().map(String::toLong) // list of longs\n\nfun main() {\n val (a, b, c, d) = readInts()\n\n var ta = a\n var ao = c\n while (true) {\n ao -= b\n ta -= d\n if (ao <= 0) {\n println(\"Yes\")\n return\n }\n if (ta <= 0) {\n println(\"No\")\n return\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1589162384, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s370579435.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s370579435", "user_id": "u059223549"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import kotlin.math.*\n\nprivate fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() // single long\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map(String::toInt) // list of ints\nprivate fun readLongs() = readStrings().map(String::toLong) // list of longs\n\nfun main() {\n val (a, b, c, d) = readInts()\n\n var ta = a\n var ao = c\n while (true) {\n ao -= b\n ta -= d\n if (ao <= 0) {\n println(\"Yes\")\n return\n }\n if (ta <= 0) {\n println(\"No\")\n return\n }\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 699, "cpu_time_ms": 98, "memory_kb": 36240}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s897469586", "group_id": "codeNet:p02700", "input_text": "fun main(args: Array) {\n readLine()?.split(\" \")?.map { it.toInt() }?.let {\n var takahashiStamina = it[0]\n var aokiStamina = it[2]\n val takahashiAtack = it[1]\n val aokiAtack = it[3]\n\n while (true) {\n aokiStamina -= takahashiAtack\n if (aokiStamina == 0) {\n println(\"Yes\")\n break\n }\n takahashiStamina -+ aokiAtack\n if (takahashiStamina == 0) {\n println(\"No\")\n break\n }\n }\n\n }\n}", "language": "Kotlin", "metadata": {"date": 1588081586, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s897469586.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s897469586", "user_id": "u228849856"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n readLine()?.split(\" \")?.map { it.toInt() }?.let {\n var takahashiStamina = it[0]\n var aokiStamina = it[2]\n val takahashiAtack = it[1]\n val aokiAtack = it[3]\n\n while (true) {\n aokiStamina -= takahashiAtack\n if (aokiStamina == 0) {\n println(\"Yes\")\n break\n }\n takahashiStamina -+ aokiAtack\n if (takahashiStamina == 0) {\n println(\"No\")\n break\n }\n }\n\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 556, "cpu_time_ms": 2207, "memory_kb": 36828}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s448447908", "group_id": "codeNet:p02700", "input_text": "fun main() {\n\tvar (a,b,c,d) = readLine()!!.split(\" \").map {it.toInt()}\n\twhile(a>0&&c>0) {\n\t\ta -= d\n\t\tc -= b\n\t}\n\tprintln(if(c<=0) \"Yes\" else \"No\")\n}\n", "language": "Kotlin", "metadata": {"date": 1588022207, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s448447908.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s448447908", "user_id": "u059234158"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main() {\n\tvar (a,b,c,d) = readLine()!!.split(\" \").map {it.toInt()}\n\twhile(a>0&&c>0) {\n\t\ta -= d\n\t\tc -= b\n\t}\n\tprintln(if(c<=0) \"Yes\" else \"No\")\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 148, "cpu_time_ms": 101, "memory_kb": 36420}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s087092327", "group_id": "codeNet:p02700", "input_text": "fun main(args: Array) {\n // A B C D\n val list = nextIntList()\n // hp\n var tH = list[0]\n var aH = list[2]\n // attack\n val tA = list[1]\n val aA = list[3]\n\n\n val stop = true\n var res = \"\"\n while(stop){\n // t->a\n aH = j(tA,aH)\n if(aH < 1){\n res = \"Yes\"\n break\n }\n tH = j(aA,tH)\n if(tH < 1){\n res = \"No\"\n break\n }\n }\n println(res)\n}\nfun nextIntList() = next().split(\" \").map{ it.toInt() }\nfun next() = readLine()!!\n\n\nfun j(a:Int, h:Int):Int{\n return h-a\n}\n", "language": "Kotlin", "metadata": {"date": 1587954382, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s087092327.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s087092327", "user_id": "u259342586"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n // A B C D\n val list = nextIntList()\n // hp\n var tH = list[0]\n var aH = list[2]\n // attack\n val tA = list[1]\n val aA = list[3]\n\n\n val stop = true\n var res = \"\"\n while(stop){\n // t->a\n aH = j(tA,aH)\n if(aH < 1){\n res = \"Yes\"\n break\n }\n tH = j(aA,tH)\n if(tH < 1){\n res = \"No\"\n break\n }\n }\n println(res)\n}\nfun nextIntList() = next().split(\" \").map{ it.toInt() }\nfun next() = readLine()!!\n\n\nfun j(a:Int, h:Int):Int{\n return h-a\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 594, "cpu_time_ms": 101, "memory_kb": 36376}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s583985205", "group_id": "codeNet:p02700", "input_text": "fun main(args: Array) {\n val args = readLine()!!.split(\" \")\n val takahashiMonsterHitPoint = args[0].toInt()\n val takahashiMonsterPower = args[1].toInt()\n val aokiMonsterHitPoint = args[2].toInt()\n val aokiMonsterPower = args[3].toInt()\n\n val aokiAttackTimes = computeAttackTimes(takahashiMonsterHitPoint, aokiMonsterPower)\n val takahashiAttackTimes = computeAttackTimes(aokiMonsterHitPoint, takahashiMonsterPower)\n\n if (takahashiAttackTimes <= aokiAttackTimes) println(\"Yes\") else println(\"No\")\n}\n\nfun computeAttackTimes(hitPoint: Int, power: Int): Int {\n var attackTimes = hitPoint / power\n if ((hitPoint % power) > 0) {\n attackTimes++\n }\n\n return attackTimes\n}", "language": "Kotlin", "metadata": {"date": 1587951536, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s583985205.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s583985205", "user_id": "u932970230"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n val args = readLine()!!.split(\" \")\n val takahashiMonsterHitPoint = args[0].toInt()\n val takahashiMonsterPower = args[1].toInt()\n val aokiMonsterHitPoint = args[2].toInt()\n val aokiMonsterPower = args[3].toInt()\n\n val aokiAttackTimes = computeAttackTimes(takahashiMonsterHitPoint, aokiMonsterPower)\n val takahashiAttackTimes = computeAttackTimes(aokiMonsterHitPoint, takahashiMonsterPower)\n\n if (takahashiAttackTimes <= aokiAttackTimes) println(\"Yes\") else println(\"No\")\n}\n\nfun computeAttackTimes(hitPoint: Int, power: Int): Int {\n var attackTimes = hitPoint / power\n if ((hitPoint % power) > 0) {\n attackTimes++\n }\n\n return attackTimes\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 713, "cpu_time_ms": 121, "memory_kb": 35576}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s574487359", "group_id": "codeNet:p02700", "input_text": "fun main() {\n\tval (a,b,c,d) = readLine()!!.split(\" \").map { it.toInt() }\n \t\n \tif (c/b >= a/d) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1587950452, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s574487359.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s574487359", "user_id": "u951291435"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main() {\n\tval (a,b,c,d) = readLine()!!.split(\" \").map { it.toInt() }\n \t\n \tif (c/b >= a/d) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 159, "cpu_time_ms": 107, "memory_kb": 36380}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s198657382", "group_id": "codeNet:p02700", "input_text": "fun main() {\n val input2 = rspint()\n function(input2)\n}\n\nfun function(in1: List) {\n var thp = in1[0]\n var ahp = in1[2]\n var tatk = true\n while (thp > 0 && ahp > 0) {\n if (tatk) {\n ahp -= in1[1]\n } else {\n thp -= in1[3]\n }\n tatk = !tatk\n }\n println(if (thp <= 0) \"No\" else \"Yes\")\n}\n\ninline fun rsp() = readLine()!!.split(\" \")\n\ninline fun rspint() = rsp().map(String::toInt)", "language": "Kotlin", "metadata": {"date": 1587950285, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s198657382.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s198657382", "user_id": "u896320985"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main() {\n val input2 = rspint()\n function(input2)\n}\n\nfun function(in1: List) {\n var thp = in1[0]\n var ahp = in1[2]\n var tatk = true\n while (thp > 0 && ahp > 0) {\n if (tatk) {\n ahp -= in1[1]\n } else {\n thp -= in1[3]\n }\n tatk = !tatk\n }\n println(if (thp <= 0) \"No\" else \"Yes\")\n}\n\ninline fun rsp() = readLine()!!.split(\" \")\n\ninline fun rspint() = rsp().map(String::toInt)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 451, "cpu_time_ms": 102, "memory_kb": 36376}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s201340206", "group_id": "codeNet:p02700", "input_text": "fun main() {\n val (A, B, C, D) = readLine()!!.split(\" \").map(String::toInt)\n val a = C / B + if (C % B == 0) 0 else 1\n val b = A / D + if (A % D == 0) 0 else 1\n if (a <= b) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n\n\n\n", "language": "Kotlin", "metadata": {"date": 1587949530, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s201340206.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s201340206", "user_id": "u085288971"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main() {\n val (A, B, C, D) = readLine()!!.split(\" \").map(String::toInt)\n val a = C / B + if (C % B == 0) 0 else 1\n val b = A / D + if (A % D == 0) 0 else 1\n if (a <= b) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 256, "cpu_time_ms": 99, "memory_kb": 36376}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s873407553", "group_id": "codeNet:p02700", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n var (a, b, c, d) = readListOfInt()\n var taka = true\n while(a > 0 && c > 0) {\n if(taka) c-=b\n else a-=d\n taka = !taka\n }\n\n val ans = if(a > 0) \"Yes\" else \"No\"\n println(ans)\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n = this.groupBy { it }.mapValues { it.value.size }\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n var l = fromIndex\n var r = toIndex\n while(l < r) {\n val mid = (l+r) / 2\n if(element >= this[mid]) { \n l = mid + 1\n } else {\n r = mid\n }\n }\n return l\n}\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n var l = fromIndex\n var r = toIndex\n while(l < r) {\n val mid = (l+r) / 2\n if(element <= this[mid]) { \n r = mid\n } else {\n l = mid + 1\n }\n }\n return r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n val divisors = mutableListOf()\n for(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n if(this % i == 0L) {\n divisors.add(i)\n if(i != this/i) {\n divisors.add(this/i)\n }\n }\n }\n return divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n if(this==1L) return false\n for(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n if(this % i == 0L && this != i) {\n return false\n }\n }\n return true\n}\n\n\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n }\n }\n return v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n when {\n n == 1L -> a % mod\n n % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n else -> {\n val tmp = repeatedModPow(a, n / 2L, mod)\n (tmp * tmp) % mod\n }\n }\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n var ret = 1L\n val min = Math.min(k, n-k)\n // まず分母の計算\n for(i in n downTo (n - min + 1)) {\n ret = ret * i % mod\n }\n for(i in min downTo 1) {\n ret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n }\n return ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n val factorials = Array(n+1) { 0L }.apply {\n this[0] = 1L\n if(this.size > 1) this[1] = 1L\n }\n val inverses = Array(n+1) { 0L }.apply {\n this[0] = 1L\n if(this.size > 1) this[1] = 1L\n }\n val factorialInverses = Array(n+1) { 0L }.apply {\n this[0] = 1L\n if(this.size > 1) this[1] = 1L\n }\n for(i in 2 .. n) {\n factorials[i] = (factorials[i-1] * i.toLong() % mod)\n inverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n factorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n }\n\n return factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n if(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n a / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n private val parent: Array = Array(n) { 0 }\n private val rank: Array = Array(n) { 0 }\n private val size: Array = Array(n) { 0 }\n\n init {\n for(i in 0 until n) {\n parent[i] = i\n rank[i] = 1\n size[i] = 1\n }\n }\n\n fun union(u: Int, v: Int) {\n var x = root(u)\n var y = root(v)\n if(x != y) {\n if(rank[y] < rank[x]) {\n val tmp = y \n y = x\n x = tmp \n }\n parent[x] = y\n rank[y] += rank[x]\n rank[x] = -1\n val totalSize = size[x] + size[y]\n size[x] = totalSize\n size[y] = totalSize\n }\n }\n\n fun root(u: Int): Int {\n var x = u\n while(parent[x] != x) {\n x = parent[x]\n }\n return x \n }\n\n fun size(u: Int): Int = size[root(u)]\n}\n", "language": "Kotlin", "metadata": {"date": 1587949506, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s873407553.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s873407553", "user_id": "u026686258"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n var (a, b, c, d) = readListOfInt()\n var taka = true\n while(a > 0 && c > 0) {\n if(taka) c-=b\n else a-=d\n taka = !taka\n }\n\n val ans = if(a > 0) \"Yes\" else \"No\"\n println(ans)\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n = this.groupBy { it }.mapValues { it.value.size }\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n var l = fromIndex\n var r = toIndex\n while(l < r) {\n val mid = (l+r) / 2\n if(element >= this[mid]) { \n l = mid + 1\n } else {\n r = mid\n }\n }\n return l\n}\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n var l = fromIndex\n var r = toIndex\n while(l < r) {\n val mid = (l+r) / 2\n if(element <= this[mid]) { \n r = mid\n } else {\n l = mid + 1\n }\n }\n return r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n val divisors = mutableListOf()\n for(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n if(this % i == 0L) {\n divisors.add(i)\n if(i != this/i) {\n divisors.add(this/i)\n }\n }\n }\n return divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n if(this==1L) return false\n for(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n if(this % i == 0L && this != i) {\n return false\n }\n }\n return true\n}\n\n\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n }\n }\n return v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n when {\n n == 1L -> a % mod\n n % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n else -> {\n val tmp = repeatedModPow(a, n / 2L, mod)\n (tmp * tmp) % mod\n }\n }\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n var ret = 1L\n val min = Math.min(k, n-k)\n // まず分母の計算\n for(i in n downTo (n - min + 1)) {\n ret = ret * i % mod\n }\n for(i in min downTo 1) {\n ret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n }\n return ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n val factorials = Array(n+1) { 0L }.apply {\n this[0] = 1L\n if(this.size > 1) this[1] = 1L\n }\n val inverses = Array(n+1) { 0L }.apply {\n this[0] = 1L\n if(this.size > 1) this[1] = 1L\n }\n val factorialInverses = Array(n+1) { 0L }.apply {\n this[0] = 1L\n if(this.size > 1) this[1] = 1L\n }\n for(i in 2 .. n) {\n factorials[i] = (factorials[i-1] * i.toLong() % mod)\n inverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n factorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n }\n\n return factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n if(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n a / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n private val parent: Array = Array(n) { 0 }\n private val rank: Array = Array(n) { 0 }\n private val size: Array = Array(n) { 0 }\n\n init {\n for(i in 0 until n) {\n parent[i] = i\n rank[i] = 1\n size[i] = 1\n }\n }\n\n fun union(u: Int, v: Int) {\n var x = root(u)\n var y = root(v)\n if(x != y) {\n if(rank[y] < rank[x]) {\n val tmp = y \n y = x\n x = tmp \n }\n parent[x] = y\n rank[y] += rank[x]\n rank[x] = -1\n val totalSize = size[x] + size[y]\n size[x] = totalSize\n size[y] = totalSize\n }\n }\n\n fun root(u: Int): Int {\n var x = u\n while(parent[x] != x) {\n x = parent[x]\n }\n return x \n }\n\n fun size(u: Int): Int = size[root(u)]\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6108, "cpu_time_ms": 179, "memory_kb": 36428}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s848709775", "group_id": "codeNet:p02700", "input_text": "import java.io.*\nimport java.lang.*\nimport java.math.BigDecimal\nimport java.util.*\n\n// Constant\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 9223372036854775807L\n\n// Main\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\nfun solve() {\n var a = nextLong()\n val b = nextLong()\n var c = nextLong()\n val d = nextLong()\n\n var flag = true\n while(a > 0 && c > 0) {\n when(flag) {\n true -> {\n c -= b\n }\n false -> {\n a -= d\n }\n }\n flag = !flag\n }\n\n println(if(a <= 0L) \"No\" else \"Yes\")\n}\n\n\n\n// Rule\noperator fun String.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.set(index: Long, value: Char) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun LongArray.get(index: Long): Long {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun LongArray.set(index: Long, value: Long) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun DoubleArray.get(index: Long): Double {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun DoubleArray.set(index: Long, value: Double) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun Array.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun Array.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun MutableList.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun MutableList.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\n\nval LongArray.siz: Long\n get() = size.toLong()\nval Array.siz: Long\n get() = size.toLong()\nval MutableList.siz: Long\n get() = size.toLong()\nval MutableSet.siz: Long\n get() = size.toLong()\nval String.len: Long\n get() = length.toLong()\n\n// Output\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\nfun next() = sc.next()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Long): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextLongAry(n: Long): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Long): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\nfun ary(n: Long, init: String = \"\") = Array(n.toInt()) { init }\nfun longAry(n: Long, init: Long = 0L) = LongArray(n.toInt()) { init }\nfun doubleAry(n: Long, init: Double = 0.0) = DoubleArray(n.toInt()) { init }\nfun boolAry(n: Long, init: Boolean = false) = Array(n.toInt()) { init }\nfun ary2(n: Long, m: Long, init: String = \"\") = Array(n.toInt()) { ary(m, init) }\nfun longAry2(n: Long, m: Long, init: Long = 0) = Array(n.toInt()) { longAry(m, init) }\nfun doubleAry2(n: Long, m: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry(m, init) }\nfun boolAry2(n: Long, m: Long, init: Boolean = false) = Array(n.toInt()) { boolAry(m, init) }\nfun ary3(n: Long, m: Long, k: Long, init: String = \"\") = Array(n.toInt()) { ary2(m, k, init) }\nfun longAry3(n: Long, m: Long, k: Long, init: Long = 0L) = Array(n.toInt()) { longAry2(m, k, init) }\nfun doubleAry3(n: Long, m: Long, k: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry2(m, k, init) }\nfun boolAry3(n: Long, m: Long, k: Long, init: Boolean = false) = Array(n.toInt()) { boolAry2(m, k, init) }\nfun list() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\nval addFunc = {a: Long, b: Long -> a + b}\nval mulFunc = {a: Long, b: Long -> a * b}\nval maxFunc = {a: Long, b: Long -> max(a, b)}\nval minFunc = {a: Long, b: Long -> min(a, b)}\nval gcdFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\nfun LongArray.lowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1L)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Long) {\n repeat(n.toInt()) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Long) {\n repeat(n.toInt()) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Long) = if (values.isEmpty()) -INF else values.max()!!\nfun min(vararg values: Long) = if (values.isEmpty()) INF else values.min()!!\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Long) {\n private val fac = longAry(max)\n private val finv = longAry(max)\n private val inv = longAry(max)\n private val p = MOD\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Long, r: Long): Long = if (n < r || (n < 0 || r < 0)) 0L else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Long, private var searched: Long = 0L, private var nextIndex: Long = 0L) {\n private val size = fact(n)\n private val permList = longAry2(size, n)\n\n private tailrec fun fact(n: Long, ans: Long = 1L): Long {\n return if (n == 0L) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, longAry(n), boolAry(n))\n }\n\n private fun create(num: Long, list: LongArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): LongArray = permList[nextIndex++]\n}\n\n// Graph\ndata class Node(val id: Long, var past: Long = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Long, val to: Long, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Long, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Long): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size.toLong(), -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Long): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size.toLong(), INF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\n// Data Structure\nclass UnionFind(size: Long) {\n private val par = LongArray(size.toInt()) { it.toLong() }\n private val size = longAry(size, 1L)\n fun root(x: Long): Long {\n return if (par[x] == x) {\n x\n } else {\n par[x] = root(par[x])\n par[x]\n }\n }\n\n fun same(x: Long, y: Long): Boolean = root(x) == root(y)\n fun unite(x: Long, y: Long) {\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n }\n size[a] += size[b]\n par[b] = a\n }\n\n fun size(x: Long): Long = size[root(x)]\n}\n\nclass SegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2L * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Long, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Long, b: Long) = getSub(a, b, 0L, 0L, n.toLong())\n private fun getSub(a: Long, b: Long, k: Long, l: Long, r: Long): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n if (buflen <= 0) false\n true\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n// \"The world doesn't need you.\"\n//\n// fun nextInt(): Int {\n// val nl = nextLong()\n// if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n// return nl.toInt()\n// }\n}", "language": "Kotlin", "metadata": {"date": 1587949407, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s848709775.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848709775", "user_id": "u581625805"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.io.*\nimport java.lang.*\nimport java.math.BigDecimal\nimport java.util.*\n\n// Constant\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 9223372036854775807L\n\n// Main\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\nfun solve() {\n var a = nextLong()\n val b = nextLong()\n var c = nextLong()\n val d = nextLong()\n\n var flag = true\n while(a > 0 && c > 0) {\n when(flag) {\n true -> {\n c -= b\n }\n false -> {\n a -= d\n }\n }\n flag = !flag\n }\n\n println(if(a <= 0L) \"No\" else \"Yes\")\n}\n\n\n\n// Rule\noperator fun String.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.set(index: Long, value: Char) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun LongArray.get(index: Long): Long {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun LongArray.set(index: Long, value: Long) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun DoubleArray.get(index: Long): Double {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun DoubleArray.set(index: Long, value: Double) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun Array.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun Array.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun MutableList.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun MutableList.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\n\nval LongArray.siz: Long\n get() = size.toLong()\nval Array.siz: Long\n get() = size.toLong()\nval MutableList.siz: Long\n get() = size.toLong()\nval MutableSet.siz: Long\n get() = size.toLong()\nval String.len: Long\n get() = length.toLong()\n\n// Output\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\nfun next() = sc.next()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Long): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextLongAry(n: Long): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Long): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\nfun ary(n: Long, init: String = \"\") = Array(n.toInt()) { init }\nfun longAry(n: Long, init: Long = 0L) = LongArray(n.toInt()) { init }\nfun doubleAry(n: Long, init: Double = 0.0) = DoubleArray(n.toInt()) { init }\nfun boolAry(n: Long, init: Boolean = false) = Array(n.toInt()) { init }\nfun ary2(n: Long, m: Long, init: String = \"\") = Array(n.toInt()) { ary(m, init) }\nfun longAry2(n: Long, m: Long, init: Long = 0) = Array(n.toInt()) { longAry(m, init) }\nfun doubleAry2(n: Long, m: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry(m, init) }\nfun boolAry2(n: Long, m: Long, init: Boolean = false) = Array(n.toInt()) { boolAry(m, init) }\nfun ary3(n: Long, m: Long, k: Long, init: String = \"\") = Array(n.toInt()) { ary2(m, k, init) }\nfun longAry3(n: Long, m: Long, k: Long, init: Long = 0L) = Array(n.toInt()) { longAry2(m, k, init) }\nfun doubleAry3(n: Long, m: Long, k: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry2(m, k, init) }\nfun boolAry3(n: Long, m: Long, k: Long, init: Boolean = false) = Array(n.toInt()) { boolAry2(m, k, init) }\nfun list() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\nval addFunc = {a: Long, b: Long -> a + b}\nval mulFunc = {a: Long, b: Long -> a * b}\nval maxFunc = {a: Long, b: Long -> max(a, b)}\nval minFunc = {a: Long, b: Long -> min(a, b)}\nval gcdFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\nfun LongArray.lowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1L)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Long) {\n repeat(n.toInt()) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Long) {\n repeat(n.toInt()) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Long) = if (values.isEmpty()) -INF else values.max()!!\nfun min(vararg values: Long) = if (values.isEmpty()) INF else values.min()!!\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Long) {\n private val fac = longAry(max)\n private val finv = longAry(max)\n private val inv = longAry(max)\n private val p = MOD\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Long, r: Long): Long = if (n < r || (n < 0 || r < 0)) 0L else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Long, private var searched: Long = 0L, private var nextIndex: Long = 0L) {\n private val size = fact(n)\n private val permList = longAry2(size, n)\n\n private tailrec fun fact(n: Long, ans: Long = 1L): Long {\n return if (n == 0L) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, longAry(n), boolAry(n))\n }\n\n private fun create(num: Long, list: LongArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): LongArray = permList[nextIndex++]\n}\n\n// Graph\ndata class Node(val id: Long, var past: Long = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Long, val to: Long, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Long, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Long): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size.toLong(), -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Long): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size.toLong(), INF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\n// Data Structure\nclass UnionFind(size: Long) {\n private val par = LongArray(size.toInt()) { it.toLong() }\n private val size = longAry(size, 1L)\n fun root(x: Long): Long {\n return if (par[x] == x) {\n x\n } else {\n par[x] = root(par[x])\n par[x]\n }\n }\n\n fun same(x: Long, y: Long): Boolean = root(x) == root(y)\n fun unite(x: Long, y: Long) {\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n }\n size[a] += size[b]\n par[b] = a\n }\n\n fun size(x: Long): Long = size[root(x)]\n}\n\nclass SegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2L * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Long, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Long, b: Long) = getSub(a, b, 0L, 0L, n.toLong())\n private fun getSub(a: Long, b: Long, k: Long, l: Long, r: Long): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n if (buflen <= 0) false\n true\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n// \"The world doesn't need you.\"\n//\n// fun nextInt(): Int {\n// val nl = nextLong()\n// if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n// return nl.toInt()\n// }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 14548, "cpu_time_ms": 127, "memory_kb": 34424}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s176931731", "group_id": "codeNet:p02700", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n var a = sc.nextInt()\n val b = sc.nextInt()\n var c = sc.nextInt()\n val d = sc.nextInt()\n while (true) {\n c -= b\n if (c <= 0) {\n println(\"Yes\")\n break\n }\n a -= d\n if (a <= 0) {\n println(\"No\")\n break\n }\n }\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}", "language": "Kotlin", "metadata": {"date": 1587949340, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02700.html", "problem_id": "p02700", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02700/input.txt", "sample_output_relpath": "derived/input_output/data/p02700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02700/Kotlin/s176931731.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s176931731", "user_id": "u190507186"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n var a = sc.nextInt()\n val b = sc.nextInt()\n var c = sc.nextInt()\n val d = sc.nextInt()\n while (true) {\n c -= b\n if (c <= 0) {\n println(\"Yes\")\n break\n }\n a -= d\n if (a <= 0) {\n println(\"No\")\n break\n }\n }\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "sample_input": "10 9 10 10\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02700", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi and Aoki will have a battle using their monsters.\n\nThe health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.\n\nThe two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...\nHere, an attack decreases the opponent's health by the value equal to the attacker's strength.\nThe monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nConstraints\n\n1 \\leq A,B,C,D \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nIf Takahashi will win, print Yes; if he will lose, print No.\n\nSample Input 1\n\n10 9 10 10\n\nSample Output 1\n\nNo\n\nFirst, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.\n\nNext, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.\n\nTakahashi's monster is the first to have 0 or less health, so Takahashi loses.\n\nSample Input 2\n\n46 4 40 5\n\nSample Output 2\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1114, "cpu_time_ms": 80, "memory_kb": 34324}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s709923505", "group_id": "codeNet:p02702", "input_text": "import java.math.BigInteger\nimport kotlin.math.*\n\n//private val inp = java.io.File(\"in\")\nprivate val inp = System.`in`\nprivate val reader = inp.bufferedReader()\nprivate val wr = java.io.PrintWriter(System.out.bufferedWriter())\n\nprivate fun readLn(): String = reader.readLine()\nprivate fun readInt(): Int = readLn().toInt()\nprivate fun readStrs(): List = readLn().split(\" \")\nprivate fun readInts(): IntArray = readStrs().map { it.toInt() }.toIntArray()\nprivate fun readChars(): CharArray = readStrs().map { it.single() }.toCharArray()\n\nfun main() {\n val s = readLn()\n val n = s.length\n var ans = 0\n val strs = HashSet()\n for (i in 1..200000) {\n strs.add((2019L * i).toString())\n }\n for (str in strs) {\n if (str.length > n) break\n val z = z(\"${str}$${s}\")\n ans += z.count { it == str.length }\n }\n println(ans)\n}\n\nfun z(s: String): IntArray {\n val n = s.length\n val z = IntArray(n)\n var l = 0\n var r = 0\n for (i in 1 until n) {\n if (i <= r) {\n z[i] = min(z[i - l], r - i + 1)\n }\n while (i + z[i] < n && s[z[i]] == s[z[i] + i]) {\n z[i]++\n }\n if (i + z[i] - 1 > r) {\n l = i\n r = i + z[i] - 1\n }\n }\n return z\n}", "language": "Kotlin", "metadata": {"date": 1588051413, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s709923505.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s709923505", "user_id": "u366116119"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.math.BigInteger\nimport kotlin.math.*\n\n//private val inp = java.io.File(\"in\")\nprivate val inp = System.`in`\nprivate val reader = inp.bufferedReader()\nprivate val wr = java.io.PrintWriter(System.out.bufferedWriter())\n\nprivate fun readLn(): String = reader.readLine()\nprivate fun readInt(): Int = readLn().toInt()\nprivate fun readStrs(): List = readLn().split(\" \")\nprivate fun readInts(): IntArray = readStrs().map { it.toInt() }.toIntArray()\nprivate fun readChars(): CharArray = readStrs().map { it.single() }.toCharArray()\n\nfun main() {\n val s = readLn()\n val n = s.length\n var ans = 0\n val strs = HashSet()\n for (i in 1..200000) {\n strs.add((2019L * i).toString())\n }\n for (str in strs) {\n if (str.length > n) break\n val z = z(\"${str}$${s}\")\n ans += z.count { it == str.length }\n }\n println(ans)\n}\n\nfun z(s: String): IntArray {\n val n = s.length\n val z = IntArray(n)\n var l = 0\n var r = 0\n for (i in 1 until n) {\n if (i <= r) {\n z[i] = min(z[i - l], r - i + 1)\n }\n while (i + z[i] < n && s[z[i]] == s[z[i] + i]) {\n z[i]++\n }\n if (i + z[i] - 1 > r) {\n l = i\n r = i + z[i] - 1\n }\n }\n return z\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1282, "cpu_time_ms": 2208, "memory_kb": 77824}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s371225603", "group_id": "codeNet:p02702", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n\tval s = read().toCharArray()\n\tval n = s.size\n\n\tvar prev = Array(2019) { 0 }\n\tvar cnt = 0L\n\n\tfor(i in 0 until n) {\n\t\tval cur = s[i].toString().toInt()\n\t\tval next = Array(2019) { 0 }\n\t\tfor(j in 1 until 2019) {\n\t\t\tnext[(j * 10 + cur) % 2019] += prev[j]\n\t\t}\n\t\tnext[cur]++\n\n\t\tcnt += next[0]\n\t\tprev = next\n\t}\n\n\tprintln(cnt)\n\tpw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n\t= this.groupBy { it }.mapValues { it.value.size }\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element >= this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn l\n}\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element <= this[mid]) { \n\t\t\tr = mid\n\t\t} else {\n\t\t\tl = mid + 1\n\t\t}\n\t}\n\treturn r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n\tval divisors = mutableListOf()\n\tfor(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n\t\tif(this % i == 0L) {\n\t\t\tdivisors.add(i)\n\t\t\tif(i != this/i) {\n\t\t\t\tdivisors.add(this/i)\n\t\t\t}\n\t\t}\n\t}\n\treturn divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n\tif(this==1L) return false\n\tfor(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n\t\tif(this % i == 0L && this != i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n\nfun permutations(src: List): List> {\n\tif(src.size == 1) return listOf(src)\n\tval perms = mutableListOf>()\n\tval insertElement = src[0]\n\tpermutations(src.drop(1)).forEach { perm ->\n\t\tfor(i in 0..perm.size) {\n\t\t\tval newPerm = perm.toMutableList()\n\t\t\tnewPerm.add(i, insertElement)\n\t\t\tperms.add(newPerm.toList())\n\t\t}\n\t}\n\treturn perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n\tval v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n\tfor(i in 0 until v.size) {\n\t\tv[i][0] = 1L\n\t\tv[i][i] = 1L\n\t}\n\tfor(i in 0 until v.size) {\n\t\tfor(j in 1 until i) {\n\t\t\tv[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n\t\t}\n\t}\n\treturn v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n\twhen {\n\t\tn == 1L -> a % mod\n\t\tn % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n\t\telse -> {\n\t\t\tval tmp = repeatedModPow(a, n / 2L, mod)\n\t\t\t(tmp * tmp) % mod\n\t\t}\n\t}\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n\tvar ret = 1L\n\tval min = Math.min(k, n-k)\n\t// まず分母の計算\n\tfor(i in n downTo (n - min + 1)) {\n\t\tret = ret * i % mod\n\t}\n\tfor(i in min downTo 1) {\n\t\tret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n\t}\n\treturn ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n\tval factorials = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval inverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval factorialInverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tfor(i in 2 .. n) {\n\t\tfactorials[i] = (factorials[i-1] * i.toLong() % mod)\n\t\tinverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n\t\tfactorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n\t}\n\n\treturn factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n\tif(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n\ta / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n\tvar num = num_\n\tvar rtn: Long = 0\n\twhile(num != 0.toLong()) {\n\t\tval tmp = num % 10\n\t\trtn += tmp\n\t\tnum /= 10\n\t}\n\treturn rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n\tprivate val parent: Array = Array(n) { 0 }\n\tprivate val rank: Array = Array(n) { 0 }\n\tprivate val size: Array = Array(n) { 0 }\n\n\tinit {\n\t\tfor(i in 0 until n) {\n\t\t\tparent[i] = i\n\t\t\trank[i] = 1\n\t\t\tsize[i] = 1\n\t\t}\n\t}\n\n\tfun union(u: Int, v: Int) {\n\t\tvar x = root(u)\n\t\tvar y = root(v)\n\t\tif(x != y) {\n\t\t\tif(rank[y] < rank[x]) {\n\t\t\t\tval tmp = y \n\t\t\t\ty = x\n\t\t\t\tx = tmp \n\t\t\t}\n\t\t\tparent[x] = y\n\t\t\trank[y] += rank[x]\n\t\t\trank[x] = -1\n\t\t\tval totalSize = size[x] + size[y]\n\t\t\tsize[x] = totalSize\n\t\t\tsize[y] = totalSize\n\t\t}\n\t}\n\n\tfun root(u: Int): Int {\n\t\tvar x = u\n\t\twhile(parent[x] != x) {\n\t\t\tx = parent[x]\n\t\t}\n\t\treturn x \n\t}\n\n\tfun size(u: Int): Int = size[root(u)]\n}\n", "language": "Kotlin", "metadata": {"date": 1587997998, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s371225603.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s371225603", "user_id": "u026686258"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n\tval s = read().toCharArray()\n\tval n = s.size\n\n\tvar prev = Array(2019) { 0 }\n\tvar cnt = 0L\n\n\tfor(i in 0 until n) {\n\t\tval cur = s[i].toString().toInt()\n\t\tval next = Array(2019) { 0 }\n\t\tfor(j in 1 until 2019) {\n\t\t\tnext[(j * 10 + cur) % 2019] += prev[j]\n\t\t}\n\t\tnext[cur]++\n\n\t\tcnt += next[0]\n\t\tprev = next\n\t}\n\n\tprintln(cnt)\n\tpw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n\t= this.groupBy { it }.mapValues { it.value.size }\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element >= this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn l\n}\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element <= this[mid]) { \n\t\t\tr = mid\n\t\t} else {\n\t\t\tl = mid + 1\n\t\t}\n\t}\n\treturn r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n\tval divisors = mutableListOf()\n\tfor(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n\t\tif(this % i == 0L) {\n\t\t\tdivisors.add(i)\n\t\t\tif(i != this/i) {\n\t\t\t\tdivisors.add(this/i)\n\t\t\t}\n\t\t}\n\t}\n\treturn divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n\tif(this==1L) return false\n\tfor(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n\t\tif(this % i == 0L && this != i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n\nfun permutations(src: List): List> {\n\tif(src.size == 1) return listOf(src)\n\tval perms = mutableListOf>()\n\tval insertElement = src[0]\n\tpermutations(src.drop(1)).forEach { perm ->\n\t\tfor(i in 0..perm.size) {\n\t\t\tval newPerm = perm.toMutableList()\n\t\t\tnewPerm.add(i, insertElement)\n\t\t\tperms.add(newPerm.toList())\n\t\t}\n\t}\n\treturn perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n\tval v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n\tfor(i in 0 until v.size) {\n\t\tv[i][0] = 1L\n\t\tv[i][i] = 1L\n\t}\n\tfor(i in 0 until v.size) {\n\t\tfor(j in 1 until i) {\n\t\t\tv[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n\t\t}\n\t}\n\treturn v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n\twhen {\n\t\tn == 1L -> a % mod\n\t\tn % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n\t\telse -> {\n\t\t\tval tmp = repeatedModPow(a, n / 2L, mod)\n\t\t\t(tmp * tmp) % mod\n\t\t}\n\t}\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n\tvar ret = 1L\n\tval min = Math.min(k, n-k)\n\t// まず分母の計算\n\tfor(i in n downTo (n - min + 1)) {\n\t\tret = ret * i % mod\n\t}\n\tfor(i in min downTo 1) {\n\t\tret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n\t}\n\treturn ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n\tval factorials = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval inverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval factorialInverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tfor(i in 2 .. n) {\n\t\tfactorials[i] = (factorials[i-1] * i.toLong() % mod)\n\t\tinverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n\t\tfactorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n\t}\n\n\treturn factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n\tif(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n\ta / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n\tvar num = num_\n\tvar rtn: Long = 0\n\twhile(num != 0.toLong()) {\n\t\tval tmp = num % 10\n\t\trtn += tmp\n\t\tnum /= 10\n\t}\n\treturn rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n\tprivate val parent: Array = Array(n) { 0 }\n\tprivate val rank: Array = Array(n) { 0 }\n\tprivate val size: Array = Array(n) { 0 }\n\n\tinit {\n\t\tfor(i in 0 until n) {\n\t\t\tparent[i] = i\n\t\t\trank[i] = 1\n\t\t\tsize[i] = 1\n\t\t}\n\t}\n\n\tfun union(u: Int, v: Int) {\n\t\tvar x = root(u)\n\t\tvar y = root(v)\n\t\tif(x != y) {\n\t\t\tif(rank[y] < rank[x]) {\n\t\t\t\tval tmp = y \n\t\t\t\ty = x\n\t\t\t\tx = tmp \n\t\t\t}\n\t\t\tparent[x] = y\n\t\t\trank[y] += rank[x]\n\t\t\trank[x] = -1\n\t\t\tval totalSize = size[x] + size[y]\n\t\t\tsize[x] = totalSize\n\t\t\tsize[y] = totalSize\n\t\t}\n\t}\n\n\tfun root(u: Int): Int {\n\t\tvar x = u\n\t\twhile(parent[x] != x) {\n\t\t\tx = parent[x]\n\t\t}\n\t\treturn x \n\t}\n\n\tfun size(u: Int): Int = size[root(u)]\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5453, "cpu_time_ms": 2195, "memory_kb": 56544}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s609187269", "group_id": "codeNet:p02702", "input_text": "import java.math.BigDecimal\n\nfun main() {\n val nums = readLine()!!\n val keta = nums.length\n val bd2019 = BigDecimal(2019)\n var count = 0\n val mods = hashMapOf()\n for (i in 0 until keta) {\n val rem = (BigDecimal(nums.substring(i)) % bd2019).toInt()\n mods[rem] = (mods[rem] ?: 0) + 1\n }\n mods.forEach { (_, num) ->\n count += num * (num - 1) / 2\n }\n println(count)\n}\n", "language": "Kotlin", "metadata": {"date": 1587962068, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s609187269.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s609187269", "user_id": "u896320985"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.math.BigDecimal\n\nfun main() {\n val nums = readLine()!!\n val keta = nums.length\n val bd2019 = BigDecimal(2019)\n var count = 0\n val mods = hashMapOf()\n for (i in 0 until keta) {\n val rem = (BigDecimal(nums.substring(i)) % bd2019).toInt()\n mods[rem] = (mods[rem] ?: 0) + 1\n }\n mods.forEach { (_, num) ->\n count += num * (num - 1) / 2\n }\n println(count)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 425, "cpu_time_ms": 2209, "memory_kb": 100912}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s614480196", "group_id": "codeNet:p02702", "input_text": "fun main(args: Array) {\n val line = next()\n val size = line.length\n\n val n = 2019\n var res = 0\n\n for(i in 0 .. size){\n for(i2 in 0 .. size){\n if(i2 >= i) continue\n val num = line.substring(i2,i).toLong()\n// if (num == 0L) continue\n if(num%n == 0L ) res++\n }\n }\n println(res)\n}\nfun next() = readLine()!!", "language": "Kotlin", "metadata": {"date": 1587956439, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s614480196.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s614480196", "user_id": "u259342586"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val line = next()\n val size = line.length\n\n val n = 2019\n var res = 0\n\n for(i in 0 .. size){\n for(i2 in 0 .. size){\n if(i2 >= i) continue\n val num = line.substring(i2,i).toLong()\n// if (num == 0L) continue\n if(num%n == 0L ) res++\n }\n }\n println(res)\n}\nfun next() = readLine()!!", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 388, "cpu_time_ms": 213, "memory_kb": 39576}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s153484672", "group_id": "codeNet:p02702", "input_text": "fun main(args: Array) {\n val s = readLine()!!.split(\" \").map { it.toLong() }[0]\n val sString = s.toString()\n val size = sString.length\n var count = 0\n val xArray:Array = Array(100){ 0.toLong() }\n for (i in 0 until 100){\n xArray[i] = 2019.toLong() * (i+1)\n }\n for (j in 0 until 100){\n val length = xArray[j].toString().length\n for (i in 0 until size){\n if (length + i > size) break\n val a = sString.substring(i, length+i).toLong()\n if (a == xArray[j]) count++\n }\n }\n println(count)\n}", "language": "Kotlin", "metadata": {"date": 1587954953, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s153484672.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s153484672", "user_id": "u385678999"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!.split(\" \").map { it.toLong() }[0]\n val sString = s.toString()\n val size = sString.length\n var count = 0\n val xArray:Array = Array(100){ 0.toLong() }\n for (i in 0 until 100){\n xArray[i] = 2019.toLong() * (i+1)\n }\n for (j in 0 until 100){\n val length = xArray[j].toString().length\n for (i in 0 until size){\n if (length + i > size) break\n val a = sString.substring(i, length+i).toLong()\n if (a == xArray[j]) count++\n }\n }\n println(count)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 587, "cpu_time_ms": 237, "memory_kb": 42344}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s407943570", "group_id": "codeNet:p02702", "input_text": "import java.math.BigDecimal\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s = sc.next()\n\n var ans = 0\n val bd = 2019.toBigDecimal()\n\n for(i in 0 .. (s.length-3)) {\n for(j in (i+4) .. s.length) {\n val sub = s.substring(i, j)\n if(sub.toBigDecimal().remainder(bd) == BigDecimal.ZERO)\n ans++\n }\n }\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1587954925, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s407943570.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s407943570", "user_id": "u079781329"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.math.BigDecimal\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s = sc.next()\n\n var ans = 0\n val bd = 2019.toBigDecimal()\n\n for(i in 0 .. (s.length-3)) {\n for(j in (i+4) .. s.length) {\n val sub = s.substring(i, j)\n if(sub.toBigDecimal().remainder(bd) == BigDecimal.ZERO)\n ans++\n }\n }\n\n println(ans)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 425, "cpu_time_ms": 2208, "memory_kb": 75988}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s842761661", "group_id": "codeNet:p02702", "input_text": "fun main(args: Array) {\n val s = readLine()!!.split(\" \").map { it.toLong() }[0]\n val sString = s.toString()\n val size = sString.length\n var count = 0\n val xArray:Array = Array(100){ 0.toLong() }\n for (i in 0 until 100){\n xArray[i] = 2019.toLong() * (i+1)\n }\n for (j in 0 until 100){\n val length = xArray[j].toString().length\n for (i in 0 until size){\n if (length + i > size) break\n val a = sString.substring(i, length+i).toInt()\n if (a.toLong() == xArray[j]) count++\n }\n }\n println(count)\n}", "language": "Kotlin", "metadata": {"date": 1587954699, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s842761661.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s842761661", "user_id": "u385678999"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!.split(\" \").map { it.toLong() }[0]\n val sString = s.toString()\n val size = sString.length\n var count = 0\n val xArray:Array = Array(100){ 0.toLong() }\n for (i in 0 until 100){\n xArray[i] = 2019.toLong() * (i+1)\n }\n for (j in 0 until 100){\n val length = xArray[j].toString().length\n for (i in 0 until size){\n if (length + i > size) break\n val a = sString.substring(i, length+i).toInt()\n if (a.toLong() == xArray[j]) count++\n }\n }\n println(count)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 595, "cpu_time_ms": 229, "memory_kb": 42872}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s562267559", "group_id": "codeNet:p02702", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s = sc.next()\n println(problem164d(s))\n}\n\nfun problem164d(s: String): Int {\n var s = s\n val multiples = (1..2000).map { it * 2019L }\n var count = 0\n for (i in 0 until multiples.size) {\n val mi = multiples[i]\n while (true) {\n val c = Regex(mi.toString()).findAll(s).count()\n s = Regex(mi.toString()).replace(s, mi.toString().drop(4))\n count += c\n if (c == 0) break\n }\n }\n return count\n}", "language": "Kotlin", "metadata": {"date": 1587954644, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s562267559.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s562267559", "user_id": "u073232808"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s = sc.next()\n println(problem164d(s))\n}\n\nfun problem164d(s: String): Int {\n var s = s\n val multiples = (1..2000).map { it * 2019L }\n var count = 0\n for (i in 0 until multiples.size) {\n val mi = multiples[i]\n while (true) {\n val c = Regex(mi.toString()).findAll(s).count()\n s = Regex(mi.toString()).replace(s, mi.toString().drop(4))\n count += c\n if (c == 0) break\n }\n }\n return count\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 565, "cpu_time_ms": 1643, "memory_kb": 63600}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s626559479", "group_id": "codeNet:p02702", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s = sc.next()\n println(problem164d(s))\n}\n\nfun problem164d(s: String): Int {\n var s = s\n val multiples = (1..1000).map { it * 2019L }\n var count = 0\n for (i in 0 until multiples.size) {\n val mi = multiples[i]\n while (true) {\n val c = Regex(mi.toString()).findAll(s).count()\n s = Regex(mi.toString()).replace(s, mi.toString().drop(2))\n count += c\n if (c == 0) break\n }\n }\n return count\n}", "language": "Kotlin", "metadata": {"date": 1587954601, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s626559479.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s626559479", "user_id": "u073232808"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s = sc.next()\n println(problem164d(s))\n}\n\nfun problem164d(s: String): Int {\n var s = s\n val multiples = (1..1000).map { it * 2019L }\n var count = 0\n for (i in 0 until multiples.size) {\n val mi = multiples[i]\n while (true) {\n val c = Regex(mi.toString()).findAll(s).count()\n s = Regex(mi.toString()).replace(s, mi.toString().drop(2))\n count += c\n if (c == 0) break\n }\n }\n return count\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 565, "cpu_time_ms": 1953, "memory_kb": 64316}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s354408772", "group_id": "codeNet:p02702", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s = sc.next()\n println(problem164d(s))\n}\n\nfun problem164d(s: String): Int {\n var s = s\n val multiples = (1..100).map { it * 2019L }\n var count = 0\n for (i in 0 until multiples.size) {\n val mi = multiples[i]\n while (true) {\n val c = Regex(mi.toString()).findAll(s).count()\n s = Regex(mi.toString()).replace(s, mi.toString().drop(2))\n count += c\n if (c == 0) break\n }\n }\n return count\n}", "language": "Kotlin", "metadata": {"date": 1587954572, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s354408772.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s354408772", "user_id": "u073232808"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s = sc.next()\n println(problem164d(s))\n}\n\nfun problem164d(s: String): Int {\n var s = s\n val multiples = (1..100).map { it * 2019L }\n var count = 0\n for (i in 0 until multiples.size) {\n val mi = multiples[i]\n while (true) {\n val c = Regex(mi.toString()).findAll(s).count()\n s = Regex(mi.toString()).replace(s, mi.toString().drop(2))\n count += c\n if (c == 0) break\n }\n }\n return count\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 564, "cpu_time_ms": 473, "memory_kb": 59400}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s862254403", "group_id": "codeNet:p02702", "input_text": "fun main() {\n val S = readString()\n// val D = Math.min(6, S.length)\n// val D = Math.min(500, S.length)\n val D = S.length\n\n fun isDividable2019(s: String): Boolean {\n var num = 0\n for (i in s.indices) {\n val n = s[i] - '0'\n num = (num * 10 + n) % 2019\n }\n println(\"$s -> ${num}\")\n return num == 0\n }\n\n fun f(s: String): Long {\n println(s)\n val size = (s.length + D - 1) / D\n val list = (0 until size).map {\n s.substring(it * D, Math.min((it + 1) * D, s.length))\n }\n val bList = list.map { isDividable2019(it) }\n println(bList)\n var cnt = 0L\n var cNum = 0\n for (i in bList.indices) {\n if (bList[i]) {\n cNum++\n cnt += cNum\n } else {\n cNum = 0\n }\n }\n return cnt\n }\n\n fun g(s: String): Long {\n var sum = 0L\n var cnt = 0\n var num = 0\n for (i in s.indices) {\n val n = s[i] - '0'\n num = num * 10 + n\n if (num % 2019 == 0) {\n cnt++\n sum += cnt\n }\n num %= 2019\n }\n return sum\n }\n\n var sum = 0L\n for (i in 0 until D) {\n// sum += f(S.substring(i))\n sum += g(S.substring(i))\n }\n println(sum)\n}\n\nfun readString() = readLine()!!\nfun readStrings() = readString().split(\" \")\nfun readInt() = readString().toInt()\nfun readInts() = readStrings().map { it.toInt() }\n", "language": "Kotlin", "metadata": {"date": 1587953935, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s862254403.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s862254403", "user_id": "u979004569"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val S = readString()\n// val D = Math.min(6, S.length)\n// val D = Math.min(500, S.length)\n val D = S.length\n\n fun isDividable2019(s: String): Boolean {\n var num = 0\n for (i in s.indices) {\n val n = s[i] - '0'\n num = (num * 10 + n) % 2019\n }\n println(\"$s -> ${num}\")\n return num == 0\n }\n\n fun f(s: String): Long {\n println(s)\n val size = (s.length + D - 1) / D\n val list = (0 until size).map {\n s.substring(it * D, Math.min((it + 1) * D, s.length))\n }\n val bList = list.map { isDividable2019(it) }\n println(bList)\n var cnt = 0L\n var cNum = 0\n for (i in bList.indices) {\n if (bList[i]) {\n cNum++\n cnt += cNum\n } else {\n cNum = 0\n }\n }\n return cnt\n }\n\n fun g(s: String): Long {\n var sum = 0L\n var cnt = 0\n var num = 0\n for (i in s.indices) {\n val n = s[i] - '0'\n num = num * 10 + n\n if (num % 2019 == 0) {\n cnt++\n sum += cnt\n }\n num %= 2019\n }\n return sum\n }\n\n var sum = 0L\n for (i in 0 until D) {\n// sum += f(S.substring(i))\n sum += g(S.substring(i))\n }\n println(sum)\n}\n\nfun readString() = readLine()!!\nfun readStrings() = readString().split(\" \")\nfun readInt() = readString().toInt()\nfun readInts() = readStrings().map { it.toInt() }\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1321, "cpu_time_ms": 2208, "memory_kb": 57324}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s536004033", "group_id": "codeNet:p02702", "input_text": "private val list = (1..100).map { 2019 * it }.map { it.toString() }.toSet()\n\nfun main() {\n val s = readLine()!!\n val result = (1..10000).flatMap { s.chunked(it) }.count { list.contains(it) }\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1587953786, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s536004033.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s536004033", "user_id": "u897579945"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "private val list = (1..100).map { 2019 * it }.map { it.toString() }.toSet()\n\nfun main() {\n val s = readLine()!!\n val result = (1..10000).flatMap { s.chunked(it) }.count { list.contains(it) }\n println(result)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 218, "cpu_time_ms": 2234, "memory_kb": 961804}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s255829912", "group_id": "codeNet:p02702", "input_text": "private val list = (1..100).map { 2019 * it }.map { it.toString() }.toSet()\n\nfun main() {\n val s = readLine()!!\n val result = (1..50).flatMap { s.chunked(it) }.count { list.contains(it) }\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1587953741, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s255829912.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s255829912", "user_id": "u897579945"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "private val list = (1..100).map { 2019 * it }.map { it.toString() }.toSet()\n\nfun main() {\n val s = readLine()!!\n val result = (1..50).flatMap { s.chunked(it) }.count { list.contains(it) }\n println(result)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 215, "cpu_time_ms": 496, "memory_kb": 109972}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s309012934", "group_id": "codeNet:p02702", "input_text": "fun main(args: Array) = ABC164D.main()\n\nobject ABC164D {\n fun log(message: Any?) {\n //println(message)// TODO: ←消す\n }\n\n val S: String\n val N: Int\n\n init {\n S = readString()\n N = S.length\n }\n\n data class Problem(val remain: String, val current: ModLong) {\n fun getOneOrNull(): Int? = when {\n remain.isEmpty() -> if (current.isValid()) 1 else 0\n else -> null\n }\n }\n\n fun main() {\n val table = LazyMap { problem ->\n problem.getOneOrNull() ?: problem.let {\n val nj = \"${it.remain.first()}\".toInt()\n val current = it.current * 10 + nj\n val sub = Problem(remain = it.remain.drop(1), current = current)\n val ans = get(sub) + if (it.current.isValid()) 1 else 0\n log(\"$it->$ans\")\n ans\n }\n }\n\n val count = S.mapIndexed { i, si ->\n val ni = \"$si\".toInt()\n val current = ni.toModLong(2019)\n log(\"i=$i, ni=$ni\")\n table[Problem(remain = S.drop(i+1), current = current)]\n }.sum()\n val ans = count\n println(ans)\n }\n\n fun Number.isValid() = this.toLong() % 2019 == 0L\n\n\n /*####################################################################################*/\n\n fun readString() = readLine()!!\n\n class LazyMap(capacity: Int = 65536, private val init: LazyMap.(K) -> V) {\n private val memo = HashMap(capacity)\n operator fun get(key: K): V {\n return memo[key] ?: init(key).memorizingAt(key)\n }\n\n private fun V.memorizingAt(key: K): V {\n memo[key] = this\n return this\n }\n }\n\n fun Number.toModLong(base: Long): ModLong = ModLong(this.toLong() % base, base)\n class ModLong(\n private val value: Long,\n val base: Long\n ) : Number(), Comparable {\n override fun toString(): String = value.toString()\n override fun equals(other: Any?): Boolean = value == other\n override fun hashCode(): Int = value.hashCode()\n override fun compareTo(other: ModLong): Int = value.compareTo(other.value)\n override fun toByte(): Byte = value.toByte()\n override fun toChar(): Char = value.toChar()\n override fun toDouble(): Double = value.toDouble()\n override fun toFloat(): Float = value.toFloat()\n override fun toInt(): Int = value.toInt()\n override fun toLong(): Long = value\n override fun toShort(): Short = value.toShort()\n operator fun plus(other: ModLong): ModLong = (this.value + other.value).toModLong(base)\n operator fun plus(other: Number): ModLong = (this.value + other.toLong() % base).toModLong(base)\n operator fun minus(other: Number): ModLong = (this.value + base - other.toLong() % base).toModLong(base)\n operator fun times(other: Number): ModLong = (this.value * other.toLong() % base).toModLong(base)\n fun pow(n: Int): ModLong {\n var res = 1L\n var a = value\n var l = n\n while (l > 0) {\n if ((l and 1) == 1) {\n res = (res * a) % base\n }\n a = a * a % base\n l /= 2\n }\n return res.toModLong(base)\n }\n\n fun pow(n: Long): ModLong {\n var res = 1L\n var a = value\n var l = n\n while (l > 0) {\n if ((l and 1L) == 1L) {\n res = (res * a) % base\n }\n a = a * a % base\n l /= 2L\n }\n return res.toModLong(base)\n }\n }\n}", "language": "Kotlin", "metadata": {"date": 1587953405, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s309012934.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s309012934", "user_id": "u981616728"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) = ABC164D.main()\n\nobject ABC164D {\n fun log(message: Any?) {\n //println(message)// TODO: ←消す\n }\n\n val S: String\n val N: Int\n\n init {\n S = readString()\n N = S.length\n }\n\n data class Problem(val remain: String, val current: ModLong) {\n fun getOneOrNull(): Int? = when {\n remain.isEmpty() -> if (current.isValid()) 1 else 0\n else -> null\n }\n }\n\n fun main() {\n val table = LazyMap { problem ->\n problem.getOneOrNull() ?: problem.let {\n val nj = \"${it.remain.first()}\".toInt()\n val current = it.current * 10 + nj\n val sub = Problem(remain = it.remain.drop(1), current = current)\n val ans = get(sub) + if (it.current.isValid()) 1 else 0\n log(\"$it->$ans\")\n ans\n }\n }\n\n val count = S.mapIndexed { i, si ->\n val ni = \"$si\".toInt()\n val current = ni.toModLong(2019)\n log(\"i=$i, ni=$ni\")\n table[Problem(remain = S.drop(i+1), current = current)]\n }.sum()\n val ans = count\n println(ans)\n }\n\n fun Number.isValid() = this.toLong() % 2019 == 0L\n\n\n /*####################################################################################*/\n\n fun readString() = readLine()!!\n\n class LazyMap(capacity: Int = 65536, private val init: LazyMap.(K) -> V) {\n private val memo = HashMap(capacity)\n operator fun get(key: K): V {\n return memo[key] ?: init(key).memorizingAt(key)\n }\n\n private fun V.memorizingAt(key: K): V {\n memo[key] = this\n return this\n }\n }\n\n fun Number.toModLong(base: Long): ModLong = ModLong(this.toLong() % base, base)\n class ModLong(\n private val value: Long,\n val base: Long\n ) : Number(), Comparable {\n override fun toString(): String = value.toString()\n override fun equals(other: Any?): Boolean = value == other\n override fun hashCode(): Int = value.hashCode()\n override fun compareTo(other: ModLong): Int = value.compareTo(other.value)\n override fun toByte(): Byte = value.toByte()\n override fun toChar(): Char = value.toChar()\n override fun toDouble(): Double = value.toDouble()\n override fun toFloat(): Float = value.toFloat()\n override fun toInt(): Int = value.toInt()\n override fun toLong(): Long = value\n override fun toShort(): Short = value.toShort()\n operator fun plus(other: ModLong): ModLong = (this.value + other.value).toModLong(base)\n operator fun plus(other: Number): ModLong = (this.value + other.toLong() % base).toModLong(base)\n operator fun minus(other: Number): ModLong = (this.value + base - other.toLong() % base).toModLong(base)\n operator fun times(other: Number): ModLong = (this.value * other.toLong() % base).toModLong(base)\n fun pow(n: Int): ModLong {\n var res = 1L\n var a = value\n var l = n\n while (l > 0) {\n if ((l and 1) == 1) {\n res = (res * a) % base\n }\n a = a * a % base\n l /= 2\n }\n return res.toModLong(base)\n }\n\n fun pow(n: Long): ModLong {\n var res = 1L\n var a = value\n var l = n\n while (l > 0) {\n if ((l and 1L) == 1L) {\n res = (res * a) % base\n }\n a = a * a % base\n l /= 2L\n }\n return res.toModLong(base)\n }\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3744, "cpu_time_ms": 1482, "memory_kb": 753208}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s151419448", "group_id": "codeNet:p02702", "input_text": "fun main() {\n val nums = readLine()!!.map { it.toInt() - 48 }\n function(nums)\n}\n\nfun function(nums: List) {\n val keta = nums.size\n var count = 0\n val rems = IntArray(keta)\n for (i in 0..keta - 3) {\n rems[i] = nums[i] * 100 + nums[i+1] * 10 + nums[i+2]\n }\n for (i in 4..keta) {\n for (j in 0..keta - i) {\n val rem = (nums[j + i - 1] + rems[j] * 10) % 2019\n if (rem == 0) {\n count++\n }\n rems[j] = rem\n }\n }\n println(count)\n}", "language": "Kotlin", "metadata": {"date": 1587953168, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s151419448.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s151419448", "user_id": "u896320985"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main() {\n val nums = readLine()!!.map { it.toInt() - 48 }\n function(nums)\n}\n\nfun function(nums: List) {\n val keta = nums.size\n var count = 0\n val rems = IntArray(keta)\n for (i in 0..keta - 3) {\n rems[i] = nums[i] * 100 + nums[i+1] * 10 + nums[i+2]\n }\n for (i in 4..keta) {\n for (j in 0..keta - i) {\n val rem = (nums[j + i - 1] + rems[j] * 10) % 2019\n if (rem == 0) {\n count++\n }\n rems[j] = rem\n }\n }\n println(count)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 536, "cpu_time_ms": 2207, "memory_kb": 41984}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s499589551", "group_id": "codeNet:p02702", "input_text": "private val list = (1..100).map { 2019 * it }.map { it.toString() }.toSet()\n\nfun main() {\n val s = readLine()!!\n val length = s.length\n if (length <= 3) {\n println(0)\n return\n }\n\n val result = (4..length)\n .map { diff -> (0..length - diff).map { s.substring(it, it + diff) }.count { list.contains(it) } }\n .sum()\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1587953137, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s499589551.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s499589551", "user_id": "u897579945"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "private val list = (1..100).map { 2019 * it }.map { it.toString() }.toSet()\n\nfun main() {\n val s = readLine()!!\n val length = s.length\n if (length <= 3) {\n println(0)\n return\n }\n\n val result = (4..length)\n .map { diff -> (0..length - diff).map { s.substring(it, it + diff) }.count { list.contains(it) } }\n .sum()\n println(result)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 377, "cpu_time_ms": 2209, "memory_kb": 112948}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s198728259", "group_id": "codeNet:p02702", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val S = sc.next()\n var ans = 0\n repeat(100) { i ->\n val n = (2019 * (i + 1)).toString()\n var j = 0\n while (j <= S.length - n.length) {\n if (S.substring(j, j + n.length) == n) {\n ans++\n }\n j++\n }\n }\n pw.println(ans)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1587950066, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s198728259.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s198728259", "user_id": "u297767059"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val S = sc.next()\n var ans = 0\n repeat(100) { i ->\n val n = (2019 * (i + 1)).toString()\n var j = 0\n while (j <= S.length - n.length) {\n if (S.substring(j, j + n.length) == n) {\n ans++\n }\n j++\n }\n }\n pw.println(ans)\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 597, "cpu_time_ms": 622, "memory_kb": 56616}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s998070571", "group_id": "codeNet:p02702", "input_text": "/**\n * Created by karayuu on 2020/04/26\n */\nfun main(args: Array) {\n val s = readLine()!!\n\n var count = 0\n for (i in s.indices) {\n for (j in i + 1..s.length) {\n if (s.substring(i, j).toLong() % 2019 == 0L) {\n count++;\n }\n }\n }\n\n println(count)\n}\n", "language": "Kotlin", "metadata": {"date": 1587950057, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02702.html", "problem_id": "p02702", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02702/input.txt", "sample_output_relpath": "derived/input_output/data/p02702/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02702/Kotlin/s998070571.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s998070571", "user_id": "u598902504"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "/**\n * Created by karayuu on 2020/04/26\n */\nfun main(args: Array) {\n val s = readLine()!!\n\n var count = 0\n for (i in s.indices) {\n for (j in i + 1..s.length) {\n if (s.substring(i, j).toLong() % 2019 == 0L) {\n count++;\n }\n }\n }\n\n println(count)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "sample_input": "1817181712114\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02702", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of digits from 1 through 9.\n\nFind the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the following condition:\n\nCondition: In base ten, the i-th through j-th characters of S form an integer that is a multiple of 2019.\n\nConstraints\n\n1 ≤ |S| ≤ 200000\n\nS is a string consisting of digits from 1 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of pairs of integers (i,j) (1 ≤ i ≤ j ≤ |S|) that satisfy the condition.\n\nSample Input 1\n\n1817181712114\n\nSample Output 1\n\n3\n\nThree pairs - (1,5), (5,9), and (9,13) - satisfy the condition.\n\nSample Input 2\n\n14282668646\n\nSample Output 2\n\n2\n\nSample Input 3\n\n2119\n\nSample Output 3\n\n0\n\nNo pairs satisfy the condition.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 282, "cpu_time_ms": 176, "memory_kb": 38124}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s020407383", "group_id": "codeNet:p02703", "input_text": "import java.util.*\nimport kotlin.math.min\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n data class Line(var to: Int, val c: Int, val d: Int)\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val M = sc.next().toInt()\n val S = sc.next().toInt()\n val edge = Array(N) { mutableListOf() }\n repeat(M) {\n val U = sc.next().toInt() - 1\n val V = sc.next().toInt() - 1\n val A = sc.next().toInt()\n val B = sc.next().toInt()\n edge[U].add(Line(V, A, B))\n edge[V].add(Line(U, A, B))\n }\n val edge2 = Array(N) { Array(2500) { mutableListOf() } }\n repeat(N) { i ->\n val C = sc.next().toInt()\n val D = sc.next().toInt()\n repeat(2500) { c ->\n edge2[i][c].add(Line(i, min(c + C, 2499), D))\n edge[i].forEach {\n if (c >= it.c) {\n edge2[i][c].add(Line(it.to, c - it.c, it.d))\n }\n }\n }\n }\n\n val pq = PriorityQueue>(100) { x, y ->\n return@PriorityQueue if (y.first < x.first) 1 else -1\n }\n val dist = Array(N) { LongArray(2500) { Long.MAX_VALUE } }\n dist[0][min(S, 2499)] = 0L\n pq.add(Triple(0L, 0, min(S, 2499))) // dist, idx, coin\n while (pq.isNotEmpty()) {\n val tmp = pq.first(); pq.remove(tmp)\n val d = tmp.first\n val from = tmp.second\n val c = tmp.third\n if (dist[from][c] < d) continue\n for (line in edge2[from][c]) {\n if (dist[line.to][line.c] > dist[from][c] + line.d) {\n dist[line.to][line.c] = dist[from][c] + line.d\n pq.add(Triple(dist[line.to][line.c], line.to, line.c))\n }\n }\n }\n\n for (i in 1 until N) {\n pw.println(dist[i].min())\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1588120766, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02703.html", "problem_id": "p02703", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02703/input.txt", "sample_output_relpath": "derived/input_output/data/p02703/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02703/Kotlin/s020407383.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s020407383", "user_id": "u297767059"}, "prompt_components": {"gold_output": "2\n14\n", "input_to_evaluate": "import java.util.*\nimport kotlin.math.min\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n data class Line(var to: Int, val c: Int, val d: Int)\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val M = sc.next().toInt()\n val S = sc.next().toInt()\n val edge = Array(N) { mutableListOf() }\n repeat(M) {\n val U = sc.next().toInt() - 1\n val V = sc.next().toInt() - 1\n val A = sc.next().toInt()\n val B = sc.next().toInt()\n edge[U].add(Line(V, A, B))\n edge[V].add(Line(U, A, B))\n }\n val edge2 = Array(N) { Array(2500) { mutableListOf() } }\n repeat(N) { i ->\n val C = sc.next().toInt()\n val D = sc.next().toInt()\n repeat(2500) { c ->\n edge2[i][c].add(Line(i, min(c + C, 2499), D))\n edge[i].forEach {\n if (c >= it.c) {\n edge2[i][c].add(Line(it.to, c - it.c, it.d))\n }\n }\n }\n }\n\n val pq = PriorityQueue>(100) { x, y ->\n return@PriorityQueue if (y.first < x.first) 1 else -1\n }\n val dist = Array(N) { LongArray(2500) { Long.MAX_VALUE } }\n dist[0][min(S, 2499)] = 0L\n pq.add(Triple(0L, 0, min(S, 2499))) // dist, idx, coin\n while (pq.isNotEmpty()) {\n val tmp = pq.first(); pq.remove(tmp)\n val d = tmp.first\n val from = tmp.second\n val c = tmp.third\n if (dist[from][c] < d) continue\n for (line in edge2[from][c]) {\n if (dist[line.to][line.c] > dist[from][c] + line.d) {\n dist[line.to][line.c] = dist[from][c] + line.d\n pq.add(Triple(dist[line.to][line.c], line.to, line.c))\n }\n }\n }\n\n for (i in 1 until N) {\n pw.println(dist[i].min())\n }\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N cities numbered 1 to N, connected by M railroads.\n\nYou are now at City 1, with 10^{100} gold coins and S silver coins in your pocket.\n\nThe i-th railroad connects City U_i and City V_i bidirectionally, and a one-way trip costs A_i silver coins and takes B_i minutes.\nYou cannot use gold coins to pay the fare.\n\nThere is an exchange counter in each city. At the exchange counter in City i, you can get C_i silver coins for 1 gold coin.\nThe transaction takes D_i minutes for each gold coin you give.\nYou can exchange any number of gold coins at each exchange counter.\n\nFor each t=2, ..., N, find the minimum time needed to travel from City 1 to City t. You can ignore the time spent waiting for trains.\n\nConstraints\n\n2 \\leq N \\leq 50\n\nN-1 \\leq M \\leq 100\n\n0 \\leq S \\leq 10^9\n\n1 \\leq A_i \\leq 50\n\n1 \\leq B_i,C_i,D_i \\leq 10^9\n\n1 \\leq U_i < V_i \\leq N\n\nThere is no pair i, j(i \\neq j) such that (U_i,V_i)=(U_j,V_j).\n\nEach city t=2,...,N can be reached from City 1 with some number of railroads.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M S\nU_1 V_1 A_1 B_1\n:\nU_M V_M A_M B_M\nC_1 D_1\n:\nC_N D_N\n\nOutput\n\nFor each t=2, ..., N in this order, print a line containing the minimum time needed to travel from City 1 to City t.\n\nSample Input 1\n\n3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n\nSample Output 1\n\n2\n14\n\nThe railway network in this input is shown in the figure below.\n\nIn this figure, each city is labeled as follows:\n\nThe first line: the ID number i of the city (i for City i)\n\nThe second line: C_i / D_i\n\nSimilarly, each railroad is labeled as follows:\n\nThe first line: the ID number i of the railroad (i for the i-th railroad in input)\n\nThe second line: A_i / B_i\n\nYou can travel from City 1 to City 2 in 2 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nYou can travel from City 1 to City 3 in 14 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 6 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nSample Input 2\n\n4 4 1\n1 2 1 5\n1 3 4 4\n2 4 2 2\n3 4 1 1\n3 1\n3 1\n5 2\n6 4\n\nSample Output 2\n\n5\n5\n7\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 4 in 7 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 2 gold coins for 6 silver coins in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nUse the 4-th railroad to move from City 3 to City 4 in 1 minutes.\n\nSample Input 3\n\n6 5 1\n1 2 1 1\n1 3 2 1\n2 4 5 1\n3 5 11 1\n1 6 50 1\n1 10000\n1 3000\n1 700\n1 100\n1 1\n100 1\n\nSample Output 3\n\n1\n9003\n14606\n16510\n16576\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 6 in 16576 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 9000 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nAt the exchange counter in City 3, exchange 8 gold coins for 8 silver coins in 5600 minutes.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nUse the 3-rd railroad to move from City 2 to City 4 in 1 minute.\n\nAt the exchange counter in City 4, exchange 19 gold coins for 19 silver coins in 1900 minutes.\n\nUse the 3-rd railroad to move from City 4 to City 2 in 1 minute.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nUse the 4-th railroad to move from City 3 to City 5 in 1 minute.\n\nAt the exchange counter in City 5, exchange 63 gold coins for 63 silver coins in 63 minutes.\n\nUse the 4-th railroad to move from City 5 to City 3 in 1 minute.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 5-th railroad to move from City 1 to City 6 in 1 minute.\n\nSample Input 4\n\n4 6 1000000000\n1 2 50 1\n1 3 50 5\n1 4 50 7\n2 3 50 2\n2 4 50 4\n3 4 50 3\n10 2\n4 4\n5 5\n7 7\n\nSample Output 4\n\n1\n3\n5\n\nThe railway network in this input is shown in the figure below:\n\nSample Input 5\n\n2 1 0\n1 2 1 1\n1 1000000000\n1 1\n\nSample Output 5\n\n1000000001\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 2 in 1000000001 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 1 gold coin for 1 silver coin in 1000000000 minutes.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.", "sample_input": "3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n"}, "reference_outputs": ["2\n14\n"], "source_document_id": "p02703", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N cities numbered 1 to N, connected by M railroads.\n\nYou are now at City 1, with 10^{100} gold coins and S silver coins in your pocket.\n\nThe i-th railroad connects City U_i and City V_i bidirectionally, and a one-way trip costs A_i silver coins and takes B_i minutes.\nYou cannot use gold coins to pay the fare.\n\nThere is an exchange counter in each city. At the exchange counter in City i, you can get C_i silver coins for 1 gold coin.\nThe transaction takes D_i minutes for each gold coin you give.\nYou can exchange any number of gold coins at each exchange counter.\n\nFor each t=2, ..., N, find the minimum time needed to travel from City 1 to City t. You can ignore the time spent waiting for trains.\n\nConstraints\n\n2 \\leq N \\leq 50\n\nN-1 \\leq M \\leq 100\n\n0 \\leq S \\leq 10^9\n\n1 \\leq A_i \\leq 50\n\n1 \\leq B_i,C_i,D_i \\leq 10^9\n\n1 \\leq U_i < V_i \\leq N\n\nThere is no pair i, j(i \\neq j) such that (U_i,V_i)=(U_j,V_j).\n\nEach city t=2,...,N can be reached from City 1 with some number of railroads.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M S\nU_1 V_1 A_1 B_1\n:\nU_M V_M A_M B_M\nC_1 D_1\n:\nC_N D_N\n\nOutput\n\nFor each t=2, ..., N in this order, print a line containing the minimum time needed to travel from City 1 to City t.\n\nSample Input 1\n\n3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n\nSample Output 1\n\n2\n14\n\nThe railway network in this input is shown in the figure below.\n\nIn this figure, each city is labeled as follows:\n\nThe first line: the ID number i of the city (i for City i)\n\nThe second line: C_i / D_i\n\nSimilarly, each railroad is labeled as follows:\n\nThe first line: the ID number i of the railroad (i for the i-th railroad in input)\n\nThe second line: A_i / B_i\n\nYou can travel from City 1 to City 2 in 2 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nYou can travel from City 1 to City 3 in 14 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 6 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nSample Input 2\n\n4 4 1\n1 2 1 5\n1 3 4 4\n2 4 2 2\n3 4 1 1\n3 1\n3 1\n5 2\n6 4\n\nSample Output 2\n\n5\n5\n7\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 4 in 7 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 2 gold coins for 6 silver coins in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nUse the 4-th railroad to move from City 3 to City 4 in 1 minutes.\n\nSample Input 3\n\n6 5 1\n1 2 1 1\n1 3 2 1\n2 4 5 1\n3 5 11 1\n1 6 50 1\n1 10000\n1 3000\n1 700\n1 100\n1 1\n100 1\n\nSample Output 3\n\n1\n9003\n14606\n16510\n16576\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 6 in 16576 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 9000 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nAt the exchange counter in City 3, exchange 8 gold coins for 8 silver coins in 5600 minutes.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nUse the 3-rd railroad to move from City 2 to City 4 in 1 minute.\n\nAt the exchange counter in City 4, exchange 19 gold coins for 19 silver coins in 1900 minutes.\n\nUse the 3-rd railroad to move from City 4 to City 2 in 1 minute.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nUse the 4-th railroad to move from City 3 to City 5 in 1 minute.\n\nAt the exchange counter in City 5, exchange 63 gold coins for 63 silver coins in 63 minutes.\n\nUse the 4-th railroad to move from City 5 to City 3 in 1 minute.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 5-th railroad to move from City 1 to City 6 in 1 minute.\n\nSample Input 4\n\n4 6 1000000000\n1 2 50 1\n1 3 50 5\n1 4 50 7\n2 3 50 2\n2 4 50 4\n3 4 50 3\n10 2\n4 4\n5 5\n7 7\n\nSample Output 4\n\n1\n3\n5\n\nThe railway network in this input is shown in the figure below:\n\nSample Input 5\n\n2 1 0\n1 2 1 1\n1 1000000000\n1 1\n\nSample Output 5\n\n1000000001\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 2 in 1000000001 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 1 gold coin for 1 silver coin in 1000000000 minutes.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2123, "cpu_time_ms": 687, "memory_kb": 92248}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s297309246", "group_id": "codeNet:p02703", "input_text": "import java.util.*\nimport kotlin.math.min\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n data class Line(var to: Int, val c: Int, val d: Int)\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val M = sc.next().toInt()\n val S = sc.next().toInt()\n val edge = Array(N) { mutableListOf() }\n repeat(M) {\n val U = sc.next().toInt() - 1\n val V = sc.next().toInt() - 1\n val A = sc.next().toInt()\n val B = sc.next().toInt()\n edge[U].add(Line(V, A, B))\n edge[V].add(Line(U, A, B))\n }\n val edge2 = Array(N) { Array(2500) { mutableListOf() } }\n repeat(N) { i ->\n val C = sc.next().toInt()\n val D = sc.next().toInt()\n repeat(2500) { c ->\n edge2[i][c].add(Line(i, min(c + C, 2499), D))\n edge[i].forEach {\n if (c >= it.c) {\n edge2[i][c].add(Line(it.to, c - it.c, it.d))\n }\n }\n }\n }\n\n val pq = PriorityQueue>(100) { x, y ->\n return@PriorityQueue if (y.first < x.first) 1 else -1\n }\n val dist = Array(N) { IntArray(2500) { Int.MAX_VALUE } }\n dist[0][min(S, 2499)] = 0\n pq.add(Triple(0, 0, min(S, 2499))) // dist, idx, coin\n while (pq.isNotEmpty()) {\n val tmp = pq.first(); pq.remove(tmp)\n val d = tmp.first\n val from = tmp.second\n val c = tmp.third\n if (dist[from][c] < d) continue\n for (line in edge2[from][c]) {\n if (dist[line.to][line.c] > dist[from][c] + line.d) {\n dist[line.to][line.c] = dist[from][c] + line.d\n pq.add(Triple(dist[line.to][line.c], line.to, line.c))\n }\n }\n }\n\n for (i in 1 until N) {\n pw.println(dist[i].min())\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1588047106, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02703.html", "problem_id": "p02703", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02703/input.txt", "sample_output_relpath": "derived/input_output/data/p02703/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02703/Kotlin/s297309246.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s297309246", "user_id": "u297767059"}, "prompt_components": {"gold_output": "2\n14\n", "input_to_evaluate": "import java.util.*\nimport kotlin.math.min\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n data class Line(var to: Int, val c: Int, val d: Int)\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val M = sc.next().toInt()\n val S = sc.next().toInt()\n val edge = Array(N) { mutableListOf() }\n repeat(M) {\n val U = sc.next().toInt() - 1\n val V = sc.next().toInt() - 1\n val A = sc.next().toInt()\n val B = sc.next().toInt()\n edge[U].add(Line(V, A, B))\n edge[V].add(Line(U, A, B))\n }\n val edge2 = Array(N) { Array(2500) { mutableListOf() } }\n repeat(N) { i ->\n val C = sc.next().toInt()\n val D = sc.next().toInt()\n repeat(2500) { c ->\n edge2[i][c].add(Line(i, min(c + C, 2499), D))\n edge[i].forEach {\n if (c >= it.c) {\n edge2[i][c].add(Line(it.to, c - it.c, it.d))\n }\n }\n }\n }\n\n val pq = PriorityQueue>(100) { x, y ->\n return@PriorityQueue if (y.first < x.first) 1 else -1\n }\n val dist = Array(N) { IntArray(2500) { Int.MAX_VALUE } }\n dist[0][min(S, 2499)] = 0\n pq.add(Triple(0, 0, min(S, 2499))) // dist, idx, coin\n while (pq.isNotEmpty()) {\n val tmp = pq.first(); pq.remove(tmp)\n val d = tmp.first\n val from = tmp.second\n val c = tmp.third\n if (dist[from][c] < d) continue\n for (line in edge2[from][c]) {\n if (dist[line.to][line.c] > dist[from][c] + line.d) {\n dist[line.to][line.c] = dist[from][c] + line.d\n pq.add(Triple(dist[line.to][line.c], line.to, line.c))\n }\n }\n }\n\n for (i in 1 until N) {\n pw.println(dist[i].min())\n }\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N cities numbered 1 to N, connected by M railroads.\n\nYou are now at City 1, with 10^{100} gold coins and S silver coins in your pocket.\n\nThe i-th railroad connects City U_i and City V_i bidirectionally, and a one-way trip costs A_i silver coins and takes B_i minutes.\nYou cannot use gold coins to pay the fare.\n\nThere is an exchange counter in each city. At the exchange counter in City i, you can get C_i silver coins for 1 gold coin.\nThe transaction takes D_i minutes for each gold coin you give.\nYou can exchange any number of gold coins at each exchange counter.\n\nFor each t=2, ..., N, find the minimum time needed to travel from City 1 to City t. You can ignore the time spent waiting for trains.\n\nConstraints\n\n2 \\leq N \\leq 50\n\nN-1 \\leq M \\leq 100\n\n0 \\leq S \\leq 10^9\n\n1 \\leq A_i \\leq 50\n\n1 \\leq B_i,C_i,D_i \\leq 10^9\n\n1 \\leq U_i < V_i \\leq N\n\nThere is no pair i, j(i \\neq j) such that (U_i,V_i)=(U_j,V_j).\n\nEach city t=2,...,N can be reached from City 1 with some number of railroads.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M S\nU_1 V_1 A_1 B_1\n:\nU_M V_M A_M B_M\nC_1 D_1\n:\nC_N D_N\n\nOutput\n\nFor each t=2, ..., N in this order, print a line containing the minimum time needed to travel from City 1 to City t.\n\nSample Input 1\n\n3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n\nSample Output 1\n\n2\n14\n\nThe railway network in this input is shown in the figure below.\n\nIn this figure, each city is labeled as follows:\n\nThe first line: the ID number i of the city (i for City i)\n\nThe second line: C_i / D_i\n\nSimilarly, each railroad is labeled as follows:\n\nThe first line: the ID number i of the railroad (i for the i-th railroad in input)\n\nThe second line: A_i / B_i\n\nYou can travel from City 1 to City 2 in 2 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nYou can travel from City 1 to City 3 in 14 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 6 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nSample Input 2\n\n4 4 1\n1 2 1 5\n1 3 4 4\n2 4 2 2\n3 4 1 1\n3 1\n3 1\n5 2\n6 4\n\nSample Output 2\n\n5\n5\n7\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 4 in 7 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 2 gold coins for 6 silver coins in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nUse the 4-th railroad to move from City 3 to City 4 in 1 minutes.\n\nSample Input 3\n\n6 5 1\n1 2 1 1\n1 3 2 1\n2 4 5 1\n3 5 11 1\n1 6 50 1\n1 10000\n1 3000\n1 700\n1 100\n1 1\n100 1\n\nSample Output 3\n\n1\n9003\n14606\n16510\n16576\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 6 in 16576 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 9000 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nAt the exchange counter in City 3, exchange 8 gold coins for 8 silver coins in 5600 minutes.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nUse the 3-rd railroad to move from City 2 to City 4 in 1 minute.\n\nAt the exchange counter in City 4, exchange 19 gold coins for 19 silver coins in 1900 minutes.\n\nUse the 3-rd railroad to move from City 4 to City 2 in 1 minute.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nUse the 4-th railroad to move from City 3 to City 5 in 1 minute.\n\nAt the exchange counter in City 5, exchange 63 gold coins for 63 silver coins in 63 minutes.\n\nUse the 4-th railroad to move from City 5 to City 3 in 1 minute.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 5-th railroad to move from City 1 to City 6 in 1 minute.\n\nSample Input 4\n\n4 6 1000000000\n1 2 50 1\n1 3 50 5\n1 4 50 7\n2 3 50 2\n2 4 50 4\n3 4 50 3\n10 2\n4 4\n5 5\n7 7\n\nSample Output 4\n\n1\n3\n5\n\nThe railway network in this input is shown in the figure below:\n\nSample Input 5\n\n2 1 0\n1 2 1 1\n1 1000000000\n1 1\n\nSample Output 5\n\n1000000001\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 2 in 1000000001 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 1 gold coin for 1 silver coin in 1000000000 minutes.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.", "sample_input": "3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n"}, "reference_outputs": ["2\n14\n"], "source_document_id": "p02703", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N cities numbered 1 to N, connected by M railroads.\n\nYou are now at City 1, with 10^{100} gold coins and S silver coins in your pocket.\n\nThe i-th railroad connects City U_i and City V_i bidirectionally, and a one-way trip costs A_i silver coins and takes B_i minutes.\nYou cannot use gold coins to pay the fare.\n\nThere is an exchange counter in each city. At the exchange counter in City i, you can get C_i silver coins for 1 gold coin.\nThe transaction takes D_i minutes for each gold coin you give.\nYou can exchange any number of gold coins at each exchange counter.\n\nFor each t=2, ..., N, find the minimum time needed to travel from City 1 to City t. You can ignore the time spent waiting for trains.\n\nConstraints\n\n2 \\leq N \\leq 50\n\nN-1 \\leq M \\leq 100\n\n0 \\leq S \\leq 10^9\n\n1 \\leq A_i \\leq 50\n\n1 \\leq B_i,C_i,D_i \\leq 10^9\n\n1 \\leq U_i < V_i \\leq N\n\nThere is no pair i, j(i \\neq j) such that (U_i,V_i)=(U_j,V_j).\n\nEach city t=2,...,N can be reached from City 1 with some number of railroads.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M S\nU_1 V_1 A_1 B_1\n:\nU_M V_M A_M B_M\nC_1 D_1\n:\nC_N D_N\n\nOutput\n\nFor each t=2, ..., N in this order, print a line containing the minimum time needed to travel from City 1 to City t.\n\nSample Input 1\n\n3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n\nSample Output 1\n\n2\n14\n\nThe railway network in this input is shown in the figure below.\n\nIn this figure, each city is labeled as follows:\n\nThe first line: the ID number i of the city (i for City i)\n\nThe second line: C_i / D_i\n\nSimilarly, each railroad is labeled as follows:\n\nThe first line: the ID number i of the railroad (i for the i-th railroad in input)\n\nThe second line: A_i / B_i\n\nYou can travel from City 1 to City 2 in 2 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nYou can travel from City 1 to City 3 in 14 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 6 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nSample Input 2\n\n4 4 1\n1 2 1 5\n1 3 4 4\n2 4 2 2\n3 4 1 1\n3 1\n3 1\n5 2\n6 4\n\nSample Output 2\n\n5\n5\n7\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 4 in 7 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 2 gold coins for 6 silver coins in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nUse the 4-th railroad to move from City 3 to City 4 in 1 minutes.\n\nSample Input 3\n\n6 5 1\n1 2 1 1\n1 3 2 1\n2 4 5 1\n3 5 11 1\n1 6 50 1\n1 10000\n1 3000\n1 700\n1 100\n1 1\n100 1\n\nSample Output 3\n\n1\n9003\n14606\n16510\n16576\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 6 in 16576 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 9000 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nAt the exchange counter in City 3, exchange 8 gold coins for 8 silver coins in 5600 minutes.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nUse the 3-rd railroad to move from City 2 to City 4 in 1 minute.\n\nAt the exchange counter in City 4, exchange 19 gold coins for 19 silver coins in 1900 minutes.\n\nUse the 3-rd railroad to move from City 4 to City 2 in 1 minute.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nUse the 4-th railroad to move from City 3 to City 5 in 1 minute.\n\nAt the exchange counter in City 5, exchange 63 gold coins for 63 silver coins in 63 minutes.\n\nUse the 4-th railroad to move from City 5 to City 3 in 1 minute.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 5-th railroad to move from City 1 to City 6 in 1 minute.\n\nSample Input 4\n\n4 6 1000000000\n1 2 50 1\n1 3 50 5\n1 4 50 7\n2 3 50 2\n2 4 50 4\n3 4 50 3\n10 2\n4 4\n5 5\n7 7\n\nSample Output 4\n\n1\n3\n5\n\nThe railway network in this input is shown in the figure below:\n\nSample Input 5\n\n2 1 0\n1 2 1 1\n1 1000000000\n1 1\n\nSample Output 5\n\n1000000001\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 2 in 1000000001 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 1 gold coin for 1 silver coin in 1000000000 minutes.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2118, "cpu_time_ms": 1603, "memory_kb": 98432}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s031278177", "group_id": "codeNet:p02703", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n data class Way(val i: Int, val s: Int, val t: Int)\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val M = sc.next().toInt()\n val S = sc.next().toInt()\n val nextWays = Array(N + 1) { mutableListOf() }\n repeat(M) {\n val U = sc.next().toInt()\n val V = sc.next().toInt()\n val A = sc.next().toInt()\n val B = sc.next().toInt()\n nextWays[U].add(Way(V, -A, B))\n nextWays[V].add(Way(U, -A, B))\n }\n repeat(N) { i ->\n val C = sc.next().toInt()\n val D = sc.next().toInt()\n nextWays[i + 1].add(Way(i + 1, C, D))\n }\n// ways.forEach(::println)\n\n val ans = IntArray(N + 1) { -1 }\n ans[1] = 0\n var solved = 1\n val q = PriorityQueue(100) { x, y ->\n return@PriorityQueue if (y.t < x.t) 1 else -1\n }\n q.add(Way(1, S, 0))\n while (solved < N) {\n val way = q.first()\n q.remove(way)\n if (ans[way.i] == -1) {\n ans[way.i] = way.t\n solved++\n }\n nextWays[way.i].forEach { nextWay ->\n if (way.s + nextWay.s >= 0) {\n q.add(Way(nextWay.i, way.s + nextWay.s, way.t + nextWay.t))\n }\n }\n }\n\n for (i in 2..N) {\n pw.println(ans[i])\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1587954411, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02703.html", "problem_id": "p02703", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02703/input.txt", "sample_output_relpath": "derived/input_output/data/p02703/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02703/Kotlin/s031278177.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s031278177", "user_id": "u297767059"}, "prompt_components": {"gold_output": "2\n14\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n data class Way(val i: Int, val s: Int, val t: Int)\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val M = sc.next().toInt()\n val S = sc.next().toInt()\n val nextWays = Array(N + 1) { mutableListOf() }\n repeat(M) {\n val U = sc.next().toInt()\n val V = sc.next().toInt()\n val A = sc.next().toInt()\n val B = sc.next().toInt()\n nextWays[U].add(Way(V, -A, B))\n nextWays[V].add(Way(U, -A, B))\n }\n repeat(N) { i ->\n val C = sc.next().toInt()\n val D = sc.next().toInt()\n nextWays[i + 1].add(Way(i + 1, C, D))\n }\n// ways.forEach(::println)\n\n val ans = IntArray(N + 1) { -1 }\n ans[1] = 0\n var solved = 1\n val q = PriorityQueue(100) { x, y ->\n return@PriorityQueue if (y.t < x.t) 1 else -1\n }\n q.add(Way(1, S, 0))\n while (solved < N) {\n val way = q.first()\n q.remove(way)\n if (ans[way.i] == -1) {\n ans[way.i] = way.t\n solved++\n }\n nextWays[way.i].forEach { nextWay ->\n if (way.s + nextWay.s >= 0) {\n q.add(Way(nextWay.i, way.s + nextWay.s, way.t + nextWay.t))\n }\n }\n }\n\n for (i in 2..N) {\n pw.println(ans[i])\n }\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N cities numbered 1 to N, connected by M railroads.\n\nYou are now at City 1, with 10^{100} gold coins and S silver coins in your pocket.\n\nThe i-th railroad connects City U_i and City V_i bidirectionally, and a one-way trip costs A_i silver coins and takes B_i minutes.\nYou cannot use gold coins to pay the fare.\n\nThere is an exchange counter in each city. At the exchange counter in City i, you can get C_i silver coins for 1 gold coin.\nThe transaction takes D_i minutes for each gold coin you give.\nYou can exchange any number of gold coins at each exchange counter.\n\nFor each t=2, ..., N, find the minimum time needed to travel from City 1 to City t. You can ignore the time spent waiting for trains.\n\nConstraints\n\n2 \\leq N \\leq 50\n\nN-1 \\leq M \\leq 100\n\n0 \\leq S \\leq 10^9\n\n1 \\leq A_i \\leq 50\n\n1 \\leq B_i,C_i,D_i \\leq 10^9\n\n1 \\leq U_i < V_i \\leq N\n\nThere is no pair i, j(i \\neq j) such that (U_i,V_i)=(U_j,V_j).\n\nEach city t=2,...,N can be reached from City 1 with some number of railroads.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M S\nU_1 V_1 A_1 B_1\n:\nU_M V_M A_M B_M\nC_1 D_1\n:\nC_N D_N\n\nOutput\n\nFor each t=2, ..., N in this order, print a line containing the minimum time needed to travel from City 1 to City t.\n\nSample Input 1\n\n3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n\nSample Output 1\n\n2\n14\n\nThe railway network in this input is shown in the figure below.\n\nIn this figure, each city is labeled as follows:\n\nThe first line: the ID number i of the city (i for City i)\n\nThe second line: C_i / D_i\n\nSimilarly, each railroad is labeled as follows:\n\nThe first line: the ID number i of the railroad (i for the i-th railroad in input)\n\nThe second line: A_i / B_i\n\nYou can travel from City 1 to City 2 in 2 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nYou can travel from City 1 to City 3 in 14 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 6 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nSample Input 2\n\n4 4 1\n1 2 1 5\n1 3 4 4\n2 4 2 2\n3 4 1 1\n3 1\n3 1\n5 2\n6 4\n\nSample Output 2\n\n5\n5\n7\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 4 in 7 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 2 gold coins for 6 silver coins in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nUse the 4-th railroad to move from City 3 to City 4 in 1 minutes.\n\nSample Input 3\n\n6 5 1\n1 2 1 1\n1 3 2 1\n2 4 5 1\n3 5 11 1\n1 6 50 1\n1 10000\n1 3000\n1 700\n1 100\n1 1\n100 1\n\nSample Output 3\n\n1\n9003\n14606\n16510\n16576\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 6 in 16576 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 9000 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nAt the exchange counter in City 3, exchange 8 gold coins for 8 silver coins in 5600 minutes.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nUse the 3-rd railroad to move from City 2 to City 4 in 1 minute.\n\nAt the exchange counter in City 4, exchange 19 gold coins for 19 silver coins in 1900 minutes.\n\nUse the 3-rd railroad to move from City 4 to City 2 in 1 minute.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nUse the 4-th railroad to move from City 3 to City 5 in 1 minute.\n\nAt the exchange counter in City 5, exchange 63 gold coins for 63 silver coins in 63 minutes.\n\nUse the 4-th railroad to move from City 5 to City 3 in 1 minute.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 5-th railroad to move from City 1 to City 6 in 1 minute.\n\nSample Input 4\n\n4 6 1000000000\n1 2 50 1\n1 3 50 5\n1 4 50 7\n2 3 50 2\n2 4 50 4\n3 4 50 3\n10 2\n4 4\n5 5\n7 7\n\nSample Output 4\n\n1\n3\n5\n\nThe railway network in this input is shown in the figure below:\n\nSample Input 5\n\n2 1 0\n1 2 1 1\n1 1000000000\n1 1\n\nSample Output 5\n\n1000000001\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 2 in 1000000001 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 1 gold coin for 1 silver coin in 1000000000 minutes.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.", "sample_input": "3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n"}, "reference_outputs": ["2\n14\n"], "source_document_id": "p02703", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N cities numbered 1 to N, connected by M railroads.\n\nYou are now at City 1, with 10^{100} gold coins and S silver coins in your pocket.\n\nThe i-th railroad connects City U_i and City V_i bidirectionally, and a one-way trip costs A_i silver coins and takes B_i minutes.\nYou cannot use gold coins to pay the fare.\n\nThere is an exchange counter in each city. At the exchange counter in City i, you can get C_i silver coins for 1 gold coin.\nThe transaction takes D_i minutes for each gold coin you give.\nYou can exchange any number of gold coins at each exchange counter.\n\nFor each t=2, ..., N, find the minimum time needed to travel from City 1 to City t. You can ignore the time spent waiting for trains.\n\nConstraints\n\n2 \\leq N \\leq 50\n\nN-1 \\leq M \\leq 100\n\n0 \\leq S \\leq 10^9\n\n1 \\leq A_i \\leq 50\n\n1 \\leq B_i,C_i,D_i \\leq 10^9\n\n1 \\leq U_i < V_i \\leq N\n\nThere is no pair i, j(i \\neq j) such that (U_i,V_i)=(U_j,V_j).\n\nEach city t=2,...,N can be reached from City 1 with some number of railroads.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M S\nU_1 V_1 A_1 B_1\n:\nU_M V_M A_M B_M\nC_1 D_1\n:\nC_N D_N\n\nOutput\n\nFor each t=2, ..., N in this order, print a line containing the minimum time needed to travel from City 1 to City t.\n\nSample Input 1\n\n3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n\nSample Output 1\n\n2\n14\n\nThe railway network in this input is shown in the figure below.\n\nIn this figure, each city is labeled as follows:\n\nThe first line: the ID number i of the city (i for City i)\n\nThe second line: C_i / D_i\n\nSimilarly, each railroad is labeled as follows:\n\nThe first line: the ID number i of the railroad (i for the i-th railroad in input)\n\nThe second line: A_i / B_i\n\nYou can travel from City 1 to City 2 in 2 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nYou can travel from City 1 to City 3 in 14 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 6 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nSample Input 2\n\n4 4 1\n1 2 1 5\n1 3 4 4\n2 4 2 2\n3 4 1 1\n3 1\n3 1\n5 2\n6 4\n\nSample Output 2\n\n5\n5\n7\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 4 in 7 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 2 gold coins for 6 silver coins in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nUse the 4-th railroad to move from City 3 to City 4 in 1 minutes.\n\nSample Input 3\n\n6 5 1\n1 2 1 1\n1 3 2 1\n2 4 5 1\n3 5 11 1\n1 6 50 1\n1 10000\n1 3000\n1 700\n1 100\n1 1\n100 1\n\nSample Output 3\n\n1\n9003\n14606\n16510\n16576\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 6 in 16576 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 9000 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nAt the exchange counter in City 3, exchange 8 gold coins for 8 silver coins in 5600 minutes.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nUse the 3-rd railroad to move from City 2 to City 4 in 1 minute.\n\nAt the exchange counter in City 4, exchange 19 gold coins for 19 silver coins in 1900 minutes.\n\nUse the 3-rd railroad to move from City 4 to City 2 in 1 minute.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nUse the 4-th railroad to move from City 3 to City 5 in 1 minute.\n\nAt the exchange counter in City 5, exchange 63 gold coins for 63 silver coins in 63 minutes.\n\nUse the 4-th railroad to move from City 5 to City 3 in 1 minute.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 5-th railroad to move from City 1 to City 6 in 1 minute.\n\nSample Input 4\n\n4 6 1000000000\n1 2 50 1\n1 3 50 5\n1 4 50 7\n2 3 50 2\n2 4 50 4\n3 4 50 3\n10 2\n4 4\n5 5\n7 7\n\nSample Output 4\n\n1\n3\n5\n\nThe railway network in this input is shown in the figure below:\n\nSample Input 5\n\n2 1 0\n1 2 1 1\n1 1000000000\n1 1\n\nSample Output 5\n\n1000000001\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 2 in 1000000001 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 1 gold coin for 1 silver coin in 1000000000 minutes.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1632, "cpu_time_ms": 2217, "memory_kb": 387436}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s940095966", "group_id": "codeNet:p02703", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n data class Way(val i: Int, val s: Int, val t: Int)\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val M = sc.next().toInt()\n val S = sc.next().toInt()\n val nextWays = Array(N + 1) { mutableListOf() }\n repeat(M) {\n val U = sc.next().toInt()\n val V = sc.next().toInt()\n val A = sc.next().toInt()\n val B = sc.next().toInt()\n nextWays[U].add(Way(V, -A, B))\n nextWays[V].add(Way(U, -A, B))\n }\n repeat(N) { i ->\n val C = sc.next().toInt()\n val D = sc.next().toInt()\n nextWays[i + 1].add(Way(i + 1, C, D))\n }\n// ways.forEach(::println)\n\n val ans = IntArray(N + 1) { -1 }\n ans[1] = 0\n var solved = 1\n val q = PriorityQueue(100) { x, y ->\n return@PriorityQueue if (y.t < x.t) 1 else -1\n }\n q.add(Way(1, S, 0))\n while (solved < N) {\n val way = q.first()\n q.remove(way)\n if (ans[way.i] == -1) {\n ans[way.i] = way.t\n solved++\n }\n nextWays[way.i].forEach { nextWay ->\n if (way.s + nextWay.s >= 0 && ans[nextWay.i] <= way.t + nextWay.t) {\n q.add(Way(nextWay.i, way.s + nextWay.s, way.t + nextWay.t))\n }\n }\n }\n\n for (i in 2..N) {\n pw.println(ans[i])\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1587954112, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02703.html", "problem_id": "p02703", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02703/input.txt", "sample_output_relpath": "derived/input_output/data/p02703/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02703/Kotlin/s940095966.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s940095966", "user_id": "u297767059"}, "prompt_components": {"gold_output": "2\n14\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n data class Way(val i: Int, val s: Int, val t: Int)\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val M = sc.next().toInt()\n val S = sc.next().toInt()\n val nextWays = Array(N + 1) { mutableListOf() }\n repeat(M) {\n val U = sc.next().toInt()\n val V = sc.next().toInt()\n val A = sc.next().toInt()\n val B = sc.next().toInt()\n nextWays[U].add(Way(V, -A, B))\n nextWays[V].add(Way(U, -A, B))\n }\n repeat(N) { i ->\n val C = sc.next().toInt()\n val D = sc.next().toInt()\n nextWays[i + 1].add(Way(i + 1, C, D))\n }\n// ways.forEach(::println)\n\n val ans = IntArray(N + 1) { -1 }\n ans[1] = 0\n var solved = 1\n val q = PriorityQueue(100) { x, y ->\n return@PriorityQueue if (y.t < x.t) 1 else -1\n }\n q.add(Way(1, S, 0))\n while (solved < N) {\n val way = q.first()\n q.remove(way)\n if (ans[way.i] == -1) {\n ans[way.i] = way.t\n solved++\n }\n nextWays[way.i].forEach { nextWay ->\n if (way.s + nextWay.s >= 0 && ans[nextWay.i] <= way.t + nextWay.t) {\n q.add(Way(nextWay.i, way.s + nextWay.s, way.t + nextWay.t))\n }\n }\n }\n\n for (i in 2..N) {\n pw.println(ans[i])\n }\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N cities numbered 1 to N, connected by M railroads.\n\nYou are now at City 1, with 10^{100} gold coins and S silver coins in your pocket.\n\nThe i-th railroad connects City U_i and City V_i bidirectionally, and a one-way trip costs A_i silver coins and takes B_i minutes.\nYou cannot use gold coins to pay the fare.\n\nThere is an exchange counter in each city. At the exchange counter in City i, you can get C_i silver coins for 1 gold coin.\nThe transaction takes D_i minutes for each gold coin you give.\nYou can exchange any number of gold coins at each exchange counter.\n\nFor each t=2, ..., N, find the minimum time needed to travel from City 1 to City t. You can ignore the time spent waiting for trains.\n\nConstraints\n\n2 \\leq N \\leq 50\n\nN-1 \\leq M \\leq 100\n\n0 \\leq S \\leq 10^9\n\n1 \\leq A_i \\leq 50\n\n1 \\leq B_i,C_i,D_i \\leq 10^9\n\n1 \\leq U_i < V_i \\leq N\n\nThere is no pair i, j(i \\neq j) such that (U_i,V_i)=(U_j,V_j).\n\nEach city t=2,...,N can be reached from City 1 with some number of railroads.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M S\nU_1 V_1 A_1 B_1\n:\nU_M V_M A_M B_M\nC_1 D_1\n:\nC_N D_N\n\nOutput\n\nFor each t=2, ..., N in this order, print a line containing the minimum time needed to travel from City 1 to City t.\n\nSample Input 1\n\n3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n\nSample Output 1\n\n2\n14\n\nThe railway network in this input is shown in the figure below.\n\nIn this figure, each city is labeled as follows:\n\nThe first line: the ID number i of the city (i for City i)\n\nThe second line: C_i / D_i\n\nSimilarly, each railroad is labeled as follows:\n\nThe first line: the ID number i of the railroad (i for the i-th railroad in input)\n\nThe second line: A_i / B_i\n\nYou can travel from City 1 to City 2 in 2 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nYou can travel from City 1 to City 3 in 14 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 6 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nSample Input 2\n\n4 4 1\n1 2 1 5\n1 3 4 4\n2 4 2 2\n3 4 1 1\n3 1\n3 1\n5 2\n6 4\n\nSample Output 2\n\n5\n5\n7\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 4 in 7 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 2 gold coins for 6 silver coins in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nUse the 4-th railroad to move from City 3 to City 4 in 1 minutes.\n\nSample Input 3\n\n6 5 1\n1 2 1 1\n1 3 2 1\n2 4 5 1\n3 5 11 1\n1 6 50 1\n1 10000\n1 3000\n1 700\n1 100\n1 1\n100 1\n\nSample Output 3\n\n1\n9003\n14606\n16510\n16576\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 6 in 16576 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 9000 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nAt the exchange counter in City 3, exchange 8 gold coins for 8 silver coins in 5600 minutes.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nUse the 3-rd railroad to move from City 2 to City 4 in 1 minute.\n\nAt the exchange counter in City 4, exchange 19 gold coins for 19 silver coins in 1900 minutes.\n\nUse the 3-rd railroad to move from City 4 to City 2 in 1 minute.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nUse the 4-th railroad to move from City 3 to City 5 in 1 minute.\n\nAt the exchange counter in City 5, exchange 63 gold coins for 63 silver coins in 63 minutes.\n\nUse the 4-th railroad to move from City 5 to City 3 in 1 minute.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 5-th railroad to move from City 1 to City 6 in 1 minute.\n\nSample Input 4\n\n4 6 1000000000\n1 2 50 1\n1 3 50 5\n1 4 50 7\n2 3 50 2\n2 4 50 4\n3 4 50 3\n10 2\n4 4\n5 5\n7 7\n\nSample Output 4\n\n1\n3\n5\n\nThe railway network in this input is shown in the figure below:\n\nSample Input 5\n\n2 1 0\n1 2 1 1\n1 1000000000\n1 1\n\nSample Output 5\n\n1000000001\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 2 in 1000000001 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 1 gold coin for 1 silver coin in 1000000000 minutes.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.", "sample_input": "3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n"}, "reference_outputs": ["2\n14\n"], "source_document_id": "p02703", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N cities numbered 1 to N, connected by M railroads.\n\nYou are now at City 1, with 10^{100} gold coins and S silver coins in your pocket.\n\nThe i-th railroad connects City U_i and City V_i bidirectionally, and a one-way trip costs A_i silver coins and takes B_i minutes.\nYou cannot use gold coins to pay the fare.\n\nThere is an exchange counter in each city. At the exchange counter in City i, you can get C_i silver coins for 1 gold coin.\nThe transaction takes D_i minutes for each gold coin you give.\nYou can exchange any number of gold coins at each exchange counter.\n\nFor each t=2, ..., N, find the minimum time needed to travel from City 1 to City t. You can ignore the time spent waiting for trains.\n\nConstraints\n\n2 \\leq N \\leq 50\n\nN-1 \\leq M \\leq 100\n\n0 \\leq S \\leq 10^9\n\n1 \\leq A_i \\leq 50\n\n1 \\leq B_i,C_i,D_i \\leq 10^9\n\n1 \\leq U_i < V_i \\leq N\n\nThere is no pair i, j(i \\neq j) such that (U_i,V_i)=(U_j,V_j).\n\nEach city t=2,...,N can be reached from City 1 with some number of railroads.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M S\nU_1 V_1 A_1 B_1\n:\nU_M V_M A_M B_M\nC_1 D_1\n:\nC_N D_N\n\nOutput\n\nFor each t=2, ..., N in this order, print a line containing the minimum time needed to travel from City 1 to City t.\n\nSample Input 1\n\n3 2 1\n1 2 1 2\n1 3 2 4\n1 11\n1 2\n2 5\n\nSample Output 1\n\n2\n14\n\nThe railway network in this input is shown in the figure below.\n\nIn this figure, each city is labeled as follows:\n\nThe first line: the ID number i of the city (i for City i)\n\nThe second line: C_i / D_i\n\nSimilarly, each railroad is labeled as follows:\n\nThe first line: the ID number i of the railroad (i for the i-th railroad in input)\n\nThe second line: A_i / B_i\n\nYou can travel from City 1 to City 2 in 2 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nYou can travel from City 1 to City 3 in 14 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 2 minutes.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 6 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nSample Input 2\n\n4 4 1\n1 2 1 5\n1 3 4 4\n2 4 2 2\n3 4 1 1\n3 1\n3 1\n5 2\n6 4\n\nSample Output 2\n\n5\n5\n7\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 4 in 7 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 2 gold coins for 6 silver coins in 2 minutes.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 4 minutes.\n\nUse the 4-th railroad to move from City 3 to City 4 in 1 minutes.\n\nSample Input 3\n\n6 5 1\n1 2 1 1\n1 3 2 1\n2 4 5 1\n3 5 11 1\n1 6 50 1\n1 10000\n1 3000\n1 700\n1 100\n1 1\n100 1\n\nSample Output 3\n\n1\n9003\n14606\n16510\n16576\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 6 in 16576 minutes, as follows:\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nAt the exchange counter in City 2, exchange 3 gold coins for 3 silver coins in 9000 minutes.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nAt the exchange counter in City 3, exchange 8 gold coins for 8 silver coins in 5600 minutes.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.\n\nUse the 3-rd railroad to move from City 2 to City 4 in 1 minute.\n\nAt the exchange counter in City 4, exchange 19 gold coins for 19 silver coins in 1900 minutes.\n\nUse the 3-rd railroad to move from City 4 to City 2 in 1 minute.\n\nUse the 1-st railroad to move from City 2 to City 1 in 1 minute.\n\nUse the 2-nd railroad to move from City 1 to City 3 in 1 minute.\n\nUse the 4-th railroad to move from City 3 to City 5 in 1 minute.\n\nAt the exchange counter in City 5, exchange 63 gold coins for 63 silver coins in 63 minutes.\n\nUse the 4-th railroad to move from City 5 to City 3 in 1 minute.\n\nUse the 2-nd railroad to move from City 3 to City 1 in 1 minute.\n\nUse the 5-th railroad to move from City 1 to City 6 in 1 minute.\n\nSample Input 4\n\n4 6 1000000000\n1 2 50 1\n1 3 50 5\n1 4 50 7\n2 3 50 2\n2 4 50 4\n3 4 50 3\n10 2\n4 4\n5 5\n7 7\n\nSample Output 4\n\n1\n3\n5\n\nThe railway network in this input is shown in the figure below:\n\nSample Input 5\n\n2 1 0\n1 2 1 1\n1 1000000000\n1 1\n\nSample Output 5\n\n1000000001\n\nThe railway network in this input is shown in the figure below:\n\nYou can travel from City 1 to City 2 in 1000000001 minutes, as follows:\n\nAt the exchange counter in City 1, exchange 1 gold coin for 1 silver coin in 1000000000 minutes.\n\nUse the 1-st railroad to move from City 1 to City 2 in 1 minute.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1671, "cpu_time_ms": 2215, "memory_kb": 362912}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s797249303", "group_id": "codeNet:p02705", "input_text": "\nfun main(args: Array) {\n /*readLine()で一行分の入力をString型として受け取り（\"!!\"でnull非許容に）\n split()で空白区切りにパースし\n map{}でInt型に変換して各変数に代入する\n */\n val (a) = readLine()!!.split(\" \").map{ it.toInt() }\n \n print(a * 2 * 3.141592)\n}\n", "language": "Kotlin", "metadata": {"date": 1596052865, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s797249303.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s797249303", "user_id": "u512605257"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "\nfun main(args: Array) {\n /*readLine()で一行分の入力をString型として受け取り（\"!!\"でnull非許容に）\n split()で空白区切りにパースし\n map{}でInt型に変換して各変数に代入する\n */\n val (a) = readLine()!!.split(\" \").map{ it.toInt() }\n \n print(a * 2 * 3.141592)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 334, "cpu_time_ms": 136, "memory_kb": 36588}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s899672963", "group_id": "codeNet:p02705", "input_text": "import kotlin.math.PI\n\nfun main() {\n val r = readInt()\n println(2 * PI * r)\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\nfun Array>.print() {\n this.forEach {\n println(it.joinToString(\" \"))\n }\n}", "language": "Kotlin", "metadata": {"date": 1590949599, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s899672963.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s899672963", "user_id": "u697467902"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "import kotlin.math.PI\n\nfun main() {\n val r = readInt()\n println(2 * PI * r)\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\nfun Array>.print() {\n this.forEach {\n println(it.joinToString(\" \"))\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 419, "cpu_time_ms": 93, "memory_kb": 34656}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s683517556", "group_id": "codeNet:p02705", "input_text": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n\nimport java.io.PrintWriter\nimport java.util.PriorityQueue\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\nfun PrintWriter.solve() {\n val r = readInt()\n val ans = 2 * PI * r\n println(ans)\n}\n\n/** IO code start */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\n@JvmField val _reader = INPUT.bufferedReader()\nfun readLine(): String? = _reader.readLine()\nfun readLn() = _reader.readLine()!!\n@JvmField var _ln = \"\"\n@JvmField var _lnPtr = 0\nfun read(): String {\n while (_lnPtr >= _ln.length) {\n _ln = readLine() ?: return \"\"\n _lnPtr = 0\n }\n var j = _ln.indexOf(' ', _lnPtr)\n if(j < 0) j = _ln.length\n val res = _ln.substring(_lnPtr, j)\n _lnPtr = j + 1\n return res\n}\nfun readRem(): String /* reads remainder of current line */ =\n _ln.substring(min(_lnPtr, _ln.length)).also { _lnPtr = _ln.length }\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() {\n iprintln(max(1, 2))\n}", "language": "Kotlin", "metadata": {"date": 1587392461, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s683517556.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s683517556", "user_id": "u596111103"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n\nimport java.io.PrintWriter\nimport java.util.PriorityQueue\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\nfun PrintWriter.solve() {\n val r = readInt()\n val ans = 2 * PI * r\n println(ans)\n}\n\n/** IO code start */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\n@JvmField val _reader = INPUT.bufferedReader()\nfun readLine(): String? = _reader.readLine()\nfun readLn() = _reader.readLine()!!\n@JvmField var _ln = \"\"\n@JvmField var _lnPtr = 0\nfun read(): String {\n while (_lnPtr >= _ln.length) {\n _ln = readLine() ?: return \"\"\n _lnPtr = 0\n }\n var j = _ln.indexOf(' ', _lnPtr)\n if(j < 0) j = _ln.length\n val res = _ln.substring(_lnPtr, j)\n _lnPtr = j + 1\n return res\n}\nfun readRem(): String /* reads remainder of current line */ =\n _ln.substring(min(_lnPtr, _ln.length)).also { _lnPtr = _ln.length }\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() {\n iprintln(max(1, 2))\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3470, "cpu_time_ms": 86, "memory_kb": 36052}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s784400677", "group_id": "codeNet:p02705", "input_text": "fun main(args: Array) = abc163a()\n\nfun abc163a() {\n val r = readLine()!!.toDouble()\n\n val answer = Math.PI * r * 2\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1587348516, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s784400677.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s784400677", "user_id": "u139478771"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "fun main(args: Array) = abc163a()\n\nfun abc163a() {\n val r = readLine()!!.toDouble()\n\n val answer = Math.PI * r * 2\n\n println(answer)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 84, "memory_kb": 34688}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s790474257", "group_id": "codeNet:p02705", "input_text": "fun main(args: Array) {\n readLine()?.toInt()?.let {\n println(it * 2 * Math.PI)\n }\n}", "language": "Kotlin", "metadata": {"date": 1587345512, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s790474257.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s790474257", "user_id": "u228849856"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "fun main(args: Array) {\n readLine()?.toInt()?.let {\n println(it * 2 * Math.PI)\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 104, "cpu_time_ms": 82, "memory_kb": 34664}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s148634857", "group_id": "codeNet:p02705", "input_text": "fun main(args: Array) = ABC163A.main()\n\nobject ABC163A {\n fun main() {\n val R = readLine()!!.toDouble()\n println(2 * R * 3.1415)\n }\n}", "language": "Kotlin", "metadata": {"date": 1587345475, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s148634857.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s148634857", "user_id": "u981616728"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "fun main(args: Array) = ABC163A.main()\n\nobject ABC163A {\n fun main() {\n val R = readLine()!!.toDouble()\n println(2 * R * 3.1415)\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 161, "cpu_time_ms": 85, "memory_kb": 34692}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s621491374", "group_id": "codeNet:p02705", "input_text": "fun main(args: Array) {\n val r = readLine()!!.toDouble()\n val pi = kotlin.math.PI\n val round = 2.0 * r * pi\n println(round.toString())\n}", "language": "Kotlin", "metadata": {"date": 1587345343, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s621491374.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s621491374", "user_id": "u010962920"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "fun main(args: Array) {\n val r = readLine()!!.toDouble()\n val pi = kotlin.math.PI\n val round = 2.0 * r * pi\n println(round.toString())\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 156, "cpu_time_ms": 85, "memory_kb": 34756}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s466099896", "group_id": "codeNet:p02705", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val r = sc.nextInt()\n\n println(abc163a(r))\n}\n\nprivate fun abc163a(r: Int): Double {\n return 2 * r * Math.PI\n}\n", "language": "Kotlin", "metadata": {"date": 1587345196, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s466099896.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s466099896", "user_id": "u323522006"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val r = sc.nextInt()\n\n println(abc163a(r))\n}\n\nprivate fun abc163a(r: Int): Double {\n return 2 * r * Math.PI\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 198, "cpu_time_ms": 121, "memory_kb": 36484}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s162917113", "group_id": "codeNet:p02705", "input_text": "import java.lang.Math\nfun main(args: Array) {\n val r = readLine()!!.toInt()\n var result = 2 * Math.PI * r\n println(\"%.3f\".format(result))\n}", "language": "Kotlin", "metadata": {"date": 1587345144, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s162917113.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s162917113", "user_id": "u430710262"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "import java.lang.Math\nfun main(args: Array) {\n val r = readLine()!!.toInt()\n var result = 2 * Math.PI * r\n println(\"%.3f\".format(result))\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 156, "cpu_time_ms": 101, "memory_kb": 35736}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s920313867", "group_id": "codeNet:p02705", "input_text": "fun main(args: Array) {\n // Your code here!\n var r = readLine()!!.toDouble()\n println(2.0 * r * 3.14)\n}\n", "language": "Kotlin", "metadata": {"date": 1587345133, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s920313867.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s920313867", "user_id": "u808976884"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "fun main(args: Array) {\n // Your code here!\n var r = readLine()!!.toDouble()\n println(2.0 * r * 3.14)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 121, "cpu_time_ms": 90, "memory_kb": 34616}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s414106846", "group_id": "codeNet:p02705", "input_text": "fun main(args: Array) = abc163a()\n\nfun abc163a() {\n val r = readLine()!!.toDouble()\n\n val answer = Math.PI * r * 2\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1587345026, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s414106846.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s414106846", "user_id": "u139478771"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "fun main(args: Array) = abc163a()\n\nfun abc163a() {\n val r = readLine()!!.toDouble()\n\n val answer = Math.PI * r * 2\n\n println(answer)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 86, "memory_kb": 34776}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s338261724", "group_id": "codeNet:p02705", "input_text": "fun main(args: Array) {\n val num = readLine()!!;\n if (num.any { it == '7' }) {\n println(\"Yes\");\n } else {\n println(\"No\");\n }\n}", "language": "Kotlin", "metadata": {"date": 1587344963, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s338261724.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s338261724", "user_id": "u693548378"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "fun main(args: Array) {\n val num = readLine()!!;\n if (num.any { it == '7' }) {\n println(\"Yes\");\n } else {\n println(\"No\");\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 160, "cpu_time_ms": 89, "memory_kb": 34368}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s321098255", "group_id": "codeNet:p02705", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toDouble()\n println(n * 2 * Math.PI)\n}\n", "language": "Kotlin", "metadata": {"date": 1587344840, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s321098255.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s321098255", "user_id": "u099066216"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toDouble()\n println(n * 2 * Math.PI)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 99, "cpu_time_ms": 85, "memory_kb": 34712}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s110713019", "group_id": "codeNet:p02705", "input_text": "fun main(args: Array) = abc163a()\n\nfun abc163a() {\n val r = readLine()!!.toDouble()\n\n val answer = Math.PI * r * 2\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1587344828, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s110713019.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s110713019", "user_id": "u139478771"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "fun main(args: Array) = abc163a()\n\nfun abc163a() {\n val r = readLine()!!.toDouble()\n\n val answer = Math.PI * r * 2\n\n println(answer)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 90, "memory_kb": 34696}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s688635839", "group_id": "codeNet:p02705", "input_text": "fun main(args: Array) {\n val r = readLine()!!.toDouble()\n val pi = 3.1415926535\n println(2*pi*r)\n}", "language": "Kotlin", "metadata": {"date": 1587344787, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s688635839.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s688635839", "user_id": "u213256030"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "fun main(args: Array) {\n val r = readLine()!!.toDouble()\n val pi = 3.1415926535\n println(2*pi*r)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 114, "memory_kb": 34652}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s340538457", "group_id": "codeNet:p02705", "input_text": "import java.util.*\n\nfun main(args: Array){\n\tval cin = Scanner(System.`in`)\n val r = cin.nextInt()\n val p = Math.PI\n \n println(r*p*2.0)\n}", "language": "Kotlin", "metadata": {"date": 1587344729, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s340538457.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s340538457", "user_id": "u111421568"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array){\n\tval cin = Scanner(System.`in`)\n val r = cin.nextInt()\n val p = Math.PI\n \n println(r*p*2.0)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 156, "cpu_time_ms": 139, "memory_kb": 36564}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s847903332", "group_id": "codeNet:p02705", "input_text": "fun main() {\n val r = readLine()!!.toInt()\n val result = r.toDouble() * 2.0 * Math.PI\n println(String.format(\"%.3f\", result))\n}", "language": "Kotlin", "metadata": {"date": 1587344583, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s847903332.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s847903332", "user_id": "u897579945"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "fun main() {\n val r = readLine()!!.toInt()\n val result = r.toDouble() * 2.0 * Math.PI\n println(String.format(\"%.3f\", result))\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 136, "cpu_time_ms": 105, "memory_kb": 35716}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s439424403", "group_id": "codeNet:p02705", "input_text": "import kotlin.math.PI\n\nfun main() {\n println(solve())\n}\n\nval solve: () -> Any = {\n readInt()*2* PI\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()", "language": "Kotlin", "metadata": {"date": 1587344572, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02705.html", "problem_id": "p02705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02705/input.txt", "sample_output_relpath": "derived/input_output/data/p02705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02705/Kotlin/s439424403.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s439424403", "user_id": "u043557308"}, "prompt_components": {"gold_output": "6.28318530717958623200\n", "input_to_evaluate": "import kotlin.math.PI\n\nfun main() {\n println(solve())\n}\n\nval solve: () -> Any = {\n readInt()*2* PI\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "sample_input": "1\n"}, "reference_outputs": ["6.28318530717958623200\n"], "source_document_id": "p02705", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the circumference of a circle of radius R.\n\nConstraints\n\n1 \\leq R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the circumference of the circle.\nYour output is considered correct if and only if its absolute or relative error from our answer is at most 10^{-2}.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n6.28318530717958623200\n\nSince we accept an absolute or relative error of at most 10^{-2}, 6.28 is also an acceptable output, but 6 is not.\n\nSample Input 2\n\n73\n\nSample Output 2\n\n458.67252742410977361942", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 176, "cpu_time_ms": 93, "memory_kb": 34572}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s811839205", "group_id": "codeNet:p02711", "input_text": "fun main() {\n val n = readString()\n if (n.contains('7')) println(\"Yes\")\n else println(\"No\")\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\nfun Array>.print() {\n this.forEach {\n println(it.joinToString(\" \"))\n }\n}", "language": "Kotlin", "metadata": {"date": 1590960429, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s811839205.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s811839205", "user_id": "u697467902"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main() {\n val n = readString()\n if (n.contains('7')) println(\"Yes\")\n else println(\"No\")\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\nfun Array>.print() {\n this.forEach {\n println(it.joinToString(\" \"))\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 438, "cpu_time_ms": 93, "memory_kb": 35692}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s459400486", "group_id": "codeNet:p02711", "input_text": "fun main(args:Array){\n val a=readLine()!!\n for (i in 0..a.length-1){\n if (a[i].toString() == \"7\"){\n println(\"Yes\")\n return\n }\n }\n println(\"No\")\n}", "language": "Kotlin", "metadata": {"date": 1588387648, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s459400486.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s459400486", "user_id": "u387080888"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args:Array){\n val a=readLine()!!\n for (i in 0..a.length-1){\n if (a[i].toString() == \"7\"){\n println(\"Yes\")\n return\n }\n }\n println(\"No\")\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 201, "cpu_time_ms": 83, "memory_kb": 34384}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s404483971", "group_id": "codeNet:p02711", "input_text": "fun main(args: Array) {\n val N = readLine()!!\n if(N.indexOf(\"7\") != -1) {\n \"Yes\"\n } else {\n \"No\"\n }.run(::println)\n}", "language": "Kotlin", "metadata": {"date": 1588215971, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s404483971.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s404483971", "user_id": "u181807786"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!\n if(N.indexOf(\"7\") != -1) {\n \"Yes\"\n } else {\n \"No\"\n }.run(::println)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 150, "cpu_time_ms": 91, "memory_kb": 35648}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s006061920", "group_id": "codeNet:p02711", "input_text": "fun main() {\n val N = readLine()!!\n println(if (N.contains(\"7\")) \"Yes\" else \"No\")\n}", "language": "Kotlin", "metadata": {"date": 1588181251, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s006061920.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s006061920", "user_id": "u159619403"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main() {\n val N = readLine()!!\n println(if (N.contains(\"7\")) \"Yes\" else \"No\")\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 89, "cpu_time_ms": 95, "memory_kb": 35752}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s037965569", "group_id": "codeNet:p02711", "input_text": "package abc162\n\n/** A - Lucky 7 */\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n\n // 3桁整数の入力\n val inputInt = sc.nextInt()\n val inputList = inputInt.toString().split(\"\")\n\n var flg = false\n inputList.forEach {\n if (it == \"7\") {\n flg = true\n return@forEach\n }\n }\n\n if (flg) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1587680120, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s037965569.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s037965569", "user_id": "u270138198"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "package abc162\n\n/** A - Lucky 7 */\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n\n // 3桁整数の入力\n val inputInt = sc.nextInt()\n val inputList = inputInt.toString().split(\"\")\n\n var flg = false\n inputList.forEach {\n if (it == \"7\") {\n flg = true\n return@forEach\n }\n }\n\n if (flg) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 448, "cpu_time_ms": 90, "memory_kb": 35236}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s525651653", "group_id": "codeNet:p02711", "input_text": "import java.io.PrintWriter\n\nfun main() {\n PrintWriter(System.out).use { out ->\n solve(out)\n out.flush()\n }\n}\n\nfun solve(out: PrintWriter) {\n val n = readLine()!!\n val ans = if (n.contains(\"7\")) {\n \"Yes\"\n } else {\n \"No\"\n }\n println(ans)\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\nfun readDoubleList() = readStringList().map(String::toDouble)\n", "language": "Kotlin", "metadata": {"date": 1587218848, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s525651653.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s525651653", "user_id": "u784448849"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun main() {\n PrintWriter(System.out).use { out ->\n solve(out)\n out.flush()\n }\n}\n\nfun solve(out: PrintWriter) {\n val n = readLine()!!\n val ans = if (n.contains(\"7\")) {\n \"Yes\"\n } else {\n \"No\"\n }\n println(ans)\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\nfun readDoubleList() = readStringList().map(String::toDouble)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 595, "cpu_time_ms": 92, "memory_kb": 35768}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s633245276", "group_id": "codeNet:p02711", "input_text": "fun main(args: Array){\n val num: String? = readLine()\n for(c in num!!){\n if(c == '7'){\n println(\"Yes\")\n }else{\n println(\"No\")\n }\n }\n}", "language": "Kotlin", "metadata": {"date": 1587065952, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s633245276.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s633245276", "user_id": "u376497013"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array){\n val num: String? = readLine()\n for(c in num!!){\n if(c == '7'){\n println(\"Yes\")\n }else{\n println(\"No\")\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 193, "cpu_time_ms": 81, "memory_kb": 34592}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s291882751", "group_id": "codeNet:p02711", "input_text": "fun main(args: Array) {\n val input1 = readLine()!!\n var result = \"No\"\n for (i in input1.indices) {\n val num = input1[i]\n if (num == '7') {\n result = \"Yes\"\n break\n }\n }\n println(result)\n\n}\n", "language": "Kotlin", "metadata": {"date": 1586743250, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s291882751.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s291882751", "user_id": "u388084726"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val input1 = readLine()!!\n var result = \"No\"\n for (i in input1.indices) {\n val num = input1[i]\n if (num == '7') {\n result = \"Yes\"\n break\n }\n }\n println(result)\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 220, "cpu_time_ms": 82, "memory_kb": 34440}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s755757974", "group_id": "codeNet:p02711", "input_text": "fun main(args: Array) {\n val argString = readLine()!!\n if (Regex(\"7\").containsMatchIn(argString)) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1586742153, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s755757974.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s755757974", "user_id": "u932970230"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val argString = readLine()!!\n if (Regex(\"7\").containsMatchIn(argString)) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 87, "memory_kb": 35216}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s674112132", "group_id": "codeNet:p02711", "input_text": "fun main(args: Array) {\n val n = readLine()!!\n\n if (n.contains('7')) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1586741679, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s674112132.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s674112132", "user_id": "u099066216"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!\n\n if (n.contains('7')) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 150, "cpu_time_ms": 90, "memory_kb": 35728}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s795336473", "group_id": "codeNet:p02711", "input_text": "fun main(args: Array) {\n val argString = readLine()!!\n if (Regex(\"7\").containsMatchIn(argString)) {\n println(\"yes\")\n } else {\n println(\"no\")\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1586741400, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s795336473.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s795336473", "user_id": "u932970230"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val argString = readLine()!!\n if (Regex(\"7\").containsMatchIn(argString)) {\n println(\"yes\")\n } else {\n println(\"no\")\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 93, "memory_kb": 35180}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s008051204", "group_id": "codeNet:p02711", "input_text": "import java.io.PrintWriter\n\nfun main() {\n PrintWriter(System.out).use { out ->\n solve(out)\n out.flush()\n }\n}\n\nfun solve(out: PrintWriter) {\n val n = readLine()!!\n if (n.contains(\"7\")) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\nfun readDoubleList() = readStringList().map(String::toDouble)\n", "language": "Kotlin", "metadata": {"date": 1586739997, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s008051204.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s008051204", "user_id": "u784448849"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun main() {\n PrintWriter(System.out).use { out ->\n solve(out)\n out.flush()\n }\n}\n\nfun solve(out: PrintWriter) {\n val n = readLine()!!\n if (n.contains(\"7\")) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\nfun readDoubleList() = readStringList().map(String::toDouble)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 586, "cpu_time_ms": 97, "memory_kb": 35736}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s442529495", "group_id": "codeNet:p02711", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.next()\n\n println(abc162a(n))\n}\n\nprivate fun abc162a(n: String): String {\n if (n.indexOf('7') != -1) {\n return \"Yes\"\n }\n\n return \"No\"\n}\n", "language": "Kotlin", "metadata": {"date": 1586739857, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s442529495.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s442529495", "user_id": "u323522006"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.next()\n\n println(abc162a(n))\n}\n\nprivate fun abc162a(n: String): String {\n if (n.indexOf('7') != -1) {\n return \"Yes\"\n }\n\n return \"No\"\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 239, "cpu_time_ms": 147, "memory_kb": 37500}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s746149986", "group_id": "codeNet:p02711", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n println(problem162a(n))\n}\n\nfun problem162a(n: Int): String {\n return if (n.toString().toCharArray().contains('7')) \"Yes\" else \"No\"\n}", "language": "Kotlin", "metadata": {"date": 1586739835, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s746149986.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s746149986", "user_id": "u073232808"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n println(problem162a(n))\n}\n\nfun problem162a(n: Int): String {\n return if (n.toString().toCharArray().contains('7')) \"Yes\" else \"No\"\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 250, "cpu_time_ms": 154, "memory_kb": 40336}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s848999023", "group_id": "codeNet:p02711", "input_text": "fun main() {\n val n = readLine()!!.toCharArray()\n if (n.contains('7')) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1586739746, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s848999023.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848999023", "user_id": "u897579945"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main() {\n val n = readLine()!!.toCharArray()\n if (n.contains('7')) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 144, "cpu_time_ms": 98, "memory_kb": 38348}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s971328111", "group_id": "codeNet:p02711", "input_text": "fun main() {\n val n = readLine() ?: return\n n.find { it == '7' }?.let {\n println(\"Yes\")\n } ?: run {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1586739732, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02711.html", "problem_id": "p02711", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02711/input.txt", "sample_output_relpath": "derived/input_output/data/p02711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02711/Kotlin/s971328111.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s971328111", "user_id": "u979429407"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main() {\n val n = readLine() ?: return\n n.find { it == '7' }?.let {\n println(\"Yes\")\n } ?: run {\n println(\"No\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "sample_input": "117\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02711", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a three-digit integer N. Does N contain the digit 7?\n\nIf so, print Yes; otherwise, print No.\n\nConstraints\n\n100 \\leq N \\leq 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N contains the digit 7, print Yes; otherwise, print No.\n\nSample Input 1\n\n117\n\nSample Output 1\n\nYes\n\n117 contains 7 as its last digit.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\n123 does not contain the digit 7.\n\nSample Input 3\n\n777\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 145, "cpu_time_ms": 79, "memory_kb": 34628}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s899366655", "group_id": "codeNet:p02713", "input_text": "import java.util.*\nimport kotlin.math.max\nimport kotlin.math.min\n\nfun main() {\n val k = readInt()\n\n var ans = 0L\n for (a in 1..k) {\n for (b in 1..k) {\n for (c in 1..k) {\n ans += gcd(listOf(a, b, c))\n }\n }\n }\n println(ans)\n}\n\nfun gcd(list: List): Int {\n val stack = Stack()\n list.forEach { stack.push(it) }\n\n while (stack.size > 1) {\n val (a, b) = (0..1).map { stack.pop() }\n val push = stack.push(min(a, b))\n val r = max(a, b) % min(a, b)\n if (r > 0) stack.push(r)\n }\n return stack.pop()\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\nfun Array>.print() {\n this.forEach {\n println(it.joinToString(\" \"))\n }\n}", "language": "Kotlin", "metadata": {"date": 1590961584, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s899366655.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s899366655", "user_id": "u697467902"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*\nimport kotlin.math.max\nimport kotlin.math.min\n\nfun main() {\n val k = readInt()\n\n var ans = 0L\n for (a in 1..k) {\n for (b in 1..k) {\n for (c in 1..k) {\n ans += gcd(listOf(a, b, c))\n }\n }\n }\n println(ans)\n}\n\nfun gcd(list: List): Int {\n val stack = Stack()\n list.forEach { stack.push(it) }\n\n while (stack.size > 1) {\n val (a, b) = (0..1).map { stack.pop() }\n val push = stack.push(min(a, b))\n val r = max(a, b) % min(a, b)\n if (r > 0) stack.push(r)\n }\n return stack.pop()\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\nfun Array>.print() {\n this.forEach {\n println(it.joinToString(\" \"))\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 944, "cpu_time_ms": 2207, "memory_kb": 57632}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s501796329", "group_id": "codeNet:p02713", "input_text": "fun main() = ABC162C.main()\n\nobject ABC162C {\n fun log(message: Any?) {\n //println(message)// TODO: ←消す\n }\n\n fun main() {\n val K = readInt()\n var ans = 0\n (1..K).forEach { a ->\n (1..K).forEach { b ->\n (1..K).forEach { c ->\n ans += Gcd.get(a, Gcd.get(b, c))\n }\n }\n }\n\n println(ans)\n log(\"calcCount=${Gcd.calcCount}\")\n }\n\n\n /*####################################################################################*/\n object Gcd {\n var calcCount = 0\n private set\n private val cache = mutableMapOf, Int>()\n\n fun get(a: Int, b: Int): Int {\n val (m, n) = if (a > b) listOf(a, b) else listOf(b, a)\n val cached = cache[m to n]\n return if (cached == null) {\n val gcd = calc(m, n)\n cache[m to n] = gcd\n gcd\n } else cached\n }\n\n private fun calc(m: Int, n: Int): Int { // m > n\n assert(m > n)\n var m = m\n var n = n\n while (n != 0) {\n val r = m % n\n m = n\n n = r\n }\n calcCount++\n return m\n }\n }\n\n fun readInt() = readLine()!!.toInt()\n fun readInts() = readLine()!!.split(\" \").map { it.toInt() }\n}", "language": "Kotlin", "metadata": {"date": 1587428418, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s501796329.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s501796329", "user_id": "u981616728"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main() = ABC162C.main()\n\nobject ABC162C {\n fun log(message: Any?) {\n //println(message)// TODO: ←消す\n }\n\n fun main() {\n val K = readInt()\n var ans = 0\n (1..K).forEach { a ->\n (1..K).forEach { b ->\n (1..K).forEach { c ->\n ans += Gcd.get(a, Gcd.get(b, c))\n }\n }\n }\n\n println(ans)\n log(\"calcCount=${Gcd.calcCount}\")\n }\n\n\n /*####################################################################################*/\n object Gcd {\n var calcCount = 0\n private set\n private val cache = mutableMapOf, Int>()\n\n fun get(a: Int, b: Int): Int {\n val (m, n) = if (a > b) listOf(a, b) else listOf(b, a)\n val cached = cache[m to n]\n return if (cached == null) {\n val gcd = calc(m, n)\n cache[m to n] = gcd\n gcd\n } else cached\n }\n\n private fun calc(m: Int, n: Int): Int { // m > n\n assert(m > n)\n var m = m\n var n = n\n while (n != 0) {\n val r = m % n\n m = n\n n = r\n }\n calcCount++\n return m\n }\n }\n\n fun readInt() = readLine()!!.toInt()\n fun readInts() = readLine()!!.split(\" \").map { it.toInt() }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1412, "cpu_time_ms": 977, "memory_kb": 63052}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s038385324", "group_id": "codeNet:p02713", "input_text": "fun main() = ABC162C.main()\n\nobject ABC162C {\n fun log(message: Any?) {\n //println(message)// TODO: ←消す\n }\n\n var gcdCount = 0\n fun main() {\n val K = readInt()\n /*\n val gcdTable = LazyMap, Int> {\n val list = it.toList()\n if (this.containsKey(it)) get(it)\n else {\n when (it.size) {\n 1 -> list.first()\n 2 -> gcd(list[0], list[1])\n else -> get(setOf(list[0], get(setOf(list[1], list[2]))))\n }\n }\n }\n\n val combinations =\n ((1..K).combination(3).map { it.toSet() } + (1..K).combination(2).map { it.toSet() } + (1..K).combination(1)\n .map { it.toSet() })\n //log(combinations.joinToString(\"\\n\"))\n val ans = when (K) {\n else -> combinations.map {\n when (it.size) {\n 1 -> {\n //log(\"$it: +${gcdTable[it]}\")\n gcdTable[it]\n }\n 2 -> {\n //log(\"$it: +${gcdTable[it]}*6\")\n gcdTable[it] * 6\n }\n else -> {\n //log(\"$it: +${gcdTable[it]}*6\")\n gcdTable[it] * 6\n }\n }\n }.sum()\n }\n */\n var ans = 0\n (1..K).forEach { a->\n (1..K).forEach { b->\n (1..K).forEach { c->\n ans += gcd(a,gcd(b,c))\n }\n }\n }\n\n println(ans)\n log(\"gcdCount=$gcdCount\")\n }\n\n\n /*####################################################################################*/\n fun gcd(a: Int, b: Int): Int {\n var (m, n) = if (a > b) listOf(a, b) else listOf(b, a)\n while (n != 0) {\n val r = m % n\n m = n\n n = r\n }\n gcdCount++\n return m\n }\n\n class LazyMap(private val init: LazyMap.(K) -> V) : Map {\n private val memo = HashMap()\n override fun get(key: K): V {\n return memo[key] ?: init(key).memorizingAt(key)\n }\n\n\n private fun V.memorizingAt(key: K): V {\n memo[key] = this\n return this\n }\n\n override val entries: Set>\n get() = memo.entries\n override val keys: Set\n get() = memo.keys\n override val size: Int\n get() = memo.size\n override val values: Collection\n get() = memo.values\n\n override fun containsKey(key: K): Boolean = memo.containsKey(key)\n override fun containsValue(value: V): Boolean = memo.containsValue(value)\n override fun isEmpty(): Boolean = memo.isEmpty()\n }\n\n fun readInt() = readLine()!!.toInt()\n fun readInts() = readLine()!!.split(\" \").map { it.toInt() }\n\n\n class Combination : BasicCombinator() {\n override fun List.chooseRemains(i: Int): List = this.drop(i + 1)\n }\n\n fun IntRange.combination(k: Int): Sequence> = this.toList().combination(k)\n fun List.combination(k: Int): Sequence> = Combination().generate(this, k)\n\n abstract class BasicCombinator {\n abstract fun List.chooseRemains(i: Int): List\n\n fun generate(items: List, k: Int): Sequence> {\n when {\n (k < 0) ->\n throw IllegalArgumentException()\n (k == 0) ->\n return emptySequence()\n (k == 1) ->\n return items.asSequence().map { listOf(it) }\n else ->\n return items.asSequence().mapIndexed { index, first ->\n val remains = items.chooseRemains(index)\n generate(remains, k - 1).map { first + it }\n }.flatten()\n }\n }\n\n private operator fun T.plus(other: List): List {\n val list = mutableListOf(this)\n list.addAll(other)\n return list\n }\n }\n}", "language": "Kotlin", "metadata": {"date": 1587426233, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s038385324.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s038385324", "user_id": "u981616728"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main() = ABC162C.main()\n\nobject ABC162C {\n fun log(message: Any?) {\n //println(message)// TODO: ←消す\n }\n\n var gcdCount = 0\n fun main() {\n val K = readInt()\n /*\n val gcdTable = LazyMap, Int> {\n val list = it.toList()\n if (this.containsKey(it)) get(it)\n else {\n when (it.size) {\n 1 -> list.first()\n 2 -> gcd(list[0], list[1])\n else -> get(setOf(list[0], get(setOf(list[1], list[2]))))\n }\n }\n }\n\n val combinations =\n ((1..K).combination(3).map { it.toSet() } + (1..K).combination(2).map { it.toSet() } + (1..K).combination(1)\n .map { it.toSet() })\n //log(combinations.joinToString(\"\\n\"))\n val ans = when (K) {\n else -> combinations.map {\n when (it.size) {\n 1 -> {\n //log(\"$it: +${gcdTable[it]}\")\n gcdTable[it]\n }\n 2 -> {\n //log(\"$it: +${gcdTable[it]}*6\")\n gcdTable[it] * 6\n }\n else -> {\n //log(\"$it: +${gcdTable[it]}*6\")\n gcdTable[it] * 6\n }\n }\n }.sum()\n }\n */\n var ans = 0\n (1..K).forEach { a->\n (1..K).forEach { b->\n (1..K).forEach { c->\n ans += gcd(a,gcd(b,c))\n }\n }\n }\n\n println(ans)\n log(\"gcdCount=$gcdCount\")\n }\n\n\n /*####################################################################################*/\n fun gcd(a: Int, b: Int): Int {\n var (m, n) = if (a > b) listOf(a, b) else listOf(b, a)\n while (n != 0) {\n val r = m % n\n m = n\n n = r\n }\n gcdCount++\n return m\n }\n\n class LazyMap(private val init: LazyMap.(K) -> V) : Map {\n private val memo = HashMap()\n override fun get(key: K): V {\n return memo[key] ?: init(key).memorizingAt(key)\n }\n\n\n private fun V.memorizingAt(key: K): V {\n memo[key] = this\n return this\n }\n\n override val entries: Set>\n get() = memo.entries\n override val keys: Set\n get() = memo.keys\n override val size: Int\n get() = memo.size\n override val values: Collection\n get() = memo.values\n\n override fun containsKey(key: K): Boolean = memo.containsKey(key)\n override fun containsValue(value: V): Boolean = memo.containsValue(value)\n override fun isEmpty(): Boolean = memo.isEmpty()\n }\n\n fun readInt() = readLine()!!.toInt()\n fun readInts() = readLine()!!.split(\" \").map { it.toInt() }\n\n\n class Combination : BasicCombinator() {\n override fun List.chooseRemains(i: Int): List = this.drop(i + 1)\n }\n\n fun IntRange.combination(k: Int): Sequence> = this.toList().combination(k)\n fun List.combination(k: Int): Sequence> = Combination().generate(this, k)\n\n abstract class BasicCombinator {\n abstract fun List.chooseRemains(i: Int): List\n\n fun generate(items: List, k: Int): Sequence> {\n when {\n (k < 0) ->\n throw IllegalArgumentException()\n (k == 0) ->\n return emptySequence()\n (k == 1) ->\n return items.asSequence().map { listOf(it) }\n else ->\n return items.asSequence().mapIndexed { index, first ->\n val remains = items.chooseRemains(index)\n generate(remains, k - 1).map { first + it }\n }.flatten()\n }\n }\n\n private operator fun T.plus(other: List): List {\n val list = mutableListOf(this)\n list.addAll(other)\n return list\n }\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4195, "cpu_time_ms": 716, "memory_kb": 55544}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s519873435", "group_id": "codeNet:p02713", "input_text": "fun main(args: Array){\n val k = readLine()\n val num = k!!.toInt()\n\n\n var sumGcd = 0\n for(a in 1..num){\n for(b in 1..num){\n for(c in 1..num){\n sumGcd = gcd(gcd(a, b), c)\n }\n }\n }\n println(sumGcd)\n}\n\nfun gcd(p: Int, q: Int) : Int{\n if(p % q == 0){\n return q\n }\n return gcd(q, p % q)\n}", "language": "Kotlin", "metadata": {"date": 1587068025, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s519873435.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s519873435", "user_id": "u376497013"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main(args: Array){\n val k = readLine()\n val num = k!!.toInt()\n\n\n var sumGcd = 0\n for(a in 1..num){\n for(b in 1..num){\n for(c in 1..num){\n sumGcd = gcd(gcd(a, b), c)\n }\n }\n }\n println(sumGcd)\n}\n\nfun gcd(p: Int, q: Int) : Int{\n if(p % q == 0){\n return q\n }\n return gcd(q, p % q)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 375, "cpu_time_ms": 409, "memory_kb": 34828}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s487853447", "group_id": "codeNet:p02713", "input_text": "fun main (args: Array) {\n val k = readLine()!!.toInt()\n\n var ans = 0\n for (a in 1..k) {\n for (b in 1..k) {\n val ab = gcd(a, b)\n for (c in 1..k) {\n ans += gcd(ab, c)\n }\n }\n }\n println(ans)\n}\n\ntailrec fun gcd(p: Int, q: Int): Int {\n if (p % q == 0) return q\n return gcd(q, p % q)\n}", "language": "Kotlin", "metadata": {"date": 1586796076, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s487853447.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s487853447", "user_id": "u664864246"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main (args: Array) {\n val k = readLine()!!.toInt()\n\n var ans = 0\n for (a in 1..k) {\n for (b in 1..k) {\n val ab = gcd(a, b)\n for (c in 1..k) {\n ans += gcd(ab, c)\n }\n }\n }\n println(ans)\n}\n\ntailrec fun gcd(p: Int, q: Int): Int {\n if (p % q == 0) return q\n return gcd(q, p % q)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 322, "cpu_time_ms": 180, "memory_kb": 34620}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s323928301", "group_id": "codeNet:p02713", "input_text": "fun main(arg: Array) {\n val K = nextLong()\n var ans = 0L\n for (a in 1 .. K)\n for (b in 1 .. K)\n for (c in 1 .. K)\n ans += gcd(a, gcd(b, c))\n return println(ans)\n}\nfun gcd(a: Long, b: Long): Long = if (a % b == 0L) b else gcd(b, a % b)\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\n\nfun next() = readLine()!!\nfun nextInt(offset: Int = 0) = Integer.parseInt(next()) + offset\nfun nextLong() = next().toLong()\n", "language": "Kotlin", "metadata": {"date": 1586751135, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s323928301.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s323928301", "user_id": "u408242391"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main(arg: Array) {\n val K = nextLong()\n var ans = 0L\n for (a in 1 .. K)\n for (b in 1 .. K)\n for (c in 1 .. K)\n ans += gcd(a, gcd(b, c))\n return println(ans)\n}\nfun gcd(a: Long, b: Long): Long = if (a % b == 0L) b else gcd(b, a % b)\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\n\nfun next() = readLine()!!\nfun nextInt(offset: Int = 0) = Integer.parseInt(next()) + offset\nfun nextLong() = next().toLong()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 445, "cpu_time_ms": 915, "memory_kb": 34532}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s444809971", "group_id": "codeNet:p02713", "input_text": "import kotlin.math.min\n\nfun main(args: Array) {\n val input = readLine()!!.toLong()\n\n var result = 0L\n for (a in 1..input) {\n for (b in 1..input) {\n for (c in 1..input) {\n result += gcb(a, b, c)\n }\n }\n }\n// val result = (1..input).toList().asSequence().map { a ->\n// (1..input).toList().asSequence().map { b ->\n// (1..input).toList().asSequence().map { c -> gcb(a, b, c) }.sum()\n// }.sum()\n// }.sum()\n println(result)\n}\n\nfun gcb(a: Long, b: Long, c: Long): Long {\n val minValue = min(min(a, b), c)\n val result = (2L..minValue).toList().asSequence()\n .find {\n (a % it == 0L)\n && (b % it == 0L)\n && (c % it == 0L)\n }\n\n return if (result == null) {\n 1L\n } else {\n result * gcb(a / result, b / result, c / result)\n }\n}", "language": "Kotlin", "metadata": {"date": 1586744693, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s444809971.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s444809971", "user_id": "u932970230"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import kotlin.math.min\n\nfun main(args: Array) {\n val input = readLine()!!.toLong()\n\n var result = 0L\n for (a in 1..input) {\n for (b in 1..input) {\n for (c in 1..input) {\n result += gcb(a, b, c)\n }\n }\n }\n// val result = (1..input).toList().asSequence().map { a ->\n// (1..input).toList().asSequence().map { b ->\n// (1..input).toList().asSequence().map { c -> gcb(a, b, c) }.sum()\n// }.sum()\n// }.sum()\n println(result)\n}\n\nfun gcb(a: Long, b: Long, c: Long): Long {\n val minValue = min(min(a, b), c)\n val result = (2L..minValue).toList().asSequence()\n .find {\n (a % it == 0L)\n && (b % it == 0L)\n && (c % it == 0L)\n }\n\n return if (result == null) {\n 1L\n } else {\n result * gcb(a / result, b / result, c / result)\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 910, "cpu_time_ms": 2207, "memory_kb": 59724}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s278440739", "group_id": "codeNet:p02713", "input_text": "fun main(args: Array) {\n val k = readLine()!!.toInt()\n\n val memo = hashMapOf, Int>()\n fun gcd(a: Int , b: Int): Int{\n val p = Pair(a,b)\n if (!memo.containsKey(p)){\n if (a == b){\n memo[p] = a\n } else if (a > b){\n memo[p] = gcd(b, a - b)\n } else {\n memo[p] = gcd(a, b - a)\n }\n }\n return memo[p]!!\n }\n\n var sum = 0\n for (a in 1..k){\n for (b in 1..k){\n for (c in 1..k){\n sum += gcd(a, gcd(b, c))\n }\n }\n }\n println(sum)\n}", "language": "Kotlin", "metadata": {"date": 1586743070, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s278440739.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s278440739", "user_id": "u856564668"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main(args: Array) {\n val k = readLine()!!.toInt()\n\n val memo = hashMapOf, Int>()\n fun gcd(a: Int , b: Int): Int{\n val p = Pair(a,b)\n if (!memo.containsKey(p)){\n if (a == b){\n memo[p] = a\n } else if (a > b){\n memo[p] = gcd(b, a - b)\n } else {\n memo[p] = gcd(a, b - a)\n }\n }\n return memo[p]!!\n }\n\n var sum = 0\n for (a in 1..k){\n for (b in 1..k){\n for (c in 1..k){\n sum += gcd(a, gcd(b, c))\n }\n }\n }\n println(sum)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 631, "cpu_time_ms": 1042, "memory_kb": 60876}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s561009396", "group_id": "codeNet:p02713", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val k = sc.nextLong()\n\n var ans = 0L\n for(a in 1..k) {\n for(b in 1..k) {\n for(c in 1..k){\n ans+= gcd(a, gcd(b,c))\n\n }\n }\n }\n\n println(ans)\n\n}\n\nfun gcd(a:Long, b:Long): Long{\n if(a < b) return gcd(b, a)\n if(b == 0L) return a\n return gcd(b, a % b)\n}", "language": "Kotlin", "metadata": {"date": 1586742723, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s561009396.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s561009396", "user_id": "u079781329"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val k = sc.nextLong()\n\n var ans = 0L\n for(a in 1..k) {\n for(b in 1..k) {\n for(c in 1..k){\n ans+= gcd(a, gcd(b,c))\n\n }\n }\n }\n\n println(ans)\n\n}\n\nfun gcd(a:Long, b:Long): Long{\n if(a < b) return gcd(b, a)\n if(b == 0L) return a\n return gcd(b, a % b)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 409, "cpu_time_ms": 712, "memory_kb": 36884}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s970622024", "group_id": "codeNet:p02713", "input_text": "import java.io.PrintWriter\nimport java.util.*\n\nval pw = PrintWriter(System.out)\nval sc = Scanner(System.`in`)\n\nfun main(args: Array) {\n val n = sc.nextInt()\n abc161c(n)\n}\n\nfun abc161c(n:Int) {\n var summ =0L\n for(i in 1..n){\n for(j in 1..n){\n for(k in 1..n){\n summ += gcd(gcd(i.toLong(),j.toLong()), k.toLong())\n }\n }\n }\n println(summ)\n}\n\nfun gcd(a : Long, b : Long) : Long {\n return if (a % b == 0L) b else gcd(b, a % b)\n}\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextListOfString() = next().split(\" \")\nfun nextListOfInt() = nextListOfString().map { it.toInt() }\nfun nextListOfLong() = nextListOfString().map { it.toLong() }\nfun nextListOfDouble() = nextListOfString().map { it.toDouble() }\n\n", "language": "Kotlin", "metadata": {"date": 1586741645, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s970622024.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s970622024", "user_id": "u240901574"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\n\nval pw = PrintWriter(System.out)\nval sc = Scanner(System.`in`)\n\nfun main(args: Array) {\n val n = sc.nextInt()\n abc161c(n)\n}\n\nfun abc161c(n:Int) {\n var summ =0L\n for(i in 1..n){\n for(j in 1..n){\n for(k in 1..n){\n summ += gcd(gcd(i.toLong(),j.toLong()), k.toLong())\n }\n }\n }\n println(summ)\n}\n\nfun gcd(a : Long, b : Long) : Long {\n return if (a % b == 0L) b else gcd(b, a % b)\n}\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextListOfString() = next().split(\" \")\nfun nextListOfInt() = nextListOfString().map { it.toInt() }\nfun nextListOfLong() = nextListOfString().map { it.toLong() }\nfun nextListOfDouble() = nextListOfString().map { it.toDouble() }\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 863, "cpu_time_ms": 1070, "memory_kb": 36996}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s583655327", "group_id": "codeNet:p02713", "input_text": "import kotlin.math.min\n\nfun main(args:Array){\n val k = readLine()!!.toInt()\n var result = 0\n for(a in 1..k){\n for(b in 1..k){\n for(c in 1..k){\n val m = min(a,min(b,c))\n var sum = 0\n var start = 1\n if(a%2==0&&b%2==0&&c%2==0){\n start *= 2\n }\n if(a%3==0&&b%3==0&&c%3==0){\n start *= 3\n }\n if(a%5==0&&b%5==0&&c%5==0){\n start *= 5\n }\n if(a%7==0&&b%7==0&&c%7==0){\n start *= 7\n }\n for(i in start..m step start){\n if(a%i==0&&b%i==0&&c%i==0){\n sum =i\n }\n }\n result += sum\n }\n }\n }\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1586741478, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s583655327.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s583655327", "user_id": "u943726499"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import kotlin.math.min\n\nfun main(args:Array){\n val k = readLine()!!.toInt()\n var result = 0\n for(a in 1..k){\n for(b in 1..k){\n for(c in 1..k){\n val m = min(a,min(b,c))\n var sum = 0\n var start = 1\n if(a%2==0&&b%2==0&&c%2==0){\n start *= 2\n }\n if(a%3==0&&b%3==0&&c%3==0){\n start *= 3\n }\n if(a%5==0&&b%5==0&&c%5==0){\n start *= 5\n }\n if(a%7==0&&b%7==0&&c%7==0){\n start *= 7\n }\n for(i in start..m step start){\n if(a%i==0&&b%i==0&&c%i==0){\n sum =i\n }\n }\n result += sum\n }\n }\n }\n println(result)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 895, "cpu_time_ms": 1787, "memory_kb": 51588}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s363355203", "group_id": "codeNet:p02713", "input_text": "fun main() {\n val numK = readLine()!!.toInt()\n val gcdList = mutableListOf()\n\n for(i in 1 .. numK ){\n for(j in 1 .. numK){\n for(k in 1 .. numK){\n gcdList.add(gcd(i, gcd(j, k)))\n }\n }\n }\n\n\n println(gcdList.sum())\n}\n\nfun gcd(a :Int, b :Int): Int{\n if(a < b) return gcd(b , a)\n if(b == 0) return a\n return gcd(b, a % b)\n}", "language": "Kotlin", "metadata": {"date": 1586741442, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s363355203.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s363355203", "user_id": "u430710262"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main() {\n val numK = readLine()!!.toInt()\n val gcdList = mutableListOf()\n\n for(i in 1 .. numK ){\n for(j in 1 .. numK){\n for(k in 1 .. numK){\n gcdList.add(gcd(i, gcd(j, k)))\n }\n }\n }\n\n\n println(gcdList.sum())\n}\n\nfun gcd(a :Int, b :Int): Int{\n if(a < b) return gcd(b , a)\n if(b == 0) return a\n return gcd(b, a % b)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 398, "cpu_time_ms": 710, "memory_kb": 113328}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s193045633", "group_id": "codeNet:p02713", "input_text": "import java.util.*\n\nfun main(args: Array){\n val input = readLine()!!.toInt()\n var res = 0\n\n for (i in 1 until input+1) {\n for (j in i until input+1) {\n for (h in j until input+1) {\n res += gcd(listOf(i, j, h)) * calc(i, j, h)\n }\n }\n }\n println(res)\n}\n\nfun calc(i: Int, j: Int, h: Int): Int {\n if (i == j && j == h) return 1\n if (i == j || j == h) return 3\n return 6\n}\n\nfun gcd(list: List): Int {\n // 最大公約数を求める対象となる数が格納されたスタック\n val stack = listToStack(list)\n\n // ユークリッドの互除法を用いて、最大公約数を導出する\n // (最終的にスタック内に1つだけ数が残り、それが最大公約数となる)\n while (1 < stack.size) {\n // スタックから2つの数をpop\n val pops = (0 until 2).map {\n stack.pop()\n }\n\n // スタックからpopした2つの数のうち、小さい方の数のインデックス\n val minIndex = if (pops[1] < pops[0]) {\n 1\n } else {\n 0\n }\n\n // スタックからpopした2つの数のうち、小さい方の数をpush\n stack.push(pops[minIndex])\n\n // スタックからpopした2つの数の剰余\n val r = pops[(minIndex + 1) % 2] % pops[minIndex]\n\n // スタックからpopした2つの数に剰余があるならば、それをpush\n if (0 < r) {\n stack.push(r)\n }\n }\n\n // 最大公約数を返す\n return stack.pop()\n}\n\nfun listToStack(list: List): Stack {\n // スタック\n val stack = Stack()\n\n for (e in list) {\n stack.push(e)\n }\n\n return stack\n}\n\n", "language": "Kotlin", "metadata": {"date": 1586740999, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s193045633.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s193045633", "user_id": "u493875901"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array){\n val input = readLine()!!.toInt()\n var res = 0\n\n for (i in 1 until input+1) {\n for (j in i until input+1) {\n for (h in j until input+1) {\n res += gcd(listOf(i, j, h)) * calc(i, j, h)\n }\n }\n }\n println(res)\n}\n\nfun calc(i: Int, j: Int, h: Int): Int {\n if (i == j && j == h) return 1\n if (i == j || j == h) return 3\n return 6\n}\n\nfun gcd(list: List): Int {\n // 最大公約数を求める対象となる数が格納されたスタック\n val stack = listToStack(list)\n\n // ユークリッドの互除法を用いて、最大公約数を導出する\n // (最終的にスタック内に1つだけ数が残り、それが最大公約数となる)\n while (1 < stack.size) {\n // スタックから2つの数をpop\n val pops = (0 until 2).map {\n stack.pop()\n }\n\n // スタックからpopした2つの数のうち、小さい方の数のインデックス\n val minIndex = if (pops[1] < pops[0]) {\n 1\n } else {\n 0\n }\n\n // スタックからpopした2つの数のうち、小さい方の数をpush\n stack.push(pops[minIndex])\n\n // スタックからpopした2つの数の剰余\n val r = pops[(minIndex + 1) % 2] % pops[minIndex]\n\n // スタックからpopした2つの数に剰余があるならば、それをpush\n if (0 < r) {\n stack.push(r)\n }\n }\n\n // 最大公約数を返す\n return stack.pop()\n}\n\nfun listToStack(list: List): Stack {\n // スタック\n val stack = Stack()\n\n for (e in list) {\n stack.push(e)\n }\n\n return stack\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1755, "cpu_time_ms": 787, "memory_kb": 57580}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s199599529", "group_id": "codeNet:p02713", "input_text": "import java.util.Scanner\n\nfun main(args: Array) {\n\tval scn = Scanner(System.`in`)\n\tval k = scn.nextInt()\n\tvar sum = 0L\n\tfor (a in 1..k){\n\t\tfor(b in a..k){\n\t\t\tval ab = gcd(b, a)\n\t\t\tfor (c in b..k){\n\t\t\t\tval t = when{\n\t\t\t\t\ta==c -> 1\n\t\t\t\t\ta==b || b==c -> 3\n\t\t\t\t\telse -> 6\n\t\t\t\t}\n\t\t\t\tsum += t*gcd(ab, c)\n\t\t\t}\n\t\t}\n\t}\n\tprintln(sum)\n}\n\nfun gcd(a: Int, b: Int): Int{\n\tvar a = a; var b = b\n\tif (a) {\n\tval scn = Scanner(System.`in`)\n\tval k = scn.nextInt()\n\tvar sum = 0L\n\tfor (a in 1..k){\n\t\tfor(b in a..k){\n\t\t\tval ab = gcd(b, a)\n\t\t\tfor (c in b..k){\n\t\t\t\tval t = when{\n\t\t\t\t\ta==c -> 1\n\t\t\t\t\ta==b || b==c -> 3\n\t\t\t\t\telse -> 6\n\t\t\t\t}\n\t\t\t\tsum += t*gcd(ab, c)\n\t\t\t}\n\t\t}\n\t}\n\tprintln(sum)\n}\n\nfun gcd(a: Int, b: Int): Int{\n\tvar a = a; var b = b\n\tif (a)\n{\n val scan = Scanner(System.`in`)\n var kotlin=scan.nextLine().toInt()\n var ans: Long=0\n for(i in 1..kotlin)\n {\n for(j in 1..kotlin)\n {\n for(k in 1..kotlin)\n {\n val x = arrayOf(i,j,k)\n ans+=findGCD(x.toIntArray(),3)\n }\n }\n }\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1586740395, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s747712288.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s747712288", "user_id": "u801179767"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*\n\nfun gcd(a: Int, b: Int): Int {\n return if (a == 0) b else gcd(b % a, a)\n}\n\nfun findGCD(arr: IntArray, n: Int): Int {\n var result = arr[0]\n for (i in 1 until n)\n result = gcd(arr[i], result)\n return result\n}\nfun main(args: Array)\n{\n val scan = Scanner(System.`in`)\n var kotlin=scan.nextLine().toInt()\n var ans: Long=0\n for(i in 1..kotlin)\n {\n for(j in 1..kotlin)\n {\n for(k in 1..kotlin)\n {\n val x = arrayOf(i,j,k)\n ans+=findGCD(x.toIntArray(),3)\n }\n }\n }\n println(ans)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 625, "cpu_time_ms": 572, "memory_kb": 56964}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s075686713", "group_id": "codeNet:p02713", "input_text": "fun main(args: Array) {\n val K = readInt()\n var sum = 0L\n for (i in 1..K) {\n for (j in 1..K) {\n for (k in 1..K) {\n val list = listOf(i, j, k).sorted()\n val a = list[0]\n val b = list[1]\n val c = list[2]\n val gcdAB = gcd(a, b)\n val gcdAll = gcd(gcdAB, c)\n sum += gcdAll\n }\n }\n }\n println(sum)\n}\n\nfun gcd(a: Int, b: Int): Int {\n if (a < b) return gcd(b, a)\n if (b == 0) return a\n return gcd(b, a % b)\n}\n\nfun readString() = readLine()!!\nfun readStrings() = readString().split(\" \")\nfun readInt() = readString().toInt()\nfun readInts() = readStrings().map { it.toInt() }\nfun readLong() = readString().toLong()\nfun readLongs() = readStrings().map { it.toLong() }\n", "language": "Kotlin", "metadata": {"date": 1586740080, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s075686713.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s075686713", "user_id": "u979004569"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main(args: Array) {\n val K = readInt()\n var sum = 0L\n for (i in 1..K) {\n for (j in 1..K) {\n for (k in 1..K) {\n val list = listOf(i, j, k).sorted()\n val a = list[0]\n val b = list[1]\n val c = list[2]\n val gcdAB = gcd(a, b)\n val gcdAll = gcd(gcdAB, c)\n sum += gcdAll\n }\n }\n }\n println(sum)\n}\n\nfun gcd(a: Int, b: Int): Int {\n if (a < b) return gcd(b, a)\n if (b == 0) return a\n return gcd(b, a % b)\n}\n\nfun readString() = readLine()!!\nfun readStrings() = readString().split(\" \")\nfun readInt() = readString().toInt()\nfun readInts() = readStrings().map { it.toInt() }\nfun readLong() = readString().toLong()\nfun readLongs() = readStrings().map { it.toLong() }\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 736, "cpu_time_ms": 1037, "memory_kb": 58508}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s726461517", "group_id": "codeNet:p02713", "input_text": "import java.io.*\nimport java.lang.*\nimport java.util.*\n\n// Constant\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 2147483647\nconst val LINF = 9223372036854775807L\n\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\n\nfun solve() {\n val k = nextInt()\n var ans = 0\n for (a in 1..k){\n for (b in 1..k){\n for (c in 1..k){\n ans += gcd(a, gcd(b, c))\n }\n }\n }\n\n println(ans)\n\n}\n\n\n\n\n// Output\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\nfun next() = sc.next()\nfun nextInt() = sc.nextInt()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Int): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextIntAry(n: Int): IntArray {\n val ary = intAry(n)\n for (i in 0 until n) ary[i] = nextInt()\n return ary\n}\nfun nextLongAry(n: Int): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Int): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\nfun ary(n: Int, init: String = \"\") = Array(n) { init }\nfun intAry(n: Int, init: Int = 0) = IntArray(n) { init }\nfun longAry(n: Int, init: Long = 0L) = LongArray(n) { init }\nfun doubleAry(n: Int, init: Double = 0.0) = DoubleArray(n) { init }\nfun ary2(n: Int, m: Int, init: String = \"\") = Array(n) { Array(m) { init } }\nfun intAry2(n: Int, m: Int, init: Int = 0) = Array(n) { IntArray(m) { init } }\nfun longAry2(n: Int, m: Int, init: Long = 0) = Array(n) { LongArray(m) { init } }\nfun doubleAry2(n: Int, m: Int, init: Double = 0.0) = Array(n) { DoubleArray(m) { init } }\nfun ary3(n: Int, m: Int, k: Int, init: String = \"\") = Array(n) { Array(m) { Array(k) { init } } }\nfun intAry3(n: Int, m: Int, k: Int, init: Int = 0) = Array(n) { Array(m) { IntArray(k) { init } } }\nfun longAry3(n: Int, m: Int, k: Int, init: Long = 0L) = Array(n) { Array(m) { LongArray(k) { init } } }\nfun doubleAry3(n: Int, m: Int, k: Int, init: Double = 0.0) = Array(n) { Array(m) { DoubleArray(k) { init } } }\nfun list() = mutableListOf()\nfun intList() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun intSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\nval addIntFunc = {a: Int, b: Int -> a + b}\nval addLongFunc = {a: Long, b: Long -> a + b}\nval mulIntFunc = {a: Int, b: Int -> a * b}\nval mulLongFunc = {a: Long, b: Long -> a * b}\nval maxIntFunc = {a: Int, b: Int -> max(a, b)}\nval maxLongFunc = {a: Long, b: Long -> max(a, b)}\nval minIntFunc = {a: Int, b: Int -> min(a, b)}\nval minLongFunc = {a: Long, b: Long -> min(a, b)}\nval gcdIntFunc = {a: Int, b: Int -> gcd(a, b)}\nval gcdLongFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmIntFunc = {a: Int, b: Int -> lcm(a, b)}\nval lcmLongFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorIntFunc = {a: Int, b: Int -> a xor b}\nval xorLongFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Int, b: Int, op: (Int, Int) -> Int) = op(a, b)\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\nfun Int.a() = this.toLong()\nfun Long.a() = this.toInt()\nfun IntArray.lowerBound(n: Int): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.lowerBound(n: Long): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.intLowerBound(n: Int): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun IntArray.cumsum(op: (Int, Int) -> Int): IntArray {\n val s = intAry(this.size + 1)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Int) {\n repeat(n) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.intCounting(n: Int) {\n repeat(n) {\n val a = nextInt()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Int) {\n repeat(n) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\nfun abs(n: Int): Int = Math.abs(n)\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Int) = if (values.isEmpty()) -INF else values.max()!!\nfun max(vararg values: Long) = if (values.isEmpty()) -LINF else values.max()!!\nfun min(vararg values: Int) = if (values.isEmpty()) INF else values.min()!!\nfun min(vararg values: Long) = if (values.isEmpty()) LINF else values.min()!!\ntailrec fun gcd(a: Int, b: Int): Int = if (b == 0) a else if (a % b == 0) b else gcd(b, (a % b))\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Int, b: Int): Int = a / gcd(a, b) * b\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Int) {\n private val fac = LongArray(max)\n private val finv = LongArray(max)\n private val inv = LongArray(max)\n private val p = MOD.a()\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Int, r: Int): Long = if (n < r || (n < 0 || r < 0)) 0 else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Int, private var searched: Int = 0, private var nextIndex: Int = 0) {\n private val size = fact(n)\n private val permList = Array(size) { IntArray(n) { 0 } }\n\n private tailrec fun fact(n: Int, ans: Int = 1): Int {\n return if (n == 0) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, IntArray(n) { 0 }, Array(n) { false })\n }\n\n private fun create(num: Int, list: IntArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): IntArray = permList[nextIndex++]\n}\n\n// Graph\ndata class Node(val id: Int, var past: Int = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Int, val to: Int, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Int, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Int): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size, -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Int): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size, LINF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\nclass UnionFind(size: Int) {\n private val par = IntArray(size) { it }\n private val size = IntArray(size) { 1 }\n fun root(x: Int): Int {\n return if (par[x] == x) {\n x\n } else {\n par[x] = root(par[x])\n par[x]\n }\n }\n\n fun same(x: Int, y: Int): Boolean = root(x) == root(y)\n fun unite(x: Int, y: Int) {\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n }\n size[a] += size[b]\n par[b] = a\n }\n\n fun size(x: Int): Int = size[root(x)]\n}\n\nclass IntSegmentTree(\n private val a: IntArray,\n private val op: (Int, Int) -> Int,\n private val def: Int = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = intAry(2 * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Int, value: Int) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Int, b: Int) = getSub(a, b, 0, 0, n)\n fun getSub(a: Int, b: Int, k: Int, l: Int, r: Int): Int {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\nclass LongSegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2 * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Int, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Int, b: Int) = getSub(a, b, 0, 0, n)\n fun getSub(a: Int, b: Int, k: Int, l: Int, r: Int): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n if (buflen <= 0) false\n true\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n}", "language": "Kotlin", "metadata": {"date": 1586739904, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02713.html", "problem_id": "p02713", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02713/input.txt", "sample_output_relpath": "derived/input_output/data/p02713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02713/Kotlin/s726461517.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s726461517", "user_id": "u581625805"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.io.*\nimport java.lang.*\nimport java.util.*\n\n// Constant\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 2147483647\nconst val LINF = 9223372036854775807L\n\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\n\nfun solve() {\n val k = nextInt()\n var ans = 0\n for (a in 1..k){\n for (b in 1..k){\n for (c in 1..k){\n ans += gcd(a, gcd(b, c))\n }\n }\n }\n\n println(ans)\n\n}\n\n\n\n\n// Output\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\nfun next() = sc.next()\nfun nextInt() = sc.nextInt()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Int): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextIntAry(n: Int): IntArray {\n val ary = intAry(n)\n for (i in 0 until n) ary[i] = nextInt()\n return ary\n}\nfun nextLongAry(n: Int): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Int): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\nfun ary(n: Int, init: String = \"\") = Array(n) { init }\nfun intAry(n: Int, init: Int = 0) = IntArray(n) { init }\nfun longAry(n: Int, init: Long = 0L) = LongArray(n) { init }\nfun doubleAry(n: Int, init: Double = 0.0) = DoubleArray(n) { init }\nfun ary2(n: Int, m: Int, init: String = \"\") = Array(n) { Array(m) { init } }\nfun intAry2(n: Int, m: Int, init: Int = 0) = Array(n) { IntArray(m) { init } }\nfun longAry2(n: Int, m: Int, init: Long = 0) = Array(n) { LongArray(m) { init } }\nfun doubleAry2(n: Int, m: Int, init: Double = 0.0) = Array(n) { DoubleArray(m) { init } }\nfun ary3(n: Int, m: Int, k: Int, init: String = \"\") = Array(n) { Array(m) { Array(k) { init } } }\nfun intAry3(n: Int, m: Int, k: Int, init: Int = 0) = Array(n) { Array(m) { IntArray(k) { init } } }\nfun longAry3(n: Int, m: Int, k: Int, init: Long = 0L) = Array(n) { Array(m) { LongArray(k) { init } } }\nfun doubleAry3(n: Int, m: Int, k: Int, init: Double = 0.0) = Array(n) { Array(m) { DoubleArray(k) { init } } }\nfun list() = mutableListOf()\nfun intList() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun intSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\nval addIntFunc = {a: Int, b: Int -> a + b}\nval addLongFunc = {a: Long, b: Long -> a + b}\nval mulIntFunc = {a: Int, b: Int -> a * b}\nval mulLongFunc = {a: Long, b: Long -> a * b}\nval maxIntFunc = {a: Int, b: Int -> max(a, b)}\nval maxLongFunc = {a: Long, b: Long -> max(a, b)}\nval minIntFunc = {a: Int, b: Int -> min(a, b)}\nval minLongFunc = {a: Long, b: Long -> min(a, b)}\nval gcdIntFunc = {a: Int, b: Int -> gcd(a, b)}\nval gcdLongFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmIntFunc = {a: Int, b: Int -> lcm(a, b)}\nval lcmLongFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorIntFunc = {a: Int, b: Int -> a xor b}\nval xorLongFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Int, b: Int, op: (Int, Int) -> Int) = op(a, b)\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\nfun Int.a() = this.toLong()\nfun Long.a() = this.toInt()\nfun IntArray.lowerBound(n: Int): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.lowerBound(n: Long): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.intLowerBound(n: Int): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun IntArray.cumsum(op: (Int, Int) -> Int): IntArray {\n val s = intAry(this.size + 1)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Int) {\n repeat(n) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.intCounting(n: Int) {\n repeat(n) {\n val a = nextInt()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Int) {\n repeat(n) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\nfun abs(n: Int): Int = Math.abs(n)\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Int) = if (values.isEmpty()) -INF else values.max()!!\nfun max(vararg values: Long) = if (values.isEmpty()) -LINF else values.max()!!\nfun min(vararg values: Int) = if (values.isEmpty()) INF else values.min()!!\nfun min(vararg values: Long) = if (values.isEmpty()) LINF else values.min()!!\ntailrec fun gcd(a: Int, b: Int): Int = if (b == 0) a else if (a % b == 0) b else gcd(b, (a % b))\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Int, b: Int): Int = a / gcd(a, b) * b\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Int) {\n private val fac = LongArray(max)\n private val finv = LongArray(max)\n private val inv = LongArray(max)\n private val p = MOD.a()\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Int, r: Int): Long = if (n < r || (n < 0 || r < 0)) 0 else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Int, private var searched: Int = 0, private var nextIndex: Int = 0) {\n private val size = fact(n)\n private val permList = Array(size) { IntArray(n) { 0 } }\n\n private tailrec fun fact(n: Int, ans: Int = 1): Int {\n return if (n == 0) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, IntArray(n) { 0 }, Array(n) { false })\n }\n\n private fun create(num: Int, list: IntArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): IntArray = permList[nextIndex++]\n}\n\n// Graph\ndata class Node(val id: Int, var past: Int = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Int, val to: Int, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Int, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Int): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size, -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Int): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size, LINF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\nclass UnionFind(size: Int) {\n private val par = IntArray(size) { it }\n private val size = IntArray(size) { 1 }\n fun root(x: Int): Int {\n return if (par[x] == x) {\n x\n } else {\n par[x] = root(par[x])\n par[x]\n }\n }\n\n fun same(x: Int, y: Int): Boolean = root(x) == root(y)\n fun unite(x: Int, y: Int) {\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n }\n size[a] += size[b]\n par[b] = a\n }\n\n fun size(x: Int): Int = size[root(x)]\n}\n\nclass IntSegmentTree(\n private val a: IntArray,\n private val op: (Int, Int) -> Int,\n private val def: Int = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = intAry(2 * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Int, value: Int) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Int, b: Int) = getSub(a, b, 0, 0, n)\n fun getSub(a: Int, b: Int, k: Int, l: Int, r: Int): Int {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\nclass LongSegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2 * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Int, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Int, b: Int) = getSub(a, b, 0, 0, n)\n fun getSub(a: Int, b: Int, k: Int, l: Int, r: Int): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n if (buflen <= 0) false\n true\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "sample_input": "2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02713", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nHere \\gcd(a,b,c) denotes the greatest common divisor of a, b, and c.\n\nConstraints\n\n1 \\leq K \\leq 200\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the value of \\displaystyle{\\sum_{a=1}^{K}\\sum_{b=1}^{K}\\sum_{c=1}^{K} \\gcd(a,b,c)}.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n200\n\nSample Output 2\n\n10813692", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 15210, "cpu_time_ms": 518, "memory_kb": 35144}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s430549298", "group_id": "codeNet:p02714", "input_text": "fun main() {\n val n = readLine()!!.toInt()\n val s = readLine()!!\n\n val rgb = s.groupBy { it }.map { it.value.size.toLong() }\n\n val exclude = (0..n-3).sumBy { l ->\n (1..n).count { w ->\n val c = l + w\n val r = c + w\n r < n && s[l] != s[c] && s[c] != s[r] && s[r] != s[l]\n }\n }\n\n println(rgb[0] * rgb[1] * rgb[2] - exclude)\n}", "language": "Kotlin", "metadata": {"date": 1588311174, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s430549298.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s430549298", "user_id": "u563556491"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun main() {\n val n = readLine()!!.toInt()\n val s = readLine()!!\n\n val rgb = s.groupBy { it }.map { it.value.size.toLong() }\n\n val exclude = (0..n-3).sumBy { l ->\n (1..n).count { w ->\n val c = l + w\n val r = c + w\n r < n && s[l] != s[c] && s[c] != s[r] && s[r] != s[l]\n }\n }\n\n println(rgb[0] * rgb[1] * rgb[2] - exclude)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 387, "cpu_time_ms": 218, "memory_kb": 36552}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s770126274", "group_id": "codeNet:p02714", "input_text": "fun solve(input: String): Long {\n val len = input.length \n \n val red_list: MutableList = mutableListOf()\n val green_list: MutableList = mutableListOf()\n val blue_list: MutableList = mutableListOf()\n\n (0 until len).forEach { \n when(input[it]) {\n 'R' -> {\n red_list.add(it)\n }\n 'G' -> {\n green_list.add(it)\n }\n 'B' -> {\n blue_list.add(it)\n }\n else -> {}\n }\n }\n assert(red_list.size + green_list.size + blue_list.size == len)\n val first_matched = red_list.size.toLong() * green_list.size.toLong() * blue_list.size.toLong()\n var diff = 0L\n for(i in 0 until len) {\n for(j in (i + 1) until len) {\n val k = 2 * j - i\n diff += if(k < len && input[i] != input[j] && input[j] != input[k] && input[i] != input[k]) { 1 } else {0}\n }\n }\n\n return first_matched - diff\n} \n\n\nfun main(args: Array) {\n val N = readLine()!!.toInt()\n val S = readLine()!!\n assert(S.length == N)\n \n solve(S).run(::println)\n}", "language": "Kotlin", "metadata": {"date": 1588298122, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s770126274.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s770126274", "user_id": "u181807786"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun solve(input: String): Long {\n val len = input.length \n \n val red_list: MutableList = mutableListOf()\n val green_list: MutableList = mutableListOf()\n val blue_list: MutableList = mutableListOf()\n\n (0 until len).forEach { \n when(input[it]) {\n 'R' -> {\n red_list.add(it)\n }\n 'G' -> {\n green_list.add(it)\n }\n 'B' -> {\n blue_list.add(it)\n }\n else -> {}\n }\n }\n assert(red_list.size + green_list.size + blue_list.size == len)\n val first_matched = red_list.size.toLong() * green_list.size.toLong() * blue_list.size.toLong()\n var diff = 0L\n for(i in 0 until len) {\n for(j in (i + 1) until len) {\n val k = 2 * j - i\n diff += if(k < len && input[i] != input[j] && input[j] != input[k] && input[i] != input[k]) { 1 } else {0}\n }\n }\n\n return first_matched - diff\n} \n\n\nfun main(args: Array) {\n val N = readLine()!!.toInt()\n val S = readLine()!!\n assert(S.length == N)\n \n solve(S).run(::println)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1130, "cpu_time_ms": 161, "memory_kb": 36592}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s965160413", "group_id": "codeNet:p02714", "input_text": "fun main(args: Array) {\n var n = readLine()!!.toInt()\n var s = readLine()!!.toString()\n var c = mutableMapOf('R' to 0, 'G' to 0, 'B' to 0)\n for (i in s) {\n c[i] = c[i]!! + 1\n }\n var diff = 0\n var ans = 1L\n for (d in 1..((n-1)/2)){\n for (i in 0..(n-d-d-1)) {\n if (s[i] != s[i+d] && s[i+d] != s[i+d+d] && s[i+d+d] != s[i]) {\n diff += 1\n }\n }\n }\n for ((x, y) in c){ans *= y}\n println(ans-diff)\n}\n", "language": "Kotlin", "metadata": {"date": 1588207839, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s965160413.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s965160413", "user_id": "u906501980"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun main(args: Array) {\n var n = readLine()!!.toInt()\n var s = readLine()!!.toString()\n var c = mutableMapOf('R' to 0, 'G' to 0, 'B' to 0)\n for (i in s) {\n c[i] = c[i]!! + 1\n }\n var diff = 0\n var ans = 1L\n for (d in 1..((n-1)/2)){\n for (i in 0..(n-d-d-1)) {\n if (s[i] != s[i+d] && s[i+d] != s[i+d+d] && s[i+d+d] != s[i]) {\n diff += 1\n }\n }\n }\n for ((x, y) in c){ans *= y}\n println(ans-diff)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 503, "cpu_time_ms": 168, "memory_kb": 37316}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s695676552", "group_id": "codeNet:p02714", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val s = readLine()!!\n var cnt = 0L\n for (i in 0 until n-2) {\n if (s[i] == 'R') {\n for (j in i+1 until n-1) {\n if (s[j] == 'R') {\n continue\n } else if (s[j] == 'G') {\n for (k in j+1 until n) {\n if (s[k] == 'B' && j-i != k-j) cnt++\n }\n } else {\n for (k in j+1 until n) {\n if (s[k] == 'G' && j-i != k-j) cnt++\n } \n }\n }\n } else if (s[i] == 'G') {\n for (j in i+1 until n-1) {\n if (s[j] == 'G') {\n continue\n } else if (s[j] == 'R') {\n for (k in j+1 until n) {\n if (s[k] == 'B' && j-i != k-j) cnt++\n }\n } else {\n for (k in j+1 until n) {\n if (s[k] == 'R' && j-i != k-j) cnt++\n }\n }\n }\n } else {\n for (j in i+1 until n-1) {\n if (s[j] == 'B') {\n continue\n } else if (s[j] == 'R') {\n for (k in j+1 until n) {\n if (s[k] == 'G' && j-i != k-j) cnt++\n }\n } else {\n for (k in j+1 until n) {\n if (s[k] == 'R' && j-i != k-j) cnt++\n }\n }\n }\n }\n }\n println(cnt)\n}", "language": "Kotlin", "metadata": {"date": 1587278033, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s695676552.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s695676552", "user_id": "u213256030"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val s = readLine()!!\n var cnt = 0L\n for (i in 0 until n-2) {\n if (s[i] == 'R') {\n for (j in i+1 until n-1) {\n if (s[j] == 'R') {\n continue\n } else if (s[j] == 'G') {\n for (k in j+1 until n) {\n if (s[k] == 'B' && j-i != k-j) cnt++\n }\n } else {\n for (k in j+1 until n) {\n if (s[k] == 'G' && j-i != k-j) cnt++\n } \n }\n }\n } else if (s[i] == 'G') {\n for (j in i+1 until n-1) {\n if (s[j] == 'G') {\n continue\n } else if (s[j] == 'R') {\n for (k in j+1 until n) {\n if (s[k] == 'B' && j-i != k-j) cnt++\n }\n } else {\n for (k in j+1 until n) {\n if (s[k] == 'R' && j-i != k-j) cnt++\n }\n }\n }\n } else {\n for (j in i+1 until n-1) {\n if (s[j] == 'B') {\n continue\n } else if (s[j] == 'R') {\n for (k in j+1 until n) {\n if (s[k] == 'G' && j-i != k-j) cnt++\n }\n } else {\n for (k in j+1 until n) {\n if (s[k] == 'R' && j-i != k-j) cnt++\n }\n }\n }\n }\n }\n println(cnt)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1642, "cpu_time_ms": 2207, "memory_kb": 38800}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s642199430", "group_id": "codeNet:p02714", "input_text": "import java.io.*\nimport java.lang.*\nimport java.util.*\n\n// Constant\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 9223372036854775807L\n\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\nfun solve() {\n val n = nextLong()\n val s = next()\n val red = longAry(n + 1)\n val green = longAry(n + 1)\n val blue = longAry(n + 1)\n for (i in n - 1 downTo 0L) {\n red[i] = red[i + 1]\n green[i] = green[i + 1]\n blue[i] = blue[i + 1]\n when(s[i]) {\n 'R' -> red[i]++\n 'G' -> green[i]++\n 'B' -> blue[i]++\n }\n }\n\n var ans = 0L\n for (i in 0 until n - 2) {\n for (j in i + 1 until n - 1){\n val gap = j - i\n if(s[i] == s[j]) continue\n when {\n s[i] == 'R' && s[j] == 'G' || s[i] == 'G' && s[j] == 'R' -> {\n ans += blue[j]\n if(j + gap < n && s[j + gap] == 'B') ans--\n }\n s[i] == 'R' && s[j] == 'B' || s[i] == 'B' && s[j] == 'R' -> {\n ans += green[j]\n if(j + gap < n && s[j + gap] == 'G') ans--\n }\n s[i] == 'G' && s[j] == 'B' || s[i] == 'B' && s[j] == 'G' -> {\n ans += red[j]\n if(j + gap < n && s[j + gap] == 'R') ans--\n }\n }\n }\n }\n\n println(ans)\n}\n\n\n// Rule\noperator fun String.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun LongArray.get(index: Long): Long {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun LongArray.set(index: Long, value: Long) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun DoubleArray.get(index: Long): Double {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun DoubleArray.set(index: Long, value: Double) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun Array.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun Array.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun MutableList.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun MutableList.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\n\n// Output\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\nfun next() = sc.next()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Long): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextLongAry(n: Long): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Long): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\nfun ary(n: Long, init: String = \"\") = Array(n.toInt()) { init }\nfun longAry(n: Long, init: Long = 0L) = LongArray(n.toInt()) { init }\nfun doubleAry(n: Long, init: Double = 0.0) = DoubleArray(n.toInt()) { init }\nfun boolAry(n: Long, init: Boolean = false) = Array(n.toInt()) { init }\nfun ary2(n: Long, m: Long, init: String = \"\") = Array(n.toInt()) { ary(m, init) }\nfun longAry2(n: Long, m: Long, init: Long = 0) = Array(n.toInt()) { longAry(m, init) }\nfun doubleAry2(n: Long, m: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry(m, init) }\nfun boolAry2(n: Long, m: Long, init: Boolean = false) = Array(n.toInt()) { boolAry(m, init) }\nfun ary3(n: Long, m: Long, k: Long, init: String = \"\") = Array(n.toInt()) { ary2(m, k, init) }\nfun longAry3(n: Long, m: Long, k: Long, init: Long = 0L) = Array(n.toInt()) { longAry2(m, k, init) }\nfun doubleAry3(n: Long, m: Long, k: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry2(m, k, init) }\nfun boolAry3(n: Long, m: Long, k: Long, init: Boolean = false) = Array(n.toInt()) { boolAry2(m, k, init) }\nfun list() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\nval addFunc = {a: Long, b: Long -> a + b}\nval mulFunc = {a: Long, b: Long -> a * b}\nval maxFunc = {a: Long, b: Long -> max(a, b)}\nval minFunc = {a: Long, b: Long -> min(a, b)}\nval gcdFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\nfun LongArray.lowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1L)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Long) {\n repeat(n.toInt()) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Long) {\n repeat(n.toInt()) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Long) = if (values.isEmpty()) -INF else values.max()!!\nfun min(vararg values: Long) = if (values.isEmpty()) INF else values.min()!!\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Long) {\n private val fac = longAry(max)\n private val finv = longAry(max)\n private val inv = longAry(max)\n private val p = MOD\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Long, r: Long): Long = if (n < r || (n < 0 || r < 0)) 0L else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Long, private var searched: Long = 0L, private var nextIndex: Long = 0L) {\n private val size = fact(n)\n private val permList = longAry2(size, n)\n\n private tailrec fun fact(n: Long, ans: Long = 1L): Long {\n return if (n == 0L) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, longAry(n), boolAry(n))\n }\n\n private fun create(num: Long, list: LongArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): LongArray = permList[nextIndex++]\n}\n\n// Graph\ndata class Node(val id: Long, var past: Long = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Long, val to: Long, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Long, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Long): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size.toLong(), -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Long): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size.toLong(), INF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\nclass UnionFind(size: Long) {\n private val par = LongArray(size.toInt()) { it.toLong() }\n private val size = longAry(size, 1L)\n fun root(x: Long): Long {\n return if (par[x] == x) {\n x\n } else {\n par[x] = root(par[x])\n par[x]\n }\n }\n\n fun same(x: Long, y: Long): Boolean = root(x) == root(y)\n fun unite(x: Long, y: Long) {\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n }\n size[a] += size[b]\n par[b] = a\n }\n\n fun size(x: Long): Long = size[root(x)]\n}\n\nclass SegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2L * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Long, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Long, b: Long) = getSub(a, b, 0L, 0L, n.toLong())\n private fun getSub(a: Long, b: Long, k: Long, l: Long, r: Long): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n if (buflen <= 0) false\n true\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n// \"The world doesn't need you.\"\n//\n// fun nextInt(): Int {\n// val nl = nextLong()\n// if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n// return nl.toInt()\n// }\n}", "language": "Kotlin", "metadata": {"date": 1586824838, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s642199430.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s642199430", "user_id": "u581625805"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.*\nimport java.lang.*\nimport java.util.*\n\n// Constant\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 9223372036854775807L\n\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\nfun solve() {\n val n = nextLong()\n val s = next()\n val red = longAry(n + 1)\n val green = longAry(n + 1)\n val blue = longAry(n + 1)\n for (i in n - 1 downTo 0L) {\n red[i] = red[i + 1]\n green[i] = green[i + 1]\n blue[i] = blue[i + 1]\n when(s[i]) {\n 'R' -> red[i]++\n 'G' -> green[i]++\n 'B' -> blue[i]++\n }\n }\n\n var ans = 0L\n for (i in 0 until n - 2) {\n for (j in i + 1 until n - 1){\n val gap = j - i\n if(s[i] == s[j]) continue\n when {\n s[i] == 'R' && s[j] == 'G' || s[i] == 'G' && s[j] == 'R' -> {\n ans += blue[j]\n if(j + gap < n && s[j + gap] == 'B') ans--\n }\n s[i] == 'R' && s[j] == 'B' || s[i] == 'B' && s[j] == 'R' -> {\n ans += green[j]\n if(j + gap < n && s[j + gap] == 'G') ans--\n }\n s[i] == 'G' && s[j] == 'B' || s[i] == 'B' && s[j] == 'G' -> {\n ans += red[j]\n if(j + gap < n && s[j + gap] == 'R') ans--\n }\n }\n }\n }\n\n println(ans)\n}\n\n\n// Rule\noperator fun String.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun LongArray.get(index: Long): Long {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun LongArray.set(index: Long, value: Long) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun DoubleArray.get(index: Long): Double {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun DoubleArray.set(index: Long, value: Double) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun Array.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun Array.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun MutableList.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun MutableList.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\n\n// Output\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\nfun next() = sc.next()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Long): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextLongAry(n: Long): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Long): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\nfun ary(n: Long, init: String = \"\") = Array(n.toInt()) { init }\nfun longAry(n: Long, init: Long = 0L) = LongArray(n.toInt()) { init }\nfun doubleAry(n: Long, init: Double = 0.0) = DoubleArray(n.toInt()) { init }\nfun boolAry(n: Long, init: Boolean = false) = Array(n.toInt()) { init }\nfun ary2(n: Long, m: Long, init: String = \"\") = Array(n.toInt()) { ary(m, init) }\nfun longAry2(n: Long, m: Long, init: Long = 0) = Array(n.toInt()) { longAry(m, init) }\nfun doubleAry2(n: Long, m: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry(m, init) }\nfun boolAry2(n: Long, m: Long, init: Boolean = false) = Array(n.toInt()) { boolAry(m, init) }\nfun ary3(n: Long, m: Long, k: Long, init: String = \"\") = Array(n.toInt()) { ary2(m, k, init) }\nfun longAry3(n: Long, m: Long, k: Long, init: Long = 0L) = Array(n.toInt()) { longAry2(m, k, init) }\nfun doubleAry3(n: Long, m: Long, k: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry2(m, k, init) }\nfun boolAry3(n: Long, m: Long, k: Long, init: Boolean = false) = Array(n.toInt()) { boolAry2(m, k, init) }\nfun list() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\nval addFunc = {a: Long, b: Long -> a + b}\nval mulFunc = {a: Long, b: Long -> a * b}\nval maxFunc = {a: Long, b: Long -> max(a, b)}\nval minFunc = {a: Long, b: Long -> min(a, b)}\nval gcdFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\nfun LongArray.lowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1L)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Long) {\n repeat(n.toInt()) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Long) {\n repeat(n.toInt()) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Long) = if (values.isEmpty()) -INF else values.max()!!\nfun min(vararg values: Long) = if (values.isEmpty()) INF else values.min()!!\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Long) {\n private val fac = longAry(max)\n private val finv = longAry(max)\n private val inv = longAry(max)\n private val p = MOD\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Long, r: Long): Long = if (n < r || (n < 0 || r < 0)) 0L else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Long, private var searched: Long = 0L, private var nextIndex: Long = 0L) {\n private val size = fact(n)\n private val permList = longAry2(size, n)\n\n private tailrec fun fact(n: Long, ans: Long = 1L): Long {\n return if (n == 0L) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, longAry(n), boolAry(n))\n }\n\n private fun create(num: Long, list: LongArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): LongArray = permList[nextIndex++]\n}\n\n// Graph\ndata class Node(val id: Long, var past: Long = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Long, val to: Long, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Long, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Long): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size.toLong(), -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Long): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size.toLong(), INF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\nclass UnionFind(size: Long) {\n private val par = LongArray(size.toInt()) { it.toLong() }\n private val size = longAry(size, 1L)\n fun root(x: Long): Long {\n return if (par[x] == x) {\n x\n } else {\n par[x] = root(par[x])\n par[x]\n }\n }\n\n fun same(x: Long, y: Long): Boolean = root(x) == root(y)\n fun unite(x: Long, y: Long) {\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n }\n size[a] += size[b]\n par[b] = a\n }\n\n fun size(x: Long): Long = size[root(x)]\n}\n\nclass SegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2L * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Long, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Long, b: Long) = getSub(a, b, 0L, 0L, n.toLong())\n private fun getSub(a: Long, b: Long, k: Long, l: Long, r: Long): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n if (buflen <= 0) false\n true\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n// \"The world doesn't need you.\"\n//\n// fun nextInt(): Int {\n// val nl = nextLong()\n// if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n// return nl.toInt()\n// }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 14734, "cpu_time_ms": 198, "memory_kb": 36192}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s700838128", "group_id": "codeNet:p02714", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val s = sc.next()\n println(problem162d(n, s))\n}\n\nfun problem162d(n: Int, s: String): Int {\n\n val rs = IntArray(n + 1) { 0 }\n for (i in 0 until n) {\n rs[i + 1] = rs[i] + if (s[i] == 'R') 1 else 0\n }\n val gs = IntArray(n + 1) { 0 }\n for (i in 0 until n) {\n gs[i + 1] = gs[i] + if (s[i] == 'G') 1 else 0\n }\n val bs = IntArray(n + 1) { 0 }\n for (i in 0 until n) {\n bs[i + 1] = bs[i] + if (s[i] == 'B') 1 else 0\n }\n val all = rs.last() * gs.last() * bs.last()\n var sub = 0;\n for (i in 0 until n) {\n for (j in i + 1 until n) {\n if (s[i] == s[j]) continue\n val k = j * 2 - i\n if (k >= n || s[k] == s[i] || s[k] == s[j]) continue\n sub++\n }\n }\n\n return all - sub\n}", "language": "Kotlin", "metadata": {"date": 1586796844, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s700838128.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s700838128", "user_id": "u073232808"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val s = sc.next()\n println(problem162d(n, s))\n}\n\nfun problem162d(n: Int, s: String): Int {\n\n val rs = IntArray(n + 1) { 0 }\n for (i in 0 until n) {\n rs[i + 1] = rs[i] + if (s[i] == 'R') 1 else 0\n }\n val gs = IntArray(n + 1) { 0 }\n for (i in 0 until n) {\n gs[i + 1] = gs[i] + if (s[i] == 'G') 1 else 0\n }\n val bs = IntArray(n + 1) { 0 }\n for (i in 0 until n) {\n bs[i + 1] = bs[i] + if (s[i] == 'B') 1 else 0\n }\n val all = rs.last() * gs.last() * bs.last()\n var sub = 0;\n for (i in 0 until n) {\n for (j in i + 1 until n) {\n if (s[i] == s[j]) continue\n val k = j * 2 - i\n if (k >= n || s[k] == s[i] || s[k] == s[j]) continue\n sub++\n }\n }\n\n return all - sub\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 894, "cpu_time_ms": 224, "memory_kb": 40920}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s072415462", "group_id": "codeNet:p02714", "input_text": "fun main(arg: Array) {\n val (R, G, B) = listOf(0, 1, 2)\n val N = nextInt()\n val S = next()\n val A = S.map {\n when(it) {\n 'R' -> 0\n 'G' -> 1\n 'B' -> 2\n else -> 999\n } }\n val RGB = Array(3) { IntArray(N) }\n A.forEachIndexed { index, ch -> RGB[ch][index] = 1 }\n for (m in 0 until 3)\n for (n in (1 until N).reversed()) RGB[m][n - 1] += RGB[m][n]\n fun get(c: Int, n: Int, m: Int): Int {\n var p = RGB[c][m + 1]\n if (p > 0 && m + (m - n) < N && c == A[m + (m - n)]) p -= 1\n return p\n }\n var ans = 0L\n for (n in 0 until N - 2) {\n when (A[n]) {\n R -> {\n for (m in n + 1 until N - 1) {\n when (A[m]) {\n G -> ans += get(B, n, m)\n B -> ans += get(G, n, m)\n else -> { }\n }\n }\n }\n G -> {\n for (m in n + 1 until N - 1) {\n when (A[m]) {\n R -> ans += get(B, n, m)\n B -> ans += get(R, n, m)\n else -> { }\n }\n }\n }\n B -> {\n for (m in n + 1 until N - 1) {\n when (A[m]) {\n R -> ans += get(G, n, m)\n G -> ans += get(R, n, m)\n else -> { }\n }\n }\n }\n }\n }\n return println(ans)\n}\n\nfun next() = readLine()!!\nfun nextInt(offset: Int = 0) = Integer.parseInt(next()) + offset\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfLong() = listOfString().map(String::toLong)\nfun listOfDouble() = listOfString().map(String::toDouble)\nfun listOfInt(offset: Int = 0) = listOfString().map { Integer.parseInt(it) + offset }\nfun listOfInt(vararg offset: Int) = listOfString().map { Integer.parseInt(it) }.mapIndexed { index, int -> int + offset[index % offset.size] }\nfun listOfLong(offset: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + offset }\nfun listOfLong(vararg offset: Long) = listOfString().map { java.lang.Long.parseLong(it) }.mapIndexed { index, long -> long + offset[index % offset.size] }\nfun listOfDouble(offset: Double = 0.0) = listOfString().map { java.lang.Double.parseDouble(it) + offset }\nfun pairIntLong() = listOfLong().let { Pair(it[0].toInt(), it[1]) }\nfun tripleIntIntLong() = listOfLong().let { Triple(it[0].toInt(), it[1].toInt(), it[2]) }\nfun tripleIntLongLong() = listOfLong().let { Triple(it[0].toInt(), it[1], it[2]) }\nfun pairIntLong(offset: Pair = Pair(0, 0L)) = listOfLong().let { Pair(it[0].toInt() + offset.first, it[1] + offset.second) }\nfun tripleIntIntLong(offset: Triple = Triple(0, 0, 0L)) = listOfLong().let { Triple(it[0].toInt() + offset.first, it[1].toInt() + offset.second, it[2] + offset.third) }\nfun tripleIntLongLong(offset: Triple = Triple(0, 0L, 0L)) = listOfLong().let { Triple(it[0].toInt() + offset.first, it[1] + offset.second, it[2] + offset.third) }\n", "language": "Kotlin", "metadata": {"date": 1586747976, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s072415462.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s072415462", "user_id": "u408242391"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun main(arg: Array) {\n val (R, G, B) = listOf(0, 1, 2)\n val N = nextInt()\n val S = next()\n val A = S.map {\n when(it) {\n 'R' -> 0\n 'G' -> 1\n 'B' -> 2\n else -> 999\n } }\n val RGB = Array(3) { IntArray(N) }\n A.forEachIndexed { index, ch -> RGB[ch][index] = 1 }\n for (m in 0 until 3)\n for (n in (1 until N).reversed()) RGB[m][n - 1] += RGB[m][n]\n fun get(c: Int, n: Int, m: Int): Int {\n var p = RGB[c][m + 1]\n if (p > 0 && m + (m - n) < N && c == A[m + (m - n)]) p -= 1\n return p\n }\n var ans = 0L\n for (n in 0 until N - 2) {\n when (A[n]) {\n R -> {\n for (m in n + 1 until N - 1) {\n when (A[m]) {\n G -> ans += get(B, n, m)\n B -> ans += get(G, n, m)\n else -> { }\n }\n }\n }\n G -> {\n for (m in n + 1 until N - 1) {\n when (A[m]) {\n R -> ans += get(B, n, m)\n B -> ans += get(R, n, m)\n else -> { }\n }\n }\n }\n B -> {\n for (m in n + 1 until N - 1) {\n when (A[m]) {\n R -> ans += get(G, n, m)\n G -> ans += get(R, n, m)\n else -> { }\n }\n }\n }\n }\n }\n return println(ans)\n}\n\nfun next() = readLine()!!\nfun nextInt(offset: Int = 0) = Integer.parseInt(next()) + offset\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfLong() = listOfString().map(String::toLong)\nfun listOfDouble() = listOfString().map(String::toDouble)\nfun listOfInt(offset: Int = 0) = listOfString().map { Integer.parseInt(it) + offset }\nfun listOfInt(vararg offset: Int) = listOfString().map { Integer.parseInt(it) }.mapIndexed { index, int -> int + offset[index % offset.size] }\nfun listOfLong(offset: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + offset }\nfun listOfLong(vararg offset: Long) = listOfString().map { java.lang.Long.parseLong(it) }.mapIndexed { index, long -> long + offset[index % offset.size] }\nfun listOfDouble(offset: Double = 0.0) = listOfString().map { java.lang.Double.parseDouble(it) + offset }\nfun pairIntLong() = listOfLong().let { Pair(it[0].toInt(), it[1]) }\nfun tripleIntIntLong() = listOfLong().let { Triple(it[0].toInt(), it[1].toInt(), it[2]) }\nfun tripleIntLongLong() = listOfLong().let { Triple(it[0].toInt(), it[1], it[2]) }\nfun pairIntLong(offset: Pair = Pair(0, 0L)) = listOfLong().let { Pair(it[0].toInt() + offset.first, it[1] + offset.second) }\nfun tripleIntIntLong(offset: Triple = Triple(0, 0, 0L)) = listOfLong().let { Triple(it[0].toInt() + offset.first, it[1].toInt() + offset.second, it[2] + offset.third) }\nfun tripleIntLongLong(offset: Triple = Triple(0, 0L, 0L)) = listOfLong().let { Triple(it[0].toInt() + offset.first, it[1] + offset.second, it[2] + offset.third) }\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3270, "cpu_time_ms": 264, "memory_kb": 42324}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s664368363", "group_id": "codeNet:p02714", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val n = readLine()!!.toInt()\n val s = readLine()!!\n\n val r = IntArray(n){-1}\n val g = IntArray(n){-1}\n val b = IntArray(n){-1}\n\n var answer = 0L\n\n var rcnt = 0\n var gcnt = 0\n var bcnt = 0\n repeat(n) {\n when {\n s[it] == 'R' -> {\n r[rcnt] = it\n rcnt++\n }\n s[it] == 'G' -> {\n g[gcnt] = it\n gcnt++\n }\n s[it] == 'B' -> {\n b[bcnt] = it\n bcnt++\n }\n }\n }\n\n repeat(rcnt) {rr->\n repeat(gcnt) {gg->\n repeat(bcnt) { bb ->\n if (Math.abs(g[gg] - r[rr]) != Math.abs(b[bb] - g[gg]) \n && Math.abs(g[gg] - r[rr]) != Math.abs(b[bb] - r[rr])\n && Math.abs(b[gg] - g[rr]) != Math.abs(b[bb] - r[rr])) {\n answer++\n }\n }\n }\n }\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1586745579, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s664368363.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s664368363", "user_id": "u288435405"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val n = readLine()!!.toInt()\n val s = readLine()!!\n\n val r = IntArray(n){-1}\n val g = IntArray(n){-1}\n val b = IntArray(n){-1}\n\n var answer = 0L\n\n var rcnt = 0\n var gcnt = 0\n var bcnt = 0\n repeat(n) {\n when {\n s[it] == 'R' -> {\n r[rcnt] = it\n rcnt++\n }\n s[it] == 'G' -> {\n g[gcnt] = it\n gcnt++\n }\n s[it] == 'B' -> {\n b[bcnt] = it\n bcnt++\n }\n }\n }\n\n repeat(rcnt) {rr->\n repeat(gcnt) {gg->\n repeat(bcnt) { bb ->\n if (Math.abs(g[gg] - r[rr]) != Math.abs(b[bb] - g[gg]) \n && Math.abs(g[gg] - r[rr]) != Math.abs(b[bb] - r[rr])\n && Math.abs(b[gg] - g[rr]) != Math.abs(b[bb] - r[rr])) {\n answer++\n }\n }\n }\n }\n println(answer)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1009, "cpu_time_ms": 2207, "memory_kb": 36536}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s370237122", "group_id": "codeNet:p02714", "input_text": "fun main() {\n val N = readLine()!!.toInt()\n val S = readLine()!!\n\n val R = IntArray(N)\n val G = IntArray(N)\n val B = IntArray(N)\n\n when (S[0]) {\n 'R' -> {\n R[0] = 1\n }\n 'G' -> {\n G[0] = 1\n }\n 'B' -> {\n B[0] = 1\n }\n }\n for (i in 1..S.lastIndex) {\n val c = S[i]\n when (c) {\n 'R' -> {\n R[i] = R[i - 1] + 1\n G[i] = G[i - 1]\n B[i] = B[i - 1]\n }\n 'G' -> {\n R[i] = R[i - 1]\n G[i] = G[i - 1] + 1\n B[i] = B[i - 1]\n }\n 'B' -> {\n R[i] = R[i - 1]\n G[i] = G[i - 1]\n B[i] = B[i - 1] + 1\n }\n }\n }\n\n var sum = 0L\n for (i in 0..S.lastIndex - 2) {\n for (j in i + 1..S.lastIndex - 1) {\n if (S[i] == S[j]) {\n continue\n }\n val a = arrayOf(S[i], S[j])\n sum += when {\n !a.contains('R') -> {\n var n = R[S.lastIndex] - R[j]\n if ((j + (j - i)) <= S.lastIndex && S[j + (j - i)] == 'R') {\n n--\n }\n n\n }\n !a.contains('G') -> {\n var n = G[S.lastIndex] - G[j]\n if ((j + (j - i)) <= S.lastIndex && S[j + (j - i)] == 'G') {\n n--\n }\n n\n }\n !a.contains('B') -> {\n var n = B[S.lastIndex] - B[j]\n if ((j + (j - i)) <= S.lastIndex && S[j + (j - i)] == 'B') {\n n--\n }\n n\n }\n else -> throw IllegalStateException(\"\")\n }\n\n\n }\n }\n println(sum)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1586744398, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s370237122.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s370237122", "user_id": "u085288971"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun main() {\n val N = readLine()!!.toInt()\n val S = readLine()!!\n\n val R = IntArray(N)\n val G = IntArray(N)\n val B = IntArray(N)\n\n when (S[0]) {\n 'R' -> {\n R[0] = 1\n }\n 'G' -> {\n G[0] = 1\n }\n 'B' -> {\n B[0] = 1\n }\n }\n for (i in 1..S.lastIndex) {\n val c = S[i]\n when (c) {\n 'R' -> {\n R[i] = R[i - 1] + 1\n G[i] = G[i - 1]\n B[i] = B[i - 1]\n }\n 'G' -> {\n R[i] = R[i - 1]\n G[i] = G[i - 1] + 1\n B[i] = B[i - 1]\n }\n 'B' -> {\n R[i] = R[i - 1]\n G[i] = G[i - 1]\n B[i] = B[i - 1] + 1\n }\n }\n }\n\n var sum = 0L\n for (i in 0..S.lastIndex - 2) {\n for (j in i + 1..S.lastIndex - 1) {\n if (S[i] == S[j]) {\n continue\n }\n val a = arrayOf(S[i], S[j])\n sum += when {\n !a.contains('R') -> {\n var n = R[S.lastIndex] - R[j]\n if ((j + (j - i)) <= S.lastIndex && S[j + (j - i)] == 'R') {\n n--\n }\n n\n }\n !a.contains('G') -> {\n var n = G[S.lastIndex] - G[j]\n if ((j + (j - i)) <= S.lastIndex && S[j + (j - i)] == 'G') {\n n--\n }\n n\n }\n !a.contains('B') -> {\n var n = B[S.lastIndex] - B[j]\n if ((j + (j - i)) <= S.lastIndex && S[j + (j - i)] == 'B') {\n n--\n }\n n\n }\n else -> throw IllegalStateException(\"\")\n }\n\n\n }\n }\n println(sum)\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1926, "cpu_time_ms": 294, "memory_kb": 55596}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s702308942", "group_id": "codeNet:p02714", "input_text": "fun main(arg: Array) {\n val (R, G, B) = listOf(0, 1, 2)\n val N = nextInt()\n val S = next()\n val A = S.map {\n when(it) {\n 'R' -> 0\n 'G' -> 1\n 'B' -> 2\n else -> 999\n } }\n val RGB = Array(3) { IntArray(N) }\n A.forEachIndexed { index, ch -> RGB[ch][index] = 1 }\n for (m in 0 until 3)\n for (n in (1 until N).reversed()) RGB[m][n - 1] += RGB[m][n]\n fun get(c: Int, n: Int, m: Int): Int {\n var p = RGB[c][m + 1]\n if (m + (m - n) < N && p == RGB[c][m + (m - n)]) p -= 1\n return p\n }\n var ans = 0L\n for (n in 0 until N - 2) {\n when (A[n]) {\n R -> {\n for (m in n + 1 until N - 1) {\n when (A[m]) {\n G -> {\n ans += get(B, n, m)\n }\n B -> {\n ans += get(G, n, m)\n }\n else -> { }\n }\n }\n }\n G -> {\n for (m in n + 1 until N - 1) {\n when (A[m]) {\n R -> {\n ans += get(B, n, m)\n }\n B -> {\n ans += get(R, n, m)\n }\n else -> { }\n }\n }\n }\n B -> {\n for (m in n + 1 until N - 1) {\n when (A[m]) {\n R -> {\n ans += get(G, n, m)\n }\n G -> {\n ans += get(R, n, m)\n }\n else -> { }\n }\n }\n }\n }\n }\n return println(ans)\n}\nfun Char.toInt() = this - 'A'\n\nfun next() = readLine()!!\nfun nextInt(offset: Int = 0) = Integer.parseInt(next()) + offset\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfLong() = listOfString().map(String::toLong)\nfun listOfDouble() = listOfString().map(String::toDouble)\nfun listOfInt(offset: Int = 0) = listOfString().map { Integer.parseInt(it) + offset }\nfun listOfInt(vararg offset: Int) = listOfString().map { Integer.parseInt(it) }.mapIndexed { index, int -> int + offset[index % offset.size] }\nfun listOfLong(offset: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + offset }\nfun listOfLong(vararg offset: Long) = listOfString().map { java.lang.Long.parseLong(it) }.mapIndexed { index, long -> long + offset[index % offset.size] }\nfun listOfDouble(offset: Double = 0.0) = listOfString().map { java.lang.Double.parseDouble(it) + offset }\nfun pairIntLong() = listOfLong().let { Pair(it[0].toInt(), it[1]) }\nfun tripleIntIntLong() = listOfLong().let { Triple(it[0].toInt(), it[1].toInt(), it[2]) }\nfun tripleIntLongLong() = listOfLong().let { Triple(it[0].toInt(), it[1], it[2]) }\nfun pairIntLong(offset: Pair = Pair(0, 0L)) = listOfLong().let { Pair(it[0].toInt() + offset.first, it[1] + offset.second) }\nfun tripleIntIntLong(offset: Triple = Triple(0, 0, 0L)) = listOfLong().let { Triple(it[0].toInt() + offset.first, it[1].toInt() + offset.second, it[2] + offset.third) }\nfun tripleIntLongLong(offset: Triple = Triple(0, 0L, 0L)) = listOfLong().let { Triple(it[0].toInt() + offset.first, it[1] + offset.second, it[2] + offset.third) }\n", "language": "Kotlin", "metadata": {"date": 1586743536, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s702308942.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s702308942", "user_id": "u408242391"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun main(arg: Array) {\n val (R, G, B) = listOf(0, 1, 2)\n val N = nextInt()\n val S = next()\n val A = S.map {\n when(it) {\n 'R' -> 0\n 'G' -> 1\n 'B' -> 2\n else -> 999\n } }\n val RGB = Array(3) { IntArray(N) }\n A.forEachIndexed { index, ch -> RGB[ch][index] = 1 }\n for (m in 0 until 3)\n for (n in (1 until N).reversed()) RGB[m][n - 1] += RGB[m][n]\n fun get(c: Int, n: Int, m: Int): Int {\n var p = RGB[c][m + 1]\n if (m + (m - n) < N && p == RGB[c][m + (m - n)]) p -= 1\n return p\n }\n var ans = 0L\n for (n in 0 until N - 2) {\n when (A[n]) {\n R -> {\n for (m in n + 1 until N - 1) {\n when (A[m]) {\n G -> {\n ans += get(B, n, m)\n }\n B -> {\n ans += get(G, n, m)\n }\n else -> { }\n }\n }\n }\n G -> {\n for (m in n + 1 until N - 1) {\n when (A[m]) {\n R -> {\n ans += get(B, n, m)\n }\n B -> {\n ans += get(R, n, m)\n }\n else -> { }\n }\n }\n }\n B -> {\n for (m in n + 1 until N - 1) {\n when (A[m]) {\n R -> {\n ans += get(G, n, m)\n }\n G -> {\n ans += get(R, n, m)\n }\n else -> { }\n }\n }\n }\n }\n }\n return println(ans)\n}\nfun Char.toInt() = this - 'A'\n\nfun next() = readLine()!!\nfun nextInt(offset: Int = 0) = Integer.parseInt(next()) + offset\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfLong() = listOfString().map(String::toLong)\nfun listOfDouble() = listOfString().map(String::toDouble)\nfun listOfInt(offset: Int = 0) = listOfString().map { Integer.parseInt(it) + offset }\nfun listOfInt(vararg offset: Int) = listOfString().map { Integer.parseInt(it) }.mapIndexed { index, int -> int + offset[index % offset.size] }\nfun listOfLong(offset: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + offset }\nfun listOfLong(vararg offset: Long) = listOfString().map { java.lang.Long.parseLong(it) }.mapIndexed { index, long -> long + offset[index % offset.size] }\nfun listOfDouble(offset: Double = 0.0) = listOfString().map { java.lang.Double.parseDouble(it) + offset }\nfun pairIntLong() = listOfLong().let { Pair(it[0].toInt(), it[1]) }\nfun tripleIntIntLong() = listOfLong().let { Triple(it[0].toInt(), it[1].toInt(), it[2]) }\nfun tripleIntLongLong() = listOfLong().let { Triple(it[0].toInt(), it[1], it[2]) }\nfun pairIntLong(offset: Pair = Pair(0, 0L)) = listOfLong().let { Pair(it[0].toInt() + offset.first, it[1] + offset.second) }\nfun tripleIntIntLong(offset: Triple = Triple(0, 0, 0L)) = listOfLong().let { Triple(it[0].toInt() + offset.first, it[1].toInt() + offset.second, it[2] + offset.third) }\nfun tripleIntLongLong(offset: Triple = Triple(0, 0L, 0L)) = listOfLong().let { Triple(it[0].toInt() + offset.first, it[1] + offset.second, it[2] + offset.third) }\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3632, "cpu_time_ms": 205, "memory_kb": 41020}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s791659864", "group_id": "codeNet:p02714", "input_text": "\n\nimport java.util.*\n\nfun main(args:Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt() // <= 4000\n val s = sc.next()\n var ans = 0L\n val m = mapOf('R' to 0, 'G' to 1, 'B' to 2)\n\n val acc = IntArray(3){0}\n val counts = Array(3){IntArray(n+1)}\n\n for(i in s.indices) {\n val idx = m[s[i]]!!\n acc[idx]++\n counts[idx][i] = acc[idx]\n }\n\n for(i in 0 until 3) {\n var j = 0\n val count = counts[i]\n while (j < n) {\n if(count[j] != 0) {\n val d = count[j]\n ++j\n while (j < n && count[j] == 0) {\n count[j++] = d\n }\n } else {\n ++j\n }\n }\n }\n // R G B\n for(i in 0 until n) {\n for(j in i + 1 until n) {\n if(s[i] == s[j]) continue\n // 남은 인덱스\n val remain = 3 - (m[s[i]]!! + m[s[j]]!!)\n val diff = j - i\n\n var v = counts[remain][n - 1] - counts[remain][j]\n if(j + diff < n && counts[remain][j + diff] != counts[remain][j + diff - 1]) {\n --v\n }\n\n ans += v \n\n // k > j && k - j > d\n // total remain size - [k <=d + j\n\n // k > j && k - j < d\n // lower bound (j + d) - lower bound(j)\n\n // k - j > d\n // k - j < d\n }\n }\n println(ans)\n\n\n}", "language": "Kotlin", "metadata": {"date": 1586743510, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s791659864.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s791659864", "user_id": "u682597394"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "\n\nimport java.util.*\n\nfun main(args:Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt() // <= 4000\n val s = sc.next()\n var ans = 0L\n val m = mapOf('R' to 0, 'G' to 1, 'B' to 2)\n\n val acc = IntArray(3){0}\n val counts = Array(3){IntArray(n+1)}\n\n for(i in s.indices) {\n val idx = m[s[i]]!!\n acc[idx]++\n counts[idx][i] = acc[idx]\n }\n\n for(i in 0 until 3) {\n var j = 0\n val count = counts[i]\n while (j < n) {\n if(count[j] != 0) {\n val d = count[j]\n ++j\n while (j < n && count[j] == 0) {\n count[j++] = d\n }\n } else {\n ++j\n }\n }\n }\n // R G B\n for(i in 0 until n) {\n for(j in i + 1 until n) {\n if(s[i] == s[j]) continue\n // 남은 인덱스\n val remain = 3 - (m[s[i]]!! + m[s[j]]!!)\n val diff = j - i\n\n var v = counts[remain][n - 1] - counts[remain][j]\n if(j + diff < n && counts[remain][j + diff] != counts[remain][j + diff - 1]) {\n --v\n }\n\n ans += v \n\n // k > j && k - j > d\n // total remain size - [k <=d + j\n\n // k > j && k - j < d\n // lower bound (j + d) - lower bound(j)\n\n // k - j > d\n // k - j < d\n }\n }\n println(ans)\n\n\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1443, "cpu_time_ms": 323, "memory_kb": 39956}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s152926448", "group_id": "codeNet:p02714", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val n = readInt()\n val s = read().toCharArray()\n val rCsum = Array(n+1) { 0L }\n val gCsum = Array(n+1) { 0L }\n val bCsum = Array(n+1) { 0L }\n for(i in 0 until s.size) {\n val c = s[i]\n val append = when(c) {\n 'R' -> { listOf(1L, 0L, 0L) }\n 'G' -> { listOf(0L, 1L, 0L) }\n else -> {listOf(0L, 0L, 1L) }\n }\n rCsum[i+1] = rCsum[i] + append[0]\n gCsum[i+1] = gCsum[i] + append[1]\n bCsum[i+1] = bCsum[i] + append[2]\n }\n\n var cnt = 0L\n for(i in 0 until n) {\n val c1 = s[i]\n if(c1 == 'R') {\n for(j in 0 until n) {\n val c2 = s[j]\n if(c2 == 'G') {\n val abs = Math.abs(i - j)\n val cands = mutableListOf(i - abs, i + abs, j - abs, j + abs)\n if(abs % 2 == 0) {\n cands.add(Math.max(i, j) - abs/2)\n }\n var removed = 0L\n cands.forEach { it ->\n if(it >= 0 && it < n) {\n if(s[it] == 'B') {\n removed++\n }\n }\n }\n val tmp = bCsum[n] - removed\n cnt += tmp\n }\n }\n }\n }\n println(cnt)\n\tpw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n\t= this.groupBy { it }.mapValues { it.value.size }\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element >= this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn l\n}\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element <= this[mid]) { \n\t\t\tr = mid\n\t\t} else {\n\t\t\tl = mid + 1\n\t\t}\n\t}\n\treturn r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n\tval divisors = mutableListOf()\n\tfor(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n\t\tif(this % i == 0L) {\n\t\t\tdivisors.add(i)\n\t\t\tif(i != this/i) {\n\t\t\t\tdivisors.add(this/i)\n\t\t\t}\n\t\t}\n\t}\n\treturn divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n\tif(this==1L) return false\n\tfor(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n\t\tif(this % i == 0L && this != i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n\nfun permutations(src: List): List> {\n\tif(src.size == 1) return listOf(src)\n\tval perms = mutableListOf>()\n\tval insertElement = src[0]\n\tpermutations(src.drop(1)).forEach { perm ->\n\t\tfor(i in 0..perm.size) {\n\t\t\tval newPerm = perm.toMutableList()\n\t\t\tnewPerm.add(i, insertElement)\n\t\t\tperms.add(newPerm.toList())\n\t\t}\n\t}\n\treturn perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n\tval v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n\tfor(i in 0 until v.size) {\n\t\tv[i][0] = 1L\n\t\tv[i][i] = 1L\n\t}\n\tfor(i in 0 until v.size) {\n\t\tfor(j in 1 until i) {\n\t\t\tv[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n\t\t}\n\t}\n\treturn v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n\twhen {\n\t\tn == 1L -> a % mod\n\t\tn % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n\t\telse -> {\n\t\t\tval tmp = repeatedModPow(a, n / 2L, mod)\n\t\t\t(tmp * tmp) % mod\n\t\t}\n\t}\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n\tvar ret = 1L\n\tval min = Math.min(k, n-k)\n\t// まず分母の計算\n\tfor(i in n downTo (n - min + 1)) {\n\t\tret = ret * i % mod\n\t}\n\tfor(i in min downTo 1) {\n\t\tret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n\t}\n\treturn ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n\tval factorials = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval inverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval factorialInverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tfor(i in 2 .. n) {\n\t\tfactorials[i] = (factorials[i-1] * i.toLong() % mod)\n\t\tinverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n\t\tfactorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n\t}\n\n\treturn factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n\tif(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n\ta / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n\tvar num = num_\n\tvar rtn: Long = 0\n\twhile(num != 0.toLong()) {\n\t\tval tmp = num % 10\n\t\trtn += tmp\n\t\tnum /= 10\n\t}\n\treturn rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n\tprivate val parent: Array = Array(n) { 0 }\n\tprivate val rank: Array = Array(n) { 0 }\n\tprivate val size: Array = Array(n) { 0 }\n\n\tinit {\n\t\tfor(i in 0 until n) {\n\t\t\tparent[i] = i\n\t\t\trank[i] = 1\n\t\t\tsize[i] = 1\n\t\t}\n\t}\n\n\tfun union(u: Int, v: Int) {\n\t\tvar x = root(u)\n\t\tvar y = root(v)\n\t\tif(x != y) {\n\t\t\tif(rank[y] < rank[x]) {\n\t\t\t\tval tmp = y \n\t\t\t\ty = x\n\t\t\t\tx = tmp \n\t\t\t}\n\t\t\tparent[x] = y\n\t\t\trank[y] += rank[x]\n\t\t\trank[x] = -1\n\t\t\tval totalSize = size[x] + size[y]\n\t\t\tsize[x] = totalSize\n\t\t\tsize[y] = totalSize\n\t\t}\n\t}\n\n\tfun root(u: Int): Int {\n\t\tvar x = u\n\t\twhile(parent[x] != x) {\n\t\t\tx = parent[x]\n\t\t}\n\t\treturn x \n\t}\n\n\tfun size(u: Int): Int = size[root(u)]\n}\n", "language": "Kotlin", "metadata": {"date": 1586743388, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s152926448.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s152926448", "user_id": "u026686258"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val n = readInt()\n val s = read().toCharArray()\n val rCsum = Array(n+1) { 0L }\n val gCsum = Array(n+1) { 0L }\n val bCsum = Array(n+1) { 0L }\n for(i in 0 until s.size) {\n val c = s[i]\n val append = when(c) {\n 'R' -> { listOf(1L, 0L, 0L) }\n 'G' -> { listOf(0L, 1L, 0L) }\n else -> {listOf(0L, 0L, 1L) }\n }\n rCsum[i+1] = rCsum[i] + append[0]\n gCsum[i+1] = gCsum[i] + append[1]\n bCsum[i+1] = bCsum[i] + append[2]\n }\n\n var cnt = 0L\n for(i in 0 until n) {\n val c1 = s[i]\n if(c1 == 'R') {\n for(j in 0 until n) {\n val c2 = s[j]\n if(c2 == 'G') {\n val abs = Math.abs(i - j)\n val cands = mutableListOf(i - abs, i + abs, j - abs, j + abs)\n if(abs % 2 == 0) {\n cands.add(Math.max(i, j) - abs/2)\n }\n var removed = 0L\n cands.forEach { it ->\n if(it >= 0 && it < n) {\n if(s[it] == 'B') {\n removed++\n }\n }\n }\n val tmp = bCsum[n] - removed\n cnt += tmp\n }\n }\n }\n }\n println(cnt)\n\tpw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n\t= this.groupBy { it }.mapValues { it.value.size }\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element >= this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn l\n}\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element <= this[mid]) { \n\t\t\tr = mid\n\t\t} else {\n\t\t\tl = mid + 1\n\t\t}\n\t}\n\treturn r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n\tval divisors = mutableListOf()\n\tfor(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n\t\tif(this % i == 0L) {\n\t\t\tdivisors.add(i)\n\t\t\tif(i != this/i) {\n\t\t\t\tdivisors.add(this/i)\n\t\t\t}\n\t\t}\n\t}\n\treturn divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n\tif(this==1L) return false\n\tfor(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n\t\tif(this % i == 0L && this != i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n\nfun permutations(src: List): List> {\n\tif(src.size == 1) return listOf(src)\n\tval perms = mutableListOf>()\n\tval insertElement = src[0]\n\tpermutations(src.drop(1)).forEach { perm ->\n\t\tfor(i in 0..perm.size) {\n\t\t\tval newPerm = perm.toMutableList()\n\t\t\tnewPerm.add(i, insertElement)\n\t\t\tperms.add(newPerm.toList())\n\t\t}\n\t}\n\treturn perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n\tval v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n\tfor(i in 0 until v.size) {\n\t\tv[i][0] = 1L\n\t\tv[i][i] = 1L\n\t}\n\tfor(i in 0 until v.size) {\n\t\tfor(j in 1 until i) {\n\t\t\tv[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n\t\t}\n\t}\n\treturn v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n\twhen {\n\t\tn == 1L -> a % mod\n\t\tn % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n\t\telse -> {\n\t\t\tval tmp = repeatedModPow(a, n / 2L, mod)\n\t\t\t(tmp * tmp) % mod\n\t\t}\n\t}\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n\tvar ret = 1L\n\tval min = Math.min(k, n-k)\n\t// まず分母の計算\n\tfor(i in n downTo (n - min + 1)) {\n\t\tret = ret * i % mod\n\t}\n\tfor(i in min downTo 1) {\n\t\tret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n\t}\n\treturn ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n\tval factorials = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval inverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval factorialInverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tfor(i in 2 .. n) {\n\t\tfactorials[i] = (factorials[i-1] * i.toLong() % mod)\n\t\tinverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n\t\tfactorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n\t}\n\n\treturn factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n\tif(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n\ta / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n\tvar num = num_\n\tvar rtn: Long = 0\n\twhile(num != 0.toLong()) {\n\t\tval tmp = num % 10\n\t\trtn += tmp\n\t\tnum /= 10\n\t}\n\treturn rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n\tprivate val parent: Array = Array(n) { 0 }\n\tprivate val rank: Array = Array(n) { 0 }\n\tprivate val size: Array = Array(n) { 0 }\n\n\tinit {\n\t\tfor(i in 0 until n) {\n\t\t\tparent[i] = i\n\t\t\trank[i] = 1\n\t\t\tsize[i] = 1\n\t\t}\n\t}\n\n\tfun union(u: Int, v: Int) {\n\t\tvar x = root(u)\n\t\tvar y = root(v)\n\t\tif(x != y) {\n\t\t\tif(rank[y] < rank[x]) {\n\t\t\t\tval tmp = y \n\t\t\t\ty = x\n\t\t\t\tx = tmp \n\t\t\t}\n\t\t\tparent[x] = y\n\t\t\trank[y] += rank[x]\n\t\t\trank[x] = -1\n\t\t\tval totalSize = size[x] + size[y]\n\t\t\tsize[x] = totalSize\n\t\t\tsize[y] = totalSize\n\t\t}\n\t}\n\n\tfun root(u: Int): Int {\n\t\tvar x = u\n\t\twhile(parent[x] != x) {\n\t\t\tx = parent[x]\n\t\t}\n\t\treturn x \n\t}\n\n\tfun size(u: Int): Int = size[root(u)]\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6514, "cpu_time_ms": 363, "memory_kb": 57284}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s060931799", "group_id": "codeNet:p02714", "input_text": "@ExperimentalStdlibApi\nfun main(args: Array) = abc162d()\n\n@ExperimentalStdlibApi\nfun abc162d() {\n val n = readLine()!!.toInt()\n val s = readLine()!!\n\n val csRed = s.scan(0) { acc, c -> acc + if (c == 'R') 1 else 0 }.toIntArray()\n val csGreen = s.scan(0) { acc, c -> acc + if (c == 'G') 1 else 0 }.toIntArray()\n val csBlue = s.scan(0) { acc, c -> acc + if (c == 'B') 1 else 0 }.toIntArray()\n\n val list = listOf(csRed, csGreen, csBlue)\n\n var answer = 0L\n\n for (i in 0 until n) {\n val c = s[i]\n val other = when (c) {\n 'R' -> list - csRed\n 'G' -> list - csGreen\n else -> list - csBlue\n }\n for (j in i + 1 until n) {\n val c2 = s[j]\n if (c2 == c) continue\n val remain = when (c2) {\n 'R' -> other - csRed\n 'G' -> other - csGreen\n else -> other - csBlue\n }[0]\n\n val jump = j + (j - i) + 1\n\n answer += remain.last() - remain[j] -\n if (jump in remain.indices) remain[jump] - remain[jump - 1] else 0\n }\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1586743308, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s060931799.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s060931799", "user_id": "u139478771"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "@ExperimentalStdlibApi\nfun main(args: Array) = abc162d()\n\n@ExperimentalStdlibApi\nfun abc162d() {\n val n = readLine()!!.toInt()\n val s = readLine()!!\n\n val csRed = s.scan(0) { acc, c -> acc + if (c == 'R') 1 else 0 }.toIntArray()\n val csGreen = s.scan(0) { acc, c -> acc + if (c == 'G') 1 else 0 }.toIntArray()\n val csBlue = s.scan(0) { acc, c -> acc + if (c == 'B') 1 else 0 }.toIntArray()\n\n val list = listOf(csRed, csGreen, csBlue)\n\n var answer = 0L\n\n for (i in 0 until n) {\n val c = s[i]\n val other = when (c) {\n 'R' -> list - csRed\n 'G' -> list - csGreen\n else -> list - csBlue\n }\n for (j in i + 1 until n) {\n val c2 = s[j]\n if (c2 == c) continue\n val remain = when (c2) {\n 'R' -> other - csRed\n 'G' -> other - csGreen\n else -> other - csBlue\n }[0]\n\n val jump = j + (j - i) + 1\n\n answer += remain.last() - remain[j] -\n if (jump in remain.indices) remain[jump] - remain[jump - 1] else 0\n }\n }\n\n println(answer)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1152, "cpu_time_ms": 396, "memory_kb": 56172}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s358770787", "group_id": "codeNet:p02714", "input_text": "import kotlin.math.absoluteValue\n\nfun main(args: Array) {\n val line = readLine()!!.trim()\n val n = line.toInt()\n val line2 = readLine()!!.trim()\n val s: String = line2\n val rs: MutableList = mutableListOf()\n val gs: MutableList = mutableListOf()\n val bs: MutableList = mutableListOf()\n\n s.take(n).mapIndexed {i, c ->\n if (c == 'R') {\n rs.add(i)\n }\n\n if (c == 'G') {\n gs.add(i)\n }\n\n if (c == 'B') {\n bs.add(i)\n }\n }\n\n\n var result: Long = 0L\n\n for (ri in rs) {\n for (gi in gs) {\n for (bi in bs) {\n if (diffDist(ri, gi, bi)) {\n result += 1\n }\n }\n }\n }\n\n println(\"${result}\")\n}\n\nfun diffDist(a: Int, b: Int, c: Int): Boolean {\n val d = (b - a).absoluteValue\n val e = (c - b).absoluteValue\n val f = (c - a).absoluteValue\n\n return d != e && e != f && d != f\n}\n", "language": "Kotlin", "metadata": {"date": 1586742881, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s358770787.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s358770787", "user_id": "u146343951"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import kotlin.math.absoluteValue\n\nfun main(args: Array) {\n val line = readLine()!!.trim()\n val n = line.toInt()\n val line2 = readLine()!!.trim()\n val s: String = line2\n val rs: MutableList = mutableListOf()\n val gs: MutableList = mutableListOf()\n val bs: MutableList = mutableListOf()\n\n s.take(n).mapIndexed {i, c ->\n if (c == 'R') {\n rs.add(i)\n }\n\n if (c == 'G') {\n gs.add(i)\n }\n\n if (c == 'B') {\n bs.add(i)\n }\n }\n\n\n var result: Long = 0L\n\n for (ri in rs) {\n for (gi in gs) {\n for (bi in bs) {\n if (diffDist(ri, gi, bi)) {\n result += 1\n }\n }\n }\n }\n\n println(\"${result}\")\n}\n\nfun diffDist(a: Int, b: Int, c: Int): Boolean {\n val d = (b - a).absoluteValue\n val e = (c - b).absoluteValue\n val f = (c - a).absoluteValue\n\n return d != e && e != f && d != f\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 988, "cpu_time_ms": 2207, "memory_kb": 53040}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s845484163", "group_id": "codeNet:p02714", "input_text": "private fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() // single long\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map(String::toInt) // list of ints\nprivate fun readLongs() = readStrings().map(String::toLong) // list of longs\n\nfun main(args: Array) {\n val n = readInt()\n val s = readLn().toCharArray()\n\n val r = s.count { it == 'R' }\n val g = s.count { it == 'G' }\n val b = s.count { it == 'B' }\n\n var t = (r.toLong() * g.toLong() * b.toLong())\n\n (0..n - 3).forEach {i ->\n (i..n - 2).forEach { j ->\n val k = 2 * j - i\n if (k < n) {\n if (s[i] != s[j] && s[j] != s[k] && s[k] != s[i]) {\n t--\n }\n }\n }\n }\n println(t)\n}\n", "language": "Kotlin", "metadata": {"date": 1586741954, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s845484163.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s845484163", "user_id": "u059223549"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "private fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() // single long\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map(String::toInt) // list of ints\nprivate fun readLongs() = readStrings().map(String::toLong) // list of longs\n\nfun main(args: Array) {\n val n = readInt()\n val s = readLn().toCharArray()\n\n val r = s.count { it == 'R' }\n val g = s.count { it == 'G' }\n val b = s.count { it == 'B' }\n\n var t = (r.toLong() * g.toLong() * b.toLong())\n\n (0..n - 3).forEach {i ->\n (i..n - 2).forEach { j ->\n val k = 2 * j - i\n if (k < n) {\n if (s[i] != s[j] && s[j] != s[k] && s[k] != s[i]) {\n t--\n }\n }\n }\n }\n println(t)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 903, "cpu_time_ms": 167, "memory_kb": 36652}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s605943269", "group_id": "codeNet:p02714", "input_text": "fun main (args: Array) {\n readLine()!!.toInt()\n val s = readLine()!!.map {it - 'A'}\n\n var ans = 0\n for (a in 0 until s.size - 2) {\n for (b in a until s.size - 1) {\n for (c in b until s.size) {\n if (s[a] != s[b] && s[b] != s[c] && s[c] != s[a]) {\n if (b - a != c - b) {\n ans++\n }\n }\n }\n }\n }\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1586741932, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s605943269.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s605943269", "user_id": "u664864246"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun main (args: Array) {\n readLine()!!.toInt()\n val s = readLine()!!.map {it - 'A'}\n\n var ans = 0\n for (a in 0 until s.size - 2) {\n for (b in a until s.size - 1) {\n for (c in b until s.size) {\n if (s[a] != s[b] && s[b] != s[c] && s[c] != s[a]) {\n if (b - a != c - b) {\n ans++\n }\n }\n }\n }\n }\n println(ans)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 379, "cpu_time_ms": 2206, "memory_kb": 36872}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s410254164", "group_id": "codeNet:p02714", "input_text": "fun main(args:Array){\n val n = readLine()!!.toInt()\n val l = readLine()!!\n var result = 0\n for(i in 0..n-3){\n for(j in i+1..n-2){\n for(k in j+1..n-1){\n if(l[i]!=l[j]&&l[j]!=l[k]&&l[k]!=l[i]&&k-j!=j-i){\n result ++\n }\n }\n }\n }\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1586741681, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s410254164.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s410254164", "user_id": "u943726499"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun main(args:Array){\n val n = readLine()!!.toInt()\n val l = readLine()!!\n var result = 0\n for(i in 0..n-3){\n for(j in i+1..n-2){\n for(k in j+1..n-1){\n if(l[i]!=l[j]&&l[j]!=l[k]&&l[k]!=l[i]&&k-j!=j-i){\n result ++\n }\n }\n }\n }\n println(result)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 352, "cpu_time_ms": 2206, "memory_kb": 36840}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s590687689", "group_id": "codeNet:p02714", "input_text": "fun main(args: Array) {\n val N = readInt()\n val S = readString()\n\n val memoL = Array(N) { Array(3) { 0 } }\n val memoR = Array(N) { Array(3) { 0 } }\n\n var cntR = 0\n var cntG = 0\n var cntB = 0\n for (i in 0 until N) {\n val c = S[i]\n if (c == 'R') cntR++\n if (c == 'G') cntG++\n if (c == 'B') cntB++\n memoL[i][0] = cntR\n memoL[i][1] = cntG\n memoL[i][2] = cntB\n }\n cntR = 0\n cntG = 0\n cntB = 0\n for (i in N - 1 downTo 0) {\n val c = S[i]\n if (c == 'R') cntR++\n if (c == 'G') cntG++\n if (c == 'B') cntB++\n memoR[i][0] = cntR\n memoR[i][1] = cntG\n memoR[i][2] = cntB\n }\n// println(memoL.joinToString { it.joinToString(\":\") })\n// println(memoR.joinToString { it.joinToString(\":\") })\n\n var cnt = 0L\n for (i in 0 until N) {\n val c = S[i]\n if (c == 'R') cnt += memoL[i][1] * memoR[i][2] + memoL[i][2] * memoR[i][1]\n if (c == 'G') cnt += memoL[i][0] * memoR[i][2] + memoL[i][2] * memoR[i][0]\n if (c == 'B') cnt += memoL[i][0] * memoR[i][1] + memoL[i][1] * memoR[i][0]\n for (j in 1..N) {\n val l = S.getOrNull(i - j) ?: break\n val r = S.getOrNull(i + j) ?: break\n if (l != c && c != r && l != r) cnt--\n }\n }\n println(cnt)\n}\n\nfun readString() = readLine()!!\nfun readStrings() = readString().split(\" \")\nfun readInt() = readString().toInt()\nfun readInts() = readStrings().map { it.toInt() }\nfun readLong() = readString().toLong()\nfun readLongs() = readStrings().map { it.toLong() }\n", "language": "Kotlin", "metadata": {"date": 1586741477, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s590687689.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s590687689", "user_id": "u979004569"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readInt()\n val S = readString()\n\n val memoL = Array(N) { Array(3) { 0 } }\n val memoR = Array(N) { Array(3) { 0 } }\n\n var cntR = 0\n var cntG = 0\n var cntB = 0\n for (i in 0 until N) {\n val c = S[i]\n if (c == 'R') cntR++\n if (c == 'G') cntG++\n if (c == 'B') cntB++\n memoL[i][0] = cntR\n memoL[i][1] = cntG\n memoL[i][2] = cntB\n }\n cntR = 0\n cntG = 0\n cntB = 0\n for (i in N - 1 downTo 0) {\n val c = S[i]\n if (c == 'R') cntR++\n if (c == 'G') cntG++\n if (c == 'B') cntB++\n memoR[i][0] = cntR\n memoR[i][1] = cntG\n memoR[i][2] = cntB\n }\n// println(memoL.joinToString { it.joinToString(\":\") })\n// println(memoR.joinToString { it.joinToString(\":\") })\n\n var cnt = 0L\n for (i in 0 until N) {\n val c = S[i]\n if (c == 'R') cnt += memoL[i][1] * memoR[i][2] + memoL[i][2] * memoR[i][1]\n if (c == 'G') cnt += memoL[i][0] * memoR[i][2] + memoL[i][2] * memoR[i][0]\n if (c == 'B') cnt += memoL[i][0] * memoR[i][1] + memoL[i][1] * memoR[i][0]\n for (j in 1..N) {\n val l = S.getOrNull(i - j) ?: break\n val r = S.getOrNull(i + j) ?: break\n if (l != c && c != r && l != r) cnt--\n }\n }\n println(cnt)\n}\n\nfun readString() = readLine()!!\nfun readStrings() = readString().split(\" \")\nfun readInt() = readString().toInt()\nfun readInts() = readStrings().map { it.toInt() }\nfun readLong() = readString().toLong()\nfun readLongs() = readStrings().map { it.toLong() }\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1465, "cpu_time_ms": 238, "memory_kb": 39280}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s496428655", "group_id": "codeNet:p02714", "input_text": "import java.io.PrintWriter\n\nfun main() {\n val pw = PrintWriter(System.out)\n\n val n = readInputLine().toInt()\n val s = readInputLine().toCharArray()\n\n val rCnt = s.count { it == 'R' }.toLong()\n val gCnt = s.count { it == 'G' }.toLong()\n val bCnt = s.count { it == 'B' }.toLong()\n\n var ans = rCnt * bCnt * gCnt\n\n for (i in s.indices) {\n for (j in i - 1 downTo 0) {\n if (i - (i - j) * 2 < 0) {\n break\n }\n if (s[i] != s[j] && s[i] != s[i - (i - j) * 2] && s[j] != s[i - (i - j) * 2]) {\n ans--\n }\n }\n }\n\n pw.println(ans)\n\n pw.flush()\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "language": "Kotlin", "metadata": {"date": 1586740885, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s496428655.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s496428655", "user_id": "u505558493"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun main() {\n val pw = PrintWriter(System.out)\n\n val n = readInputLine().toInt()\n val s = readInputLine().toCharArray()\n\n val rCnt = s.count { it == 'R' }.toLong()\n val gCnt = s.count { it == 'G' }.toLong()\n val bCnt = s.count { it == 'B' }.toLong()\n\n var ans = rCnt * bCnt * gCnt\n\n for (i in s.indices) {\n for (j in i - 1 downTo 0) {\n if (i - (i - j) * 2 < 0) {\n break\n }\n if (s[i] != s[j] && s[i] != s[i - (i - j) * 2] && s[j] != s[i - (i - j) * 2]) {\n ans--\n }\n }\n }\n\n pw.println(ans)\n\n pw.flush()\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 709, "cpu_time_ms": 134, "memory_kb": 36216}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s377205416", "group_id": "codeNet:p02714", "input_text": "import java.io.*\nimport java.lang.*\nimport java.util.*\n\n// Constant\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 2147483647\nconst val LINF = 9223372036854775807L\n\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\n\nfun solve() {\n val n = nextInt()\n val s = next()\n val red = intAry(n + 1)\n val green = intAry(n + 1)\n val blue = intAry(n + 1)\n for (i in n - 1 downTo 0){\n red[i] = red[i + 1]\n green[i] = green[i + 1]\n blue[i] = blue[i + 1]\n when(s[i]){\n 'R' -> red[i] += 1\n 'G' -> green[i] += 1\n 'B' -> blue[i] += 1\n }\n }\n\n var ans = 0\n for (i in 0 until n - 2){\n for (j in i + 1 until n - 1){\n if(s[i] == s[j]) continue\n val gap = j - i\n when{\n (s[i] == 'R' && s[j] == 'G') || (s[i] == 'G' && s[j] == 'R') -> {\n var tmp = blue[j]\n if(j + gap < n && s[j + gap] == 'B') tmp--\n ans += tmp\n }\n (s[i] == 'R' && s[j] == 'B') || (s[i] == 'B' && s[j] == 'R') -> {\n var tmp = green[j]\n if(j + gap < n && s[j + gap] == 'G') tmp--\n ans += tmp\n }\n (s[i] == 'G' && s[j] == 'B') || (s[i] == 'B' && s[j] == 'G') -> {\n var tmp = red[j]\n if(j + gap < n && s[j + gap] == 'R') tmp--\n ans += tmp\n }\n }\n\n }\n }\n\n println(ans)\n\n}\n\n\n\n\n// Output\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\nfun next() = sc.next()\nfun nextInt() = sc.nextInt()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Int): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextIntAry(n: Int): IntArray {\n val ary = intAry(n)\n for (i in 0 until n) ary[i] = nextInt()\n return ary\n}\nfun nextLongAry(n: Int): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Int): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\nfun ary(n: Int, init: String = \"\") = Array(n) { init }\nfun intAry(n: Int, init: Int = 0) = IntArray(n) { init }\nfun longAry(n: Int, init: Long = 0L) = LongArray(n) { init }\nfun doubleAry(n: Int, init: Double = 0.0) = DoubleArray(n) { init }\nfun ary2(n: Int, m: Int, init: String = \"\") = Array(n) { Array(m) { init } }\nfun intAry2(n: Int, m: Int, init: Int = 0) = Array(n) { IntArray(m) { init } }\nfun longAry2(n: Int, m: Int, init: Long = 0) = Array(n) { LongArray(m) { init } }\nfun doubleAry2(n: Int, m: Int, init: Double = 0.0) = Array(n) { DoubleArray(m) { init } }\nfun ary3(n: Int, m: Int, k: Int, init: String = \"\") = Array(n) { Array(m) { Array(k) { init } } }\nfun intAry3(n: Int, m: Int, k: Int, init: Int = 0) = Array(n) { Array(m) { IntArray(k) { init } } }\nfun longAry3(n: Int, m: Int, k: Int, init: Long = 0L) = Array(n) { Array(m) { LongArray(k) { init } } }\nfun doubleAry3(n: Int, m: Int, k: Int, init: Double = 0.0) = Array(n) { Array(m) { DoubleArray(k) { init } } }\nfun list() = mutableListOf()\nfun intList() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun intSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\nval addIntFunc = {a: Int, b: Int -> a + b}\nval addLongFunc = {a: Long, b: Long -> a + b}\nval mulIntFunc = {a: Int, b: Int -> a * b}\nval mulLongFunc = {a: Long, b: Long -> a * b}\nval maxIntFunc = {a: Int, b: Int -> max(a, b)}\nval maxLongFunc = {a: Long, b: Long -> max(a, b)}\nval minIntFunc = {a: Int, b: Int -> min(a, b)}\nval minLongFunc = {a: Long, b: Long -> min(a, b)}\nval gcdIntFunc = {a: Int, b: Int -> gcd(a, b)}\nval gcdLongFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmIntFunc = {a: Int, b: Int -> lcm(a, b)}\nval lcmLongFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorIntFunc = {a: Int, b: Int -> a xor b}\nval xorLongFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Int, b: Int, op: (Int, Int) -> Int) = op(a, b)\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\nfun Int.a() = this.toLong()\nfun Long.a() = this.toInt()\nfun IntArray.lowerBound(n: Int): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.lowerBound(n: Long): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.intLowerBound(n: Int): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun IntArray.cumsum(op: (Int, Int) -> Int): IntArray {\n val s = intAry(this.size + 1)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Int) {\n repeat(n) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.intCounting(n: Int) {\n repeat(n) {\n val a = nextInt()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Int) {\n repeat(n) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\nfun abs(n: Int): Int = Math.abs(n)\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Int) = if (values.isEmpty()) -INF else values.max()!!\nfun max(vararg values: Long) = if (values.isEmpty()) -LINF else values.max()!!\nfun min(vararg values: Int) = if (values.isEmpty()) INF else values.min()!!\nfun min(vararg values: Long) = if (values.isEmpty()) LINF else values.min()!!\ntailrec fun gcd(a: Int, b: Int): Int = if (b == 0) a else if (a % b == 0) b else gcd(b, (a % b))\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Int, b: Int): Int = a / gcd(a, b) * b\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Int) {\n private val fac = LongArray(max)\n private val finv = LongArray(max)\n private val inv = LongArray(max)\n private val p = MOD.a()\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Int, r: Int): Long = if (n < r || (n < 0 || r < 0)) 0 else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Int, private var searched: Int = 0, private var nextIndex: Int = 0) {\n private val size = fact(n)\n private val permList = Array(size) { IntArray(n) { 0 } }\n\n private tailrec fun fact(n: Int, ans: Int = 1): Int {\n return if (n == 0) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, IntArray(n) { 0 }, Array(n) { false })\n }\n\n private fun create(num: Int, list: IntArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): IntArray = permList[nextIndex++]\n}\n\n// Graph\ndata class Node(val id: Int, var past: Int = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Int, val to: Int, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Int, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Int): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size, -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Int): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size, LINF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\nclass UnionFind(size: Int) {\n private val par = IntArray(size) { it }\n private val size = IntArray(size) { 1 }\n fun root(x: Int): Int {\n return if (par[x] == x) {\n x\n } else {\n par[x] = root(par[x])\n par[x]\n }\n }\n\n fun same(x: Int, y: Int): Boolean = root(x) == root(y)\n fun unite(x: Int, y: Int) {\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n }\n size[a] += size[b]\n par[b] = a\n }\n\n fun size(x: Int): Int = size[root(x)]\n}\n\nclass IntSegmentTree(\n private val a: IntArray,\n private val op: (Int, Int) -> Int,\n private val def: Int = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = intAry(2 * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Int, value: Int) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Int, b: Int) = getSub(a, b, 0, 0, n)\n fun getSub(a: Int, b: Int, k: Int, l: Int, r: Int): Int {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\nclass LongSegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2 * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Int, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Int, b: Int) = getSub(a, b, 0, 0, n)\n fun getSub(a: Int, b: Int, k: Int, l: Int, r: Int): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n if (buflen <= 0) false\n true\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n}", "language": "Kotlin", "metadata": {"date": 1586740722, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s377205416.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s377205416", "user_id": "u581625805"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.*\nimport java.lang.*\nimport java.util.*\n\n// Constant\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 2147483647\nconst val LINF = 9223372036854775807L\n\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\n\nfun solve() {\n val n = nextInt()\n val s = next()\n val red = intAry(n + 1)\n val green = intAry(n + 1)\n val blue = intAry(n + 1)\n for (i in n - 1 downTo 0){\n red[i] = red[i + 1]\n green[i] = green[i + 1]\n blue[i] = blue[i + 1]\n when(s[i]){\n 'R' -> red[i] += 1\n 'G' -> green[i] += 1\n 'B' -> blue[i] += 1\n }\n }\n\n var ans = 0\n for (i in 0 until n - 2){\n for (j in i + 1 until n - 1){\n if(s[i] == s[j]) continue\n val gap = j - i\n when{\n (s[i] == 'R' && s[j] == 'G') || (s[i] == 'G' && s[j] == 'R') -> {\n var tmp = blue[j]\n if(j + gap < n && s[j + gap] == 'B') tmp--\n ans += tmp\n }\n (s[i] == 'R' && s[j] == 'B') || (s[i] == 'B' && s[j] == 'R') -> {\n var tmp = green[j]\n if(j + gap < n && s[j + gap] == 'G') tmp--\n ans += tmp\n }\n (s[i] == 'G' && s[j] == 'B') || (s[i] == 'B' && s[j] == 'G') -> {\n var tmp = red[j]\n if(j + gap < n && s[j + gap] == 'R') tmp--\n ans += tmp\n }\n }\n\n }\n }\n\n println(ans)\n\n}\n\n\n\n\n// Output\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\nfun next() = sc.next()\nfun nextInt() = sc.nextInt()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Int): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextIntAry(n: Int): IntArray {\n val ary = intAry(n)\n for (i in 0 until n) ary[i] = nextInt()\n return ary\n}\nfun nextLongAry(n: Int): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Int): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\nfun ary(n: Int, init: String = \"\") = Array(n) { init }\nfun intAry(n: Int, init: Int = 0) = IntArray(n) { init }\nfun longAry(n: Int, init: Long = 0L) = LongArray(n) { init }\nfun doubleAry(n: Int, init: Double = 0.0) = DoubleArray(n) { init }\nfun ary2(n: Int, m: Int, init: String = \"\") = Array(n) { Array(m) { init } }\nfun intAry2(n: Int, m: Int, init: Int = 0) = Array(n) { IntArray(m) { init } }\nfun longAry2(n: Int, m: Int, init: Long = 0) = Array(n) { LongArray(m) { init } }\nfun doubleAry2(n: Int, m: Int, init: Double = 0.0) = Array(n) { DoubleArray(m) { init } }\nfun ary3(n: Int, m: Int, k: Int, init: String = \"\") = Array(n) { Array(m) { Array(k) { init } } }\nfun intAry3(n: Int, m: Int, k: Int, init: Int = 0) = Array(n) { Array(m) { IntArray(k) { init } } }\nfun longAry3(n: Int, m: Int, k: Int, init: Long = 0L) = Array(n) { Array(m) { LongArray(k) { init } } }\nfun doubleAry3(n: Int, m: Int, k: Int, init: Double = 0.0) = Array(n) { Array(m) { DoubleArray(k) { init } } }\nfun list() = mutableListOf()\nfun intList() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun intSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\nval addIntFunc = {a: Int, b: Int -> a + b}\nval addLongFunc = {a: Long, b: Long -> a + b}\nval mulIntFunc = {a: Int, b: Int -> a * b}\nval mulLongFunc = {a: Long, b: Long -> a * b}\nval maxIntFunc = {a: Int, b: Int -> max(a, b)}\nval maxLongFunc = {a: Long, b: Long -> max(a, b)}\nval minIntFunc = {a: Int, b: Int -> min(a, b)}\nval minLongFunc = {a: Long, b: Long -> min(a, b)}\nval gcdIntFunc = {a: Int, b: Int -> gcd(a, b)}\nval gcdLongFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmIntFunc = {a: Int, b: Int -> lcm(a, b)}\nval lcmLongFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorIntFunc = {a: Int, b: Int -> a xor b}\nval xorLongFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Int, b: Int, op: (Int, Int) -> Int) = op(a, b)\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\nfun Int.a() = this.toLong()\nfun Long.a() = this.toInt()\nfun IntArray.lowerBound(n: Int): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.lowerBound(n: Long): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.intLowerBound(n: Int): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun IntArray.cumsum(op: (Int, Int) -> Int): IntArray {\n val s = intAry(this.size + 1)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Int) {\n repeat(n) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.intCounting(n: Int) {\n repeat(n) {\n val a = nextInt()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Int) {\n repeat(n) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\nfun abs(n: Int): Int = Math.abs(n)\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Int) = if (values.isEmpty()) -INF else values.max()!!\nfun max(vararg values: Long) = if (values.isEmpty()) -LINF else values.max()!!\nfun min(vararg values: Int) = if (values.isEmpty()) INF else values.min()!!\nfun min(vararg values: Long) = if (values.isEmpty()) LINF else values.min()!!\ntailrec fun gcd(a: Int, b: Int): Int = if (b == 0) a else if (a % b == 0) b else gcd(b, (a % b))\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Int, b: Int): Int = a / gcd(a, b) * b\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Int) {\n private val fac = LongArray(max)\n private val finv = LongArray(max)\n private val inv = LongArray(max)\n private val p = MOD.a()\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Int, r: Int): Long = if (n < r || (n < 0 || r < 0)) 0 else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Int, private var searched: Int = 0, private var nextIndex: Int = 0) {\n private val size = fact(n)\n private val permList = Array(size) { IntArray(n) { 0 } }\n\n private tailrec fun fact(n: Int, ans: Int = 1): Int {\n return if (n == 0) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, IntArray(n) { 0 }, Array(n) { false })\n }\n\n private fun create(num: Int, list: IntArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): IntArray = permList[nextIndex++]\n}\n\n// Graph\ndata class Node(val id: Int, var past: Int = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Int, val to: Int, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Int, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Int): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size, -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Int): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size, LINF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\nclass UnionFind(size: Int) {\n private val par = IntArray(size) { it }\n private val size = IntArray(size) { 1 }\n fun root(x: Int): Int {\n return if (par[x] == x) {\n x\n } else {\n par[x] = root(par[x])\n par[x]\n }\n }\n\n fun same(x: Int, y: Int): Boolean = root(x) == root(y)\n fun unite(x: Int, y: Int) {\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n }\n size[a] += size[b]\n par[b] = a\n }\n\n fun size(x: Int): Int = size[root(x)]\n}\n\nclass IntSegmentTree(\n private val a: IntArray,\n private val op: (Int, Int) -> Int,\n private val def: Int = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = intAry(2 * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Int, value: Int) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Int, b: Int) = getSub(a, b, 0, 0, n)\n fun getSub(a: Int, b: Int, k: Int, l: Int, r: Int): Int {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\nclass LongSegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2 * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Int, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Int, b: Int) = getSub(a, b, 0, 0, n)\n fun getSub(a: Int, b: Int, k: Int, l: Int, r: Int): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n if (buflen <= 0) false\n true\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 16303, "cpu_time_ms": 191, "memory_kb": 36904}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s333268459", "group_id": "codeNet:p02714", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val s = sc.next().toCharArray().toList()\n\n var ans = 0\n for(i in 0..(n-3)) {\n for(j in (i+1)..(n-2)) {\n for(k in (j+1) until n){\n if(s[i] != s[j] && s[i]!=s[k] && s[j]!=s[k] && j-i!=k-j)\n ans++\n\n }\n }\n }\n\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1586740637, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s333268459.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s333268459", "user_id": "u079781329"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val s = sc.next().toCharArray().toList()\n\n var ans = 0\n for(i in 0..(n-3)) {\n for(j in (i+1)..(n-2)) {\n for(k in (j+1) until n){\n if(s[i] != s[j] && s[i]!=s[k] && s[j]!=s[k] && j-i!=k-j)\n ans++\n\n }\n }\n }\n\n println(ans)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 417, "cpu_time_ms": 2207, "memory_kb": 41552}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s407496249", "group_id": "codeNet:p02714", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val n = sc.nextInt()\n val s = sc.nextLine()\n val countR = Array(n + 1) { 0 }\n val countG = Array(n + 1) { 0 }\n val countB = Array(n + 1) { 0 }\n for (i in n - 1 downTo 0) {\n countR[i] = countR[i + 1]\n countG[i] = countG[i + 1]\n countB[i] = countB[i + 1]\n if (s[i] == 'R') {\n countR[i]++\n } else if (s[i] == 'G') {\n countG[i]++\n } else {\n countB[i]++\n }\n }\n var sum = 0L\n for (i in 0 until n) {\n for (j in i + 1 until n) {\n val k = j + 1\n val ng = 2 * j - i\n if (k >= n) break\n if (s[i] == s[j]) continue\n\n if (s[i] != 'R' && s[j] != 'R') {\n sum += countR[k]\n if (ng < n && s[ng] == 'R') sum--\n } else if (s[i] != 'G' && s[j] != 'G') {\n sum += countG[k]\n if (ng < n && s[ng] == 'G') sum--\n } else {\n sum += countB[k]\n if (ng < n && s[ng] == 'B') sum--\n }\n }\n }\n println(sum)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "language": "Kotlin", "metadata": {"date": 1586740326, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02714.html", "problem_id": "p02714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02714/input.txt", "sample_output_relpath": "derived/input_output/data/p02714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02714/Kotlin/s407496249.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s407496249", "user_id": "u190507186"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val n = sc.nextInt()\n val s = sc.nextLine()\n val countR = Array(n + 1) { 0 }\n val countG = Array(n + 1) { 0 }\n val countB = Array(n + 1) { 0 }\n for (i in n - 1 downTo 0) {\n countR[i] = countR[i + 1]\n countG[i] = countG[i + 1]\n countB[i] = countB[i + 1]\n if (s[i] == 'R') {\n countR[i]++\n } else if (s[i] == 'G') {\n countG[i]++\n } else {\n countB[i]++\n }\n }\n var sum = 0L\n for (i in 0 until n) {\n for (j in i + 1 until n) {\n val k = j + 1\n val ng = 2 * j - i\n if (k >= n) break\n if (s[i] == s[j]) continue\n\n if (s[i] != 'R' && s[j] != 'R') {\n sum += countR[k]\n if (ng < n && s[ng] == 'R') sum--\n } else if (s[i] != 'G' && s[j] != 'G') {\n sum += countG[k]\n if (ng < n && s[ng] == 'G') sum--\n } else {\n sum += countB[k]\n if (ng < n && s[ng] == 'B') sum--\n }\n }\n }\n println(sum)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "sample_input": "4\nRRGB\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02714", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string S of length N consisting of R, G, and B.\n\nFind the number of triples (i,~j,~k)~(1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nS_i \\neq S_j, S_i \\neq S_k, and S_j \\neq S_k.\n\nj - i \\neq k - j.\n\nConstraints\n\n1 \\leq N \\leq 4000\n\nS is a string of length N consisting of R, G, and B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of triplets in question.\n\nSample Input 1\n\n4\nRRGB\n\nSample Output 1\n\n1\n\nOnly the triplet (1,~3,~4) satisfies both conditions. The triplet (2,~3,~4) satisfies the first condition but not the second, so it does not count.\n\nSample Input 2\n\n39\nRBRBGRBGGBBRRGBBRRRBGGBRBGBRBGBRBBBGBBB\n\nSample Output 2\n\n1800", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1888, "cpu_time_ms": 193, "memory_kb": 37024}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s071366701", "group_id": "codeNet:p02717", "input_text": "fun main(args: Array) {\n val (x, y, z) = readLine()!!.split(\" \").map(String::toInt)\n println(\"$z $x $y\")\n}", "language": "Kotlin", "metadata": {"date": 1588799037, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Kotlin/s071366701.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s071366701", "user_id": "u228849856"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "fun main(args: Array) {\n val (x, y, z) = readLine()!!.split(\" \").map(String::toInt)\n println(\"$z $x $y\")\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 120, "cpu_time_ms": 241, "memory_kb": 36140}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s802194868", "group_id": "codeNet:p02717", "input_text": "\nfun main(){\n val (X, Y, Z) = readLine()!!.split(\" \")\n\n println(Z + \" \" + X + \" \" + Y)\n}\n", "language": "Kotlin", "metadata": {"date": 1586987618, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Kotlin/s802194868.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s802194868", "user_id": "u584790715"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "\nfun main(){\n val (X, Y, Z) = readLine()!!.split(\" \")\n\n println(Z + \" \" + X + \" \" + Y)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 95, "cpu_time_ms": 156, "memory_kb": 31388}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s581190083", "group_id": "codeNet:p02717", "input_text": "fun main() {\n val input = readLine()\n val array = input!!.split(\" \")\n print(\"${array[2]} ${array[0]} ${array[1]}\")\n}", "language": "Kotlin", "metadata": {"date": 1586587384, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Kotlin/s581190083.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s581190083", "user_id": "u496029009"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "fun main() {\n val input = readLine()\n val array = input!!.split(\" \")\n print(\"${array[2]} ${array[0]} ${array[1]}\")\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 125, "cpu_time_ms": 154, "memory_kb": 29356}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s688061843", "group_id": "codeNet:p02717", "input_text": "\nimport java.util.*\n\nconst val mInf = 1 shl 31\nconst val inf = mInf - 1\nprivate val sc = Scanner(System.`in`)\n\nfun readWord(): String = sc.next()\nfun readLine(): String = sc.nextLine()\nfun readInt(): Int = readLine().toInt()\n\nfun readArray(): List = readLine().split(\" \").toList()\nfun readStringList(size: Int): List = (0 until size).map { readLine() }\n\n\nfun readMultiRowToStringArray(size: Int, f: (String) -> Unit = {}): Array =\n Array(size) { readLine().apply(f) }\n\nfun readMultiRowToIntArray(size: Int, f: (Int) -> Unit = {}): IntArray =\n IntArray(size) { readLine().toInt().apply(f) }\n\nfun readMultiRowToBooleanArray(size: Int, f: (String) -> Boolean): BooleanArray = BooleanArray(size) { f(readLine()) }\n\n//\nfun readRowSplitToStringArray(size: Int, f: (String) -> String = { it }): Array =\n Array(size) { sc.next().apply { f } }\n\nfun readRowSplitToIntArray(size: Int, f: (Int) -> Unit = { }): IntArray =\n IntArray(size) { sc.next().toInt().apply(f) }\n\nfun readRowSplitToBooleanArray(size: Int, f: (String) -> Boolean): BooleanArray = BooleanArray(size) { f(sc.next()) }\n\n\nfun main(args: Array) {\n readRowSplitToIntArray(3).let {\n print(\"${it[2]} ${it[0]} ${it[1]}\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1586049752, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Kotlin/s688061843.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s688061843", "user_id": "u335693071"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "\nimport java.util.*\n\nconst val mInf = 1 shl 31\nconst val inf = mInf - 1\nprivate val sc = Scanner(System.`in`)\n\nfun readWord(): String = sc.next()\nfun readLine(): String = sc.nextLine()\nfun readInt(): Int = readLine().toInt()\n\nfun readArray(): List = readLine().split(\" \").toList()\nfun readStringList(size: Int): List = (0 until size).map { readLine() }\n\n\nfun readMultiRowToStringArray(size: Int, f: (String) -> Unit = {}): Array =\n Array(size) { readLine().apply(f) }\n\nfun readMultiRowToIntArray(size: Int, f: (Int) -> Unit = {}): IntArray =\n IntArray(size) { readLine().toInt().apply(f) }\n\nfun readMultiRowToBooleanArray(size: Int, f: (String) -> Boolean): BooleanArray = BooleanArray(size) { f(readLine()) }\n\n//\nfun readRowSplitToStringArray(size: Int, f: (String) -> String = { it }): Array =\n Array(size) { sc.next().apply { f } }\n\nfun readRowSplitToIntArray(size: Int, f: (Int) -> Unit = { }): IntArray =\n IntArray(size) { sc.next().toInt().apply(f) }\n\nfun readRowSplitToBooleanArray(size: Int, f: (String) -> Boolean): BooleanArray = BooleanArray(size) { f(sc.next()) }\n\n\nfun main(args: Array) {\n readRowSplitToIntArray(3).let {\n print(\"${it[2]} ${it[0]} ${it[1]}\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1241, "cpu_time_ms": 201, "memory_kb": 29464}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s210487564", "group_id": "codeNet:p02717", "input_text": "fun main(args: Array) {\n val (X,Y,Z) = readIntList()\n\n println(\"$Z $X $Y\")\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)", "language": "Kotlin", "metadata": {"date": 1586048960, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Kotlin/s210487564.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s210487564", "user_id": "u043557308"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "fun main(args: Array) {\n val (X,Y,Z) = readIntList()\n\n println(\"$Z $X $Y\")\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 309, "cpu_time_ms": 241, "memory_kb": 37856}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s965228663", "group_id": "codeNet:p02717", "input_text": "import java.util.*\n\nfun main(args : Array) {\n val sc = Scanner(System.`in`)\n val A = sc.next()\n val B = sc.next()\n val C = sc.next()\n println(\"$C $A $B\")\n}\n", "language": "Kotlin", "metadata": {"date": 1586048765, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Kotlin/s965228663.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s965228663", "user_id": "u209749609"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args : Array) {\n val sc = Scanner(System.`in`)\n val A = sc.next()\n val B = sc.next()\n val C = sc.next()\n println(\"$C $A $B\")\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 179, "cpu_time_ms": 214, "memory_kb": 31392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s266690666", "group_id": "codeNet:p02717", "input_text": "fun main (args: Array) {\n val (a, b, c) = readLine()!!.split(' ')\n println(\"$c $a $b\")\n}", "language": "Kotlin", "metadata": {"date": 1586048611, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Kotlin/s266690666.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s266690666", "user_id": "u664864246"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "fun main (args: Array) {\n val (a, b, c) = readLine()!!.split(' ')\n println(\"$c $a $b\")\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 98, "cpu_time_ms": 315, "memory_kb": 38228}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s719300487", "group_id": "codeNet:p02717", "input_text": "private fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() // single long\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map(String::toInt) // list of ints\nprivate fun readLongs() = readStrings().map(String::toLong) // list of longs\n\nfun main(args: Array) {\n val ints = readInts()\n println(\"${ints[2]} ${ints[0]} ${ints[1]}\")\n}\n", "language": "Kotlin", "metadata": {"date": 1586048556, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Kotlin/s719300487.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s719300487", "user_id": "u059223549"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "private fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() // single long\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map(String::toInt) // list of ints\nprivate fun readLongs() = readStrings().map(String::toLong) // list of longs\n\nfun main(args: Array) {\n val ints = readInts()\n println(\"${ints[2]} ${ints[0]} ${ints[1]}\")\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 491, "cpu_time_ms": 305, "memory_kb": 37936}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s048650438", "group_id": "codeNet:p02717", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val x = sc.nextInt()\n val y = sc.nextInt()\n val z = sc.nextInt()\n println(problem161a(x, y, z))\n}\n\nfun problem161a(x: Int, y: Int, z: Int): String {\n var a = y\n var b = x\n var c = z\n return \"$c $b $a\"\n}", "language": "Kotlin", "metadata": {"date": 1586048536, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Kotlin/s048650438.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s048650438", "user_id": "u073232808"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val x = sc.nextInt()\n val y = sc.nextInt()\n val z = sc.nextInt()\n println(problem161a(x, y, z))\n}\n\nfun problem161a(x: Int, y: Int, z: Int): String {\n var a = y\n var b = x\n var c = z\n return \"$c $b $a\"\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 313, "cpu_time_ms": 282, "memory_kb": 29608}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s862320504", "group_id": "codeNet:p02717", "input_text": "fun main(args: Array) {\n val (x, y, z) = readInputLine().split(\" \").map { it.toInt() }\n\n println(\"$z $x $y\")\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "language": "Kotlin", "metadata": {"date": 1586048516, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Kotlin/s862320504.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s862320504", "user_id": "u505558493"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "fun main(args: Array) {\n val (x, y, z) = readInputLine().split(\" \").map { it.toInt() }\n\n println(\"$z $x $y\")\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 182, "cpu_time_ms": 272, "memory_kb": 37736}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s562277649", "group_id": "codeNet:p02717", "input_text": "fun main(args: Array) {\n val (a, b, c) = readLine()!!.split(\" \").map { it.toInt() }\n println(\"$c $a $b\")\n}", "language": "Kotlin", "metadata": {"date": 1586048507, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Kotlin/s562277649.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s562277649", "user_id": "u897579945"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "fun main(args: Array) {\n val (a, b, c) = readLine()!!.split(\" \").map { it.toInt() }\n println(\"$c $a $b\")\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 120, "cpu_time_ms": 331, "memory_kb": 37608}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s196625567", "group_id": "codeNet:p02717", "input_text": "import java.io.*\n\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 2147483647\nconst val LINF = 9223372036854775807L\n\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\nfun solve() {\n val (x, y, z) = nextIntList()\n println(\"$z $x $y\")\n\n\n}\n\n\nfun println(v: String) {\n pw.println(v)\n}\n\nfun print(v: String) {\n pw.print(v)\n}\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \").toMutableList()\nfun nextIntList(index: Int = 0) = next().split(\" \").map { it.toInt() + index }.toMutableList()\nfun nextLongList(index: Long = 0L) = next().split(\" \").map { it.toLong() + index }.toMutableList()\nfun nextDoubleList() = next().split(\" \").map { it.toDouble() }.toMutableList()\n\nfun ary(n: Int, init: String = \"\") = Array(n) { init }\nfun intAry(n: Int, init: Int = 0) = IntArray(n) { init }\nfun longAry(n: Int, init: Long = 0L) = LongArray(n) { init }\nfun doubleAry(n: Int, init: Double = 0.0) = DoubleArray(n) { init }\nfun ary2(n: Int, m: Int, init: String = \"\") = Array(n) { Array(m) { init } }\nfun intAry2(n: Int, m: Int, init: Int = 0) = Array(n) { IntArray(m) { init } }\nfun longAry2(n: Int, m: Int, init: Long = 0) = Array(n) { LongArray(m) { init } }\nfun doubleAry2(n: Int, m: Int, init: Double = 0.0) = Array(n) { DoubleArray(m) { init } }\nfun ary3(n: Int, m: Int, k: Int, init: String = \"\") = Array(n) { Array(m) { Array(k) { init } } }\nfun intAry3(n: Int, m: Int, k: Int, init: Int = 0) = Array(n) { Array(m) { IntArray(k) { init } } }\nfun longAry3(n: Int, m: Int, k: Int, init: Long = 0L) = Array(n) { Array(m) { LongArray(k) { init } } }\nfun doubleAry3(n: Int, m: Int, k: Int, init: Double = 0.0) = Array(n) { Array(m) { DoubleArray(k) { init } } }\n\nfun abs(n: Int): Int = Math.abs(n)\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Int) = if (values.isEmpty()) -INF else values.max()!!\nfun max(vararg values: Long) = if (values.isEmpty()) -LINF else values.max()!!\nfun min(vararg values: Int) = if (values.isEmpty()) INF else values.min()!!\nfun min(vararg values: Long) = if (values.isEmpty()) LINF else values.min()!!", "language": "Kotlin", "metadata": {"date": 1586048484, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02717.html", "problem_id": "p02717", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02717/input.txt", "sample_output_relpath": "derived/input_output/data/p02717/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02717/Kotlin/s196625567.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s196625567", "user_id": "u581625805"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "import java.io.*\n\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 2147483647\nconst val LINF = 9223372036854775807L\n\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\nfun solve() {\n val (x, y, z) = nextIntList()\n println(\"$z $x $y\")\n\n\n}\n\n\nfun println(v: String) {\n pw.println(v)\n}\n\nfun print(v: String) {\n pw.print(v)\n}\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \").toMutableList()\nfun nextIntList(index: Int = 0) = next().split(\" \").map { it.toInt() + index }.toMutableList()\nfun nextLongList(index: Long = 0L) = next().split(\" \").map { it.toLong() + index }.toMutableList()\nfun nextDoubleList() = next().split(\" \").map { it.toDouble() }.toMutableList()\n\nfun ary(n: Int, init: String = \"\") = Array(n) { init }\nfun intAry(n: Int, init: Int = 0) = IntArray(n) { init }\nfun longAry(n: Int, init: Long = 0L) = LongArray(n) { init }\nfun doubleAry(n: Int, init: Double = 0.0) = DoubleArray(n) { init }\nfun ary2(n: Int, m: Int, init: String = \"\") = Array(n) { Array(m) { init } }\nfun intAry2(n: Int, m: Int, init: Int = 0) = Array(n) { IntArray(m) { init } }\nfun longAry2(n: Int, m: Int, init: Long = 0) = Array(n) { LongArray(m) { init } }\nfun doubleAry2(n: Int, m: Int, init: Double = 0.0) = Array(n) { DoubleArray(m) { init } }\nfun ary3(n: Int, m: Int, k: Int, init: String = \"\") = Array(n) { Array(m) { Array(k) { init } } }\nfun intAry3(n: Int, m: Int, k: Int, init: Int = 0) = Array(n) { Array(m) { IntArray(k) { init } } }\nfun longAry3(n: Int, m: Int, k: Int, init: Long = 0L) = Array(n) { Array(m) { LongArray(k) { init } } }\nfun doubleAry3(n: Int, m: Int, k: Int, init: Double = 0.0) = Array(n) { Array(m) { DoubleArray(k) { init } } }\n\nfun abs(n: Int): Int = Math.abs(n)\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Int) = if (values.isEmpty()) -INF else values.max()!!\nfun max(vararg values: Long) = if (values.isEmpty()) -LINF else values.max()!!\nfun min(vararg values: Int) = if (values.isEmpty()) INF else values.min()!!\nfun min(vararg values: Long) = if (values.isEmpty()) LINF else values.min()!!", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "sample_input": "1 2 3\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02717", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have three boxes A, B, and C, each of which contains an integer.\n\nCurrently, the boxes A, B, and C contain the integers X, Y, and Z, respectively.\n\nWe will now do the operations below in order. Find the content of each box afterward.\n\nSwap the contents of the boxes A and B\n\nSwap the contents of the boxes A and C\n\nConstraints\n\n1 \\leq X,Y,Z \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the integers contained in the boxes A, B, and C, in this order, with space in between.\n\nSample Input 1\n\n1 2 3\n\nSample Output 1\n\n3 1 2\n\nAfter the contents of the boxes A and B are swapped, A, B, and C contain 2, 1, and 3, respectively.\n\nThen, after the contents of A and C are swapped, A, B, and C contain 3, 1, and 2, respectively.\n\nSample Input 2\n\n100 100 100\n\nSample Output 2\n\n100 100 100\n\nSample Input 3\n\n41 59 31\n\nSample Output 3\n\n31 41 59", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2230, "cpu_time_ms": 282, "memory_kb": 37608}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s078018410", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) {\n\n val (n, m) = readLine()!!.split(\" \").map { it.toInt() }\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val total = a.sum()\n val answer = if (a.filter { it >= total / (4.0 * m) }.size >= m) \"Yes\" else \"No\"\n\n println(answer)\n}", "language": "Kotlin", "metadata": {"date": 1594953534, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s078018410.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s078018410", "user_id": "u108272327"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n\n val (n, m) = readLine()!!.split(\" \").map { it.toInt() }\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val total = a.sum()\n val answer = if (a.filter { it >= total / (4.0 * m) }.size >= m) \"Yes\" else \"No\"\n\n println(answer)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 279, "cpu_time_ms": 122, "memory_kb": 37960}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s710177829", "group_id": "codeNet:p02718", "input_text": "fun main() {\n val (N, M) = readLine()!!.split(\" \").map { it.toInt() }\n val A = readLine()!!.split(\" \").map { it.toDouble() }\n val jub = A.sum() / (4.0 * M)\n\n val ans = A.filter { it >= jub }\n\n if (ans.size >= M) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n\n}\n\n", "language": "Kotlin", "metadata": {"date": 1594316664, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s710177829.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s710177829", "user_id": "u035856025"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main() {\n val (N, M) = readLine()!!.split(\" \").map { it.toInt() }\n val A = readLine()!!.split(\" \").map { it.toDouble() }\n val jub = A.sum() / (4.0 * M)\n\n val ans = A.filter { it >= jub }\n\n if (ans.size >= M) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 297, "cpu_time_ms": 123, "memory_kb": 37968}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s704983333", "group_id": "codeNet:p02718", "input_text": "fun main() {\n val (N, M) = readLine()!!.split(\" \").map { it.toInt() }\n val A = readLine()!!.split(\" \").map { it.toInt() }.sortedBy { it * -1 }\n var ans = 0\n val jub = A.sum() / (4 * M)\n\n for (i in A) {\n if (i > jub) {\n ans++\n }\n }\n\n\n if (ans >= M) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n\n}\n", "language": "Kotlin", "metadata": {"date": 1594316109, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s704983333.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s704983333", "user_id": "u035856025"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main() {\n val (N, M) = readLine()!!.split(\" \").map { it.toInt() }\n val A = readLine()!!.split(\" \").map { it.toInt() }.sortedBy { it * -1 }\n var ans = 0\n val jub = A.sum() / (4 * M)\n\n for (i in A) {\n if (i > jub) {\n ans++\n }\n }\n\n\n if (ans >= M) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 363, "cpu_time_ms": 133, "memory_kb": 40512}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s489782013", "group_id": "codeNet:p02718", "input_text": "\nimport java.lang.Math.ceil\n\nfun main (args:Array) {\n val (N, M) = readLine()!!.split(\" \").map(String::toInt)\n val productList = readLine()!!.split(\" \").map(String::toInt).sortedWith(reverseOrder())\n // prntln(productList) // debug\n val minChooseablePoint = ceil(productList.sum() / (4.0 * M))\n // println(productList.sum().toString() + \", \" + minChooseablePoint.toString()) // debug\n var chooseableCount = 0\n for (product in productList) {\n if (product < minChooseablePoint) break\n chooseableCount++\n if (chooseableCount == M) break\n }\n if (chooseableCount == M) print(\"Yes\")\n else print(\"No\")\n}\n", "language": "Kotlin", "metadata": {"date": 1593611271, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s489782013.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s489782013", "user_id": "u838133978"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\nimport java.lang.Math.ceil\n\nfun main (args:Array) {\n val (N, M) = readLine()!!.split(\" \").map(String::toInt)\n val productList = readLine()!!.split(\" \").map(String::toInt).sortedWith(reverseOrder())\n // prntln(productList) // debug\n val minChooseablePoint = ceil(productList.sum() / (4.0 * M))\n // println(productList.sum().toString() + \", \" + minChooseablePoint.toString()) // debug\n var chooseableCount = 0\n for (product in productList) {\n if (product < minChooseablePoint) break\n chooseableCount++\n if (chooseableCount == M) break\n }\n if (chooseableCount == M) print(\"Yes\")\n else print(\"No\")\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 658, "cpu_time_ms": 133, "memory_kb": 40544}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s262568615", "group_id": "codeNet:p02718", "input_text": "import kotlin.math.ceil\n\nfun main (args:Array) {\n var (itemNum , popItem) = readLine()!!.split(\" \").map(String::toInt)\n var vote = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n var numVote = 0\n\n vote.forEach{ //総得票数を求めるため\n numVote += it\n }\n val aaa = ceil(numVote.toDouble()/(4*popItem)) //人気商品を選ぶ基準の数字を決定,voteの中にaaa以上のものがpopItem以上あればYes,popItem未満であればNo\n var bbb = 0\n vote.sortDescending()\n// print(vote[0]..vote[popItem-1])\n\n vote.forEach {\n if (it >= aaa) bbb += 1\n }\n\n if(bbb >= popItem){\n print(\"Yes\")\n return\n }\n print(\"No\")\n\n\n\n// print(numVote)\n// print(numVote/(4*b))\n// for (i in vote) {\n// if (numVote / (4 * popItem) < i) { //人気商品を選ぶための基準\n// print(i)\n//// popItem - 1\n//// if (popItem <= 0) break\n// }\n// else {\n// print(\"No\")\n// }\n// }\n}", "language": "Kotlin", "metadata": {"date": 1593538469, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s262568615.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s262568615", "user_id": "u800824593"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import kotlin.math.ceil\n\nfun main (args:Array) {\n var (itemNum , popItem) = readLine()!!.split(\" \").map(String::toInt)\n var vote = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n var numVote = 0\n\n vote.forEach{ //総得票数を求めるため\n numVote += it\n }\n val aaa = ceil(numVote.toDouble()/(4*popItem)) //人気商品を選ぶ基準の数字を決定,voteの中にaaa以上のものがpopItem以上あればYes,popItem未満であればNo\n var bbb = 0\n vote.sortDescending()\n// print(vote[0]..vote[popItem-1])\n\n vote.forEach {\n if (it >= aaa) bbb += 1\n }\n\n if(bbb >= popItem){\n print(\"Yes\")\n return\n }\n print(\"No\")\n\n\n\n// print(numVote)\n// print(numVote/(4*b))\n// for (i in vote) {\n// if (numVote / (4 * popItem) < i) { //人気商品を選ぶための基準\n// print(i)\n//// popItem - 1\n//// if (popItem <= 0) break\n// }\n// else {\n// print(\"No\")\n// }\n// }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1069, "cpu_time_ms": 126, "memory_kb": 37968}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s816003764", "group_id": "codeNet:p02718", "input_text": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.PrintWriter\nimport java.util.ArrayDeque\nimport java.util.PriorityQueue\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\n\nfun PrintWriter.solve() {\n// val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n val n = readInt()\n val m = readInt()\n val A = readIntArray(n)\n\n val sum = A.sum()\n val ans = A.count { it * 4 * m >= sum } >= m\n println(if(ans) \"Yes\" else \"No\")\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "language": "Kotlin", "metadata": {"date": 1593535438, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s816003764.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s816003764", "user_id": "u596111103"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "@file:Suppress(\"NOTHING_TO_INLINE\", \"EXPERIMENTAL_FEATURE_WARNING\", \"OVERRIDE_BY_INLINE\")\n//@file:OptIn(ExperimentalStdlibApi::class)\n\nimport java.io.PrintWriter\nimport java.util.ArrayDeque\nimport java.util.PriorityQueue\nimport kotlin.math.*\nimport kotlin.random.Random\nimport kotlin.collections.sort as _sort\nimport kotlin.collections.sortDescending as _sortDescending\nimport kotlin.io.println as iprintln\n\n/** @author Spheniscine */\nfun main() { _writer.solve(); _writer.flush() }\n\nfun PrintWriter.solve() {\n// val startTime = System.nanoTime()\n\n val numCases = 1//readInt()\n case@ for(case in 1..numCases) {\n //print(\"Case #$case: \")\n\n val n = readInt()\n val m = readInt()\n val A = readIntArray(n)\n\n val sum = A.sum()\n val ans = A.count { it * 4 * m >= sum } >= m\n println(if(ans) \"Yes\" else \"No\")\n }\n\n// iprintln(\"Time: ${(System.nanoTime() - startTime) / 1000000} ms\")\n}\n\n/** IO */\n//@JvmField val INPUT = File(\"input.txt\").inputStream()\n//@JvmField val OUTPUT = File(\"output.txt\").outputStream()\n@JvmField val INPUT = System.`in`\n@JvmField val OUTPUT = System.out\n\nconst val _BUFFER_SIZE = 1 shl 16\n@JvmField val _buffer = ByteArray(_BUFFER_SIZE)\n@JvmField var _bufferPt = 0\n@JvmField var _bytesRead = 0\n\ntailrec fun readChar(): Char {\n if(_bufferPt == _bytesRead) {\n _bufferPt = 0\n _bytesRead = INPUT.read(_buffer, 0, _BUFFER_SIZE)\n }\n return if(_bytesRead < 0) Char.MIN_VALUE\n else {\n val c = _buffer[_bufferPt++].toChar()\n if (c == '\\r') readChar()\n else c\n }\n}\n\nfun readLine(): String? {\n var c = readChar()\n return if(c == Char.MIN_VALUE) null\n else buildString {\n while(c != '\\n' && c != Char.MIN_VALUE) {\n append(c)\n c = readChar()\n }\n }\n}\nfun readLn() = readLine()!!\n\nfun read() = buildString {\n var c = readChar()\n while(c <= ' ') {\n if(c == Char.MIN_VALUE) return@buildString\n c = readChar()\n }\n do {\n append(c)\n c = readChar()\n } while(c > ' ')\n}\nfun readInt() = read().toInt()\nfun readDouble() = read().toDouble()\nfun readLong() = read().toLong()\nfun readStrings(n: Int) = List(n) { read() }\nfun readLines(n: Int) = List(n) { readLn() }\nfun readInts(n: Int) = List(n) { read().toInt() }\nfun readIntArray(n: Int) = IntArray(n) { read().toInt() }\nfun readDoubles(n: Int) = List(n) { read().toDouble() }\nfun readDoubleArray(n: Int) = DoubleArray(n) { read().toDouble() }\nfun readLongs(n: Int) = List(n) { read().toLong() }\nfun readLongArray(n: Int) = LongArray(n) { read().toLong() }\n\n@JvmField val _writer = PrintWriter(OUTPUT, false)\n\n/** shuffles and sort overrides to avoid quicksort attacks */\nprivate inline fun _shuffle(rnd: Random, get: (Int) -> T, set: (Int, T) -> Unit, size: Int) {\n // Fisher-Yates shuffle algorithm\n for (i in size - 1 downTo 1) {\n val j = rnd.nextInt(i + 1)\n val temp = get(i)\n set(i, get(j))\n set(j, temp)\n }\n}\n\n@JvmField var _random: Random? = null\nval random get() = _random ?: Random(0x594E215C123 * System.nanoTime()).also { _random = it }\n\nfun IntArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun IntArray.sort() { shuffle(); _sort() }\nfun IntArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun LongArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun LongArray.sort() { shuffle(); _sort() }\nfun LongArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun DoubleArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\nfun DoubleArray.sort() { shuffle(); _sort() }\nfun DoubleArray.sortDescending() { shuffle(); _sortDescending() }\n\nfun CharArray.shuffle(rnd: Random = random) = _shuffle(rnd, ::get, ::set, size)\ninline fun CharArray.sort() { _sort() }\ninline fun CharArray.sortDescending() { _sortDescending() }\n\ninline fun > Array.sort() = _sort()\ninline fun > Array.sortDescending() = _sortDescending()\ninline fun > MutableList.sort() = _sort()\ninline fun > MutableList.sortDescending() = _sortDescending()\n\nfun `please stop removing these imports IntelliJ`() { iprintln(max(1, 2)) }\n\n/** additional commons */\ninline fun Iterable.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Sequence.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\ninline fun Array.sumByLong(func: (T) -> Long) = fold(0L) { acc, t -> acc + func(t) }\nfun IntArray.sumLong() = fold(0L, Long::plus)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4612, "cpu_time_ms": 112, "memory_kb": 38484}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s803304776", "group_id": "codeNet:p02718", "input_text": "fun main (args:Array) {\n var (itemNum , popItem) = readLine()!!.split(\" \").map(String::toInt)\n var vote = readLine()!!.split(\" \").map(String::toInt)\n// val voteLen = vote.count()\n var numVote = 0\n vote.forEach{ //総得票数を求めるため\n numVote += it\n }\n val aaa = numVote/(4*popItem)\n var bbb = 0\n vote.forEach{\n if(it >= aaa){\n bbb += 1\n }\n }\n if(bbb >= popItem){\n print(\"Yes\")\n return\n }\n print(\"No\")\n\n\n\n// print(numVote)\n// print(numVote/(4*b))\n// for (i in vote) {\n// if (numVote / (4 * popItem) < i) { //人気商品を選ぶための基準\n// print(i)\n//// popItem - 1\n//// if (popItem <= 0) break\n// }\n// else {\n// print(\"No\")\n// }\n// }\n}", "language": "Kotlin", "metadata": {"date": 1593466957, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s803304776.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s803304776", "user_id": "u800824593"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main (args:Array) {\n var (itemNum , popItem) = readLine()!!.split(\" \").map(String::toInt)\n var vote = readLine()!!.split(\" \").map(String::toInt)\n// val voteLen = vote.count()\n var numVote = 0\n vote.forEach{ //総得票数を求めるため\n numVote += it\n }\n val aaa = numVote/(4*popItem)\n var bbb = 0\n vote.forEach{\n if(it >= aaa){\n bbb += 1\n }\n }\n if(bbb >= popItem){\n print(\"Yes\")\n return\n }\n print(\"No\")\n\n\n\n// print(numVote)\n// print(numVote/(4*b))\n// for (i in vote) {\n// if (numVote / (4 * popItem) < i) { //人気商品を選ぶための基準\n// print(i)\n//// popItem - 1\n//// if (popItem <= 0) break\n// }\n// else {\n// print(\"No\")\n// }\n// }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 860, "cpu_time_ms": 123, "memory_kb": 37856}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s025693691", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) {\n val (n,m) = readLine()!!.split(\" \").map { it.toInt() }\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val sum = a.reduce { a, b -> a + b }\n a.sortedDescending().subList(0,m).forEach {\n if (it < sum / (4 * m)) return println(\"No\")\n }\n println(\"Yes\")\n}", "language": "Kotlin", "metadata": {"date": 1591885133, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s025693691.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s025693691", "user_id": "u172820018"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val (n,m) = readLine()!!.split(\" \").map { it.toInt() }\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val sum = a.reduce { a, b -> a + b }\n a.sortedDescending().subList(0,m).forEach {\n if (it < sum / (4 * m)) return println(\"No\")\n }\n println(\"Yes\")\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 314, "cpu_time_ms": 122, "memory_kb": 40356}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s644695994", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) {\n val (_, M) = readLine()!!.split(\" \").map { it.toInt() }\n val input = readLine()!!.split(\" \").map { it.toInt() }\n\n val judge = input.sum() / (4 * M)\n\n if (input.count { it >= judge } >= M) println(\"Yes\") else println(\"No\")\n}\n", "language": "Kotlin", "metadata": {"date": 1590884257, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s644695994.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s644695994", "user_id": "u932970230"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val (_, M) = readLine()!!.split(\" \").map { it.toInt() }\n val input = readLine()!!.split(\" \").map { it.toInt() }\n\n val judge = input.sum() / (4 * M)\n\n if (input.count { it >= judge } >= M) println(\"Yes\") else println(\"No\")\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 269, "cpu_time_ms": 111, "memory_kb": 37680}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s741130942", "group_id": "codeNet:p02718", "input_text": "fun main(){\n var (N, M) = readLine()!!.split(\" \").map{it.toInt()}\n var A = readLine()!!.split(\" \").map{it.toInt()}\n var B = A.sum() / (4 * M)\n println(if(M <= A.count{ B <= it}) \"Yes\" else \"No\")\n}", "language": "Kotlin", "metadata": {"date": 1590265112, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s741130942.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s741130942", "user_id": "u209053759"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(){\n var (N, M) = readLine()!!.split(\" \").map{it.toInt()}\n var A = readLine()!!.split(\" \").map{it.toInt()}\n var B = A.sum() / (4 * M)\n println(if(M <= A.count{ B <= it}) \"Yes\" else \"No\")\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 208, "cpu_time_ms": 101, "memory_kb": 37896}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s271540169", "group_id": "codeNet:p02718", "input_text": "import kotlin.math.*\nimport java.util.*\n\nfun main(args: Array) {\n val (_, m) = readLine()!!.split(' ').map(String::toInt)\n val a = readLine()!!.split(' ').map(String::toDouble)\n val b = a.sum() / (4 * m)\n println(if (m <= a.count { b <= it }) \"Yes\" else \"No\")\n}\n", "language": "Kotlin", "metadata": {"date": 1590201977, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s271540169.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s271540169", "user_id": "u051841332"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import kotlin.math.*\nimport java.util.*\n\nfun main(args: Array) {\n val (_, m) = readLine()!!.split(' ').map(String::toInt)\n val a = readLine()!!.split(' ').map(String::toDouble)\n val b = a.sum() / (4 * m)\n println(if (m <= a.count { b <= it }) \"Yes\" else \"No\")\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 274, "cpu_time_ms": 108, "memory_kb": 37708}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s237828406", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) = println(run {\n val (n,m) = readLine()!!.split(\" \").map { it.toInt() }\n val a = readLine()!!.split(\" \").map { it.toInt() }\n\n val min = (a.sum()/(4.0*m))\n if (a.filter { it.toDouble() >= min }.count() >= m) \"Yes\" else \"No\"\n})", "language": "Kotlin", "metadata": {"date": 1588956840, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s237828406.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s237828406", "user_id": "u122428774"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) = println(run {\n val (n,m) = readLine()!!.split(\" \").map { it.toInt() }\n val a = readLine()!!.split(\" \").map { it.toInt() }\n\n val min = (a.sum()/(4.0*m))\n if (a.filter { it.toDouble() >= min }.count() >= m) \"Yes\" else \"No\"\n})", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 267, "cpu_time_ms": 238, "memory_kb": 37600}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s509456221", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map(String::toInt)\n var canChoose = true\n readLine()?.split(\" \")?.map { it.toInt() }?.sortedDescending()?.let {\n val base = it.sum() / (4 * m)\n for (i in 0 until(m)) {\n if (it[i] < base) {\n canChoose = false\n break\n }\n }\n }\n if (canChoose) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1588802113, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s509456221.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s509456221", "user_id": "u228849856"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map(String::toInt)\n var canChoose = true\n readLine()?.split(\" \")?.map { it.toInt() }?.sortedDescending()?.let {\n val base = it.sum() / (4 * m)\n for (i in 0 until(m)) {\n if (it[i] < base) {\n canChoose = false\n break\n }\n }\n }\n if (canChoose) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 465, "cpu_time_ms": 241, "memory_kb": 37864}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s450840768", "group_id": "codeNet:p02718", "input_text": "fun main() {\n val ints = rspint()\n val ints2 = rspint()\n val n = (ints2.sum() + 3) / (ints[1] * 4)\n printYN(ints2.filter { it >= n }.size > ints[1])\n}\n\nfun rl() = readLine()!!\nfun rsp() = readLine()!!.split(\" \")\nfun rint() = readLine()!!.toInt()\nfun rspint() = readLine()!!.split(\" \").map { it.toInt() }\nfun printYN(isYes: Boolean) = println(if (isYes) \"Yes\" else \"No\")\n\nfun main(args: Array) = main()", "language": "Kotlin", "metadata": {"date": 1588208992, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s450840768.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s450840768", "user_id": "u896320985"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main() {\n val ints = rspint()\n val ints2 = rspint()\n val n = (ints2.sum() + 3) / (ints[1] * 4)\n printYN(ints2.filter { it >= n }.size > ints[1])\n}\n\nfun rl() = readLine()!!\nfun rsp() = readLine()!!.split(\" \")\nfun rint() = readLine()!!.toInt()\nfun rspint() = readLine()!!.split(\" \").map { it.toInt() }\nfun printYN(isYes: Boolean) = println(if (isYes) \"Yes\" else \"No\")\n\nfun main(args: Array) = main()", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 421, "cpu_time_ms": 233, "memory_kb": 37696}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s017285210", "group_id": "codeNet:p02718", "input_text": "import kotlin.system.exitProcess\nfun main(args:Array) {\n val(n,m) = readLine()!!.split(\" \").map(String::toInt)\n val al:MutableList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n al.sortDescending()\n val comp:Int = ((1.0 / (4.0 * m.toDouble())) * al.sum()).toInt()\n val p = al.slice(0..m-1)\n for (x in p) {\n if (x < comp) {\n println(\"No\")\n exitProcess(0)\n }\n }\n println(\"Yes\")\n}\n", "language": "Kotlin", "metadata": {"date": 1588171262, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s017285210.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s017285210", "user_id": "u122428774"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import kotlin.system.exitProcess\nfun main(args:Array) {\n val(n,m) = readLine()!!.split(\" \").map(String::toInt)\n val al:MutableList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n al.sortDescending()\n val comp:Int = ((1.0 / (4.0 * m.toDouble())) * al.sum()).toInt()\n val p = al.slice(0..m-1)\n for (x in p) {\n if (x < comp) {\n println(\"No\")\n exitProcess(0)\n }\n }\n println(\"Yes\")\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 466, "cpu_time_ms": 244, "memory_kb": 38060}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s249705123", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) {\n var (n, m) = readLine()!!.split(\" \").map{it.toInt()}\n var a = readLine()!!.split(\" \").map{it.toInt()}.sortedDescending()\n if (a[m-1] < a.sum()/(4*m)) {\n println(\"No\")\n } else {\n println(\"Yes\")\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1588135062, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s249705123.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s249705123", "user_id": "u906501980"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n var (n, m) = readLine()!!.split(\" \").map{it.toInt()}\n var a = readLine()!!.split(\" \").map{it.toInt()}.sortedDescending()\n if (a[m-1] < a.sum()/(4*m)) {\n println(\"No\")\n } else {\n println(\"Yes\")\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 260, "cpu_time_ms": 240, "memory_kb": 38032}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s525647288", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array){\n val (n, m) = readLine()!!.split(\" \").map{it.toInt()}\n val elemens = readLine()!!.split(\" \").map{it.toDouble()}\n\n val sum = elemens.reduce{e1, e2 -> e1 + e2}\n\n val limit = sum / (4 * m)\n val canChoose = elemens.filter{ it >= limit }\n if(canChoose.size >= m){\n println(\"Yes\")\n return\n }\n println(\"No\")\n}", "language": "Kotlin", "metadata": {"date": 1587090523, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s525647288.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s525647288", "user_id": "u376497013"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array){\n val (n, m) = readLine()!!.split(\" \").map{it.toInt()}\n val elemens = readLine()!!.split(\" \").map{it.toDouble()}\n\n val sum = elemens.reduce{e1, e2 -> e1 + e2}\n\n val limit = sum / (4 * m)\n val canChoose = elemens.filter{ it >= limit }\n if(canChoose.size >= m){\n println(\"Yes\")\n return\n }\n println(\"No\")\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 371, "cpu_time_ms": 234, "memory_kb": 37868}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s180720238", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) {\n var (n, m)= readLine()!!.split(' ').map { it.toInt() }\n var a=readLine()!!.split(' ').map { it.toInt() }\n var sum=a.sum()\n var count=0\n a.map {\n if(it.toFloat()>=sum.toFloat()/(4*m).toFloat()){\n count++\n } }\n if (count) {\n var (n, m)= readLine()!!.split(' ').map { it.toInt() }\n var a=readLine()!!.split(' ').map { it.toInt() }\n var sum=a.sum()\n var count=0\n a.map {\n if(it.toFloat()>=sum.toFloat()/(4*m).toFloat()){\n count++\n } }\n if (count) {\n val sc = Scanner(System.`in`)\n val N: Int = sc.nextInt()\n val M: Int = sc.nextInt()\n\n val A = Array(N) { sc.nextInt() }\n\n val sumCount = A.sum()\n A.sortDescending()\n val ninnki = A.take(M)\n\n val minimalCount = sumCount / (4.0 * M)\n\n val yes = ninnki.all { !(it < minimalCount) }\n if (yes) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1586051350, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s709656623.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s709656623", "user_id": "u466955962"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val N: Int = sc.nextInt()\n val M: Int = sc.nextInt()\n\n val A = Array(N) { sc.nextInt() }\n\n val sumCount = A.sum()\n A.sortDescending()\n val ninnki = A.take(M)\n\n val minimalCount = sumCount / (4.0 * M)\n\n val yes = ninnki.all { !(it < minimalCount) }\n if (yes) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 440, "cpu_time_ms": 215, "memory_kb": 34132}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s150508418", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) {\n // Your code here!\n var (n,m) = readLine()!!.split(\" \").map{it.toInt()}\n n = 0\n var votes = readLine()!!.split(\" \").map{it.toInt()}.toList()\n var total = votes.reduce{x,y->x+y}\n var com = total/(4*m)\n var msg = \"Yes\"\n var cnt = votes.filter{it >= com}.count()\n \n if(!(cnt >= m)) msg = \"No\"\n \n print(msg)\n \n}\n", "language": "Kotlin", "metadata": {"date": 1586050772, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s150508418.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s150508418", "user_id": "u808976884"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n // Your code here!\n var (n,m) = readLine()!!.split(\" \").map{it.toInt()}\n n = 0\n var votes = readLine()!!.split(\" \").map{it.toInt()}.toList()\n var total = votes.reduce{x,y->x+y}\n var com = total/(4*m)\n var msg = \"Yes\"\n var cnt = votes.filter{it >= com}.count()\n \n if(!(cnt >= m)) msg = \"No\"\n \n print(msg)\n \n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 380, "cpu_time_ms": 266, "memory_kb": 37908}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s182967876", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) {\n val inputLine = readLine()!!.split(\" \").map(String::toInt)\n val numN = inputLine[0]\n val numM = inputLine[1]\n\n val aList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n\n aList.sortDescending()\n val sumA = aList.sum()\n val aSize = aList.filter{it > sumA / (numM * 4).toDouble()}.size\n\n val result = if(aSize >= numM) \"Yes\" else \"No\"\n println(result)\n\n}", "language": "Kotlin", "metadata": {"date": 1586050342, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s182967876.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s182967876", "user_id": "u430710262"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val inputLine = readLine()!!.split(\" \").map(String::toInt)\n val numN = inputLine[0]\n val numM = inputLine[1]\n\n val aList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n\n aList.sortDescending()\n val sumA = aList.sum()\n val aSize = aList.filter{it > sumA / (numM * 4).toDouble()}.size\n\n val result = if(aSize >= numM) \"Yes\" else \"No\"\n println(result)\n\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 425, "cpu_time_ms": 241, "memory_kb": 37856}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s535152699", "group_id": "codeNet:p02718", "input_text": "import java.util.*\n\nfun main(args : Array) {\n val sc = Scanner(System.`in`)\n\n val N = sc.nextInt()\n val M = sc.nextInt()\n var A = mutableListOf()\n var total = 0\n for (i in 0 until N) {\n val a = sc.nextInt()\n A.add(Integer(a))\n total+=a\n }\n var count = 0\n val compaire = total / (4 * M)\n for (i in 0 until N) {\n if (A[i] > compaire) {\n count++\n }\n }\n if (count > M) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1586049679, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s535152699.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s535152699", "user_id": "u209749609"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main(args : Array) {\n val sc = Scanner(System.`in`)\n\n val N = sc.nextInt()\n val M = sc.nextInt()\n var A = mutableListOf()\n var total = 0\n for (i in 0 until N) {\n val a = sc.nextInt()\n A.add(Integer(a))\n total+=a\n }\n var count = 0\n val compaire = total / (4 * M)\n for (i in 0 until N) {\n if (A[i] > compaire) {\n count++\n }\n }\n if (count > M) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 532, "cpu_time_ms": 237, "memory_kb": 31520}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s314663891", "group_id": "codeNet:p02718", "input_text": "private fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() // single long\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map(String::toInt) // list of ints\nprivate fun readLongs() = readStrings().map(String::toLong) // list of longs\n\nfun main(args: Array) {\n val (n, m) = readInts()\n val a = readInts()\n val b = a.sortedDescending().take(m)\n //println(b.last())\n println(if (b.last() * 4 * m >= a.sum()) \"Yes\" else \"No\")\n}\n", "language": "Kotlin", "metadata": {"date": 1586049614, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s314663891.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s314663891", "user_id": "u059223549"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "private fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() // single long\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map(String::toInt) // list of ints\nprivate fun readLongs() = readStrings().map(String::toLong) // list of longs\n\nfun main(args: Array) {\n val (n, m) = readInts()\n val a = readInts()\n val b = a.sortedDescending().take(m)\n //println(b.last())\n println(if (b.last() * 4 * m >= a.sum()) \"Yes\" else \"No\")\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 595, "cpu_time_ms": 308, "memory_kb": 36140}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s469280724", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) {\n val (N, M) = listOfInt()\n val A = listOfDouble().sortedDescending()\n val total = A.sum()\n val limit = 1.0 / M.toDouble() / 4.0\n var good = A.subList(0, M).all { (it / total) >= limit }\n val ans = if (good) \"Yes\" else \"No\"\n println(ans)\n}\n\n\nfun next() = readLine()!!\nfun nextInt(delta: Int = 0) = Integer.parseInt(next()) + delta\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfLong() = listOfString().map(String::toLong)\nfun listOfDouble() = listOfString().map(String::toDouble)\nfun listOfInt(delta: Int = 0) = listOfString().map { Integer.parseInt(it) + delta }\nfun listOfInt(vararg offset: Int) = listOfString().map { Integer.parseInt(it) }.mapIndexed { index, int -> int + offset[index % offset.size] }\nfun listOfLong(delta: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + delta }\nfun listOfLong(vararg offset: Long) = listOfString().map { java.lang.Long.parseLong(it) }.mapIndexed { index, long -> long + offset[index % offset.size] }\nfun listOfDouble(delta: Double = 0.0) = listOfString().map { java.lang.Double.parseDouble(it) + delta }\nfun pairIntLong() = listOfLong().let { Pair(it[0].toInt(), it[1]) }\nfun tripleIntIntLong() = listOfLong().let { Triple(it[0].toInt(), it[1].toInt(), it[2]) }\nfun tripleIntLongLong() = listOfLong().let { Triple(it[0].toInt(), it[1], it[2]) }\nfun pairIntLong(offset: Pair = Pair(0, 0L)) = listOfLong().let { Pair(it[0].toInt() + offset.first, it[1] + offset.second) }\nfun tripleIntIntLong(offset: Triple = Triple(0, 0, 0L)) = listOfLong().let { Triple(it[0].toInt() + offset.first, it[1].toInt() + offset.second, it[2] + offset.third) }\nfun tripleIntLongLong(offset: Triple = Triple(0, 0L, 0L)) = listOfLong().let { Triple(it[0].toInt() + offset.first, it[1] + offset.second, it[2] + offset.third) }\n\n\n\n", "language": "Kotlin", "metadata": {"date": 1586049517, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s469280724.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s469280724", "user_id": "u408242391"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, M) = listOfInt()\n val A = listOfDouble().sortedDescending()\n val total = A.sum()\n val limit = 1.0 / M.toDouble() / 4.0\n var good = A.subList(0, M).all { (it / total) >= limit }\n val ans = if (good) \"Yes\" else \"No\"\n println(ans)\n}\n\n\nfun next() = readLine()!!\nfun nextInt(delta: Int = 0) = Integer.parseInt(next()) + delta\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfLong() = listOfString().map(String::toLong)\nfun listOfDouble() = listOfString().map(String::toDouble)\nfun listOfInt(delta: Int = 0) = listOfString().map { Integer.parseInt(it) + delta }\nfun listOfInt(vararg offset: Int) = listOfString().map { Integer.parseInt(it) }.mapIndexed { index, int -> int + offset[index % offset.size] }\nfun listOfLong(delta: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + delta }\nfun listOfLong(vararg offset: Long) = listOfString().map { java.lang.Long.parseLong(it) }.mapIndexed { index, long -> long + offset[index % offset.size] }\nfun listOfDouble(delta: Double = 0.0) = listOfString().map { java.lang.Double.parseDouble(it) + delta }\nfun pairIntLong() = listOfLong().let { Pair(it[0].toInt(), it[1]) }\nfun tripleIntIntLong() = listOfLong().let { Triple(it[0].toInt(), it[1].toInt(), it[2]) }\nfun tripleIntLongLong() = listOfLong().let { Triple(it[0].toInt(), it[1], it[2]) }\nfun pairIntLong(offset: Pair = Pair(0, 0L)) = listOfLong().let { Pair(it[0].toInt() + offset.first, it[1] + offset.second) }\nfun tripleIntIntLong(offset: Triple = Triple(0, 0, 0L)) = listOfLong().let { Triple(it[0].toInt() + offset.first, it[1].toInt() + offset.second, it[2] + offset.third) }\nfun tripleIntLongLong(offset: Triple = Triple(0, 0L, 0L)) = listOfLong().let { Triple(it[0].toInt() + offset.first, it[1] + offset.second, it[2] + offset.third) }\n\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1982, "cpu_time_ms": 312, "memory_kb": 37908}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s829656978", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map { it.toInt() }\n val items = readLine()!!.split(\" \").map { it.toInt() }.sortedDescending()\n\n val sum = items.sum()\n val result = items[m - 1] >= (sum / (4 * m))\n if (result) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1586049061, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s829656978.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s829656978", "user_id": "u897579945"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map { it.toInt() }\n val items = readLine()!!.split(\" \").map { it.toInt() }.sortedDescending()\n\n val sum = items.sum()\n val result = items[m - 1] >= (sum / (4 * m))\n if (result) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 329, "cpu_time_ms": 272, "memory_kb": 37648}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s475480964", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(java.util.Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n fun solve(sc: java.util.Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val M = sc.next().toInt()\n val A = Array(N) { sc.next().toInt() }.sorted().reversed()\n val total = A.sum()\n\n if (A[M - 1] * 4 * M >= total) {\n pw.println(\"Yes\")\n } else {\n pw.println(\"No\")\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1586048841, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s475480964.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s475480964", "user_id": "u297767059"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(java.util.Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n fun solve(sc: java.util.Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val M = sc.next().toInt()\n val A = Array(N) { sc.next().toInt() }.sorted().reversed()\n val total = A.sum()\n\n if (A[M - 1] * 4 * M >= total) {\n pw.println(\"Yes\")\n } else {\n pw.println(\"No\")\n }\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 529, "cpu_time_ms": 259, "memory_kb": 35920}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s931047574", "group_id": "codeNet:p02718", "input_text": "fun main(args: Array) {\n val (N, M) = readLine()!!.split(\" \").map(String::toInt)\n\n val AN = readLine()!!.split(\" \").map(String::toInt).sortedDescending()\n val a = AN.sum() / (4 * M)\n\n if(AN.take(M).all { it > a }){\n println(\"Yes\")\n }else{\n println(\"No\")\n }\n\n}\n\n\n\n", "language": "Kotlin", "metadata": {"date": 1586048722, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s931047574.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s931047574", "user_id": "u085288971"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, M) = readLine()!!.split(\" \").map(String::toInt)\n\n val AN = readLine()!!.split(\" \").map(String::toInt).sortedDescending()\n val a = AN.sum() / (4 * M)\n\n if(AN.take(M).all { it > a }){\n println(\"Yes\")\n }else{\n println(\"No\")\n }\n\n}\n\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 303, "cpu_time_ms": 245, "memory_kb": 36156}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s664075454", "group_id": "codeNet:p02718", "input_text": "fun main(args : Array) {\n val (n, m) = readLine()!!.split(\" \").map { it.toInt() }\n val aa = readLine()!!.split(\" \").map { it.toInt() }\n val sum = aa.sum()\n val del = sum/(4*m)\n\n var cnt = 0\n aa.forEach {\n if (it >= del) cnt++\n if (cnt == m) {\n println(\"Yes\")\n return\n }\n }\n\n println(\"No\")\n}\n", "language": "Kotlin", "metadata": {"date": 1586048710, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02718.html", "problem_id": "p02718", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02718/input.txt", "sample_output_relpath": "derived/input_output/data/p02718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02718/Kotlin/s664075454.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s664075454", "user_id": "u262403099"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args : Array) {\n val (n, m) = readLine()!!.split(\" \").map { it.toInt() }\n val aa = readLine()!!.split(\" \").map { it.toInt() }\n val sum = aa.sum()\n val del = sum/(4*m)\n\n var cnt = 0\n aa.forEach {\n if (it >= del) cnt++\n if (cnt == m) {\n println(\"Yes\")\n return\n }\n }\n\n println(\"No\")\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "sample_input": "4 1\n5 4 2 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02718", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have held a popularity poll for N items on sale. Item i received A_i votes.\n\nFrom these N items, we will select M as popular items. However, we cannot select an item with less than \\dfrac{1}{4M} of the total number of votes.\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq M \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nA_i are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_N\n\nOutput\n\nIf M popular items can be selected, print Yes; otherwise, print No.\n\nSample Input 1\n\n4 1\n5 4 2 1\n\nSample Output 1\n\nYes\n\nThere were 12 votes in total. The most popular item received 5 votes, and we can select it.\n\nSample Input 2\n\n3 2\n380 19 1\n\nSample Output 2\n\nNo\n\nThere were 400 votes in total. The second and third most popular items received less than \\dfrac{1}{4\\times 2} of the total number of votes, so we cannot select them. Thus, we cannot select two popular items.\n\nSample Input 3\n\n12 3\n4 56 78 901 2 345 67 890 123 45 6 789\n\nSample Output 3\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 366, "cpu_time_ms": 302, "memory_kb": 38060}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s258609730", "group_id": "codeNet:p02727", "input_text": "fun main(args: Array) {\n val (x, y, a, b, c) = readLine()!!.split(\" \").map{it.toInt()}\n val p = readLine()!!.split(\" \").map{it.toLong()}\n var q = readLine()!!.split(\" \").map{it.toLong()}\n val r = readLine()!!.split(\" \").map{it.toLong()}\n val aa = p.sortedDescending().take(x).toLongArray()\n val bb = q.sortedDescending().take(y).toLongArray()\n val apple = ( aa + bb + r).sortedDescending().take(x+y)\n var ans = 0L\n repeat(x+y){ans += apple[it]}\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1588112785, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Kotlin/s258609730.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s258609730", "user_id": "u906501980"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "fun main(args: Array) {\n val (x, y, a, b, c) = readLine()!!.split(\" \").map{it.toInt()}\n val p = readLine()!!.split(\" \").map{it.toLong()}\n var q = readLine()!!.split(\" \").map{it.toLong()}\n val r = readLine()!!.split(\" \").map{it.toLong()}\n val aa = p.sortedDescending().take(x).toLongArray()\n val bb = q.sortedDescending().take(y).toLongArray()\n val apple = ( aa + bb + r).sortedDescending().take(x+y)\n var ans = 0L\n repeat(x+y){ans += apple[it]}\n println(ans)\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 499, "cpu_time_ms": 1352, "memory_kb": 112536}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s944452018", "group_id": "codeNet:p02727", "input_text": "import java.util.*;\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val x = Integer.parseInt(sc.next())\n val y = Integer.parseInt(sc.next())\n val a = Integer.parseInt(sc.next())\n val b = Integer.parseInt(sc.next())\n val c = Integer.parseInt(sc.next())\n val p = LongArray(a)\n val q = LongArray(b)\n val r = LongArray(c)\n repeat(a){p[it] = sc.nextLong()}\n repeat(b){q[it] = sc.nextLong()}\n repeat(c){r[it] = sc.nextLong()}\n val aa = p.sortedDescending().take(x).toLongArray()\n val bb = q.sortedDescending().take(y).toLongArray()\n val apple = ( aa + bb + r).sortedDescending().take(x+y)\n var ans = 0L\n repeat(x+y){ans += apple[it]}\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1588112196, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Kotlin/s944452018.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s944452018", "user_id": "u906501980"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "import java.util.*;\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val x = Integer.parseInt(sc.next())\n val y = Integer.parseInt(sc.next())\n val a = Integer.parseInt(sc.next())\n val b = Integer.parseInt(sc.next())\n val c = Integer.parseInt(sc.next())\n val p = LongArray(a)\n val q = LongArray(b)\n val r = LongArray(c)\n repeat(a){p[it] = sc.nextLong()}\n repeat(b){q[it] = sc.nextLong()}\n repeat(c){r[it] = sc.nextLong()}\n val aa = p.sortedDescending().take(x).toLongArray()\n val bb = q.sortedDescending().take(y).toLongArray()\n val apple = ( aa + bb + r).sortedDescending().take(x+y)\n var ans = 0L\n repeat(x+y){ans += apple[it]}\n println(ans)\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 715, "cpu_time_ms": 1019, "memory_kb": 115168}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s777931896", "group_id": "codeNet:p02727", "input_text": "import java.util.*;\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val x = Integer.parseInt(sc.next())\n val y = Integer.parseInt(sc.next())\n val a = Integer.parseInt(sc.next())\n val b = Integer.parseInt(sc.next())\n val c = Integer.parseInt(sc.next())\n var p = LongArray(a)\n var q = LongArray(b)\n var r = LongArray(c)\n repeat(a){p[it] = sc.nextLong()}\n repeat(b){q[it] = sc.nextLong()}\n repeat(c){r[it] = sc.nextLong()}\n var apple = (p.sortedBy{it*-1}.slice(0..x-1).toLongArray() + q.sortedBy{it*-1}.slice(0..y-1).toLongArray() + r).sortedBy{it*-1}.take(x+y)\n println(apple.sum())\n}\n", "language": "Kotlin", "metadata": {"date": 1588111637, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Kotlin/s777931896.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s777931896", "user_id": "u906501980"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "import java.util.*;\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val x = Integer.parseInt(sc.next())\n val y = Integer.parseInt(sc.next())\n val a = Integer.parseInt(sc.next())\n val b = Integer.parseInt(sc.next())\n val c = Integer.parseInt(sc.next())\n var p = LongArray(a)\n var q = LongArray(b)\n var r = LongArray(c)\n repeat(a){p[it] = sc.nextLong()}\n repeat(b){q[it] = sc.nextLong()}\n repeat(c){r[it] = sc.nextLong()}\n var apple = (p.sortedBy{it*-1}.slice(0..x-1).toLongArray() + q.sortedBy{it*-1}.slice(0..y-1).toLongArray() + r).sortedBy{it*-1}.take(x+y)\n println(apple.sum())\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 642, "cpu_time_ms": 1776, "memory_kb": 122332}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s442135259", "group_id": "codeNet:p02727", "input_text": "fun main(args: Array) {\n var (x,y,a,b,c)= readLine()!!.split(' ').map { it.toInt() }\n var p_a= readLine()!!.split(' ').map { it.toInt() }.sortedDescending().toMutableList()\n var p_b= readLine()!!.split(' ').map { it.toInt() }.sortedDescending().toMutableList()\n var p_c= readLine()!!.split(' ').map { it.toInt() }.sortedDescending().toMutableList()\n p_a.add(0)\n p_b.add(0)\n p_c.add(0)\n\n var count_a=0\n var count_b=0\n var count_c=0\n var ans=0\n for (i in 0 until x+y){\n if (count_a=p_b[count_b] && p_a[count_a]>=p_c[count_c]){\n ans+=p_a[count_a]\n count_a++\n }else if(p_a[count_a]=p_c[count_c]){\n ans+=p_b[count_b]\n count_b++\n }else{\n ans+=p_c[count_c]\n count_c++\n }\n }else if (count_b!=y && p_b[count_b]>=p_c[count_c]){\n ans+=p_b[count_b]\n count_b++\n }else if (count_a!=x && p_a[count_a]>=p_c[count_c]){\n ans+=p_a[count_a]\n count_a++\n }else{\n ans+=p_c[count_c]\n count_c++\n }\n }\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1585620720, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Kotlin/s442135259.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s442135259", "user_id": "u456173040"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "fun main(args: Array) {\n var (x,y,a,b,c)= readLine()!!.split(' ').map { it.toInt() }\n var p_a= readLine()!!.split(' ').map { it.toInt() }.sortedDescending().toMutableList()\n var p_b= readLine()!!.split(' ').map { it.toInt() }.sortedDescending().toMutableList()\n var p_c= readLine()!!.split(' ').map { it.toInt() }.sortedDescending().toMutableList()\n p_a.add(0)\n p_b.add(0)\n p_c.add(0)\n\n var count_a=0\n var count_b=0\n var count_c=0\n var ans=0\n for (i in 0 until x+y){\n if (count_a=p_b[count_b] && p_a[count_a]>=p_c[count_c]){\n ans+=p_a[count_a]\n count_a++\n }else if(p_a[count_a]=p_c[count_c]){\n ans+=p_b[count_b]\n count_b++\n }else{\n ans+=p_c[count_c]\n count_c++\n }\n }else if (count_b!=y && p_b[count_b]>=p_c[count_c]){\n ans+=p_b[count_b]\n count_b++\n }else if (count_a!=x && p_a[count_a]>=p_c[count_c]){\n ans+=p_a[count_a]\n count_a++\n }else{\n ans+=p_c[count_c]\n count_c++\n }\n }\n println(ans)\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1241, "cpu_time_ms": 1126, "memory_kb": 109620}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s208471367", "group_id": "codeNet:p02727", "input_text": "fun main(arg: Array) {\n var (X, Y, A, B, C) = listOfInt()\n val P = listOfLong().sortedDescending()\n val Q = listOfLong().sortedDescending()\n val R = listOfLong().toMutableList()\n R.addAll(P.subList(0, X))\n R.addAll(Q.subList(0, Y))\n R.sortDescending()\n var ans = R.subList(0, X + Y).sumByLong { it }\n println(ans)\n}\ninline fun Iterable.sumByLong(selector: (T) -> Long): Long {\n var sum = 0L\n for (element in this) sum += selector(element)\n return sum\n}\nfun next() = readLine()!!\nfun nextInt(delta: Int = 0) = Integer.parseInt(next()) + delta\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt(delta: Int = 0) = listOfString().map { Integer.parseInt(it) + delta }\nfun listOfLong(delta: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + delta }\nfun listOfDouble(delta: Double = 0.0) = listOfString().map { java.lang.Double.parseDouble(it) + delta }\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfLong() = listOfString().map(String::toLong)\nfun listOfDouble() = listOfString().map(String::toDouble)\n", "language": "Kotlin", "metadata": {"date": 1585456826, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Kotlin/s208471367.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s208471367", "user_id": "u043150661"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "fun main(arg: Array) {\n var (X, Y, A, B, C) = listOfInt()\n val P = listOfLong().sortedDescending()\n val Q = listOfLong().sortedDescending()\n val R = listOfLong().toMutableList()\n R.addAll(P.subList(0, X))\n R.addAll(Q.subList(0, Y))\n R.sortDescending()\n var ans = R.subList(0, X + Y).sumByLong { it }\n println(ans)\n}\ninline fun Iterable.sumByLong(selector: (T) -> Long): Long {\n var sum = 0L\n for (element in this) sum += selector(element)\n return sum\n}\nfun next() = readLine()!!\nfun nextInt(delta: Int = 0) = Integer.parseInt(next()) + delta\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt(delta: Int = 0) = listOfString().map { Integer.parseInt(it) + delta }\nfun listOfLong(delta: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + delta }\nfun listOfDouble(delta: Double = 0.0) = listOfString().map { java.lang.Double.parseDouble(it) + delta }\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfLong() = listOfString().map(String::toLong)\nfun listOfDouble() = listOfString().map(String::toDouble)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1149, "cpu_time_ms": 1067, "memory_kb": 103332}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s857433467", "group_id": "codeNet:p02727", "input_text": "fun main(args: Array) {\n val (x, y, a, b, c) = readLine()!!.split(\" \").map { it.toInt() }\n val aList = readLine()!!.split(\" \").map { it.toInt() }.sortedDescending()\n val bList = readLine()!!.split(\" \").map { it.toInt() }.sortedDescending()\n val cList = readLine()!!.split(\" \").map { it.toInt() }.sortedDescending()\n\n var result = 0\n var i = 0\n var j = 0\n var k = 0\n while (i + j + k < x + y) {\n val n1 = if (i < a) aList[i] else -1\n val n2 = if (j < b) bList[j] else -1\n val n3 = if (k < c) cList[k] else -1\n\n if (n1 >= n2 && n1 >= n3 && i < x) {\n result += n1\n i++\n } else if (n2 >= n1 && n2 >= n3 && j < y) {\n result += n2\n j++\n } else if (n3 >= n1 && n3 >= n2) {\n result += n3\n k++\n } else if (j == y && i < x && n1 >= n3) {\n result += n1\n i++\n } else if (i == x && j < y && n2 >= n3) {\n result += n2\n j++\n } else {\n result += n3\n k++\n }\n }\n\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1585453880, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Kotlin/s857433467.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s857433467", "user_id": "u897579945"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "fun main(args: Array) {\n val (x, y, a, b, c) = readLine()!!.split(\" \").map { it.toInt() }\n val aList = readLine()!!.split(\" \").map { it.toInt() }.sortedDescending()\n val bList = readLine()!!.split(\" \").map { it.toInt() }.sortedDescending()\n val cList = readLine()!!.split(\" \").map { it.toInt() }.sortedDescending()\n\n var result = 0\n var i = 0\n var j = 0\n var k = 0\n while (i + j + k < x + y) {\n val n1 = if (i < a) aList[i] else -1\n val n2 = if (j < b) bList[j] else -1\n val n3 = if (k < c) cList[k] else -1\n\n if (n1 >= n2 && n1 >= n3 && i < x) {\n result += n1\n i++\n } else if (n2 >= n1 && n2 >= n3 && j < y) {\n result += n2\n j++\n } else if (n3 >= n1 && n3 >= n2) {\n result += n3\n k++\n } else if (j == y && i < x && n1 >= n3) {\n result += n1\n i++\n } else if (i == x && j < y && n2 >= n3) {\n result += n2\n j++\n } else {\n result += n3\n k++\n }\n }\n\n println(result)\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1106, "cpu_time_ms": 1059, "memory_kb": 109392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s571551487", "group_id": "codeNet:p02727", "input_text": "fun main(arg: Array) {\n val (X, Y, A, B, C) = listOfInt()\n val P = listOfLong().sortedDescending().toLongArray()\n val Q = listOfLong().sortedDescending().toLongArray()\n val R = listOfLong().sortedDescending().toLongArray()\n var ans = 0L\n var x = 0\n var z = 0\n for (n in 0 until X) {\n if (z < C && P[x] < R[z]) {\n ans += R[z]\n z += 1\n } else {\n ans += P[x]\n x += 1\n }\n }\n var y = 0\n for (n in 0 until Y) {\n if (z < C && Q[y] < R[z]) {\n ans += R[z]\n z += 1\n } else {\n ans += Q[y]\n y += 1\n }\n }\n println(ans)\n}\n\nfun next() = readLine()!!\nfun nextInt(delta: Int = 0) = Integer.parseInt(next()) + delta\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt(delta: Int = 0) = listOfString().map { Integer.parseInt(it) + delta }\nfun listOfLong(delta: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + delta }\nfun listOfDouble(delta: Double = 0.0) = listOfString().map { java.lang.Double.parseDouble(it) + delta }\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfLong() = listOfString().map(String::toLong)\nfun listOfDouble() = listOfString().map(String::toDouble)\n", "language": "Kotlin", "metadata": {"date": 1585452446, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Kotlin/s571551487.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s571551487", "user_id": "u043150661"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "fun main(arg: Array) {\n val (X, Y, A, B, C) = listOfInt()\n val P = listOfLong().sortedDescending().toLongArray()\n val Q = listOfLong().sortedDescending().toLongArray()\n val R = listOfLong().sortedDescending().toLongArray()\n var ans = 0L\n var x = 0\n var z = 0\n for (n in 0 until X) {\n if (z < C && P[x] < R[z]) {\n ans += R[z]\n z += 1\n } else {\n ans += P[x]\n x += 1\n }\n }\n var y = 0\n for (n in 0 until Y) {\n if (z < C && Q[y] < R[z]) {\n ans += R[z]\n z += 1\n } else {\n ans += Q[y]\n y += 1\n }\n }\n println(ans)\n}\n\nfun next() = readLine()!!\nfun nextInt(delta: Int = 0) = Integer.parseInt(next()) + delta\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt(delta: Int = 0) = listOfString().map { Integer.parseInt(it) + delta }\nfun listOfLong(delta: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + delta }\nfun listOfDouble(delta: Double = 0.0) = listOfString().map { java.lang.Double.parseDouble(it) + delta }\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfLong() = listOfString().map(String::toLong)\nfun listOfDouble() = listOfString().map(String::toDouble)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1331, "cpu_time_ms": 994, "memory_kb": 101480}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s736735639", "group_id": "codeNet:p02727", "input_text": "import java.util.*\nimport java.io.*\n\nval pw = PrintWriter(System.out)\nval MOD = 1000000007L\nval INF = 2147483647\nval LINF = 9223372036854775807L\n\nfun main(args: Array){\n solve()\n pw.flush() \n}\n\nfun solve(){\n val tmp = nextIntList()\n val x = tmp[0]\n val y = tmp[1]\n val red = nextLongList()\n val green = nextLongList()\n val wild = nextLongList()\n red.sortDescending()\n green.sortDescending()\n wild.sortDescending()\n\n var redIndex = 0\n var greenIndex = 0\n var wildIndex = 0\n var ans = 0L\n for (i in 0 until x) {\n if(red[redIndex] > wild[wildIndex] || wildIndex == wild.size){\n ans += red[redIndex]\n redIndex++\n } else {\n ans += wild[wildIndex]\n wildIndex++\n }\n }\n for (i in 0 until y) {\n if(green[greenIndex] > wild[wildIndex] || wildIndex == wild.size){\n ans += green[greenIndex]\n greenIndex++\n } else {\n ans += wild[wildIndex]\n wildIndex++\n }\n }\n\n println(ans)\n\n\n}\n\n\n\n// Print\nfun println(v: String){\n pw.println(v)\n}\nfun print(v: String){\n pw.print(v)\n}\n\n// Read\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \").toMutableList()\nfun nextIntList(index: Int = 0) = next().split(\" \").map{ it.toInt() + index }.toMutableList()\nfun nextLongList(index: Long = 0L) = next().split(\" \").map{ it.toLong() + index }.toMutableList()\nfun nextDoubleList() = next().split(\" \").map{ it.toDouble() }.toMutableList()\nfun nextAryln(n: Int) = Array(n){ next() }\nfun nextIntAryln(n: Int, index: Int = 0) = IntArray(n){ nextInt() + index }\nfun nextLongAryln(n: Int, index: Long = 0) = LongArray(n){ nextLong() + index }\nfun nextDoubleAryln(n: Int) = DoubleArray(n) { nextDouble() }\n\n// Array\nfun ary(n: Int, init: String = \"\") = Array(n) { init }\nfun intAry(n: Int, init: Int = 0) = IntArray(n) { init }\nfun longAry(n: Int, init: Long = 0L) = LongArray(n) { init }\nfun doubleAry(n: Int, init: Double = 0.0) = DoubleArray(n) { init }\nfun ary2(n: Int, m: Int, init: String = \"\") = Array(n) { Array(m) { init } }\nfun intAry2(n: Int, m: Int, init: Int = 0) = Array(n) { IntArray(m) { init } }\nfun longAry2(n: Int, m: Int, init: Long = 0) = Array(n) { LongArray(m) { init } }\nfun doubleAry2(n: Int, m: Int, init: Double = 0.0) = Array(n) { DoubleArray(m) { init } }\nfun ary3(n: Int, m: Int, k: Int, init: String = \"\") = Array(n) { Array(m) { Array(k) { init } } }\nfun intAry3(n: Int, m: Int, k: Int, init: Int = 0) = Array(n) { Array(m) { IntArray(k) { init } } }\nfun longAry3(n: Int, m: Int, k: Int, init: Long = 0L) = Array(n) { Array(m) { LongArray(k) { init } } }\nfun doubleAry3(n: Int, m: Int, k: Int, init: Double = 0.0) = Array(n) { Array(m) { DoubleArray(k) { init } } }\n\n\n// Math\nfun abs(n: Int) : Int = Math.abs(n)\nfun abs(n: Long) : Long = Math.abs(n)\nfun abs(n: Double) : Double = Math.abs(n)\nfun max(a: Int = -INF, b: Int = -INF, c: Int = -INF, d: Int = -INF, e: Int = -INF): Int = listOf(a, b, c, d, e).max()!!\nfun max(a: Long = -LINF, b: Long = -LINF, c: Long = -LINF, d: Long = -LINF, e: Long = -LINF): Long = listOf(a, b, c, d, e).max()!!.toLong()\nfun min(a: Int = INF, b: Int = INF, c: Int = INF, d: Int = INF, e: Int = INF): Int = listOf(a, b, c, d, e).min()!!\nfun min(a: Long = LINF, b: Long = LINF, c: Long = LINF, d: Long = LINF, e: Long = LINF): Long = listOf(a, b, c, d, e).min()!!.toLong()\nfun prime(from: Long, to: Long = from) : List{\n return (from..to).filter{ i ->\n val max = Math.sqrt(i.toDouble()).toLong()\n (2..max).all{ j -> i % j != 0L}\n }\n}\nfun gcd(a: Long, b: Long) : Long = if(a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Long, b: Long) : Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p:Long = MOD) : Long {\n var res = 1L\n var ar = a\n var nr = n\n while(nr > 0){\n if((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD) : Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long) : Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Permutation(val n: Int, var searched: Int = 0, var nextIndex: Int = 0){\n val size = fact(n)\n val permList = Array(size) { IntArray(n){ 0 } }\n\n fun fact(n: Int) : Int = if(n == 0) 1 else n * fact(n - 1)\n fun init(){\n create(0, IntArray(n) { 0 }, Array(n){ false })\n }\n fun create(num: Int, list: IntArray, flag: Array){\n if(num == n){\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if(flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n fun hasNext() : Boolean {\n if(nextIndex < size){\n return true\n } else {\n nextIndex = 0\n return false\n }\n }\n fun nextPerm() : IntArray = permList[nextIndex++]\n}\n\ndata class Node(val id: Int, var past: Int = -1, var edges: MutableList = mutableListOf())\ndata class Edge(val from: Int, val to: Int, val cost: Long = 1L)", "language": "Kotlin", "metadata": {"date": 1585447660, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Kotlin/s736735639.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s736735639", "user_id": "u581625805"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "import java.util.*\nimport java.io.*\n\nval pw = PrintWriter(System.out)\nval MOD = 1000000007L\nval INF = 2147483647\nval LINF = 9223372036854775807L\n\nfun main(args: Array){\n solve()\n pw.flush() \n}\n\nfun solve(){\n val tmp = nextIntList()\n val x = tmp[0]\n val y = tmp[1]\n val red = nextLongList()\n val green = nextLongList()\n val wild = nextLongList()\n red.sortDescending()\n green.sortDescending()\n wild.sortDescending()\n\n var redIndex = 0\n var greenIndex = 0\n var wildIndex = 0\n var ans = 0L\n for (i in 0 until x) {\n if(red[redIndex] > wild[wildIndex] || wildIndex == wild.size){\n ans += red[redIndex]\n redIndex++\n } else {\n ans += wild[wildIndex]\n wildIndex++\n }\n }\n for (i in 0 until y) {\n if(green[greenIndex] > wild[wildIndex] || wildIndex == wild.size){\n ans += green[greenIndex]\n greenIndex++\n } else {\n ans += wild[wildIndex]\n wildIndex++\n }\n }\n\n println(ans)\n\n\n}\n\n\n\n// Print\nfun println(v: String){\n pw.println(v)\n}\nfun print(v: String){\n pw.print(v)\n}\n\n// Read\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \").toMutableList()\nfun nextIntList(index: Int = 0) = next().split(\" \").map{ it.toInt() + index }.toMutableList()\nfun nextLongList(index: Long = 0L) = next().split(\" \").map{ it.toLong() + index }.toMutableList()\nfun nextDoubleList() = next().split(\" \").map{ it.toDouble() }.toMutableList()\nfun nextAryln(n: Int) = Array(n){ next() }\nfun nextIntAryln(n: Int, index: Int = 0) = IntArray(n){ nextInt() + index }\nfun nextLongAryln(n: Int, index: Long = 0) = LongArray(n){ nextLong() + index }\nfun nextDoubleAryln(n: Int) = DoubleArray(n) { nextDouble() }\n\n// Array\nfun ary(n: Int, init: String = \"\") = Array(n) { init }\nfun intAry(n: Int, init: Int = 0) = IntArray(n) { init }\nfun longAry(n: Int, init: Long = 0L) = LongArray(n) { init }\nfun doubleAry(n: Int, init: Double = 0.0) = DoubleArray(n) { init }\nfun ary2(n: Int, m: Int, init: String = \"\") = Array(n) { Array(m) { init } }\nfun intAry2(n: Int, m: Int, init: Int = 0) = Array(n) { IntArray(m) { init } }\nfun longAry2(n: Int, m: Int, init: Long = 0) = Array(n) { LongArray(m) { init } }\nfun doubleAry2(n: Int, m: Int, init: Double = 0.0) = Array(n) { DoubleArray(m) { init } }\nfun ary3(n: Int, m: Int, k: Int, init: String = \"\") = Array(n) { Array(m) { Array(k) { init } } }\nfun intAry3(n: Int, m: Int, k: Int, init: Int = 0) = Array(n) { Array(m) { IntArray(k) { init } } }\nfun longAry3(n: Int, m: Int, k: Int, init: Long = 0L) = Array(n) { Array(m) { LongArray(k) { init } } }\nfun doubleAry3(n: Int, m: Int, k: Int, init: Double = 0.0) = Array(n) { Array(m) { DoubleArray(k) { init } } }\n\n\n// Math\nfun abs(n: Int) : Int = Math.abs(n)\nfun abs(n: Long) : Long = Math.abs(n)\nfun abs(n: Double) : Double = Math.abs(n)\nfun max(a: Int = -INF, b: Int = -INF, c: Int = -INF, d: Int = -INF, e: Int = -INF): Int = listOf(a, b, c, d, e).max()!!\nfun max(a: Long = -LINF, b: Long = -LINF, c: Long = -LINF, d: Long = -LINF, e: Long = -LINF): Long = listOf(a, b, c, d, e).max()!!.toLong()\nfun min(a: Int = INF, b: Int = INF, c: Int = INF, d: Int = INF, e: Int = INF): Int = listOf(a, b, c, d, e).min()!!\nfun min(a: Long = LINF, b: Long = LINF, c: Long = LINF, d: Long = LINF, e: Long = LINF): Long = listOf(a, b, c, d, e).min()!!.toLong()\nfun prime(from: Long, to: Long = from) : List{\n return (from..to).filter{ i ->\n val max = Math.sqrt(i.toDouble()).toLong()\n (2..max).all{ j -> i % j != 0L}\n }\n}\nfun gcd(a: Long, b: Long) : Long = if(a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Long, b: Long) : Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p:Long = MOD) : Long {\n var res = 1L\n var ar = a\n var nr = n\n while(nr > 0){\n if((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD) : Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long) : Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Permutation(val n: Int, var searched: Int = 0, var nextIndex: Int = 0){\n val size = fact(n)\n val permList = Array(size) { IntArray(n){ 0 } }\n\n fun fact(n: Int) : Int = if(n == 0) 1 else n * fact(n - 1)\n fun init(){\n create(0, IntArray(n) { 0 }, Array(n){ false })\n }\n fun create(num: Int, list: IntArray, flag: Array){\n if(num == n){\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if(flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n fun hasNext() : Boolean {\n if(nextIndex < size){\n return true\n } else {\n nextIndex = 0\n return false\n }\n }\n fun nextPerm() : IntArray = permList[nextIndex++]\n}\n\ndata class Node(val id: Int, var past: Int = -1, var edges: MutableList = mutableListOf())\ndata class Edge(val from: Int, val to: Int, val cost: Long = 1L)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5369, "cpu_time_ms": 1092, "memory_kb": 104044}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s995984446", "group_id": "codeNet:p02727", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n\n val (x, y , a, b, c) = sc.nextLine().split(\" \").map { it.toInt() }\n val p: List = sc.nextLine().split(\" \").map { it.toLong() }.sortedDescending().subList(0, x)\n val q: List = sc.nextLine().split(\" \").map { it.toLong() }.sortedDescending().subList(0, y)\n val r: List = sc.nextLine().split(\" \").map { it.toLong() }.sortedDescending()\n\n println(listOf(p, q, r).flatten().sortedDescending().subList(0, x+y).sum())\n}", "language": "Kotlin", "metadata": {"date": 1585447090, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Kotlin/s995984446.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s995984446", "user_id": "u079781329"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n\n val (x, y , a, b, c) = sc.nextLine().split(\" \").map { it.toInt() }\n val p: List = sc.nextLine().split(\" \").map { it.toLong() }.sortedDescending().subList(0, x)\n val q: List = sc.nextLine().split(\" \").map { it.toLong() }.sortedDescending().subList(0, y)\n val r: List = sc.nextLine().split(\" \").map { it.toLong() }.sortedDescending()\n\n println(listOf(p, q, r).flatten().sortedDescending().subList(0, x+y).sum())\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 532, "cpu_time_ms": 1183, "memory_kb": 117848}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s480624253", "group_id": "codeNet:p02727", "input_text": "import java.util.Scanner\n\nfun main(args: Array) {\n\tval scn = Scanner(System.`in`)\n\tval x = scn.nextInt()\n\tval y = scn.nextInt()\n\tval a = scn.nextInt()\n\tval b = scn.nextInt()\n\tval c = scn.nextInt()\n\tval ps = LongArray(a){scn.nextLong()}.sortedDescending()\n\tval qs = LongArray(b){scn.nextLong()}.sortedDescending()\n\tval rs = LongArray(c){scn.nextLong()}.sortedDescending()\n\tvar ip = x-1\n\tvar iq = y-1\n\tvar sum = ps.subList(0,x).sum() + qs.subList(0,y).sum()\n\tfor (ir in 0 until c.coerceAtMost(x+y)){\n\t\tval r = rs[ir]\n\t\tif (ip<0){\n\t\t\tval q = qs[iq]\n\t\t\tif (q>=r) break\n\t\t\tiq--\n\t\t\tsum += r-q\n\t\t}else if(iq<0){\n\t\t\tval p = ps[ip]\n\t\t\tif (p>=r) break\n\t\t\tip--\n\t\t\tsum += r-p\n\t\t}else {\n\t\t\tval p = ps[ip]\n\t\t\tval q = qs[iq]\n\t\t\tif (p<=q && p) {\n\tval scn = Scanner(System.`in`)\n\tval x = scn.nextInt()\n\tval y = scn.nextInt()\n\tval a = scn.nextInt()\n\tval b = scn.nextInt()\n\tval c = scn.nextInt()\n\tval ps = LongArray(a){scn.nextLong()}.sortedDescending()\n\tval qs = LongArray(b){scn.nextLong()}.sortedDescending()\n\tval rs = LongArray(c){scn.nextLong()}.sortedDescending()\n\tvar ip = x-1\n\tvar iq = y-1\n\tvar sum = ps.subList(0,x).sum() + qs.subList(0,y).sum()\n\tfor (ir in 0 until c.coerceAtMost(x+y)){\n\t\tval r = rs[ir]\n\t\tif (ip<0){\n\t\t\tval q = qs[iq]\n\t\t\tif (q>=r) break\n\t\t\tiq--\n\t\t\tsum += r-q\n\t\t}else if(iq<0){\n\t\t\tval p = ps[ip]\n\t\t\tif (p>=r) break\n\t\t\tip--\n\t\t\tsum += r-p\n\t\t}else {\n\t\t\tval p = ps[ip]\n\t\t\tval q = qs[iq]\n\t\t\tif (p<=q && p= n2 && n1 >= n3 && i < x) {\n ans += n1\n i++\n } else if (n2 >= n1 && n2 >= n3 && j < y) {\n ans += n2\n j++\n } else if (n3 >= n1 && n3 >= n1) {\n ans += n3\n k++\n } else if (i == x && j < y) {\n ans += n2\n j++\n } else if (j == y && i < x) {\n ans += n1\n i++\n } else {\n ans += n3\n k++\n }\n }\n println(ans)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "language": "Kotlin", "metadata": {"date": 1585446359, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Kotlin/s986474383.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s986474383", "user_id": "u190507186"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n val x = sc.nextInt()\n val y = sc.nextInt()\n val a = sc.nextInt()\n val b = sc.nextInt()\n val c = sc.nextInt()\n val p = Array(a) { sc.nextInt() }.sortedDescending()\n val q = Array(b) { sc.nextInt() }.sortedDescending()\n val r = Array(c) { sc.nextInt() }.sortedDescending()\n var ans = 0L\n var i = 0\n var j = 0\n var k = 0\n while (i + j + k < x + y) {\n val n1 = if (i < a) p[i] else -1\n val n2 = if (j < b) q[j] else -1\n val n3 = if (k < c) r[k] else -1\n if (n1 >= n2 && n1 >= n3 && i < x) {\n ans += n1\n i++\n } else if (n2 >= n1 && n2 >= n3 && j < y) {\n ans += n2\n j++\n } else if (n3 >= n1 && n3 >= n1) {\n ans += n3\n k++\n } else if (i == x && j < y) {\n ans += n2\n j++\n } else if (j == y && i < x) {\n ans += n1\n i++\n } else {\n ans += n3\n k++\n }\n }\n println(ans)\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1811, "cpu_time_ms": 1394, "memory_kb": 69960}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s591760039", "group_id": "codeNet:p02727", "input_text": "import java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) {\n PrintWriter(System.out).use { out ->\n solve(out)\n out.flush()\n }\n}\n\nfun solve(out: PrintWriter) {\n val (x, y, a, b, c) = readIntegerList()\n val pList = readLongList().sortedDescending().dropLast(a - x)\n val qList = readLongList().sortedDescending().dropLast(b - y)\n val rList = readLongList().sortedDescending()\n val queue = PriorityQueue()\n queue += pList\n queue += qList\n// println(queue.size)\n var eatR = 0\n var ans = 0L\n// println(queue.joinToString(\" \"))\n while (queue.isNotEmpty()) {\n val eat = queue.remove()\n// println(\"current $eat\")\n if (eatR < c && eat < rList[eatR]) {\n// println(\"eat whilte ${rList[eatR]}\")\n ans += rList[eatR]\n eatR++\n } else {\n// println(\"eat $eat\")\n ans += eat\n }\n// println(\"-----------\")\n }\n\n println(ans)\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\nfun readDoubleList() = readStringList().map(String::toDouble)\n", "language": "Kotlin", "metadata": {"date": 1585446247, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02727.html", "problem_id": "p02727", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02727/input.txt", "sample_output_relpath": "derived/input_output/data/p02727/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02727/Kotlin/s591760039.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s591760039", "user_id": "u784448849"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) {\n PrintWriter(System.out).use { out ->\n solve(out)\n out.flush()\n }\n}\n\nfun solve(out: PrintWriter) {\n val (x, y, a, b, c) = readIntegerList()\n val pList = readLongList().sortedDescending().dropLast(a - x)\n val qList = readLongList().sortedDescending().dropLast(b - y)\n val rList = readLongList().sortedDescending()\n val queue = PriorityQueue()\n queue += pList\n queue += qList\n// println(queue.size)\n var eatR = 0\n var ans = 0L\n// println(queue.joinToString(\" \"))\n while (queue.isNotEmpty()) {\n val eat = queue.remove()\n// println(\"current $eat\")\n if (eatR < c && eat < rList[eatR]) {\n// println(\"eat whilte ${rList[eatR]}\")\n ans += rList[eatR]\n eatR++\n } else {\n// println(\"eat $eat\")\n ans += eat\n }\n// println(\"-----------\")\n }\n\n println(ans)\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\nfun readDoubleList() = readStringList().map(String::toDouble)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "sample_input": "1 2 2 2 1\n2 4\n5 1\n3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02727", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to eat X red apples and Y green apples.\n\nYou have A red apples of deliciousness p_1,p_2, \\dots, p_A, B green apples of deliciousness q_1,q_2, \\dots, q_B, and C colorless apples of deliciousness r_1,r_2, \\dots, r_C.\n\nBefore eating a colorless apple, you can paint it red or green, and it will count as a red or green apple, respectively.\n\nFrom the apples above, you will choose the apples to eat while making the sum of the deliciousness of the eaten apples as large as possible.\n\nFind the maximum possible sum of the deliciousness of the eaten apples that can be achieved when optimally coloring zero or more colorless apples.\n\nConstraints\n\n1 \\leq X \\leq A \\leq 10^5\n\n1 \\leq Y \\leq B \\leq 10^5\n\n1 \\leq C \\leq 10^5\n\n1 \\leq p_i \\leq 10^9\n\n1 \\leq q_i \\leq 10^9\n\n1 \\leq r_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y A B C\np_1 p_2 ... p_A\nq_1 q_2 ... q_B\nr_1 r_2 ... r_C\n\nOutput\n\nPrint the maximum possible sum of the deliciousness of the eaten apples.\n\nSample Input 1\n\n1 2 2 2 1\n2 4\n5 1\n3\n\nSample Output 1\n\n12\n\nThe maximum possible sum of the deliciousness of the eaten apples can be achieved as follows:\n\nEat the 2-nd red apple.\n\nEat the 1-st green apple.\n\nPaint the 1-st colorless apple green and eat it.\n\nSample Input 2\n\n2 2 2 2 2\n8 6\n9 1\n2 1\n\nSample Output 2\n\n25\n\nSample Input 3\n\n2 2 4 4 4\n11 12 13 14\n21 22 23 24\n1 2 3 4\n\nSample Output 3\n\n74", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1296, "cpu_time_ms": 1164, "memory_kb": 106348}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s952818264", "group_id": "codeNet:p02743", "input_text": "fun main(args: Array) {\n // Your code here!\n val (a,b,c) = readLine()!!.split(\" \").map{it.toLong()}\n var msg = \"No\"\n val d = c-a-b\n \n \n if(d > 0 && 4*a*b < d*d){\n msg = \"Yes\"\n }\n println(msg)\n}", "language": "Kotlin", "metadata": {"date": 1587559115, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s952818264.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s952818264", "user_id": "u808976884"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n // Your code here!\n val (a,b,c) = readLine()!!.split(\" \").map{it.toLong()}\n var msg = \"No\"\n val d = c-a-b\n \n \n if(d > 0 && 4*a*b < d*d){\n msg = \"Yes\"\n }\n println(msg)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 235, "cpu_time_ms": 235, "memory_kb": 37868}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s429326435", "group_id": "codeNet:p02743", "input_text": "fun main(args: Array) {\n val (a, b, c) = readLine()!!.split(\" \").map(String::toDouble)\n\n if (Math.sqrt(a) + Math.sqrt(b) < Math.sqrt(c)) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1586027437, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s429326435.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s429326435", "user_id": "u482808328"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n val (a, b, c) = readLine()!!.split(\" \").map(String::toDouble)\n\n if (Math.sqrt(a) + Math.sqrt(b) < Math.sqrt(c)) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 218, "cpu_time_ms": 235, "memory_kb": 36016}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s034865455", "group_id": "codeNet:p02743", "input_text": "fun main(args: Array) {\n val (a, b, c) = readLine()!!.split(' ').map { it.toLong() }\n val d = c - a - b\n println(if (d > 0 && 4 * a * b < d * d) \"Yes\" else \"No\")\n}\n", "language": "Kotlin", "metadata": {"date": 1584366459, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s034865455.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s034865455", "user_id": "u863309603"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n val (a, b, c) = readLine()!!.split(' ').map { it.toLong() }\n val d = c - a - b\n println(if (d > 0 && 4 * a * b < d * d) \"Yes\" else \"No\")\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 181, "cpu_time_ms": 239, "memory_kb": 38164}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s761525397", "group_id": "codeNet:p02743", "input_text": "fun main(args: Array) {\n val (a, b, c) = readLine()!!.split(\" \").map { it.toDouble()}\n if((Math.sqrt(a) + Math.sqrt(b)).toLong() < Math.sqrt(c).toLong()) println(\"Yes\")\n else println(\"No\")\n}", "language": "Kotlin", "metadata": {"date": 1584267288, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s761525397.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s761525397", "user_id": "u012185592"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n val (a, b, c) = readLine()!!.split(\" \").map { it.toDouble()}\n if((Math.sqrt(a) + Math.sqrt(b)).toLong() < Math.sqrt(c).toLong()) println(\"Yes\")\n else println(\"No\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 207, "cpu_time_ms": 240, "memory_kb": 37908}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s833992098", "group_id": "codeNet:p02743", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextLong()\n val b = sc.nextLong()\n val c = sc.nextLong()\n val left = 4 * a * b\n val right = (c-a-b)*(c-a-b)\n if (c - a - b > 0 && left < right) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1584241616, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s833992098.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s833992098", "user_id": "u733811860"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextLong()\n val b = sc.nextLong()\n val c = sc.nextLong()\n val left = 4 * a * b\n val right = (c-a-b)*(c-a-b)\n if (c - a - b > 0 && left < right) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 327, "cpu_time_ms": 220, "memory_kb": 31512}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s653830708", "group_id": "codeNet:p02743", "input_text": "fun main(args: Array) = panasonic2020c()\n\nfun panasonic2020c() {\n val (a, b, c) = readLine()!!.split(' ').map { it.toLong() }\n\n val n = c - a - b\n\n val answer = if (n > 0 && 4 * a * b < n * n) \"Yes\" else \"No\"\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1584241561, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s653830708.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s653830708", "user_id": "u139478771"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) = panasonic2020c()\n\nfun panasonic2020c() {\n val (a, b, c) = readLine()!!.split(' ').map { it.toLong() }\n\n val n = c - a - b\n\n val answer = if (n > 0 && 4 * a * b < n * n) \"Yes\" else \"No\"\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 249, "cpu_time_ms": 241, "memory_kb": 38176}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s390529142", "group_id": "codeNet:p02743", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextLong()\n val b = sc.nextLong()\n val c = sc.nextLong()\n val left = 4 * a * b\n val right = (c-a-b)*(c-a-b)\n if (c - a - b > 0 && left < right) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1584241492, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s390529142.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s390529142", "user_id": "u219475690"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextLong()\n val b = sc.nextLong()\n val c = sc.nextLong()\n val left = 4 * a * b\n val right = (c-a-b)*(c-a-b)\n if (c - a - b > 0 && left < right) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 327, "cpu_time_ms": 180, "memory_kb": 31264}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s277142756", "group_id": "codeNet:p02743", "input_text": "fun main(args : Array) {\n val (a, b, c) = readLine()!!.split(\" \").map { it.toLong() }\n\n if (c - a - b <= 0) {\n println(\"No\")\n return\n }\n\n val left = (c - a - b) * (c - a - b)\n val right = 4 * a * b\n\n println(if (left > right) \"Yes\" else \"No\")\n}", "language": "Kotlin", "metadata": {"date": 1584241339, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s277142756.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s277142756", "user_id": "u262403099"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args : Array) {\n val (a, b, c) = readLine()!!.split(\" \").map { it.toLong() }\n\n if (c - a - b <= 0) {\n println(\"No\")\n return\n }\n\n val left = (c - a - b) * (c - a - b)\n val right = 4 * a * b\n\n println(if (left > right) \"Yes\" else \"No\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 284, "cpu_time_ms": 278, "memory_kb": 39872}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s072524950", "group_id": "codeNet:p02743", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextLong()\n val b = sc.nextLong()\n val c = sc.nextLong()\n val left = 4 * a * b\n val right = Math.pow((c-a-b).toDouble(), 2.0).toLong()\n if (left < right) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1584240965, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s072524950.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s072524950", "user_id": "u219475690"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextLong()\n val b = sc.nextLong()\n val c = sc.nextLong()\n val left = 4 * a * b\n val right = Math.pow((c-a-b).toDouble(), 2.0).toLong()\n if (left < right) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 337, "cpu_time_ms": 186, "memory_kb": 31260}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s488663651", "group_id": "codeNet:p02743", "input_text": "fun main(args: Array) {\n val (a, b, c) = readLine()!!.split(' ').map { it.toDouble() }\n\n val sa = sqrt(a)\n val sb = sqrt(b)\n val sc = sqrt(c)\n if ((sa + sb) < sc) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\nfun sqrt(a: Double) : Double {\n var b = Math.sqrt(a)\n repeat(10000000) {\n b = (b * b + a) / (2 * b)\n }\n return b\n}\n", "language": "Kotlin", "metadata": {"date": 1584239891, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s488663651.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s488663651", "user_id": "u288435405"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n val (a, b, c) = readLine()!!.split(' ').map { it.toDouble() }\n\n val sa = sqrt(a)\n val sb = sqrt(b)\n val sc = sqrt(c)\n if ((sa + sb) < sc) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\nfun sqrt(a: Double) : Double {\n var b = Math.sqrt(a)\n repeat(10000000) {\n b = (b * b + a) / (2 * b)\n }\n return b\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 388, "cpu_time_ms": 728, "memory_kb": 38056}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s670861898", "group_id": "codeNet:p02743", "input_text": "import java.math.BigDecimal\n\nfun main(args: Array) {\n val (a, b, c) = readLongList()\n val ab = BigDecimal.valueOf(4).multiply(BigDecimal.valueOf(a)).multiply(BigDecimal.valueOf(b))!!\n var tmp = BigDecimal.valueOf(c).minus(BigDecimal.valueOf(a)).minus(BigDecimal.valueOf(b))\n tmp = tmp.multiply(tmp)\n val ans = if (ab.compareTo(tmp) < 0) {\n \"Yes\"\n } else {\n \"No\"\n }\n\n println(ans)\n}\n\nfun lowerBound(ab: Long): Double {\n var left: Double = 0.0\n var right = ab.toDouble()\n var i = 0\n while (i < 100000000) {\n val mid = (right + left) / 2.0\n if (ab <= mid * mid) {\n right = mid\n } else {\n left = mid\n }\n i++\n }\n\n return left\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "language": "Kotlin", "metadata": {"date": 1584239716, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s670861898.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s670861898", "user_id": "u784448849"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.math.BigDecimal\n\nfun main(args: Array) {\n val (a, b, c) = readLongList()\n val ab = BigDecimal.valueOf(4).multiply(BigDecimal.valueOf(a)).multiply(BigDecimal.valueOf(b))!!\n var tmp = BigDecimal.valueOf(c).minus(BigDecimal.valueOf(a)).minus(BigDecimal.valueOf(b))\n tmp = tmp.multiply(tmp)\n val ans = if (ab.compareTo(tmp) < 0) {\n \"Yes\"\n } else {\n \"No\"\n }\n\n println(ans)\n}\n\nfun lowerBound(ab: Long): Double {\n var left: Double = 0.0\n var right = ab.toDouble()\n var i = 0\n while (i < 100000000) {\n val mid = (right + left) / 2.0\n if (ab <= mid * mid) {\n right = mid\n } else {\n left = mid\n }\n i++\n }\n\n return left\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 991, "cpu_time_ms": 312, "memory_kb": 37992}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s505833286", "group_id": "codeNet:p02743", "input_text": "fun main(args : Array) {\n val (a, b, c) = readLine()!!.split(\" \").map { it.toDouble() }\n\n val cal = (a*a + b*b + c*c) - 2*(a*b + b*c + a*c)\n\n println(if (cal > 0) \"Yes\" else \"No\")\n}", "language": "Kotlin", "metadata": {"date": 1584239360, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s505833286.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s505833286", "user_id": "u262403099"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args : Array) {\n val (a, b, c) = readLine()!!.split(\" \").map { it.toDouble() }\n\n val cal = (a*a + b*b + c*c) - 2*(a*b + b*c + a*c)\n\n println(if (cal > 0) \"Yes\" else \"No\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 198, "cpu_time_ms": 241, "memory_kb": 38052}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s532908246", "group_id": "codeNet:p02743", "input_text": "import java.math.BigDecimal\n\nfun main(args: Array) {\n val (a, b, c) = readLongList()\n val ab = 4 * a * b\n val tmp = (c - a - b) * (c - a - b)\n val ans = if (0 < a * a + b * b + c * c - 2 * c * a - 2 * b * c - 2 * a * b) {\n \"Yes\"\n } else {\n \"No\"\n }\n\n println(ans)\n}\n\nfun lowerBound(ab: Long): Double {\n var left: Double = 0.0\n var right = ab.toDouble()\n var i = 0\n while (i < 100000000) {\n val mid = (right + left) / 2.0\n if (ab <= mid * mid) {\n right = mid\n } else {\n left = mid\n }\n i++\n }\n\n return left\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "language": "Kotlin", "metadata": {"date": 1584238989, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s532908246.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s532908246", "user_id": "u784448849"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.math.BigDecimal\n\nfun main(args: Array) {\n val (a, b, c) = readLongList()\n val ab = 4 * a * b\n val tmp = (c - a - b) * (c - a - b)\n val ans = if (0 < a * a + b * b + c * c - 2 * c * a - 2 * b * c - 2 * a * b) {\n \"Yes\"\n } else {\n \"No\"\n }\n\n println(ans)\n}\n\nfun lowerBound(ab: Long): Double {\n var left: Double = 0.0\n var right = ab.toDouble()\n var i = 0\n while (i < 100000000) {\n val mid = (right + left) / 2.0\n if (ab <= mid * mid) {\n right = mid\n } else {\n left = mid\n }\n i++\n }\n\n return left\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 871, "cpu_time_ms": 246, "memory_kb": 37748}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s589016071", "group_id": "codeNet:p02743", "input_text": "import java.math.BigDecimal\n\nimport java.math.MathContext\n\nfun main(args: Array) = panasonic2020c()\n\nfun panasonic2020c() {\n val (a, b, c) = readLine()!!.split(' ').map { BigDecimal(it) }\n\n val answer =\n if (sqrt(a, 2)!! + sqrt(b, 2)!! < sqrt(c, 2)!!) \"Yes\" else \"No\"\n\n println(answer)\n}\n\nfun sqrt(a: BigDecimal, scale: Int): BigDecimal? {\n var x = BigDecimal(Math.sqrt(a.toDouble()), MathContext.DECIMAL64)\n if (scale < 17) {\n x = x.setScale(scale, BigDecimal.ROUND_HALF_EVEN)\n return x\n }\n val b2 = BigDecimal(2)\n var tempScale = 16\n while (tempScale < scale) {\n x = x.subtract(\n x.multiply(x).subtract(a).divide(\n x.multiply(b2), scale, BigDecimal.ROUND_HALF_EVEN\n )\n )\n tempScale *= 2\n }\n return x\n}\n", "language": "Kotlin", "metadata": {"date": 1584238495, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s589016071.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s589016071", "user_id": "u139478771"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.math.BigDecimal\n\nimport java.math.MathContext\n\nfun main(args: Array) = panasonic2020c()\n\nfun panasonic2020c() {\n val (a, b, c) = readLine()!!.split(' ').map { BigDecimal(it) }\n\n val answer =\n if (sqrt(a, 2)!! + sqrt(b, 2)!! < sqrt(c, 2)!!) \"Yes\" else \"No\"\n\n println(answer)\n}\n\nfun sqrt(a: BigDecimal, scale: Int): BigDecimal? {\n var x = BigDecimal(Math.sqrt(a.toDouble()), MathContext.DECIMAL64)\n if (scale < 17) {\n x = x.setScale(scale, BigDecimal.ROUND_HALF_EVEN)\n return x\n }\n val b2 = BigDecimal(2)\n var tempScale = 16\n while (tempScale < scale) {\n x = x.subtract(\n x.multiply(x).subtract(a).divide(\n x.multiply(b2), scale, BigDecimal.ROUND_HALF_EVEN\n )\n )\n tempScale *= 2\n }\n return x\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 824, "cpu_time_ms": 238, "memory_kb": 38180}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s911260135", "group_id": "codeNet:p02743", "input_text": "import java.math.BigInteger\nimport java.util.*\n\nprivate fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() // single long\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map(String::toInt) // list of ints\nprivate fun readLongs() = readStrings().map(String::toLong) // list of longs\n\nfun main(args: Array) {\n val (a, b, c) = readInts().map { Math.sqrt(it.toDouble()) }\n print(if (a + b - c < 0 && Math.abs(a + b - c) > 0.000000001) \"Yes\" else \"No\")\n}\n", "language": "Kotlin", "metadata": {"date": 1584237763, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s911260135.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s911260135", "user_id": "u059223549"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.math.BigInteger\nimport java.util.*\n\nprivate fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() // single long\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map(String::toInt) // list of ints\nprivate fun readLongs() = readStrings().map(String::toLong) // list of longs\n\nfun main(args: Array) {\n val (a, b, c) = readInts().map { Math.sqrt(it.toDouble()) }\n print(if (a + b - c < 0 && Math.abs(a + b - c) > 0.000000001) \"Yes\" else \"No\")\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 612, "cpu_time_ms": 234, "memory_kb": 37876}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s445450644", "group_id": "codeNet:p02743", "input_text": "import java.math.BigDecimal\n\nfun main(args: Array){\n val bd1 = BigDecimal(\"123456789012345\")\n val bd2 = BigDecimal(\"0.123456789012345\")\n val bd3 = BigDecimal(\"0.123456789012344\")\n val input: List = readLine()!!.split(\" \").map { it.toDouble() }\n val b1=BigDecimal(input[0])\n val b2=BigDecimal(input[1])\n val b3=BigDecimal(input[2])\n if(b1+b2){\n val bd1 = BigDecimal(\"123456789012345\")\n val bd2 = BigDecimal(\"0.123456789012345\")\n val bd3 = BigDecimal(\"0.123456789012344\")\n val input: List = readLine()!!.split(\" \").map { it.toDouble() }\n val b1=BigDecimal(input[0])\n val b2=BigDecimal(input[1])\n val b3=BigDecimal(input[2])\n if(b1+b2) {\n val sc = Scanner(System.`in`)\n\n val a = sc.nextLong()\n val b = sc.nextLong()\n val c = sc.nextLong()\n\n println(if(a + b + 2 * sqrt(a*b.toDouble()) < c) \"Yes\" else \"No\")\n}", "language": "Kotlin", "metadata": {"date": 1584236629, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s194417043.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s194417043", "user_id": "u079781329"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.lang.Math.sqrt\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n\n val a = sc.nextLong()\n val b = sc.nextLong()\n val c = sc.nextLong()\n\n println(if(a + b + 2 * sqrt(a*b.toDouble()) < c) \"Yes\" else \"No\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 264, "cpu_time_ms": 186, "memory_kb": 31396}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s944899893", "group_id": "codeNet:p02743", "input_text": "import java.lang.Math.sqrt\n\nfun main(args: Array){\n val input: List = readLine()!!.split(\" \").map { it.toDouble() }\n if(sqrt(input[0])+sqrt(input[1])){\n val input: List = readLine()!!.split(\" \").map { it.toDouble() }\n if(sqrt(input[0])+sqrt(input[1])) {\n val (a, b, c) = readListOfLong() \n // val ishigher = Math.sqrt(c) > Math.sqrt(a) + Math.sqrt(b)\n val ishigher = c * c - 2 * (a + b) * c + (a + b) * (a + b) > 4 * a * b\n println(if(ishigher) \"Yes\" else \"No\")\n\tpw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n\t= this.groupBy { it }.mapValues { it.value.size }\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element >= this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn l\n}\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element <= this[mid]) { \n\t\t\tr = mid\n\t\t} else {\n\t\t\tl = mid + 1\n\t\t}\n\t}\n\treturn r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n\tval divisors = mutableListOf()\n\tfor(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n\t\tif(this % i == 0L) {\n\t\t\tdivisors.add(i)\n\t\t\tif(i != this/i) {\n\t\t\t\tdivisors.add(this/i)\n\t\t\t}\n\t\t}\n\t}\n\treturn divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n\tif(this==1L) return false\n\tfor(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n\t\tif(this % i == 0L && this != i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n\nfun permutations(src: List): List> {\n\tif(src.size == 1) return listOf(src)\n\tval perms = mutableListOf>()\n\tval insertElement = src[0]\n\tpermutations(src.drop(1)).forEach { perm ->\n\t\tfor(i in 0..perm.size) {\n\t\t\tval newPerm = perm.toMutableList()\n\t\t\tnewPerm.add(i, insertElement)\n\t\t\tperms.add(newPerm.toList())\n\t\t}\n\t}\n\treturn perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n\tval v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n\tfor(i in 0 until v.size) {\n\t\tv[i][0] = 1L\n\t\tv[i][i] = 1L\n\t}\n\tfor(i in 0 until v.size) {\n\t\tfor(j in 1 until i) {\n\t\t\tv[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n\t\t}\n\t}\n\treturn v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n\twhen {\n\t\tn == 1L -> a % mod\n\t\tn % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n\t\telse -> {\n\t\t\tval tmp = repeatedModPow(a, n / 2L, mod)\n\t\t\t(tmp * tmp) % mod\n\t\t}\n\t}\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n\tvar ret = 1L\n\tval min = Math.min(k, n-k)\n\t// まず分母の計算\n\tfor(i in n downTo (n - min + 1)) {\n\t\tret = ret * i % mod\n\t}\n\tfor(i in min downTo 1) {\n\t\tret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n\t}\n\treturn ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n\tval factorials = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval inverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval factorialInverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tfor(i in 2 .. n) {\n\t\tfactorials[i] = (factorials[i-1] * i.toLong() % mod)\n\t\tinverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n\t\tfactorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n\t}\n\n\treturn factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n\tif(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n\ta / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n\tvar num = num_\n\tvar rtn: Long = 0\n\twhile(num != 0.toLong()) {\n\t\tval tmp = num % 10\n\t\trtn += tmp\n\t\tnum /= 10\n\t}\n\treturn rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n\tprivate val parent: Array = Array(n) { 0 }\n\tprivate val rank: Array = Array(n) { 0 }\n\tprivate val size: Array = Array(n) { 0 }\n\n\tinit {\n\t\tfor(i in 0 until n) {\n\t\t\tparent[i] = i\n\t\t\trank[i] = 1\n\t\t\tsize[i] = 1\n\t\t}\n\t}\n\n\tfun union(u: Int, v: Int) {\n\t\tvar x = root(u)\n\t\tvar y = root(v)\n\t\tif(x != y) {\n\t\t\tif(rank[y] < rank[x]) {\n\t\t\t\tval tmp = y \n\t\t\t\ty = x\n\t\t\t\tx = tmp \n\t\t\t}\n\t\t\tparent[x] = y\n\t\t\trank[y] += rank[x]\n\t\t\trank[x] = -1\n\t\t\tval totalSize = size[x] + size[y]\n\t\t\tsize[x] = totalSize\n\t\t\tsize[y] = totalSize\n\t\t}\n\t}\n\n\tfun root(u: Int): Int {\n\t\tvar x = u\n\t\twhile(parent[x] != x) {\n\t\t\tx = parent[x]\n\t\t}\n\t\treturn x \n\t}\n\n\tfun size(u: Int): Int = size[root(u)]\n}\n\nclass Stack(private var st: MutableList = mutableListOf()) {\n\tfun isEmpty() = st.isEmpty()\n\tfun top(): T = st.last()\n\tfun push(e: T) { st.add(e) }\n\tfun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n\tfun isEmpty() = que.isEmpty()\n\tfun top(): T = que.first()\n\tfun push(e: T) { que.add(e) }\n\tfun pop() { que = que.drop(1).toMutableList() }\n}\n", "language": "Kotlin", "metadata": {"date": 1584236176, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s856799855.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s856799855", "user_id": "u026686258"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val (a, b, c) = readListOfLong() \n // val ishigher = Math.sqrt(c) > Math.sqrt(a) + Math.sqrt(b)\n val ishigher = c * c - 2 * (a + b) * c + (a + b) * (a + b) > 4 * a * b\n println(if(ishigher) \"Yes\" else \"No\")\n\tpw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n\t= this.groupBy { it }.mapValues { it.value.size }\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element >= this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn l\n}\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element <= this[mid]) { \n\t\t\tr = mid\n\t\t} else {\n\t\t\tl = mid + 1\n\t\t}\n\t}\n\treturn r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n\tval divisors = mutableListOf()\n\tfor(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n\t\tif(this % i == 0L) {\n\t\t\tdivisors.add(i)\n\t\t\tif(i != this/i) {\n\t\t\t\tdivisors.add(this/i)\n\t\t\t}\n\t\t}\n\t}\n\treturn divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n\tif(this==1L) return false\n\tfor(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n\t\tif(this % i == 0L && this != i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n\nfun permutations(src: List): List> {\n\tif(src.size == 1) return listOf(src)\n\tval perms = mutableListOf>()\n\tval insertElement = src[0]\n\tpermutations(src.drop(1)).forEach { perm ->\n\t\tfor(i in 0..perm.size) {\n\t\t\tval newPerm = perm.toMutableList()\n\t\t\tnewPerm.add(i, insertElement)\n\t\t\tperms.add(newPerm.toList())\n\t\t}\n\t}\n\treturn perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n\tval v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n\tfor(i in 0 until v.size) {\n\t\tv[i][0] = 1L\n\t\tv[i][i] = 1L\n\t}\n\tfor(i in 0 until v.size) {\n\t\tfor(j in 1 until i) {\n\t\t\tv[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n\t\t}\n\t}\n\treturn v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n\twhen {\n\t\tn == 1L -> a % mod\n\t\tn % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n\t\telse -> {\n\t\t\tval tmp = repeatedModPow(a, n / 2L, mod)\n\t\t\t(tmp * tmp) % mod\n\t\t}\n\t}\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n\tvar ret = 1L\n\tval min = Math.min(k, n-k)\n\t// まず分母の計算\n\tfor(i in n downTo (n - min + 1)) {\n\t\tret = ret * i % mod\n\t}\n\tfor(i in min downTo 1) {\n\t\tret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n\t}\n\treturn ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n\tval factorials = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval inverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval factorialInverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tfor(i in 2 .. n) {\n\t\tfactorials[i] = (factorials[i-1] * i.toLong() % mod)\n\t\tinverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n\t\tfactorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n\t}\n\n\treturn factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n\tif(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n\ta / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n\tvar num = num_\n\tvar rtn: Long = 0\n\twhile(num != 0.toLong()) {\n\t\tval tmp = num % 10\n\t\trtn += tmp\n\t\tnum /= 10\n\t}\n\treturn rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n\tprivate val parent: Array = Array(n) { 0 }\n\tprivate val rank: Array = Array(n) { 0 }\n\tprivate val size: Array = Array(n) { 0 }\n\n\tinit {\n\t\tfor(i in 0 until n) {\n\t\t\tparent[i] = i\n\t\t\trank[i] = 1\n\t\t\tsize[i] = 1\n\t\t}\n\t}\n\n\tfun union(u: Int, v: Int) {\n\t\tvar x = root(u)\n\t\tvar y = root(v)\n\t\tif(x != y) {\n\t\t\tif(rank[y] < rank[x]) {\n\t\t\t\tval tmp = y \n\t\t\t\ty = x\n\t\t\t\tx = tmp \n\t\t\t}\n\t\t\tparent[x] = y\n\t\t\trank[y] += rank[x]\n\t\t\trank[x] = -1\n\t\t\tval totalSize = size[x] + size[y]\n\t\t\tsize[x] = totalSize\n\t\t\tsize[y] = totalSize\n\t\t}\n\t}\n\n\tfun root(u: Int): Int {\n\t\tvar x = u\n\t\twhile(parent[x] != x) {\n\t\t\tx = parent[x]\n\t\t}\n\t\treturn x \n\t}\n\n\tfun size(u: Int): Int = size[root(u)]\n}\n\nclass Stack(private var st: MutableList = mutableListOf()) {\n\tfun isEmpty() = st.isEmpty()\n\tfun top(): T = st.last()\n\tfun push(e: T) { st.add(e) }\n\tfun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n\tfun isEmpty() = que.isEmpty()\n\tfun top(): T = que.first()\n\tfun push(e: T) { que.add(e) }\n\tfun pop() { que = que.drop(1).toMutableList() }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5780, "cpu_time_ms": 237, "memory_kb": 37944}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s079282810", "group_id": "codeNet:p02743", "input_text": "import java.math.BigDecimal\n\nfun main(args: Array) {\n val (a, b, c) = readLine()!!.split(\" \").map(String::toDouble)\n val decA = BigDecimal.valueOf(Math.sqrt(a))\n val decB = BigDecimal.valueOf(Math.sqrt(b))\n val decC = BigDecimal.valueOf(Math.sqrt(c))\n val decSum = decA.add(decB)\n if (decSum < decC) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1584236158, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s079282810.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s079282810", "user_id": "u106908407"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.math.BigDecimal\n\nfun main(args: Array) {\n val (a, b, c) = readLine()!!.split(\" \").map(String::toDouble)\n val decA = BigDecimal.valueOf(Math.sqrt(a))\n val decB = BigDecimal.valueOf(Math.sqrt(b))\n val decC = BigDecimal.valueOf(Math.sqrt(c))\n val decSum = decA.add(decB)\n if (decSum < decC) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 393, "cpu_time_ms": 250, "memory_kb": 37944}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s299606366", "group_id": "codeNet:p02743", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val (a, b, c) = readListOfDouble() \n val ishigher = Math.sqrt(c) > Math.sqrt(a) + Math.sqrt(b)\n println(if(ishigher) \"Yes\" else \"No\")\n\tpw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n\t= this.groupBy { it }.mapValues { it.value.size }\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element >= this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn l\n}\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element <= this[mid]) { \n\t\t\tr = mid\n\t\t} else {\n\t\t\tl = mid + 1\n\t\t}\n\t}\n\treturn r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n\tval divisors = mutableListOf()\n\tfor(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n\t\tif(this % i == 0L) {\n\t\t\tdivisors.add(i)\n\t\t\tif(i != this/i) {\n\t\t\t\tdivisors.add(this/i)\n\t\t\t}\n\t\t}\n\t}\n\treturn divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n\tif(this==1L) return false\n\tfor(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n\t\tif(this % i == 0L && this != i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n\nfun permutations(src: List): List> {\n\tif(src.size == 1) return listOf(src)\n\tval perms = mutableListOf>()\n\tval insertElement = src[0]\n\tpermutations(src.drop(1)).forEach { perm ->\n\t\tfor(i in 0..perm.size) {\n\t\t\tval newPerm = perm.toMutableList()\n\t\t\tnewPerm.add(i, insertElement)\n\t\t\tperms.add(newPerm.toList())\n\t\t}\n\t}\n\treturn perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n\tval v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n\tfor(i in 0 until v.size) {\n\t\tv[i][0] = 1L\n\t\tv[i][i] = 1L\n\t}\n\tfor(i in 0 until v.size) {\n\t\tfor(j in 1 until i) {\n\t\t\tv[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n\t\t}\n\t}\n\treturn v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n\twhen {\n\t\tn == 1L -> a % mod\n\t\tn % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n\t\telse -> {\n\t\t\tval tmp = repeatedModPow(a, n / 2L, mod)\n\t\t\t(tmp * tmp) % mod\n\t\t}\n\t}\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n\tvar ret = 1L\n\tval min = Math.min(k, n-k)\n\t// まず分母の計算\n\tfor(i in n downTo (n - min + 1)) {\n\t\tret = ret * i % mod\n\t}\n\tfor(i in min downTo 1) {\n\t\tret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n\t}\n\treturn ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n\tval factorials = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval inverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval factorialInverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tfor(i in 2 .. n) {\n\t\tfactorials[i] = (factorials[i-1] * i.toLong() % mod)\n\t\tinverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n\t\tfactorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n\t}\n\n\treturn factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n\tif(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n\ta / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n\tvar num = num_\n\tvar rtn: Long = 0\n\twhile(num != 0.toLong()) {\n\t\tval tmp = num % 10\n\t\trtn += tmp\n\t\tnum /= 10\n\t}\n\treturn rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n\tprivate val parent: Array = Array(n) { 0 }\n\tprivate val rank: Array = Array(n) { 0 }\n\tprivate val size: Array = Array(n) { 0 }\n\n\tinit {\n\t\tfor(i in 0 until n) {\n\t\t\tparent[i] = i\n\t\t\trank[i] = 1\n\t\t\tsize[i] = 1\n\t\t}\n\t}\n\n\tfun union(u: Int, v: Int) {\n\t\tvar x = root(u)\n\t\tvar y = root(v)\n\t\tif(x != y) {\n\t\t\tif(rank[y] < rank[x]) {\n\t\t\t\tval tmp = y \n\t\t\t\ty = x\n\t\t\t\tx = tmp \n\t\t\t}\n\t\t\tparent[x] = y\n\t\t\trank[y] += rank[x]\n\t\t\trank[x] = -1\n\t\t\tval totalSize = size[x] + size[y]\n\t\t\tsize[x] = totalSize\n\t\t\tsize[y] = totalSize\n\t\t}\n\t}\n\n\tfun root(u: Int): Int {\n\t\tvar x = u\n\t\twhile(parent[x] != x) {\n\t\t\tx = parent[x]\n\t\t}\n\t\treturn x \n\t}\n\n\tfun size(u: Int): Int = size[root(u)]\n}\n\nclass Stack(private var st: MutableList = mutableListOf()) {\n\tfun isEmpty() = st.isEmpty()\n\tfun top(): T = st.last()\n\tfun push(e: T) { st.add(e) }\n\tfun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n\tfun isEmpty() = que.isEmpty()\n\tfun top(): T = que.first()\n\tfun push(e: T) { que.add(e) }\n\tfun pop() { que = que.drop(1).toMutableList() }\n}\n", "language": "Kotlin", "metadata": {"date": 1584235426, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s299606366.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s299606366", "user_id": "u026686258"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val (a, b, c) = readListOfDouble() \n val ishigher = Math.sqrt(c) > Math.sqrt(a) + Math.sqrt(b)\n println(if(ishigher) \"Yes\" else \"No\")\n\tpw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n// Extensions\nfun List.toBuckets(): Map\n\t= this.groupBy { it }.mapValues { it.value.size }\n\nfun> List.upperBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element >= this[mid]) { \n\t\t\tl = mid + 1\n\t\t} else {\n\t\t\tr = mid\n\t\t}\n\t}\n\treturn l\n}\n\nfun> List.lowerBound(element: T, fromIndex: Int=0, toIndex: Int=this.size): Int {\n\tvar l = fromIndex\n\tvar r = toIndex\n\twhile(l < r) {\n\t\tval mid = (l+r) / 2\n\t\tif(element <= this[mid]) { \n\t\t\tr = mid\n\t\t} else {\n\t\t\tl = mid + 1\n\t\t}\n\t}\n\treturn r \n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun Long.makeDivisors(): List {\n\tval divisors = mutableListOf()\n\tfor(i in 1L .. Math.sqrt(this.toDouble()).toLong()+1L) {\n\t\tif(this % i == 0L) {\n\t\t\tdivisors.add(i)\n\t\t\tif(i != this/i) {\n\t\t\t\tdivisors.add(this/i)\n\t\t\t}\n\t\t}\n\t}\n\treturn divisors.distinct().sorted()\n}\n\nfun Long.isPrime(): Boolean {\n\tif(this==1L) return false\n\tfor(i in 2L .. Math.sqrt(this.toDouble()).toLong() + 1L) {\n\t\tif(this % i == 0L && this != i) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n\nfun permutations(src: List): List> {\n\tif(src.size == 1) return listOf(src)\n\tval perms = mutableListOf>()\n\tval insertElement = src[0]\n\tpermutations(src.drop(1)).forEach { perm ->\n\t\tfor(i in 0..perm.size) {\n\t\t\tval newPerm = perm.toMutableList()\n\t\t\tnewPerm.add(i, insertElement)\n\t\t\tperms.add(newPerm.toList())\n\t\t}\n\t}\n\treturn perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n\tval v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n\tfor(i in 0 until v.size) {\n\t\tv[i][0] = 1L\n\t\tv[i][i] = 1L\n\t}\n\tfor(i in 0 until v.size) {\n\t\tfor(j in 1 until i) {\n\t\t\tv[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n\t\t}\n\t}\n\treturn v.map { it.toList() }.toList()\n}\n\nfun repeatedModPow(a: Long, n: Long, mod: Long): Long = \n\twhen {\n\t\tn == 1L -> a % mod\n\t\tn % 2L == 1L -> (a * repeatedModPow(a, n-1L, mod)) % mod\n\t\telse -> {\n\t\t\tval tmp = repeatedModPow(a, n / 2L, mod)\n\t\t\t(tmp * tmp) % mod\n\t\t}\n\t}\n\n// return nCr % MOD\nfun modnCkWithoutArray(n: Long, k: Long, mod: Long): Long {\n\tvar ret = 1L\n\tval min = Math.min(k, n-k)\n\t// まず分母の計算\n\tfor(i in n downTo (n - min + 1)) {\n\t\tret = ret * i % mod\n\t}\n\tfor(i in min downTo 1) {\n\t\tret = ret * repeatedModPow(i, (mod - 2L), mod) % mod\n\t}\n\treturn ret\n}\n\n// return nCr % MOD\nfun modnCk(n: Int, k: Int, mod: Long): Long {\n\tval factorials = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval inverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tval factorialInverses = Array(n+1) { 0L }.apply {\n\t\tthis[0] = 1L\n\t\tif(this.size > 1) this[1] = 1L\n\t}\n\tfor(i in 2 .. n) {\n\t\tfactorials[i] = (factorials[i-1] * i.toLong() % mod)\n\t\tinverses[i] = (mod - inverses[mod.toInt() % i] * (mod / i.toLong()) % mod)\n\t\tfactorialInverses[i] = (factorialInverses[i-1] * inverses[i] % mod)\n\t}\n\n\treturn factorials[n] % mod * (factorialInverses[k] * factorialInverses[n-k] % mod) % mod\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n\tif(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n\ta / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n\tvar num = num_\n\tvar rtn: Long = 0\n\twhile(num != 0.toLong()) {\n\t\tval tmp = num % 10\n\t\trtn += tmp\n\t\tnum /= 10\n\t}\n\treturn rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\n\nclass UnionFind(private val n: Int) {\n\tprivate val parent: Array = Array(n) { 0 }\n\tprivate val rank: Array = Array(n) { 0 }\n\tprivate val size: Array = Array(n) { 0 }\n\n\tinit {\n\t\tfor(i in 0 until n) {\n\t\t\tparent[i] = i\n\t\t\trank[i] = 1\n\t\t\tsize[i] = 1\n\t\t}\n\t}\n\n\tfun union(u: Int, v: Int) {\n\t\tvar x = root(u)\n\t\tvar y = root(v)\n\t\tif(x != y) {\n\t\t\tif(rank[y] < rank[x]) {\n\t\t\t\tval tmp = y \n\t\t\t\ty = x\n\t\t\t\tx = tmp \n\t\t\t}\n\t\t\tparent[x] = y\n\t\t\trank[y] += rank[x]\n\t\t\trank[x] = -1\n\t\t\tval totalSize = size[x] + size[y]\n\t\t\tsize[x] = totalSize\n\t\t\tsize[y] = totalSize\n\t\t}\n\t}\n\n\tfun root(u: Int): Int {\n\t\tvar x = u\n\t\twhile(parent[x] != x) {\n\t\t\tx = parent[x]\n\t\t}\n\t\treturn x \n\t}\n\n\tfun size(u: Int): Int = size[root(u)]\n}\n\nclass Stack(private var st: MutableList = mutableListOf()) {\n\tfun isEmpty() = st.isEmpty()\n\tfun top(): T = st.last()\n\tfun push(e: T) { st.add(e) }\n\tfun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n\tfun isEmpty() = que.isEmpty()\n\tfun top(): T = que.first()\n\tfun push(e: T) { que.add(e) }\n\tfun pop() { que = que.drop(1).toMutableList() }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5704, "cpu_time_ms": 247, "memory_kb": 37944}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s559243829", "group_id": "codeNet:p02743", "input_text": "import java.util.Scanner\nimport kotlin.system.exitProcess\n\nfun main(args: Array) {\n\tval scn = Scanner(System.`in`)\n\tval a = scn.nextLong()\n\tval b = scn.nextLong()\n\tval c = scn.nextLong()\n\tif (a+b>=c) no()\n\tval dC = c*c\n\tval dAB = (a+b)*(a+b)\n\tprintln(\n\t\t\tif (4*a*b+2*c*(a+b)) {\n\tval scn = Scanner(System.`in`)\n\tval a = scn.nextLong()\n\tval b = scn.nextLong()\n\tval c = scn.nextLong()\n\tif (a+b>=c) no()\n\tval dC = c*c\n\tval dAB = (a+b)*(a+b)\n\tprintln(\n\t\t\tif (4*a*b+2*c*(a+b)) {\n val (a, b, c) = listOfDouble()\n val ans = (Math.sqrt(a) + Math.sqrt(b)) < Math.sqrt(c)\n println(if (ans) \"Yes\" else \"No\")\n}\nfun Long.isEven() = (this % 2L) == 0L\nfun Long.isOdd() = !this.isEven()\nfun next() = readLine()!!\nfun nextInt() = Integer.parseInt(next())\nfun nextInt(offset: Int = 0) = nextInt() + offset\nfun nextLong() = java.lang.Long.parseLong(next())\nfun nextLong(offset: Long = 0L) = nextLong() + offset\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map { Integer.parseInt(it) }\nfun listOfInt(offset: Int = 0) = listOfString().map { Integer.parseInt(it) + offset }\nfun listOfLong() = listOfString().map { java.lang.Long.parseLong(it) }\nfun listOfLong(offset: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + offset }\nfun listOfDouble() = listOfString().map { it.toDouble() }\n", "language": "Kotlin", "metadata": {"date": 1584234802, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s821242385.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s821242385", "user_id": "u043150661"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n val (a, b, c) = listOfDouble()\n val ans = (Math.sqrt(a) + Math.sqrt(b)) < Math.sqrt(c)\n println(if (ans) \"Yes\" else \"No\")\n}\nfun Long.isEven() = (this % 2L) == 0L\nfun Long.isOdd() = !this.isEven()\nfun next() = readLine()!!\nfun nextInt() = Integer.parseInt(next())\nfun nextInt(offset: Int = 0) = nextInt() + offset\nfun nextLong() = java.lang.Long.parseLong(next())\nfun nextLong(offset: Long = 0L) = nextLong() + offset\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map { Integer.parseInt(it) }\nfun listOfInt(offset: Int = 0) = listOfString().map { Integer.parseInt(it) + offset }\nfun listOfLong() = listOfString().map { java.lang.Long.parseLong(it) }\nfun listOfLong(offset: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + offset }\nfun listOfDouble() = listOfString().map { it.toDouble() }\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 909, "cpu_time_ms": 240, "memory_kb": 37952}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s013079370", "group_id": "codeNet:p02743", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun main(args: Array) {\n val sc = FastScanner(System.`in`)\n val a = sc.nextLong()\n val b = sc.nextLong()\n val c = sc.nextLong()\n println(if (4*a*b < (c-a-b) * (c-a-b)) \"Yes\" else \"No\")\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "language": "Kotlin", "metadata": {"date": 1584234658, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s013079370.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s013079370", "user_id": "u190507186"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun main(args: Array) {\n val sc = FastScanner(System.`in`)\n val a = sc.nextLong()\n val b = sc.nextLong()\n val c = sc.nextLong()\n println(if (4*a*b < (c-a-b) * (c-a-b)) \"Yes\" else \"No\")\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 802, "cpu_time_ms": 199, "memory_kb": 31132}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s485083419", "group_id": "codeNet:p02743", "input_text": "fun main(args: Array) = panasonic2020c()\n\nfun panasonic2020c() {\n val (a, b, c) = readLine()!!.split(' ').map { it.toDouble() }\n\n val answer = if (Math.sqrt(a) + Math.sqrt(b) < Math.sqrt(c)) \"Yes\" else \"No\"\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1584234427, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02743.html", "problem_id": "p02743", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02743/input.txt", "sample_output_relpath": "derived/input_output/data/p02743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02743/Kotlin/s485083419.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s485083419", "user_id": "u139478771"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) = panasonic2020c()\n\nfun panasonic2020c() {\n val (a, b, c) = readLine()!!.split(' ').map { it.toDouble() }\n\n val answer = if (Math.sqrt(a) + Math.sqrt(b) < Math.sqrt(c)) \"Yes\" else \"No\"\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "sample_input": "2 3 9\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02743", "source_text": "Score : 300 points\n\nProblem Statement\n\nDoes \\sqrt{a} + \\sqrt{b} < \\sqrt{c} hold?\n\nConstraints\n\n1 \\leq a, b, c \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na \\ b \\ c\n\nOutput\n\nIf \\sqrt{a} + \\sqrt{b} < \\sqrt{c}, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 3 9\n\nSample Output 1\n\nNo\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{9} does not hold.\n\nSample Input 2\n\n2 3 10\n\nSample Output 2\n\nYes\n\n\\sqrt{2} + \\sqrt{3} < \\sqrt{10} holds.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 277, "memory_kb": 38044}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s800973039", "group_id": "codeNet:p02761", "input_text": "import java.util.Scanner;\n\nfun main (args : Array) {\n val input = Scanner(System.`in`)\n \n while (input.hasNext()) {\n val N = input.nextInt()\n val M = input.nextInt()\n val num = CharArray(N) {'.'}\n var isExist = true\n \n for (i in 1..M) {\n val s = input.nextInt()\n val c = input.nextInt()\n \n if (num[s - 1] == '.') {\n num[s - 1] = (c + '0'.toInt()).toChar()\n } else if (num[s - 1] != (c + '0'.toInt()).toChar()){\n isExist = false\n }\n }\n \n for (i in num.indices) {\n if (num[i] == '.') {\n if (i == 0 && num.size > 1) {\n num[i] = '1'\n } else {\n num[i] = '0'\n }\n }\n }\n \n if (num.size > 1 && num[0] == '0') {\n isExist = false\n }\n \n if (isExist) {\n println(num)\n } else {\n println(-1)\n }\n }\n}", "language": "Kotlin", "metadata": {"date": 1598408818, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s800973039.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s800973039", "user_id": "u920836104"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "import java.util.Scanner;\n\nfun main (args : Array) {\n val input = Scanner(System.`in`)\n \n while (input.hasNext()) {\n val N = input.nextInt()\n val M = input.nextInt()\n val num = CharArray(N) {'.'}\n var isExist = true\n \n for (i in 1..M) {\n val s = input.nextInt()\n val c = input.nextInt()\n \n if (num[s - 1] == '.') {\n num[s - 1] = (c + '0'.toInt()).toChar()\n } else if (num[s - 1] != (c + '0'.toInt()).toChar()){\n isExist = false\n }\n }\n \n for (i in num.indices) {\n if (num[i] == '.') {\n if (i == 0 && num.size > 1) {\n num[i] = '1'\n } else {\n num[i] = '0'\n }\n }\n }\n \n if (num.size > 1 && num[0] == '0') {\n isExist = false\n }\n \n if (isExist) {\n println(num)\n } else {\n println(-1)\n }\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 855, "cpu_time_ms": 127, "memory_kb": 36452}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s428001805", "group_id": "codeNet:p02761", "input_text": "fun main() {\n val (n, m) = readLine()!!.split(\" \").map { it.toInt() }\n\n val s = IntArray(m)\n val c = IntArray(m)\n repeat(m) {i ->\n val (r1, r2) = readLine()!!.split(\" \").map { it.toInt() }\n s[i] = r1\n c[i] = r2\n }\n\n var ans = -1\n for (i in 0..Math.pow(10.0, n.toDouble()).toInt()){\n val sa = i.toString().split(\"\").filter { it != \"\" }\n var flg = true\n\n for (j in 0..(m - 1)) {\n if (sa.size < s[j]) {\n flg = false\n break\n } else if (sa[s[j] - 1].toInt() != c[j]) {\n flg = false\n break\n }\n\n }\n if (flg && i.toString().length == n) {\n ans = i\n break\n }\n }\n\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1596256474, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s428001805.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s428001805", "user_id": "u945228737"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "fun main() {\n val (n, m) = readLine()!!.split(\" \").map { it.toInt() }\n\n val s = IntArray(m)\n val c = IntArray(m)\n repeat(m) {i ->\n val (r1, r2) = readLine()!!.split(\" \").map { it.toInt() }\n s[i] = r1\n c[i] = r2\n }\n\n var ans = -1\n for (i in 0..Math.pow(10.0, n.toDouble()).toInt()){\n val sa = i.toString().split(\"\").filter { it != \"\" }\n var flg = true\n\n for (j in 0..(m - 1)) {\n if (sa.size < s[j]) {\n flg = false\n break\n } else if (sa[s[j] - 1].toInt() != c[j]) {\n flg = false\n break\n }\n\n }\n if (flg && i.toString().length == n) {\n ans = i\n break\n }\n }\n\n println(ans)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 774, "cpu_time_ms": 158, "memory_kb": 41328}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s619909757", "group_id": "codeNet:p02761", "input_text": "fun main(args:Array) {\n val (n,m) = readLine()!!.split(\" \").map { it.toInt() }\n val num = mutableListOf()\n num.addAll((1..n).map { null })\n val query = (1..m).map { readLine()!!.split(\" \").map { it.toInt() }.let { listOf(it[0]-1,it[1]) } }\n for(tmp in query) {\n val idx = tmp[0]\n if(num[idx] == null) {\n num[idx] = tmp[1]\n } else {\n if(num[idx]!! != tmp[1]) {\n println(-1)\n return\n }\n }\n }\n for(i in num.indices) {\n if(num[i] == null) {\n if(i == 0) {\n num[i] = 1\n } else {\n num[i] = 0\n }\n }\n }\n println(num.joinToString(\"\"))\n\n}\n", "language": "Kotlin", "metadata": {"date": 1593463626, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s619909757.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s619909757", "user_id": "u269969976"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "fun main(args:Array) {\n val (n,m) = readLine()!!.split(\" \").map { it.toInt() }\n val num = mutableListOf()\n num.addAll((1..n).map { null })\n val query = (1..m).map { readLine()!!.split(\" \").map { it.toInt() }.let { listOf(it[0]-1,it[1]) } }\n for(tmp in query) {\n val idx = tmp[0]\n if(num[idx] == null) {\n num[idx] = tmp[1]\n } else {\n if(num[idx]!! != tmp[1]) {\n println(-1)\n return\n }\n }\n }\n for(i in num.indices) {\n if(num[i] == null) {\n if(i == 0) {\n num[i] = 1\n } else {\n num[i] = 0\n }\n }\n }\n println(num.joinToString(\"\"))\n\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 737, "cpu_time_ms": 128, "memory_kb": 39056}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s471558882", "group_id": "codeNet:p02761", "input_text": "fun main(args: Array) {\n val (n,m) = readLine()!!.split(\" \").map { it.toInt() }\n var answer = \"\"\n val rules = mutableSetOf>()\n repeat(m) {\n rules.add(readLine()!!.split(\" \").map { it.toInt() }.let { Pair(it.first(),it.last()) })\n }\n if (rules.groupBy { it.first }.filter { it.value.size > 1 }.isNotEmpty()) return println(-1)\n if (rules.any { it.first == 1 && it.second == 0 } && n != 1) return println(-1)\n if (!rules.any { it.first == 1 && it.second != 0 } && n == 1) return println(0)\n for (i in 1..n) {\n if (rules.any { it.first == i }) answer += rules.first { it.first == i }.second.toString()\n else if (i == 1) answer += \"1\"\n else answer += \"0\"\n }\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1593286247, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s471558882.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s471558882", "user_id": "u172820018"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "fun main(args: Array) {\n val (n,m) = readLine()!!.split(\" \").map { it.toInt() }\n var answer = \"\"\n val rules = mutableSetOf>()\n repeat(m) {\n rules.add(readLine()!!.split(\" \").map { it.toInt() }.let { Pair(it.first(),it.last()) })\n }\n if (rules.groupBy { it.first }.filter { it.value.size > 1 }.isNotEmpty()) return println(-1)\n if (rules.any { it.first == 1 && it.second == 0 } && n != 1) return println(-1)\n if (!rules.any { it.first == 1 && it.second != 0 } && n == 1) return println(0)\n for (i in 1..n) {\n if (rules.any { it.first == i }) answer += rules.first { it.first == i }.second.toString()\n else if (i == 1) answer += \"1\"\n else answer += \"0\"\n }\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 756, "cpu_time_ms": 120, "memory_kb": 36284}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s124373394", "group_id": "codeNet:p02761", "input_text": "fun main(args: Array) {\n val (n,m) = readLine()!!.split(\" \").map { it.toInt() }\n var answer = \"\"\n val rules = mutableSetOf>()\n repeat(m) {\n rules.add(readLine()!!.split(\" \").map { it.toInt() }.let { Pair(it.first(),it.last()) })\n }\n if (rules.groupBy { it.first }.filter { it.value.size > 1 }.isNotEmpty()) return println(-1)\n if (rules.any { it.first == 1 && it.second == 0 }) return println(-1)\n for (i in 1..n) {\n if (rules.any { it.first == i }) answer += rules.first { it.first == i }.second.toString()\n else answer += \"0\"\n }\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1593285383, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s124373394.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s124373394", "user_id": "u172820018"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "fun main(args: Array) {\n val (n,m) = readLine()!!.split(\" \").map { it.toInt() }\n var answer = \"\"\n val rules = mutableSetOf>()\n repeat(m) {\n rules.add(readLine()!!.split(\" \").map { it.toInt() }.let { Pair(it.first(),it.last()) })\n }\n if (rules.groupBy { it.first }.filter { it.value.size > 1 }.isNotEmpty()) return println(-1)\n if (rules.any { it.first == 1 && it.second == 0 }) return println(-1)\n for (i in 1..n) {\n if (rules.any { it.first == i }) answer += rules.first { it.first == i }.second.toString()\n else answer += \"0\"\n }\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 623, "cpu_time_ms": 121, "memory_kb": 36456}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s685968934", "group_id": "codeNet:p02761", "input_text": "\nfun main(args: Array) {\n val (N, M) = readLine()!!.split(\" \").map(String::toInt)\n val sc = (1..M).map {\n val (s, c) = readLine()!!.split(\" \").map(String::toInt)\n Pair(s, c)\n }\n\n val sc_map: MutableMap = mutableMapOf()\n for((s, c) in sc) {\n sc_map.get(s)?.run {\n if(this != c) {\n println(\"-1\")\n return\n }\n }\n sc_map[s] = c\n }\n\n val digit_list = (1..N).map { null as Int? }.toMutableList()\n \n for((s, c) in sc_map) {\n digit_list[s- 1] = c\n }\n if(N == 1) {\n (digit_list[0]?: 0).run(::println)\n return\n } else {\n var is_error = false \n digit_list[0]?.run {\n if(this == 0) {\n println(-1)\n is_error = true\n }\n }\n if(is_error) {\n return\n }\n }\n for( i in 0 until digit_list.size) {\n if(digit_list[i] == null) {\n digit_list[i] = if(i == 0) {1} else {0}\n }\n }\n\n digit_list.joinToString(\"\").toInt().let {\n val s = it.toString()\n s\n }.run(::println)\n}", "language": "Kotlin", "metadata": {"date": 1588857604, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s685968934.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s685968934", "user_id": "u181807786"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "\nfun main(args: Array) {\n val (N, M) = readLine()!!.split(\" \").map(String::toInt)\n val sc = (1..M).map {\n val (s, c) = readLine()!!.split(\" \").map(String::toInt)\n Pair(s, c)\n }\n\n val sc_map: MutableMap = mutableMapOf()\n for((s, c) in sc) {\n sc_map.get(s)?.run {\n if(this != c) {\n println(\"-1\")\n return\n }\n }\n sc_map[s] = c\n }\n\n val digit_list = (1..N).map { null as Int? }.toMutableList()\n \n for((s, c) in sc_map) {\n digit_list[s- 1] = c\n }\n if(N == 1) {\n (digit_list[0]?: 0).run(::println)\n return\n } else {\n var is_error = false \n digit_list[0]?.run {\n if(this == 0) {\n println(-1)\n is_error = true\n }\n }\n if(is_error) {\n return\n }\n }\n for( i in 0 until digit_list.size) {\n if(digit_list[i] == null) {\n digit_list[i] = if(i == 0) {1} else {0}\n }\n }\n\n digit_list.joinToString(\"\").toInt().let {\n val s = it.toString()\n s\n }.run(::println)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1154, "cpu_time_ms": 243, "memory_kb": 37420}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s823283947", "group_id": "codeNet:p02761", "input_text": "\nfun main(args: Array) {\n val (N, M) = readLine()!!.split(\" \").map(String::toInt)\n val sc = (1..M).map {\n val (s, c) = readLine()!!.split(\" \").map(String::toInt)\n Pair(s, c)\n }\n\n val sc_map: MutableMap = mutableMapOf()\n for((s, c) in sc) {\n sc_map.get(s)?.run {\n if(this != c) {\n println(\"-1\")\n return\n }\n }\n sc_map[s] = c\n }\n sc_map.keys.min()?.let { sc_map.get(it) }?.run {\n if(this == 0 && N >= 2) {\n println(\"-1\")\n return\n }\n }\n\n\n for(n in 0..1000) {\n val s = (\"000\" + n.toString()).takeLast(3)\n if(sc_map.all {\n val (k, c) = it \n (s[k - 1] - '0').toInt() == c \n }) {\n println(n)\n return\n }\n }\n println(-1)\n}", "language": "Kotlin", "metadata": {"date": 1588855402, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s823283947.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s823283947", "user_id": "u181807786"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "\nfun main(args: Array) {\n val (N, M) = readLine()!!.split(\" \").map(String::toInt)\n val sc = (1..M).map {\n val (s, c) = readLine()!!.split(\" \").map(String::toInt)\n Pair(s, c)\n }\n\n val sc_map: MutableMap = mutableMapOf()\n for((s, c) in sc) {\n sc_map.get(s)?.run {\n if(this != c) {\n println(\"-1\")\n return\n }\n }\n sc_map[s] = c\n }\n sc_map.keys.min()?.let { sc_map.get(it) }?.run {\n if(this == 0 && N >= 2) {\n println(\"-1\")\n return\n }\n }\n\n\n for(n in 0..1000) {\n val s = (\"000\" + n.toString()).takeLast(3)\n if(sc_map.all {\n val (k, c) = it \n (s[k - 1] - '0').toInt() == c \n }) {\n println(n)\n return\n }\n }\n println(-1)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 864, "cpu_time_ms": 256, "memory_kb": 37616}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s003384249", "group_id": "codeNet:p02761", "input_text": "\nfun main(args: Array) {\n val (N, M) = readLine()!!.split(\" \").map(String::toInt)\n val sc = (1..M).map {\n val (s, c) = readLine()!!.split(\" \").map(String::toInt)\n Pair(s, c)\n }\n val sc_map: MutableMap = mutableMapOf()\n for((s, c) in sc) {\n sc_map.get(s)?.run {\n if(this != c) {\n println(\"-1\")\n return\n }\n }\n sc_map[s] = c\n }\n\n val digit_list = (1..N).map { 0 }.toMutableList()\n \n for((s, c) in sc_map) {\n digit_list[s- 1] = c\n }\n\n digit_list.joinToString(\"\").toInt().let {\n val s = it.toString()\n \n if(s.length != N && s.substring(0, listOf(N - s.length + 1, s.length).min()!!).toInt() == 0) {\n \"-1\"\n } else {\n s\n }\n }.run(::println)\n}", "language": "Kotlin", "metadata": {"date": 1588824108, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s003384249.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s003384249", "user_id": "u181807786"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "\nfun main(args: Array) {\n val (N, M) = readLine()!!.split(\" \").map(String::toInt)\n val sc = (1..M).map {\n val (s, c) = readLine()!!.split(\" \").map(String::toInt)\n Pair(s, c)\n }\n val sc_map: MutableMap = mutableMapOf()\n for((s, c) in sc) {\n sc_map.get(s)?.run {\n if(this != c) {\n println(\"-1\")\n return\n }\n }\n sc_map[s] = c\n }\n\n val digit_list = (1..N).map { 0 }.toMutableList()\n \n for((s, c) in sc_map) {\n digit_list[s- 1] = c\n }\n\n digit_list.joinToString(\"\").toInt().let {\n val s = it.toString()\n \n if(s.length != N && s.substring(0, listOf(N - s.length + 1, s.length).min()!!).toInt() == 0) {\n \"-1\"\n } else {\n s\n }\n }.run(::println)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 836, "cpu_time_ms": 239, "memory_kb": 38156}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s483273752", "group_id": "codeNet:p02761", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map { it.toInt() }\n val a = IntArray(n + 1) { -1 }\n\n var error = false\n\n repeat(m) {\n val (s, c) = readLine()!!.split(' ').map { it.toInt() }\n if (a[s] == -1) a[s] = c\n if (a[s] != c) {\n error = true\n return@repeat\n }\n }\n\n for (i in 1..n) {\n if (a[i] == -1) a[i] = if (i == 1) 1 else 0\n }\n\n if (a[1] == 0) error = true\n\n println(if (error) -1 else a.slice(1..n).joinToString(\"\"))\n}", "language": "Kotlin", "metadata": {"date": 1588305633, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s483273752.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s483273752", "user_id": "u863309603"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map { it.toInt() }\n val a = IntArray(n + 1) { -1 }\n\n var error = false\n\n repeat(m) {\n val (s, c) = readLine()!!.split(' ').map { it.toInt() }\n if (a[s] == -1) a[s] = c\n if (a[s] != c) {\n error = true\n return@repeat\n }\n }\n\n for (i in 1..n) {\n if (a[i] == -1) a[i] = if (i == 1) 1 else 0\n }\n\n if (a[1] == 0) error = true\n\n println(if (error) -1 else a.slice(1..n).joinToString(\"\"))\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 535, "cpu_time_ms": 243, "memory_kb": 36376}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s066474968", "group_id": "codeNet:p02761", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map { it.toInt() }\n val a = IntArray(n + 1) { -1 }\n\n var error = false\n\n repeat(m) {\n val (s, c) = readLine()!!.split(' ').map { it.toInt() }\n if (a[s] == -1) a[s] = c\n if (a[s] != c) {\n error = true\n return@repeat\n }\n }\n\n for (i in 1..n) {\n if (n >= 2 && i < n && a[i] == 0) {\n error = true\n break\n }\n if (a[i] < 0) {\n a[i] = 0\n }\n }\n\n println(if (error) -1 else a.slice(1..n).joinToString(\"\").toInt())\n}", "language": "Kotlin", "metadata": {"date": 1588305045, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s066474968.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s066474968", "user_id": "u863309603"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map { it.toInt() }\n val a = IntArray(n + 1) { -1 }\n\n var error = false\n\n repeat(m) {\n val (s, c) = readLine()!!.split(' ').map { it.toInt() }\n if (a[s] == -1) a[s] = c\n if (a[s] != c) {\n error = true\n return@repeat\n }\n }\n\n for (i in 1..n) {\n if (n >= 2 && i < n && a[i] == 0) {\n error = true\n break\n }\n if (a[i] < 0) {\n a[i] = 0\n }\n }\n\n println(if (error) -1 else a.slice(1..n).joinToString(\"\").toInt())\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 610, "cpu_time_ms": 242, "memory_kb": 38300}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s370776551", "group_id": "codeNet:p02761", "input_text": "fun main(args: Array) {\n val (n, m) = readLongList()\n val conditionArray = Array(m.toInt()) { readIntegerList() }\n val first = if (n == 1L) 0 else pow(10, n - 1, Long.MAX_VALUE)\n for (i in first until pow(10, n, Long.MAX_VALUE)) {\n if (isOk(i.toString(), conditionArray)) {\n println(i)\n return\n }\n }\n\n println(-1)\n}\n\nfun isOk(i: String, cArray: Array>): Boolean {\n for (c in cArray) {\n if (i[c[0] - 1].toString() != c[1].toString()) {\n return false\n }\n }\n\n return true\n}\n\nfun pow(n: Long, m: Long, MOD: Long): Long {\n var ret = 1L\n var x = n\n var k = m\n while (k > 0) {\n if ((k and 1L) == 1L) {\n ret = (ret * x) % MOD\n }\n x = (x * x) % MOD\n k = k shr 1\n }\n\n return ret\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "language": "Kotlin", "metadata": {"date": 1583687975, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s370776551.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s370776551", "user_id": "u784448849"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLongList()\n val conditionArray = Array(m.toInt()) { readIntegerList() }\n val first = if (n == 1L) 0 else pow(10, n - 1, Long.MAX_VALUE)\n for (i in first until pow(10, n, Long.MAX_VALUE)) {\n if (isOk(i.toString(), conditionArray)) {\n println(i)\n return\n }\n }\n\n println(-1)\n}\n\nfun isOk(i: String, cArray: Array>): Boolean {\n for (c in cArray) {\n if (i[c[0] - 1].toString() != c[1].toString()) {\n return false\n }\n }\n\n return true\n}\n\nfun pow(n: Long, m: Long, MOD: Long): Long {\n var ret = 1L\n var x = n\n var k = m\n while (k > 0) {\n if ((k and 1L) == 1L) {\n ret = (ret * x) % MOD\n }\n x = (x * x) % MOD\n k = k shr 1\n }\n\n return ret\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1080, "cpu_time_ms": 246, "memory_kb": 36120}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s742043336", "group_id": "codeNet:p02761", "input_text": "fun main(args: Array) {\n val (N, M) = listOfInt()\n val S = IntArray(M)\n val C = IntArray(M)\n repeat(M) {\n val (s, c) = listOfInt()\n S[it] = s - 1\n C[it] = c\n }\n var min = 0\n var max = 999\n when (N) {\n 1 -> { min = 0; max = 9 }\n 2 -> { min = 10; max = 99 }\n 3 -> { min = 100; max = 999 }\n }\n fun d2c(D: Int): IntArray {\n var n = D\n val a = IntArray(N)\n for (i in (0 until N).reversed()) {\n a[i] = n % 10\n n /= 10\n }\n return a\n }\n for (n in min .. max) {\n var ans = true\n val d = d2c(n)\n for (m in 0 until M) {\n if (d[S[m]] != C[m]) ans = false\n }\n if (ans) {\n println(n)\n return\n }\n }\n println(-1)\n}\nfun next() = readLine()!!\nfun nextInt() = Integer.parseInt(next())\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map(String::toInt)\n", "language": "Kotlin", "metadata": {"date": 1583120962, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s742043336.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s742043336", "user_id": "u043150661"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, M) = listOfInt()\n val S = IntArray(M)\n val C = IntArray(M)\n repeat(M) {\n val (s, c) = listOfInt()\n S[it] = s - 1\n C[it] = c\n }\n var min = 0\n var max = 999\n when (N) {\n 1 -> { min = 0; max = 9 }\n 2 -> { min = 10; max = 99 }\n 3 -> { min = 100; max = 999 }\n }\n fun d2c(D: Int): IntArray {\n var n = D\n val a = IntArray(N)\n for (i in (0 until N).reversed()) {\n a[i] = n % 10\n n /= 10\n }\n return a\n }\n for (n in min .. max) {\n var ans = true\n val d = d2c(n)\n for (m in 0 until M) {\n if (d[S[m]] != C[m]) ans = false\n }\n if (ans) {\n println(n)\n return\n }\n }\n println(-1)\n}\nfun next() = readLine()!!\nfun nextInt() = Integer.parseInt(next())\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map(String::toInt)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 981, "cpu_time_ms": 240, "memory_kb": 38032}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s930546197", "group_id": "codeNet:p02761", "input_text": "import java.util.*\n\nval MAX_N = 100000\nval par = Array(MAX_N) {0}\nval rank = Array(MAX_N) {0}\nval size = Array(MAX_N) {0}\n\nfun init() {\n for(i in 0 until MAX_N) {\n par[i] = i\n rank[i] = 0\n size[i] = 1\n }\n}\n\nfun find(a: Int): Int {\n if (par[a] == a){\n return a\n } else{\n par[a] = find(par[a])\n return par[a]\n }\n}\n\nfun unite(a:Int, b: Int) {\n val ta = find(a)\n val tb = find(b)\n if(ta == tb) return\n\n if(rank[ta] < rank[tb]){\n par[ta] = tb\n size[tb] += size[ta]\n }else{\n par[tb] = ta\n size[ta] += size[tb]\n if(rank[ta] == rank[tb]) rank[ta]++;\n }\n}\n\nfun same(a: Int, b: Int): Boolean{\n return find(a) == find(b);\n}\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val m = sc.nextInt()\n val k = sc.nextInt()\n init()\n val countAB = Array(n) {0}\n repeat(m) {\n val a = sc.nextInt() - 1\n val b = sc.nextInt() - 1\n unite(a, b)\n countAB[a]++\n countAB[b]++\n }\n val countCD = Array(n) { mutableSetOf()}\n repeat(k) {\n val c = sc.nextInt() - 1\n val d = sc.nextInt() - 1\n countCD[c].add(d)\n countCD[d].add(c)\n }\n\n println((0 until n).map {\n val blockCount = countCD[it].count { pos -> same(it, pos) }\n (size[find(it)] - 1) - countAB[it] - blockCount\n }.joinToString(\" \"))\n}", "language": "Kotlin", "metadata": {"date": 1583120508, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s930546197.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s930546197", "user_id": "u219475690"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "import java.util.*\n\nval MAX_N = 100000\nval par = Array(MAX_N) {0}\nval rank = Array(MAX_N) {0}\nval size = Array(MAX_N) {0}\n\nfun init() {\n for(i in 0 until MAX_N) {\n par[i] = i\n rank[i] = 0\n size[i] = 1\n }\n}\n\nfun find(a: Int): Int {\n if (par[a] == a){\n return a\n } else{\n par[a] = find(par[a])\n return par[a]\n }\n}\n\nfun unite(a:Int, b: Int) {\n val ta = find(a)\n val tb = find(b)\n if(ta == tb) return\n\n if(rank[ta] < rank[tb]){\n par[ta] = tb\n size[tb] += size[ta]\n }else{\n par[tb] = ta\n size[ta] += size[tb]\n if(rank[ta] == rank[tb]) rank[ta]++;\n }\n}\n\nfun same(a: Int, b: Int): Boolean{\n return find(a) == find(b);\n}\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val m = sc.nextInt()\n val k = sc.nextInt()\n init()\n val countAB = Array(n) {0}\n repeat(m) {\n val a = sc.nextInt() - 1\n val b = sc.nextInt() - 1\n unite(a, b)\n countAB[a]++\n countAB[b]++\n }\n val countCD = Array(n) { mutableSetOf()}\n repeat(k) {\n val c = sc.nextInt() - 1\n val d = sc.nextInt() - 1\n countCD[c].add(d)\n countCD[d].add(c)\n }\n\n println((0 until n).map {\n val blockCount = countCD[it].count { pos -> same(it, pos) }\n (size[find(it)] - 1) - countAB[it] - blockCount\n }.joinToString(\" \"))\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1431, "cpu_time_ms": 219, "memory_kb": 33556}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s675443523", "group_id": "codeNet:p02761", "input_text": "import java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.util.*\n\nval reader by lazy { BufferedReader(InputStreamReader(System.`in`)) }\n\n@Suppress(\"ReplaceJavaStaticMethodWithKotlinAnalog\")\nfun main(a: Array) {\n val args = reader.readArgs()\n val n = args[0].toInt()\n val m = args[1].toInt()\n\n if (m == 0) {\n println(1)\n return\n }\n\n val list = (1..m).map { reader.readArgs() }.map { (it[0].toInt() - 1) to it[1].toInt() }\n val s = list.map { it.first }\n val c = list.map { it.second }\n\n val scMap = HashMap>()\n\n s.forEachIndexed { i, digit ->\n val cList = scMap.getOrPut(digit) { ArrayList() }\n cList.add(c[i])\n scMap[digit] = cList.distinct().toMutableList()\n }\n\n scMap.map { it.value }.forEach {\n if (it.size > 1) {\n println(-1)\n return\n }\n }\n\n val answer = (1..n).map { -1 }.toMutableList()\n\n scMap.forEach { answer[it.key] = it.value.first() }\n answer.forEachIndexed { digit, number ->\n if (number == -1) answer[digit] = if (digit == 0) 1 else 0\n }\n\n if (answer.size == 1) {\n println(answer[0])\n return\n }\n\n if (answer[0] == 0) {\n println(-1)\n return\n }\n\n if (answer.filterNot { it == 0 }.isEmpty()) {\n println(-1)\n return\n }\n\n println(answer.joinToString(\"\"))\n}\n\nfun BufferedReader.readArgs() = readLine().split(\" \")\nfun BufferedReader.readInt() = readLine().toInt()\nfun BufferedReader.readLong() = readLine().toLong()\nfun BufferedReader.readChar() = readLine().toInt().toChar()\nfun BufferedReader.readString() = readLine().toInt().toString()\n", "language": "Kotlin", "metadata": {"date": 1583119091, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s675443523.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s675443523", "user_id": "u402723479"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.util.*\n\nval reader by lazy { BufferedReader(InputStreamReader(System.`in`)) }\n\n@Suppress(\"ReplaceJavaStaticMethodWithKotlinAnalog\")\nfun main(a: Array) {\n val args = reader.readArgs()\n val n = args[0].toInt()\n val m = args[1].toInt()\n\n if (m == 0) {\n println(1)\n return\n }\n\n val list = (1..m).map { reader.readArgs() }.map { (it[0].toInt() - 1) to it[1].toInt() }\n val s = list.map { it.first }\n val c = list.map { it.second }\n\n val scMap = HashMap>()\n\n s.forEachIndexed { i, digit ->\n val cList = scMap.getOrPut(digit) { ArrayList() }\n cList.add(c[i])\n scMap[digit] = cList.distinct().toMutableList()\n }\n\n scMap.map { it.value }.forEach {\n if (it.size > 1) {\n println(-1)\n return\n }\n }\n\n val answer = (1..n).map { -1 }.toMutableList()\n\n scMap.forEach { answer[it.key] = it.value.first() }\n answer.forEachIndexed { digit, number ->\n if (number == -1) answer[digit] = if (digit == 0) 1 else 0\n }\n\n if (answer.size == 1) {\n println(answer[0])\n return\n }\n\n if (answer[0] == 0) {\n println(-1)\n return\n }\n\n if (answer.filterNot { it == 0 }.isEmpty()) {\n println(-1)\n return\n }\n\n println(answer.joinToString(\"\"))\n}\n\nfun BufferedReader.readArgs() = readLine().split(\" \")\nfun BufferedReader.readInt() = readLine().toInt()\nfun BufferedReader.readLong() = readLine().toLong()\nfun BufferedReader.readChar() = readLine().toInt().toChar()\nfun BufferedReader.readString() = readLine().toInt().toString()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1686, "cpu_time_ms": 238, "memory_kb": 36028}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s383470784", "group_id": "codeNet:p02761", "input_text": "fun main(args: Array) {\n\n val (N, M) = readLine()!!.split(\" \").map { it.toInt() }\n val scPairs = (1..M).map {\n readLine()!!.split(\" \").map { it.toInt() }\n }\n\n val number = Array(N) { -1 }\n\n for (pair in scPairs) {\n if (number[pair[0] - 1] != -1 && number[pair[0] - 1] != pair[1]) {\n println(-1)\n return\n }\n if (number[pair[0] - 1] == -1) {\n number[pair[0] - 1] = pair[1]\n }\n }\n\n if (N == 1 && number[0] == -1) {\n number[0] = 0\n }\n\n if (N != 1 && number[0] == 0) {\n println(-1)\n return\n }\n\n for (i in number.indices) {\n if (number[i] == -1) {\n if (i == 0) number[i] = 1 else number[i] = 0\n }\n }\n\n println(number.joinToString(\"\"))\n}", "language": "Kotlin", "metadata": {"date": 1583117116, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s383470784.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s383470784", "user_id": "u108272327"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "fun main(args: Array) {\n\n val (N, M) = readLine()!!.split(\" \").map { it.toInt() }\n val scPairs = (1..M).map {\n readLine()!!.split(\" \").map { it.toInt() }\n }\n\n val number = Array(N) { -1 }\n\n for (pair in scPairs) {\n if (number[pair[0] - 1] != -1 && number[pair[0] - 1] != pair[1]) {\n println(-1)\n return\n }\n if (number[pair[0] - 1] == -1) {\n number[pair[0] - 1] = pair[1]\n }\n }\n\n if (N == 1 && number[0] == -1) {\n number[0] = 0\n }\n\n if (N != 1 && number[0] == 0) {\n println(-1)\n return\n }\n\n for (i in number.indices) {\n if (number[i] == -1) {\n if (i == 0) number[i] = 1 else number[i] = 0\n }\n }\n\n println(number.joinToString(\"\"))\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 791, "cpu_time_ms": 238, "memory_kb": 37756}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s000152435", "group_id": "codeNet:p02761", "input_text": "import java.math.BigInteger\nimport java.util.*\n\nfun main(args: Array) {\n val sc = java.util.Scanner(System.`in`)\n val n = sc.nextInt()\n val m = sc.nextInt()\n val map = TreeMap()\n (1..m).forEach {\n val s = sc.nextInt()\n val c = sc.nextInt()\n if (map.containsKey(s) && map[s] != c) {\n println(-1)\n return\n }\n map[s] = c\n }\n var r = 0\n if (map[1] != null) {\n if (n != 1 && map[1] == 0) {\n println(-1)\n return\n }\n r += map[1]!! * Math.pow(10.0, (n - 1).toDouble()).toInt()\n } else if (n != 1) {\n r += 1 * Math.pow(10.0, (n - 1).toDouble()).toInt()\n }\n if (n >= 2 && map[2] != null) {\n r += map[2]!! * Math.pow(10.0, (n - 2).toDouble()).toInt()\n }\n if (n >= 3 && map[3] != null) {\n r += map[3]!!\n }\n println(r)\n}\n", "language": "Kotlin", "metadata": {"date": 1583116983, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s000152435.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s000152435", "user_id": "u059223549"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "import java.math.BigInteger\nimport java.util.*\n\nfun main(args: Array) {\n val sc = java.util.Scanner(System.`in`)\n val n = sc.nextInt()\n val m = sc.nextInt()\n val map = TreeMap()\n (1..m).forEach {\n val s = sc.nextInt()\n val c = sc.nextInt()\n if (map.containsKey(s) && map[s] != c) {\n println(-1)\n return\n }\n map[s] = c\n }\n var r = 0\n if (map[1] != null) {\n if (n != 1 && map[1] == 0) {\n println(-1)\n return\n }\n r += map[1]!! * Math.pow(10.0, (n - 1).toDouble()).toInt()\n } else if (n != 1) {\n r += 1 * Math.pow(10.0, (n - 1).toDouble()).toInt()\n }\n if (n >= 2 && map[2] != null) {\n r += map[2]!! * Math.pow(10.0, (n - 2).toDouble()).toInt()\n }\n if (n >= 3 && map[3] != null) {\n r += map[3]!!\n }\n println(r)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 892, "cpu_time_ms": 196, "memory_kb": 31392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s819613829", "group_id": "codeNet:p02761", "input_text": "fun main(args: Array) {\n val nm = readLine()!!.split(\" \").map(String::toInt)\n\n var ans = arrayOfNulls(nm[0])\n for (i in 1.. nm[0]) {\n ans[i -1] = \" \"\n }\n var fail = false\n for (i in 1.. nm[1]) {\n val sc = readLine()!!.split(\" \")\n\n if (ans[sc[0].toInt()-1] == \" \" || ans[sc[0].toInt()-1] == sc[1]) {\n ans[sc[0].toInt()-1] = sc[1]\n } else {\n fail = true\n }\n }\n\n if (fail) {\n println(\"-1\")\n } else {\n if (ans[0] == \"0\") {\n if (nm[0] == 1 ) println(\"0\")\n else println(\"-1\")\n } else {\n for (i in 1..nm[0]) {\n if (ans[i -1] == \" \") {\n if (i==1) {\n if (nm[0] == 1 ) ans[i -1] = \"0\"\n else ans[i -1] = \"1\"\n } else { ans[i -1] = \"0\" }\n }\n print(ans[i -1])\n }\n println()\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1583116657, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s819613829.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s819613829", "user_id": "u288435405"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "fun main(args: Array) {\n val nm = readLine()!!.split(\" \").map(String::toInt)\n\n var ans = arrayOfNulls(nm[0])\n for (i in 1.. nm[0]) {\n ans[i -1] = \" \"\n }\n var fail = false\n for (i in 1.. nm[1]) {\n val sc = readLine()!!.split(\" \")\n\n if (ans[sc[0].toInt()-1] == \" \" || ans[sc[0].toInt()-1] == sc[1]) {\n ans[sc[0].toInt()-1] = sc[1]\n } else {\n fail = true\n }\n }\n\n if (fail) {\n println(\"-1\")\n } else {\n if (ans[0] == \"0\") {\n if (nm[0] == 1 ) println(\"0\")\n else println(\"-1\")\n } else {\n for (i in 1..nm[0]) {\n if (ans[i -1] == \" \") {\n if (i==1) {\n if (nm[0] == 1 ) ans[i -1] = \"0\"\n else ans[i -1] = \"1\"\n } else { ans[i -1] = \"0\" }\n }\n print(ans[i -1])\n }\n println()\n }\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 985, "cpu_time_ms": 239, "memory_kb": 38072}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s133572805", "group_id": "codeNet:p02761", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map(String::toInt)\n val ans = IntArray(n) { -1 }\n\n for (i in 1..m) {\n val (s, c) = readLine()!!.split(' ').map(String::toInt)\n if ((n > 1 && s == 1 && c == 0) || (ans[s - 1] != -1 && ans[s - 1] != c)) {\n println(-1)\n return\n }\n ans[s - 1] = c\n }\n if (ans[0] == -1 && n > 2) ans[0] = 1\n if (ans[0] == -1 && n == 1) ans[0] = 0\n for (i in 1 until n)\n if (ans[i] == -1) ans[i] = 0\n println(ans.joinToString(\"\"))\n}\n", "language": "Kotlin", "metadata": {"date": 1583115469, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s133572805.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s133572805", "user_id": "u099066216"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map(String::toInt)\n val ans = IntArray(n) { -1 }\n\n for (i in 1..m) {\n val (s, c) = readLine()!!.split(' ').map(String::toInt)\n if ((n > 1 && s == 1 && c == 0) || (ans[s - 1] != -1 && ans[s - 1] != c)) {\n println(-1)\n return\n }\n ans[s - 1] = c\n }\n if (ans[0] == -1 && n > 2) ans[0] = 1\n if (ans[0] == -1 && n == 1) ans[0] = 0\n for (i in 1 until n)\n if (ans[i] == -1) ans[i] = 0\n println(ans.joinToString(\"\"))\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 561, "cpu_time_ms": 237, "memory_kb": 38072}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s650100358", "group_id": "codeNet:p02761", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map(String::toInt)\n val ans = IntArray(n) { -1 }\n\n for (i in 1..m) {\n val (s, c) = readLine()!!.split(' ').map(String::toInt)\n if (s == 1 && c == 0 || (ans[s - 1] != -1 && ans[s - 1] != c)) {\n println(-1)\n return\n }\n ans[s - 1] = c\n }\n if (ans[0] == -1) ans[0] = 1\n for (i in 1 until n)\n if (ans[i] == -1) ans[i] = 0\n println(ans.joinToString(\"\"))\n}\n", "language": "Kotlin", "metadata": {"date": 1583115166, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02761.html", "problem_id": "p02761", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02761/input.txt", "sample_output_relpath": "derived/input_output/data/p02761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02761/Kotlin/s650100358.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s650100358", "user_id": "u099066216"}, "prompt_components": {"gold_output": "702\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map(String::toInt)\n val ans = IntArray(n) { -1 }\n\n for (i in 1..m) {\n val (s, c) = readLine()!!.split(' ').map(String::toInt)\n if (s == 1 && c == 0 || (ans[s - 1] != -1 && ans[s - 1] != c)) {\n println(-1)\n return\n }\n ans[s - 1] = c\n }\n if (ans[0] == -1) ans[0] = 1\n for (i in 1 until n)\n if (ans[i] == -1) ans[i] = 0\n println(ans.joinToString(\"\"))\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "sample_input": "3 3\n1 7\n3 2\n1 7\n"}, "reference_outputs": ["702\n"], "source_document_id": "p02761", "source_text": "Score : 300 points\n\nProblem Statement\n\nIf there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print -1.\n\nThe integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)\n\nThe s_i-th digit from the left is c_i. \\left(i = 1, 2, \\cdots, M\\right)\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3\n\n0 \\leq M \\leq 5\n\n1 \\leq s_i \\leq N\n\n0 \\leq c_i \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\ns_1 c_1\n\\vdots\ns_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n1 7\n3 2\n1 7\n\nSample Output 1\n\n702\n\n702 satisfies the conditions - its 1-st and 3-rd digits are 7 and 2, respectively - while no non-negative integer less than 702 satisfies them.\n\nSample Input 2\n\n3 2\n2 1\n2 3\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n3 1\n1 0\n\nSample Output 3\n\n-1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 498, "cpu_time_ms": 238, "memory_kb": 38208}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s145359860", "group_id": "codeNet:p02774", "input_text": "fun main(args: Array) {\n val (n, k) = readLine()?.split(\" \")?.map(String::toLong) ?: return\n val a = readLine()?.split(\" \")?.map(String::toLong)?.sorted() ?: return\n val nInt = n.toInt()\n}", "language": "Kotlin", "metadata": {"date": 1586618916, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Kotlin/s145359860.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s145359860", "user_id": "u979429407"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, k) = readLine()?.split(\" \")?.map(String::toLong) ?: return\n val a = readLine()?.split(\" \")?.map(String::toLong)?.sorted() ?: return\n val nInt = n.toInt()\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 205, "cpu_time_ms": 1046, "memory_kb": 85256}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s701237457", "group_id": "codeNet:p02774", "input_text": "fun main(args: Array) {\n val (n, k) = readLine()!!.split(\" \").map { it.toInt() }\n val items = readLine()!!.split(\" \").map { it.toLong() }.sorted()\n\n val list = mutableListOf()\n for (i in 0 until n) {\n for (j in n - 1 downTo i + 1) {\n list.add(items[i] * items[j])\n }\n }\n\n val ans = list.sorted()\n println(ans[k - 1])\n}", "language": "Kotlin", "metadata": {"date": 1585688738, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Kotlin/s701237457.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s701237457", "user_id": "u897579945"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, k) = readLine()!!.split(\" \").map { it.toInt() }\n val items = readLine()!!.split(\" \").map { it.toLong() }.sorted()\n\n val list = mutableListOf()\n for (i in 0 until n) {\n for (j in n - 1 downTo i + 1) {\n list.add(items[i] * items[j])\n }\n }\n\n val ans = list.sorted()\n println(ans[k - 1])\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 378, "cpu_time_ms": 2119, "memory_kb": 304844}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s210428856", "group_id": "codeNet:p02774", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val (N, K) = readInputLine().split(\" \").map { it.toLong() }\n val AArr = readInputLine().split(\" \").map { it.toLong() }\n\n val minus = mutableListOf()\n val zero = mutableListOf()\n val plus = mutableListOf()\n\n for (A in AArr) {\n when {\n A == 0L -> zero.add(A)\n A < 0L -> minus.add(A)\n else -> plus.add(A)\n }\n }\n\n val minusNum = minus.size.toLong() * plus.size.toLong()\n val zeroNum = minus.size.toLong() * zero.size.toLong() + plus.size.toLong() * zero.size.toLong() + zero.size.toLong() * (zero.size.toLong() - 1L) / 2L\n\n when {\n K <= minusNum -> {\n var l = (-1e18).toLong() - 1L\n var r = -1L\n\n minus.sort()\n\n while (r - l > 1L) {\n val mid = (l + r) / 2L\n var cnt = 0L\n plus.forEach { cnt += (upperBound(minus, (mid - it + 1L) / it)).toLong() }\n\n if (cnt >= K) {\n r = mid\n } else {\n l = mid\n }\n }\n\n println(r)\n return\n }\n K <= zeroNum -> {\n println(0)\n }\n else -> {\n val K = K - minusNum - zeroNum\n val minus = minus.map { it * -1L }.toMutableList()\n\n minus.sort()\n plus.sort()\n\n var l = -1L\n var r = 1e18.toLong()\n\n while (r - l > 1L) {\n val mid = (l + r) / 2L\n\n var cnt = plus.foldIndexed(0L, {\n index: Int, acc: Long, l: Long ->\n val tmp = upperBound(plus, mid / l).toLong()\n acc + tmp + if (index < tmp) -1L else 0L\n })\n\n cnt += minus.foldIndexed(0L, {\n index: Int, acc: Long, l: Long ->\n val tmp = upperBound(minus, mid / l).toLong()\n acc + tmp + if (index < tmp) -1L else 0L\n })\n\n if (cnt / 2L >= K) {\n r = mid\n } else {\n l = mid\n }\n }\n\n println(r)\n }\n }\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n\nfun > upperBound(list: List, value: T): Int {\n return Collections.binarySearch(list, value, { x, y -> if (x > y) 1 else -1}).inv()\n}\n", "language": "Kotlin", "metadata": {"date": 1582242070, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Kotlin/s210428856.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s210428856", "user_id": "u505558493"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val (N, K) = readInputLine().split(\" \").map { it.toLong() }\n val AArr = readInputLine().split(\" \").map { it.toLong() }\n\n val minus = mutableListOf()\n val zero = mutableListOf()\n val plus = mutableListOf()\n\n for (A in AArr) {\n when {\n A == 0L -> zero.add(A)\n A < 0L -> minus.add(A)\n else -> plus.add(A)\n }\n }\n\n val minusNum = minus.size.toLong() * plus.size.toLong()\n val zeroNum = minus.size.toLong() * zero.size.toLong() + plus.size.toLong() * zero.size.toLong() + zero.size.toLong() * (zero.size.toLong() - 1L) / 2L\n\n when {\n K <= minusNum -> {\n var l = (-1e18).toLong() - 1L\n var r = -1L\n\n minus.sort()\n\n while (r - l > 1L) {\n val mid = (l + r) / 2L\n var cnt = 0L\n plus.forEach { cnt += (upperBound(minus, (mid - it + 1L) / it)).toLong() }\n\n if (cnt >= K) {\n r = mid\n } else {\n l = mid\n }\n }\n\n println(r)\n return\n }\n K <= zeroNum -> {\n println(0)\n }\n else -> {\n val K = K - minusNum - zeroNum\n val minus = minus.map { it * -1L }.toMutableList()\n\n minus.sort()\n plus.sort()\n\n var l = -1L\n var r = 1e18.toLong()\n\n while (r - l > 1L) {\n val mid = (l + r) / 2L\n\n var cnt = plus.foldIndexed(0L, {\n index: Int, acc: Long, l: Long ->\n val tmp = upperBound(plus, mid / l).toLong()\n acc + tmp + if (index < tmp) -1L else 0L\n })\n\n cnt += minus.foldIndexed(0L, {\n index: Int, acc: Long, l: Long ->\n val tmp = upperBound(minus, mid / l).toLong()\n acc + tmp + if (index < tmp) -1L else 0L\n })\n\n if (cnt / 2L >= K) {\n r = mid\n } else {\n l = mid\n }\n }\n\n println(r)\n }\n }\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n\nfun > upperBound(list: List, value: T): Int {\n return Collections.binarySearch(list, value, { x, y -> if (x > y) 1 else -1}).inv()\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2455, "cpu_time_ms": 1857, "memory_kb": 135708}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s894014546", "group_id": "codeNet:p02774", "input_text": "import java.util.*\n\nfun main(args: Array) {\n\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val k = sc.nextInt()\n\n val a = Array(n){\n sc.nextLong()\n }\n\n val lst = mutableListOf()\n\n for (i in 0 until n-1) {\n for (j in i+1 until n) {\n lst.add(a[i] * a[j])\n }\n }\n\n println(lst.sorted()[k-1])\n\n}\n", "language": "Kotlin", "metadata": {"date": 1581888072, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Kotlin/s894014546.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s894014546", "user_id": "u288435405"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val k = sc.nextInt()\n\n val a = Array(n){\n sc.nextLong()\n }\n\n val lst = mutableListOf()\n\n for (i in 0 until n-1) {\n for (j in i+1 until n) {\n lst.add(a[i] * a[j])\n }\n }\n\n println(lst.sorted()[k-1])\n\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 371, "cpu_time_ms": 2111, "memory_kb": 330916}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s427351126", "group_id": "codeNet:p02774", "input_text": "fun main(args: Array) {\n val (N, K) = readLine()!!.split(\" \").map(String::toInt)\n val A = readLine()!!.split(\" \").map(String::toLong)\n val ans = LongArray(K + 1)\n var index = 0\n for (i in 0 until N - 1) {\n for (j in i + 1 until N) {\n ans[index++] = A[i] * A[j]\n while (index > K) {\n ans.sort()\n ans.dropLast(1)\n index--\n }\n }\n }\n println(ans[K - 1])\n}", "language": "Kotlin", "metadata": {"date": 1581885348, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Kotlin/s427351126.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s427351126", "user_id": "u860789370"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, K) = readLine()!!.split(\" \").map(String::toInt)\n val A = readLine()!!.split(\" \").map(String::toLong)\n val ans = LongArray(K + 1)\n var index = 0\n for (i in 0 until N - 1) {\n for (j in i + 1 until N) {\n ans[index++] = A[i] * A[j]\n while (index > K) {\n ans.sort()\n ans.dropLast(1)\n index--\n }\n }\n }\n println(ans[K - 1])\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 472, "cpu_time_ms": 2123, "memory_kb": 244688}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s340742648", "group_id": "codeNet:p02774", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val k = sc.nextInt()\n val a = (0 until n).map { sc.next().toLong() }\n println(problem155d(n, k, a))\n}\n\nfun problem155d(n: Int, k: Int, a: List): Long {\n var res = 0L\n val seki = mutableListOf()\n for (i in 0 until a.size) {\n val ai = a[i]\n for (j in i + 1 until a.size) {\n val aj = a[j]\n seki.add(ai * aj)\n }\n }\n return seki.sorted()[k - 1]\n}", "language": "Kotlin", "metadata": {"date": 1581884685, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02774.html", "problem_id": "p02774", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02774/input.txt", "sample_output_relpath": "derived/input_output/data/p02774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02774/Kotlin/s340742648.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s340742648", "user_id": "u073232808"}, "prompt_components": {"gold_output": "-6\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val k = sc.nextInt()\n val a = (0 until n).map { sc.next().toLong() }\n println(problem155d(n, k, a))\n}\n\nfun problem155d(n: Int, k: Int, a: List): Long {\n var res = 0L\n val seki = mutableListOf()\n for (i in 0 until a.size) {\n val ai = a[i]\n for (j in i + 1 until a.size) {\n val aj = a[j]\n seki.add(ai * aj)\n }\n }\n return seki.sorted()[k - 1]\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "sample_input": "4 3\n3 3 -4 -2\n"}, "reference_outputs": ["-6\n"], "source_document_id": "p02774", "source_text": "Score: 400 points\n\nProblem Statement\n\nWe have N integers A_1, A_2, ..., A_N.\n\nThere are \\frac{N(N-1)}{2} ways to choose two of them and form a pair. If we compute the product of each of those pairs and sort the results in ascending order, what will be the K-th number in that list?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\frac{N(N-1)}{2}\n\n-10^9 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 3\n3 3 -4 -2\n\nSample Output 1\n\n-6\n\nThere are six ways to form a pair. The products of those pairs are 9, -12, -6, -12, -6, 8.\n\nSorting those numbers in ascending order, we have -12, -12, -6, -6, 8, 9. The third number in this list is -6.\n\nSample Input 2\n\n10 40\n5 4 3 2 -1 0 0 0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n30 413\n-170202098 -268409015 537203564 983211703 21608710 -443999067 -937727165 -97596546 -372334013 398994917 -972141167 798607104 -949068442 -959948616 37909651 0 886627544 -20098238 0 -948955241 0 -214720580 277222296 -18897162 834475626 0 -425610555 110117526 663621752 0\n\nSample Output 3\n\n448283280358331064", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 532, "cpu_time_ms": 2119, "memory_kb": 331956}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s648464983", "group_id": "codeNet:p02879", "input_text": "fun solve(a:Int, b:Int){\n if(a in 1..9 && b in 1..9){\n println(a*b)\n }\n else{\n println(-1)\n }\n}\n\nfun main(){\n val (a, b) = readLine()!!.split(\" \").map{it.toInt()}\n solve(a,b)\n}", "language": "Kotlin", "metadata": {"date": 1599964593, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Kotlin/s648464983.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s648464983", "user_id": "u212831449"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "fun solve(a:Int, b:Int){\n if(a in 1..9 && b in 1..9){\n println(a*b)\n }\n else{\n println(-1)\n }\n}\n\nfun main(){\n val (a, b) = readLine()!!.split(\" \").map{it.toInt()}\n solve(a,b)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 208, "cpu_time_ms": 113, "memory_kb": 36476}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s672159660", "group_id": "codeNet:p02879", "input_text": "import java.lang.Math\n\nfun main(args: Array)\n{\n val (a, b) = readLine()!!.split(\" \").map{it.toInt()}\n println( if (a > 9 || b > 9) -1 else a*b)\n}\n", "language": "Kotlin", "metadata": {"date": 1578171581, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Kotlin/s672159660.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s672159660", "user_id": "u118477733"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "import java.lang.Math\n\nfun main(args: Array)\n{\n val (a, b) = readLine()!!.split(\" \").map{it.toInt()}\n println( if (a > 9 || b > 9) -1 else a*b)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 160, "cpu_time_ms": 237, "memory_kb": 37808}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s128745275", "group_id": "codeNet:p02879", "input_text": "fun main(args: Array){\n val sc: List = readLine()!!.split(\" \")\n if(sc[0].toInt() < 10 && sc[1].toInt() < 10) {\n println(sc[0].toInt() * sc[1].toInt())\n }else{\n println(\"-1\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1574295197, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Kotlin/s128745275.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s128745275", "user_id": "u035856025"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "fun main(args: Array){\n val sc: List = readLine()!!.split(\" \")\n if(sc[0].toInt() < 10 && sc[1].toInt() < 10) {\n println(sc[0].toInt() * sc[1].toInt())\n }else{\n println(\"-1\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 220, "cpu_time_ms": 236, "memory_kb": 37676}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s649103840", "group_id": "codeNet:p02879", "input_text": "fun main(args: Array){\n val sc: List = readLine()!!.split(\" \")\n if(sc[0].toInt() < 10){\n if(sc[1].toInt() < 10){\n println(sc[0].toInt() * sc[1].toInt())\n }else{\n println(\"-1\")\n }\n }else{\n println(\"-1\")\n }\n\n}", "language": "Kotlin", "metadata": {"date": 1574295015, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Kotlin/s649103840.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s649103840", "user_id": "u035856025"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "fun main(args: Array){\n val sc: List = readLine()!!.split(\" \")\n if(sc[0].toInt() < 10){\n if(sc[1].toInt() < 10){\n println(sc[0].toInt() * sc[1].toInt())\n }else{\n println(\"-1\")\n }\n }else{\n println(\"-1\")\n }\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 285, "cpu_time_ms": 240, "memory_kb": 37980}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s041172308", "group_id": "codeNet:p02879", "input_text": "fun main(args: Array){\n val sc: List = readLine()!!.split(\" \")\n if(sc[0].toInt() < 10){\n if(sc[1].toInt() < 10){\n println(sc[0].toInt() * sc[1].toInt())\n }else{\n println(\"-12 \")\n }\n }else{\n println(\"-1\")\n }\n\n}\n", "language": "Kotlin", "metadata": {"date": 1574294959, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Kotlin/s041172308.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s041172308", "user_id": "u035856025"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "fun main(args: Array){\n val sc: List = readLine()!!.split(\" \")\n if(sc[0].toInt() < 10){\n if(sc[1].toInt() < 10){\n println(sc[0].toInt() * sc[1].toInt())\n }else{\n println(\"-12 \")\n }\n }else{\n println(\"-1\")\n }\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 288, "cpu_time_ms": 239, "memory_kb": 37692}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s591846093", "group_id": "codeNet:p02879", "input_text": "fun main(args: Array) {\n val (a,b) = readLine()!!.split(\" \").map(String::toInt)\n if (a <= 9 && b <= 9) {\n println(a*b)\n } else {\n println(-1)\n }\n}", "language": "Kotlin", "metadata": {"date": 1573615545, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Kotlin/s591846093.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s591846093", "user_id": "u388719350"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "fun main(args: Array) {\n val (a,b) = readLine()!!.split(\" \").map(String::toInt)\n if (a <= 9 && b <= 9) {\n println(a*b)\n } else {\n println(-1)\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 245, "memory_kb": 37872}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s240373868", "group_id": "codeNet:p02879", "input_text": "fun main(args: Array) {\n val (a, b) = readLine()!!.split(\" \").map {it.toLong()}\n println(if (a < 10 && b < 10) a * b else -1)\n}", "language": "Kotlin", "metadata": {"date": 1572556463, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Kotlin/s240373868.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s240373868", "user_id": "u183530284"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "fun main(args: Array) {\n val (a, b) = readLine()!!.split(\" \").map {it.toLong()}\n println(if (a < 10 && b < 10) a * b else -1)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 137, "cpu_time_ms": 239, "memory_kb": 38032}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s580035005", "group_id": "codeNet:p02879", "input_text": "fun main(args: Array) {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n val answer = if (a > 9 || b > 9) {\n -1\n } else {\n a * b\n }\n println(answer)\n}", "language": "Kotlin", "metadata": {"date": 1572224855, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Kotlin/s580035005.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s580035005", "user_id": "u225381909"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "fun main(args: Array) {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n val answer = if (a > 9 || b > 9) {\n -1\n } else {\n a * b\n }\n println(answer)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 196, "cpu_time_ms": 273, "memory_kb": 37856}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s193129477", "group_id": "codeNet:p02879", "input_text": "fun main(args : Array) {\n val (a, b) = readLine()!!.split(\" \").map{it.toInt()}\n\n if (a > 9 || b > 9) {\n println(-1)\n } else {\n println(a * b)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1572224518, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Kotlin/s193129477.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s193129477", "user_id": "u262403099"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "fun main(args : Array) {\n val (a, b) = readLine()!!.split(\" \").map{it.toInt()}\n\n if (a > 9 || b > 9) {\n println(-1)\n } else {\n println(a * b)\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 181, "cpu_time_ms": 283, "memory_kb": 38068}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s496196780", "group_id": "codeNet:p02879", "input_text": "fun main(args: Array) {\n val (A, B) = readInputLine().split(\" \").map { it.toInt() }\n \n if (A <= 9 && B <= 9) {\n println(A * B)\n } else {\n println(-1)\n }\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "language": "Kotlin", "metadata": {"date": 1572224499, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Kotlin/s496196780.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s496196780", "user_id": "u505558493"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "fun main(args: Array) {\n val (A, B) = readInputLine().split(\" \").map { it.toInt() }\n \n if (A <= 9 && B <= 9) {\n println(A * B)\n } else {\n println(-1)\n }\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 249, "cpu_time_ms": 299, "memory_kb": 36336}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s539247888", "group_id": "codeNet:p02879", "input_text": "fun main(args: Array) {\n abc144a()\n}\n\nfun abc144a() {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n\n val answer = if (a in 1..9 && b in 1..9) a * b else -1\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1572224476, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02879.html", "problem_id": "p02879", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02879/input.txt", "sample_output_relpath": "derived/input_output/data/p02879/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02879/Kotlin/s539247888.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s539247888", "user_id": "u139478771"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "fun main(args: Array) {\n abc144a()\n}\n\nfun abc144a() {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n\n val answer = if (a in 1..9 && b in 1..9) a * b else -1\n\n println(answer)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02879", "source_text": "Score : 100 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.\n\nGiven are two integers A and B.\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1 instead.\n\nConstraints\n\n1 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf Takahashi can calculate A \\times B, print the result; if he cannot, print -1.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\n2 \\times 5 = 10.\n\nSample Input 2\n\n5 10\n\nSample Output 2\n\n-1\n\n5\\times 10 = 50, but Takahashi cannot do this calculation, so print -1 instead.\n\nSample Input 3\n\n9 9\n\nSample Output 3\n\n81", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 208, "cpu_time_ms": 271, "memory_kb": 37876}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s232150687", "group_id": "codeNet:p02891", "input_text": "import java.io.*\nimport java.util.*\nimport java.lang.*\nimport java.lang.Math.*\n\n\nfun solve() {\n val S = rd.readString()\n val K = rd.readLong()\n val N = S.length\n\n if (N == 1) {\n println(K/2)\n return\n } else if (N == 2) {\n if (S[0] == S[1]) {\n println(K)\n } else {\n println(0)\n }\n return\n }\n\n var C = S.toCharArray()\n var cnt = 0L\n for (i in 0 until N-1) {\n if (C[i] == C[i+1]) {\n C[i+1] = '*'\n cnt++\n }\n }\n if (C[1]=='*' && C[0] != C[2]) {\n C[1] = C[0]\n C[0] = '+'\n }\n val ans = if (C[0] == C[N-1]) cnt*K + K-1\n else cnt*K\n println(ans)\n}\n\n\n//val rd = debug.Reader(\"agc\", \"039\", \"a\", \"sample-3\")\nval rd = Reader()\n\n\nfun main(args: Array) {\n try {\n var exception: Throwable? = null\n val sth = Thread(null, SolveThread(), \"solveThread\", 128 * 1024 * 1024)\n sth.setUncaughtExceptionHandler { _, e -> exception = e }\n sth.start(); sth.join()\n if (exception != null) throw exception!! }\n catch (e: Exception) { throw e }\n finally { rd.close() }\n}\nconst val MOD = 1_000_000_007L; const val INF = Int.MAX_VALUE/2; const val LINF = Long.MAX_VALUE/2\ndata class IntPair(val first: Int, val second: Int)\nval errPrintln: (Any) -> Unit = { msg -> System.err.println(msg) }\nfun rAssert(exp: Boolean, lazyMsg: () -> String = {\"\"}) {\n if (!exp) { val msg = lazyMsg(); errPrintln(\"EAssert Error: $msg\"); throw Error(msg) }\n}\nfun tAssert(exp: Boolean, lazyMsg: () -> String = {\"\"}) {\n if (!exp) { val msg = lazyMsg(); errPrintln(\"TAssert Error: $msg\"); Thread.sleep(3000) }\n}\nclass SolveThread : Runnable {\n override fun run() { solve() }\n}\nclass Reader {\n private val br = BufferedReader(InputStreamReader(System.`in`))\n val readString: () -> String = { br.readLine() }\n val readInt: () -> Int = { br.readLine().toInt() }\n val readLong: () -> Long = { br.readLine().toLong() }\n val readIntArray: () -> IntArray = { br.readLine().split(' ').map { it.toInt() }.toIntArray() }\n val readLongArray: () -> LongArray = { br.readLine().split(' ').map { it.toLong() }.toLongArray() }\n val readListInt: () -> List = { br.readLine().split(' ').map { it.toInt() } }\n val readListLong: () -> List = { br.readLine().split(' ').map { it.toLong() } }\n val readListIntCol: (Int) -> List = { N -> (0 until N).map { readInt() } }\n val readListIntCols: (Int) -> List> = { N -> (0 until N).map { br.readLine().split(' ').map { it.toInt() } } }\n val readListLongCol: (Int) -> List = { N -> (0 until N).map { readLong() } }\n val readListLongCols: (Int) -> List> = { N -> (0 until N).map { br.readLine().split(' ').map { it.toLong() } } }\n val close: () -> Unit = { br.close() }\n protected fun finalize() { close() }\n}\n", "language": "Kotlin", "metadata": {"date": 1598470595, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s232150687.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s232150687", "user_id": "u404244809"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.*\nimport java.util.*\nimport java.lang.*\nimport java.lang.Math.*\n\n\nfun solve() {\n val S = rd.readString()\n val K = rd.readLong()\n val N = S.length\n\n if (N == 1) {\n println(K/2)\n return\n } else if (N == 2) {\n if (S[0] == S[1]) {\n println(K)\n } else {\n println(0)\n }\n return\n }\n\n var C = S.toCharArray()\n var cnt = 0L\n for (i in 0 until N-1) {\n if (C[i] == C[i+1]) {\n C[i+1] = '*'\n cnt++\n }\n }\n if (C[1]=='*' && C[0] != C[2]) {\n C[1] = C[0]\n C[0] = '+'\n }\n val ans = if (C[0] == C[N-1]) cnt*K + K-1\n else cnt*K\n println(ans)\n}\n\n\n//val rd = debug.Reader(\"agc\", \"039\", \"a\", \"sample-3\")\nval rd = Reader()\n\n\nfun main(args: Array) {\n try {\n var exception: Throwable? = null\n val sth = Thread(null, SolveThread(), \"solveThread\", 128 * 1024 * 1024)\n sth.setUncaughtExceptionHandler { _, e -> exception = e }\n sth.start(); sth.join()\n if (exception != null) throw exception!! }\n catch (e: Exception) { throw e }\n finally { rd.close() }\n}\nconst val MOD = 1_000_000_007L; const val INF = Int.MAX_VALUE/2; const val LINF = Long.MAX_VALUE/2\ndata class IntPair(val first: Int, val second: Int)\nval errPrintln: (Any) -> Unit = { msg -> System.err.println(msg) }\nfun rAssert(exp: Boolean, lazyMsg: () -> String = {\"\"}) {\n if (!exp) { val msg = lazyMsg(); errPrintln(\"EAssert Error: $msg\"); throw Error(msg) }\n}\nfun tAssert(exp: Boolean, lazyMsg: () -> String = {\"\"}) {\n if (!exp) { val msg = lazyMsg(); errPrintln(\"TAssert Error: $msg\"); Thread.sleep(3000) }\n}\nclass SolveThread : Runnable {\n override fun run() { solve() }\n}\nclass Reader {\n private val br = BufferedReader(InputStreamReader(System.`in`))\n val readString: () -> String = { br.readLine() }\n val readInt: () -> Int = { br.readLine().toInt() }\n val readLong: () -> Long = { br.readLine().toLong() }\n val readIntArray: () -> IntArray = { br.readLine().split(' ').map { it.toInt() }.toIntArray() }\n val readLongArray: () -> LongArray = { br.readLine().split(' ').map { it.toLong() }.toLongArray() }\n val readListInt: () -> List = { br.readLine().split(' ').map { it.toInt() } }\n val readListLong: () -> List = { br.readLine().split(' ').map { it.toLong() } }\n val readListIntCol: (Int) -> List = { N -> (0 until N).map { readInt() } }\n val readListIntCols: (Int) -> List> = { N -> (0 until N).map { br.readLine().split(' ').map { it.toInt() } } }\n val readListLongCol: (Int) -> List = { N -> (0 until N).map { readLong() } }\n val readListLongCols: (Int) -> List> = { N -> (0 until N).map { br.readLine().split(' ').map { it.toLong() } } }\n val close: () -> Unit = { br.close() }\n protected fun finalize() { close() }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2900, "cpu_time_ms": 102, "memory_kb": 34608}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s949882480", "group_id": "codeNet:p02891", "input_text": "import java.io.*\nimport java.lang.*\nimport java.math.BigDecimal\nimport java.util.*\n\n// Constant\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 9223372036854775807L\n\n// Main\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\nfun solve() {\n val s = next()\n val k = nextLong()\n val len = s.len\n\n var now = s.first()\n var count = 1L\n var ans = 0L\n var flag = true\n var topCount = 1L\n var bottomCount = 1L\n for (i in 1 until len) {\n when {\n s[i] != now -> {\n flag = false\n ans += count / 2\n count = 1L\n now = s[i]\n }\n else -> {\n count++\n if(flag) topCount++\n }\n }\n }\n if(count > 1L) ans += count / 2\n now = s.last()\n for (i in len - 2 downTo 0) {\n if(now != s[i]) break\n bottomCount++\n }\n\n if(topCount == len) println(len * k / 2)\n else if(s.first() == s.last()) println(ans * k - (topCount / 2 + bottomCount / 2 - (topCount + bottomCount) / 2) * (k - 1))\n else println(ans * k)\n\n\n}\n\n\n// Rule\noperator fun String.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.set(index: Long, value: Char) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun LongArray.get(index: Long): Long {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun LongArray.set(index: Long, value: Long) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun DoubleArray.get(index: Long): Double {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun DoubleArray.set(index: Long, value: Double) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun Array.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun Array.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun MutableList.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun MutableList.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\n\nval LongArray.siz: Long\n get() = size.toLong()\nval Array.siz: Long\n get() = size.toLong()\nval MutableList.siz: Long\n get() = size.toLong()\nval MutableSet.siz: Long\n get() = size.toLong()\nval String.len: Long\n get() = length.toLong()\n\n// Output\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\nfun next() = sc.next()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Long): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextLongAry(n: Long): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Long): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\nfun ary(n: Long, init: String = \"\") = Array(n.toInt()) { init }\nfun longAry(n: Long, init: Long = 0L) = LongArray(n.toInt()) { init }\nfun doubleAry(n: Long, init: Double = 0.0) = DoubleArray(n.toInt()) { init }\nfun boolAry(n: Long, init: Boolean = false) = Array(n.toInt()) { init }\nfun ary2(n: Long, m: Long, init: String = \"\") = Array(n.toInt()) { ary(m, init) }\nfun longAry2(n: Long, m: Long, init: Long = 0) = Array(n.toInt()) { longAry(m, init) }\nfun doubleAry2(n: Long, m: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry(m, init) }\nfun boolAry2(n: Long, m: Long, init: Boolean = false) = Array(n.toInt()) { boolAry(m, init) }\nfun ary3(n: Long, m: Long, k: Long, init: String = \"\") = Array(n.toInt()) { ary2(m, k, init) }\nfun longAry3(n: Long, m: Long, k: Long, init: Long = 0L) = Array(n.toInt()) { longAry2(m, k, init) }\nfun doubleAry3(n: Long, m: Long, k: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry2(m, k, init) }\nfun boolAry3(n: Long, m: Long, k: Long, init: Boolean = false) = Array(n.toInt()) { boolAry2(m, k, init) }\nfun list() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\nval addFunc = {a: Long, b: Long -> a + b}\nval mulFunc = {a: Long, b: Long -> a * b}\nval maxFunc = {a: Long, b: Long -> max(a, b)}\nval minFunc = {a: Long, b: Long -> min(a, b)}\nval gcdFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\nfun LongArray.lowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1L)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Long) {\n repeat(n.toInt()) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Long) {\n repeat(n.toInt()) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Long) = if (values.isEmpty()) -INF else values.max()!!\nfun min(vararg values: Long) = if (values.isEmpty()) INF else values.min()!!\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Long) {\n private val fac = longAry(max)\n private val finv = longAry(max)\n private val inv = longAry(max)\n private val p = MOD\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Long, r: Long): Long = if (n < r || (n < 0 || r < 0)) 0L else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Long, private var searched: Long = 0L, private var nextIndex: Long = 0L) {\n private val size = fact(n)\n private val permList = longAry2(size, n)\n\n private tailrec fun fact(n: Long, ans: Long = 1L): Long {\n return if (n == 0L) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, longAry(n), boolAry(n))\n }\n\n private fun create(num: Long, list: LongArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): LongArray = permList[nextIndex++]\n}\n\n// Graph\ndata class Node(val id: Long, var past: Long = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Long, val to: Long, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Long, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Long): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size.toLong(), -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Long): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size.toLong(), INF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\n// Data Structure\nclass UnionFind(size: Long) {\n private val par = LongArray(size.toInt()) { it.toLong() }\n private val size = longAry(size, 1L)\n fun root(x: Long): Long {\n return if (par[x] == x) {\n x\n } else {\n par[x] = root(par[x])\n par[x]\n }\n }\n\n fun same(x: Long, y: Long): Boolean = root(x) == root(y)\n fun unite(x: Long, y: Long) {\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n }\n size[a] += size[b]\n par[b] = a\n }\n\n fun size(x: Long): Long = size[root(x)]\n}\n\nclass SegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2L * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Long, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Long, b: Long) = getSub(a, b, 0L, 0L, n.toLong())\n private fun getSub(a: Long, b: Long, k: Long, l: Long, r: Long): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n if (buflen <= 0) false\n true\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n// \"The world doesn't need you.\"\n//\n// fun nextInt(): Int {\n// val nl = nextLong()\n// if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n// return nl.toInt()\n// }\n}", "language": "Kotlin", "metadata": {"date": 1588433757, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s949882480.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s949882480", "user_id": "u581625805"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.*\nimport java.lang.*\nimport java.math.BigDecimal\nimport java.util.*\n\n// Constant\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 9223372036854775807L\n\n// Main\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\nfun solve() {\n val s = next()\n val k = nextLong()\n val len = s.len\n\n var now = s.first()\n var count = 1L\n var ans = 0L\n var flag = true\n var topCount = 1L\n var bottomCount = 1L\n for (i in 1 until len) {\n when {\n s[i] != now -> {\n flag = false\n ans += count / 2\n count = 1L\n now = s[i]\n }\n else -> {\n count++\n if(flag) topCount++\n }\n }\n }\n if(count > 1L) ans += count / 2\n now = s.last()\n for (i in len - 2 downTo 0) {\n if(now != s[i]) break\n bottomCount++\n }\n\n if(topCount == len) println(len * k / 2)\n else if(s.first() == s.last()) println(ans * k - (topCount / 2 + bottomCount / 2 - (topCount + bottomCount) / 2) * (k - 1))\n else println(ans * k)\n\n\n}\n\n\n// Rule\noperator fun String.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.set(index: Long, value: Char) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun LongArray.get(index: Long): Long {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun LongArray.set(index: Long, value: Long) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun DoubleArray.get(index: Long): Double {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun DoubleArray.set(index: Long, value: Double) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun Array.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun Array.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun MutableList.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun MutableList.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\n\nval LongArray.siz: Long\n get() = size.toLong()\nval Array.siz: Long\n get() = size.toLong()\nval MutableList.siz: Long\n get() = size.toLong()\nval MutableSet.siz: Long\n get() = size.toLong()\nval String.len: Long\n get() = length.toLong()\n\n// Output\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\nfun next() = sc.next()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Long): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextLongAry(n: Long): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Long): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\nfun ary(n: Long, init: String = \"\") = Array(n.toInt()) { init }\nfun longAry(n: Long, init: Long = 0L) = LongArray(n.toInt()) { init }\nfun doubleAry(n: Long, init: Double = 0.0) = DoubleArray(n.toInt()) { init }\nfun boolAry(n: Long, init: Boolean = false) = Array(n.toInt()) { init }\nfun ary2(n: Long, m: Long, init: String = \"\") = Array(n.toInt()) { ary(m, init) }\nfun longAry2(n: Long, m: Long, init: Long = 0) = Array(n.toInt()) { longAry(m, init) }\nfun doubleAry2(n: Long, m: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry(m, init) }\nfun boolAry2(n: Long, m: Long, init: Boolean = false) = Array(n.toInt()) { boolAry(m, init) }\nfun ary3(n: Long, m: Long, k: Long, init: String = \"\") = Array(n.toInt()) { ary2(m, k, init) }\nfun longAry3(n: Long, m: Long, k: Long, init: Long = 0L) = Array(n.toInt()) { longAry2(m, k, init) }\nfun doubleAry3(n: Long, m: Long, k: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry2(m, k, init) }\nfun boolAry3(n: Long, m: Long, k: Long, init: Boolean = false) = Array(n.toInt()) { boolAry2(m, k, init) }\nfun list() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\nval addFunc = {a: Long, b: Long -> a + b}\nval mulFunc = {a: Long, b: Long -> a * b}\nval maxFunc = {a: Long, b: Long -> max(a, b)}\nval minFunc = {a: Long, b: Long -> min(a, b)}\nval gcdFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\nfun LongArray.lowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1L)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Long) {\n repeat(n.toInt()) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Long) {\n repeat(n.toInt()) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Long) = if (values.isEmpty()) -INF else values.max()!!\nfun min(vararg values: Long) = if (values.isEmpty()) INF else values.min()!!\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Long) {\n private val fac = longAry(max)\n private val finv = longAry(max)\n private val inv = longAry(max)\n private val p = MOD\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Long, r: Long): Long = if (n < r || (n < 0 || r < 0)) 0L else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Long, private var searched: Long = 0L, private var nextIndex: Long = 0L) {\n private val size = fact(n)\n private val permList = longAry2(size, n)\n\n private tailrec fun fact(n: Long, ans: Long = 1L): Long {\n return if (n == 0L) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, longAry(n), boolAry(n))\n }\n\n private fun create(num: Long, list: LongArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): LongArray = permList[nextIndex++]\n}\n\n// Graph\ndata class Node(val id: Long, var past: Long = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Long, val to: Long, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Long, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Long): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size.toLong(), -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Long): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size.toLong(), INF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\n// Data Structure\nclass UnionFind(size: Long) {\n private val par = LongArray(size.toInt()) { it.toLong() }\n private val size = longAry(size, 1L)\n fun root(x: Long): Long {\n return if (par[x] == x) {\n x\n } else {\n par[x] = root(par[x])\n par[x]\n }\n }\n\n fun same(x: Long, y: Long): Boolean = root(x) == root(y)\n fun unite(x: Long, y: Long) {\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n }\n size[a] += size[b]\n par[b] = a\n }\n\n fun size(x: Long): Long = size[root(x)]\n}\n\nclass SegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2L * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Long, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Long, b: Long) = getSub(a, b, 0L, 0L, n.toLong())\n private fun getSub(a: Long, b: Long, k: Long, l: Long, r: Long): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n if (buflen <= 0) false\n true\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n// \"The world doesn't need you.\"\n//\n// fun nextInt(): Int {\n// val nl = nextLong()\n// if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n// return nl.toInt()\n// }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 15041, "cpu_time_ms": 197, "memory_kb": 31492}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s991851798", "group_id": "codeNet:p02891", "input_text": "fun main(args: Array) {\n val S = readInputLine().toCharArray()\n val K = readInputLine().toLong()\n\n var allSame = true\n\n for (i in 1 until S.size) {\n if (S[i] != S[i - 1]) {\n allSame = false\n break\n }\n }\n if (allSame) {\n println(S.size * K / 2L)\n return\n }\n\n var concurrentCnt = 0L\n\n for (i in 1 until S.size) {\n if (S[i] == S[i - 1]) {\n concurrentCnt++\n S[i] = '*'\n }\n }\n\n if (S[S.size - 1] == S[0]) {\n var header = 1L\n for (i in 1 until S.size) {\n if (S[i] == S[i - 1]) {\n header++\n } else {\n break\n }\n }\n var footer = 1L\n for (i in S.size - 2 downTo 0) {\n if (S[i] == S[i + 1]) {\n footer++\n } else {\n break\n }\n }\n\n println(concurrentCnt * K - (K - 1) * (header / 2L + footer / 2L - (header + footer) / 2L))\n } else {\n println(concurrentCnt * K)\n }\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "language": "Kotlin", "metadata": {"date": 1583114068, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s991851798.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s991851798", "user_id": "u505558493"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(args: Array) {\n val S = readInputLine().toCharArray()\n val K = readInputLine().toLong()\n\n var allSame = true\n\n for (i in 1 until S.size) {\n if (S[i] != S[i - 1]) {\n allSame = false\n break\n }\n }\n if (allSame) {\n println(S.size * K / 2L)\n return\n }\n\n var concurrentCnt = 0L\n\n for (i in 1 until S.size) {\n if (S[i] == S[i - 1]) {\n concurrentCnt++\n S[i] = '*'\n }\n }\n\n if (S[S.size - 1] == S[0]) {\n var header = 1L\n for (i in 1 until S.size) {\n if (S[i] == S[i - 1]) {\n header++\n } else {\n break\n }\n }\n var footer = 1L\n for (i in S.size - 2 downTo 0) {\n if (S[i] == S[i + 1]) {\n footer++\n } else {\n break\n }\n }\n\n println(concurrentCnt * K - (K - 1) * (header / 2L + footer / 2L - (header + footer) / 2L))\n } else {\n println(concurrentCnt * K)\n }\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1124, "cpu_time_ms": 277, "memory_kb": 33788}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s825703846", "group_id": "codeNet:p02891", "input_text": "fun main(args: Array) {\n val S = readInputLine().toCharArray()\n val K = readInputLine().toLong()\n\n var concurrentCnt = 0L\n\n for (i in 1 until S.size) {\n if (S[i] == S[i - 1]) {\n concurrentCnt++\n S[i] = '*'\n }\n }\n\n if (S[S.size - 1] == S[0]) {\n println(concurrentCnt * K + K - 1)\n } else {\n println(concurrentCnt * K)\n }\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "language": "Kotlin", "metadata": {"date": 1583113478, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s825703846.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s825703846", "user_id": "u505558493"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(args: Array) {\n val S = readInputLine().toCharArray()\n val K = readInputLine().toLong()\n\n var concurrentCnt = 0L\n\n for (i in 1 until S.size) {\n if (S[i] == S[i - 1]) {\n concurrentCnt++\n S[i] = '*'\n }\n }\n\n if (S[S.size - 1] == S[0]) {\n println(concurrentCnt * K + K - 1)\n } else {\n println(concurrentCnt * K)\n }\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 461, "cpu_time_ms": 249, "memory_kb": 33652}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s372025347", "group_id": "codeNet:p02891", "input_text": "fun main(args: Array) {\n val s = readLine()!!.toList()\n val k = readLine()!!.toInt()\n\n val s1 = s.toMutableList()\n var cnt1 = 0L\n for (i in 1 until s.size) {\n val a = s1[i - 1]\n val b = s1[i]\n if (a == b) {\n s1[i] = '_'\n cnt1++\n }\n }\n\n if (k == 1) {\n println(cnt1)\n return\n }\n if (s1.first() != s1.last()) {\n println(cnt1 * k)\n return\n }\n\n val s2 = s.toMutableList()\n s2[0] = '_'\n var cnt2 = 1L\n for (i in 1 until s.size) {\n val a = s2[i - 1]\n val b = s2[i]\n if (a == b) {\n s2[i] = '_'\n cnt2++\n }\n }\n\n if (s1.first() != s2.last()) {\n println((cnt1 + cnt2) * k / 2 + cnt1 * k % 2)\n } else {\n println(cnt1 + cnt2 * (k - 1))\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1570465566, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s372025347.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s372025347", "user_id": "u979004569"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!.toList()\n val k = readLine()!!.toInt()\n\n val s1 = s.toMutableList()\n var cnt1 = 0L\n for (i in 1 until s.size) {\n val a = s1[i - 1]\n val b = s1[i]\n if (a == b) {\n s1[i] = '_'\n cnt1++\n }\n }\n\n if (k == 1) {\n println(cnt1)\n return\n }\n if (s1.first() != s1.last()) {\n println(cnt1 * k)\n return\n }\n\n val s2 = s.toMutableList()\n s2[0] = '_'\n var cnt2 = 1L\n for (i in 1 until s.size) {\n val a = s2[i - 1]\n val b = s2[i]\n if (a == b) {\n s2[i] = '_'\n cnt2++\n }\n }\n\n if (s1.first() != s2.last()) {\n println((cnt1 + cnt2) * k / 2 + cnt1 * k % 2)\n } else {\n println(cnt1 + cnt2 * (k - 1))\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 715, "cpu_time_ms": 213, "memory_kb": 33864}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s369177339", "group_id": "codeNet:p02891", "input_text": "fun main(args: Array) {\n val s = readLine()!!.toList()\n val k = readLine()!!.toInt()\n\n val s1 = s.toMutableList()\n var cnt1 = 0L\n for (i in 1 until s.size) {\n val a = s1[i - 1]\n val b = s1[i]\n if (a == b) {\n s1[i] = '_'\n cnt1++\n }\n }\n\n if (s1.first() != s1.last()) {\n println(cnt1 * k)\n return\n }\n\n val s2 = s.toMutableList()\n s2[0] = '_'\n var cnt2 = 1L\n for (i in 1 until s.size) {\n val a = s2[i - 1]\n val b = s2[i]\n if (a == b) {\n s2[i] = '_'\n cnt2++\n }\n }\n\n if (s1.first() != s2.last()) {\n println((cnt1 + cnt2) * k / 2 + cnt1 * k % 2)\n } else {\n println(cnt1 + cnt2 * (k - 1))\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1570465383, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s369177339.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s369177339", "user_id": "u979004569"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!.toList()\n val k = readLine()!!.toInt()\n\n val s1 = s.toMutableList()\n var cnt1 = 0L\n for (i in 1 until s.size) {\n val a = s1[i - 1]\n val b = s1[i]\n if (a == b) {\n s1[i] = '_'\n cnt1++\n }\n }\n\n if (s1.first() != s1.last()) {\n println(cnt1 * k)\n return\n }\n\n val s2 = s.toMutableList()\n s2[0] = '_'\n var cnt2 = 1L\n for (i in 1 until s.size) {\n val a = s2[i - 1]\n val b = s2[i]\n if (a == b) {\n s2[i] = '_'\n cnt2++\n }\n }\n\n if (s1.first() != s2.last()) {\n println((cnt1 + cnt2) * k / 2 + cnt1 * k % 2)\n } else {\n println(cnt1 + cnt2 * (k - 1))\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 666, "cpu_time_ms": 215, "memory_kb": 31820}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s498089447", "group_id": "codeNet:p02891", "input_text": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val s = next()\n val k = nextLong()\n\n if (s.length == 1) {\n println(k / 2L)\n return\n }\n\n var changed = false\n var count = 0L\n\n for (i in 1 until s.length) {\n if (changed) {\n changed = false\n continue\n }\n if (s[i] == s[i-1]) {\n count++\n changed = true\n }\n }\n\n if (k == 1L) {\n println(count)\n return\n }\n\n // abbc\n if (s.first() != s.last()) {\n println(count * k)\n return\n }\n\n val ss = s + s\n changed = false\n var dCount = 0L\n for (i in 1 until ss.length) {\n if (changed) {\n changed = false\n continue\n }\n if (ss[i] == ss[i-1]) {\n dCount++\n changed = true\n }\n }\n\n\n // aaa\n if (s.first() == s.last() && s.last() == s[s.length - 2]) {\n if (k % 2L == 0L) {\n println(dCount * (k / 2L))\n } else {\n println(dCount * (k / 2L) + count)\n }\n return\n }\n\n // abba\n if (s.first() == s.last() && s.last() != s[s.length - 2]) {\n dCount++\n if (k % 2L == 0L) {\n println(dCount * (k / 2L) - 1)\n } else {\n println(dCount * (k / 2L) + count - 1)\n }\n return\n }\n}\n\nfun next() = readLine()!!\nfun nextLong() = next().toLong()\n\nfun println(value : Any) {\n pw.println(value)\n}\n", "language": "Kotlin", "metadata": {"date": 1570332469, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s498089447.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s498089447", "user_id": "u262403099"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val s = next()\n val k = nextLong()\n\n if (s.length == 1) {\n println(k / 2L)\n return\n }\n\n var changed = false\n var count = 0L\n\n for (i in 1 until s.length) {\n if (changed) {\n changed = false\n continue\n }\n if (s[i] == s[i-1]) {\n count++\n changed = true\n }\n }\n\n if (k == 1L) {\n println(count)\n return\n }\n\n // abbc\n if (s.first() != s.last()) {\n println(count * k)\n return\n }\n\n val ss = s + s\n changed = false\n var dCount = 0L\n for (i in 1 until ss.length) {\n if (changed) {\n changed = false\n continue\n }\n if (ss[i] == ss[i-1]) {\n dCount++\n changed = true\n }\n }\n\n\n // aaa\n if (s.first() == s.last() && s.last() == s[s.length - 2]) {\n if (k % 2L == 0L) {\n println(dCount * (k / 2L))\n } else {\n println(dCount * (k / 2L) + count)\n }\n return\n }\n\n // abba\n if (s.first() == s.last() && s.last() != s[s.length - 2]) {\n dCount++\n if (k % 2L == 0L) {\n println(dCount * (k / 2L) - 1)\n } else {\n println(dCount * (k / 2L) + count - 1)\n }\n return\n }\n}\n\nfun next() = readLine()!!\nfun nextLong() = next().toLong()\n\nfun println(value : Any) {\n pw.println(value)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1551, "cpu_time_ms": 219, "memory_kb": 31820}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s215564070", "group_id": "codeNet:p02891", "input_text": "fun main(args: Array) {\n agc039a()\n}\n\nfun agc039a() {\n val s = readLine()!!\n val k = readLine()!!.toLong()\n\n if (s.length == 1) return println(k / 2L)\n\n var lastChar: Char? = null\n val charCount = mutableListOf()\n for (i in s.indices) {\n if (lastChar != null && s[i] == lastChar) {\n val last = charCount[charCount.lastIndex]\n charCount.removeAt(charCount.lastIndex)\n charCount.add(last + 1L)\n } else {\n charCount.add(1L)\n lastChar = s[i]\n }\n }\n\n val inside = charCount.map { it / 2L }.sum()\n\n for (i in s.indices) {\n if (lastChar != null && s[i] == lastChar) {\n val last = charCount[charCount.lastIndex]\n charCount.removeAt(charCount.lastIndex)\n charCount.add(last + 1L)\n } else {\n charCount.add(1L)\n lastChar = s[i]\n }\n }\n\n val between = charCount.map { it / 2L }.sum() - inside\n\n for (i in s.indices) {\n if (lastChar != null && s[i] == lastChar) {\n val last = charCount[charCount.lastIndex]\n charCount.removeAt(charCount.lastIndex)\n charCount.add(last + 1L)\n } else {\n charCount.add(1L)\n lastChar = s[i]\n }\n }\n\n val between2 = charCount.map { it / 2L }.sum() - between - inside\n\n val answer = inside + if (between == between2) {\n between * (k - 1L)\n } else {\n (between * Math.ceil((k - 1L).toDouble() / 2) + between2 * Math.floor((k - 1).toDouble() / 2)).toLong()\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1570329899, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s215564070.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s215564070", "user_id": "u139478771"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(args: Array) {\n agc039a()\n}\n\nfun agc039a() {\n val s = readLine()!!\n val k = readLine()!!.toLong()\n\n if (s.length == 1) return println(k / 2L)\n\n var lastChar: Char? = null\n val charCount = mutableListOf()\n for (i in s.indices) {\n if (lastChar != null && s[i] == lastChar) {\n val last = charCount[charCount.lastIndex]\n charCount.removeAt(charCount.lastIndex)\n charCount.add(last + 1L)\n } else {\n charCount.add(1L)\n lastChar = s[i]\n }\n }\n\n val inside = charCount.map { it / 2L }.sum()\n\n for (i in s.indices) {\n if (lastChar != null && s[i] == lastChar) {\n val last = charCount[charCount.lastIndex]\n charCount.removeAt(charCount.lastIndex)\n charCount.add(last + 1L)\n } else {\n charCount.add(1L)\n lastChar = s[i]\n }\n }\n\n val between = charCount.map { it / 2L }.sum() - inside\n\n for (i in s.indices) {\n if (lastChar != null && s[i] == lastChar) {\n val last = charCount[charCount.lastIndex]\n charCount.removeAt(charCount.lastIndex)\n charCount.add(last + 1L)\n } else {\n charCount.add(1L)\n lastChar = s[i]\n }\n }\n\n val between2 = charCount.map { it / 2L }.sum() - between - inside\n\n val answer = inside + if (between == between2) {\n between * (k - 1L)\n } else {\n (between * Math.ceil((k - 1L).toDouble() / 2) + between2 * Math.floor((k - 1).toDouble() / 2)).toLong()\n }\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1602, "cpu_time_ms": 222, "memory_kb": 33620}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s526677896", "group_id": "codeNet:p02891", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val s = scanner.next()\n val k = scanner.nextLong()\n var prev = s[0]\n var check = true\n var check2 = true\n var dCount = 0\n var fCount = 1\n var sum = 0L\n for(c in s){\n if(check) {\n check = false\n continue\n }\n if(c == prev) dCount++\n else {\n sum += (dCount+1) / 2\n dCount = 0\n check2 = false\n }\n if(check2) fCount++\n prev = c\n //println(dCount)\n }\n if(s[0] == s[s.length-1]){\n val sCount = (dCount+1) + fCount\n if(fCount === 1){\n sum += sCount / 2\n }\n else {\n sum += (dCount+1) / 2\n }\n }\n else if(dCount != 0){\n sum += (dCount+1) / 2\n }\n //println(\"${s[0]}=${s[s.length-1]}\")\n if(check) println(sum * k - 1L)\n else println(sum * k)\n}", "language": "Kotlin", "metadata": {"date": 1570329418, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s526677896.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s526677896", "user_id": "u046105273"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val s = scanner.next()\n val k = scanner.nextLong()\n var prev = s[0]\n var check = true\n var check2 = true\n var dCount = 0\n var fCount = 1\n var sum = 0L\n for(c in s){\n if(check) {\n check = false\n continue\n }\n if(c == prev) dCount++\n else {\n sum += (dCount+1) / 2\n dCount = 0\n check2 = false\n }\n if(check2) fCount++\n prev = c\n //println(dCount)\n }\n if(s[0] == s[s.length-1]){\n val sCount = (dCount+1) + fCount\n if(fCount === 1){\n sum += sCount / 2\n }\n else {\n sum += (dCount+1) / 2\n }\n }\n else if(dCount != 0){\n sum += (dCount+1) / 2\n }\n //println(\"${s[0]}=${s[s.length-1]}\")\n if(check) println(sum * k - 1L)\n else println(sum * k)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 948, "cpu_time_ms": 183, "memory_kb": 31388}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s956340375", "group_id": "codeNet:p02891", "input_text": "fun main(args: Array) {\n val s = readLine()!!.toCharArray()\n val k = readLine()!!.toLong()\n var cnt = 1\n var ope = 0\n for (i in 1 until s.size) {\n if (s[i - 1] == s[i]) {\n cnt += 1\n } else {\n ope += cnt / 2\n cnt = 1\n }\n }\n ope += cnt / 2\n var result = ope.toLong() * k\n if (s[0] == s[s.size - 1] && cnt % 2 == 0) {\n var j = 0\n while (s[j] == s[s.size - 1] && j < s.size - 1) {\n cnt += 1\n j += 1\n }\n if (cnt % 2 == 0) {\n result += k - 1\n }\n }\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1570327547, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s956340375.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s956340375", "user_id": "u388719350"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!.toCharArray()\n val k = readLine()!!.toLong()\n var cnt = 1\n var ope = 0\n for (i in 1 until s.size) {\n if (s[i - 1] == s[i]) {\n cnt += 1\n } else {\n ope += cnt / 2\n cnt = 1\n }\n }\n ope += cnt / 2\n var result = ope.toLong() * k\n if (s[0] == s[s.size - 1] && cnt % 2 == 0) {\n var j = 0\n while (s[j] == s[s.size - 1] && j < s.size - 1) {\n cnt += 1\n j += 1\n }\n if (cnt % 2 == 0) {\n result += k - 1\n }\n }\n println(result)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 623, "cpu_time_ms": 211, "memory_kb": 33536}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s657633532", "group_id": "codeNet:p02891", "input_text": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val s = next()\n val k = nextLong()\n\n if (s.length == 1) {\n println(k / 2)\n return\n }\n\n var changed = false\n var count = 0L\n\n for (i in 1 until s.length) {\n if (changed) {\n changed = false\n continue\n }\n if (s[i] == s[i-1]) {\n count++\n changed = true\n }\n }\n\n if (k == 1L) {\n println(count)\n return\n }\n\n var changedLast = false\n val ss = s + s\n changed = false\n var dCount = 0L\n\n for (i in 1 until ss.length) {\n if (changed) {\n changed = false\n continue\n }\n if (ss[i] == ss[i-1]) {\n dCount++\n changed = true\n if (i == ss.length - 1) changedLast = true\n }\n }\n\n if (k % 2L == 0L) {\n if (!changedLast && ss.first() == ss.last()) {\n dCount++\n println(dCount * (k / 2L) - 1L)\n } else {\n println(dCount * (k / 2L))\n }\n } else {\n if (!changedLast && ss.first() == ss.last()) {\n dCount++\n println(dCount * (k / 2L) + count)\n } else {\n println(dCount * (k / 2L) + count)\n }\n }\n}\n\nfun next() = readLine()!!\nfun nextLong() = next().toLong()\n\nfun println(value : Any) {\n pw.println(value)\n}", "language": "Kotlin", "metadata": {"date": 1570327493, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s657633532.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s657633532", "user_id": "u262403099"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val s = next()\n val k = nextLong()\n\n if (s.length == 1) {\n println(k / 2)\n return\n }\n\n var changed = false\n var count = 0L\n\n for (i in 1 until s.length) {\n if (changed) {\n changed = false\n continue\n }\n if (s[i] == s[i-1]) {\n count++\n changed = true\n }\n }\n\n if (k == 1L) {\n println(count)\n return\n }\n\n var changedLast = false\n val ss = s + s\n changed = false\n var dCount = 0L\n\n for (i in 1 until ss.length) {\n if (changed) {\n changed = false\n continue\n }\n if (ss[i] == ss[i-1]) {\n dCount++\n changed = true\n if (i == ss.length - 1) changedLast = true\n }\n }\n\n if (k % 2L == 0L) {\n if (!changedLast && ss.first() == ss.last()) {\n dCount++\n println(dCount * (k / 2L) - 1L)\n } else {\n println(dCount * (k / 2L))\n }\n } else {\n if (!changedLast && ss.first() == ss.last()) {\n dCount++\n println(dCount * (k / 2L) + count)\n } else {\n println(dCount * (k / 2L) + count)\n }\n }\n}\n\nfun next() = readLine()!!\nfun nextLong() = next().toLong()\n\nfun println(value : Any) {\n pw.println(value)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1463, "cpu_time_ms": 209, "memory_kb": 33652}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s669038879", "group_id": "codeNet:p02891", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val s = scanner.next()\n val k = scanner.nextLong()\n var prev = s[0]\n var check = true\n var check2 = false\n var dCount = 0\n var sum = 0\n for(c in s){\n if(check) {\n check = false\n continue\n }\n if(c == prev) dCount++\n else {\n sum += (dCount+1) / 2\n dCount = 0\n }\n prev = c\n //println(dCount)\n }\n if(dCount != 0){\n sum += (dCount+1) / 2\n }\n //println(\"${s[0]}=${s[s.length-1]}\")\n if(s[0] == s[s.length-1]){\n if(dCount == 0) {\n sum++\n check2 = true\n }\n else if(dCount != 0 && dCount % 2 == 0) {\n sum++\n check2 = true\n }\n }\n if(check2) println(sum * k - 1L)\n else println(sum * k)\n}", "language": "Kotlin", "metadata": {"date": 1570327462, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s669038879.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s669038879", "user_id": "u046105273"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val s = scanner.next()\n val k = scanner.nextLong()\n var prev = s[0]\n var check = true\n var check2 = false\n var dCount = 0\n var sum = 0\n for(c in s){\n if(check) {\n check = false\n continue\n }\n if(c == prev) dCount++\n else {\n sum += (dCount+1) / 2\n dCount = 0\n }\n prev = c\n //println(dCount)\n }\n if(dCount != 0){\n sum += (dCount+1) / 2\n }\n //println(\"${s[0]}=${s[s.length-1]}\")\n if(s[0] == s[s.length-1]){\n if(dCount == 0) {\n sum++\n check2 = true\n }\n else if(dCount != 0 && dCount % 2 == 0) {\n sum++\n check2 = true\n }\n }\n if(check2) println(sum * k - 1L)\n else println(sum * k)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 888, "cpu_time_ms": 180, "memory_kb": 31012}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s258147403", "group_id": "codeNet:p02891", "input_text": "fun main(args: Array) {\n agc039a()\n}\n\nfun agc039a() {\n val s = readLine()!!\n val k = readLine()!!.toLong()\n\n var beforeChar: Char? = null\n val charCount = mutableListOf()\n for (i in s.indices) {\n if (beforeChar != null && s[i] == beforeChar) {\n val last = charCount[charCount.lastIndex]\n charCount.removeAt(charCount.lastIndex)\n charCount.add(last)\n } else {\n charCount.add(1L)\n }\n beforeChar = s[i]\n }\n\n val inside = charCount.map { it / 2 }.sum()\n\n val between = if (s.length > 1 && s.first() == s.last() && s[s.lastIndex] != s[s.lastIndex - 1]) 1 else 0\n\n val answer = inside * k + between * (k - 1)\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1570326209, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s258147403.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s258147403", "user_id": "u139478771"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(args: Array) {\n agc039a()\n}\n\nfun agc039a() {\n val s = readLine()!!\n val k = readLine()!!.toLong()\n\n var beforeChar: Char? = null\n val charCount = mutableListOf()\n for (i in s.indices) {\n if (beforeChar != null && s[i] == beforeChar) {\n val last = charCount[charCount.lastIndex]\n charCount.removeAt(charCount.lastIndex)\n charCount.add(last)\n } else {\n charCount.add(1L)\n }\n beforeChar = s[i]\n }\n\n val inside = charCount.map { it / 2 }.sum()\n\n val between = if (s.length > 1 && s.first() == s.last() && s[s.lastIndex] != s[s.lastIndex - 1]) 1 else 0\n\n val answer = inside * k + between * (k - 1)\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 742, "cpu_time_ms": 218, "memory_kb": 33852}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s583093965", "group_id": "codeNet:p02891", "input_text": "\nfun num(input: String) : Long {\n var i = 0L\n var r = 0L\n var prev = ' '\n input.forEach {\n if (prev != it) {\n r += i / 2\n i = 1\n } else {\n i++\n }\n prev = it\n }\n r += i / 2\n return r\n}\n\nfun main(args: Array) {\n val input = readLine()!!\n val k = readLine()!!.toLong()\n\n val one = num(input)\n val two = num(input.repeat(2))\n\n val allSame = input.all { it == input.first() }\n if (allSame) {\n println(input.length * k / 2)\n } else {\n println((two - one) * (k - 1) + one)\n }\n}\n\n", "language": "Kotlin", "metadata": {"date": 1570326047, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s583093965.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s583093965", "user_id": "u895858420"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "\nfun num(input: String) : Long {\n var i = 0L\n var r = 0L\n var prev = ' '\n input.forEach {\n if (prev != it) {\n r += i / 2\n i = 1\n } else {\n i++\n }\n prev = it\n }\n r += i / 2\n return r\n}\n\nfun main(args: Array) {\n val input = readLine()!!\n val k = readLine()!!.toLong()\n\n val one = num(input)\n val two = num(input.repeat(2))\n\n val allSame = input.all { it == input.first() }\n if (allSame) {\n println(input.length * k / 2)\n } else {\n println((two - one) * (k - 1) + one)\n }\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 600, "cpu_time_ms": 254, "memory_kb": 33784}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s511067914", "group_id": "codeNet:p02891", "input_text": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val ss = next()\n val k = nextLong()\n\n var changed = false\n var changedLast = false\n var count = 0L\n\n if (ss.length == 1) {\n println(k / 2)\n return\n }\n\n for (i in 1 until ss.length) {\n if (changed) {\n changed = false\n continue\n }\n if (ss[i] == ss[i-1]) {\n count++\n changed = true\n if (i == ss.length - 1) changedLast = true\n }\n }\n\n if (!changedLast && ss.first() == ss.last()) {\n count++\n println(count * k - 1L)\n } else {\n println(count * k)\n }\n}\n\nfun next() = readLine()!!\nfun nextLong() = next().toLong()\n\nfun println(value : Any) {\n pw.println(value)\n}", "language": "Kotlin", "metadata": {"date": 1570325952, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s511067914.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s511067914", "user_id": "u262403099"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val ss = next()\n val k = nextLong()\n\n var changed = false\n var changedLast = false\n var count = 0L\n\n if (ss.length == 1) {\n println(k / 2)\n return\n }\n\n for (i in 1 until ss.length) {\n if (changed) {\n changed = false\n continue\n }\n if (ss[i] == ss[i-1]) {\n count++\n changed = true\n if (i == ss.length - 1) changedLast = true\n }\n }\n\n if (!changedLast && ss.first() == ss.last()) {\n count++\n println(count * k - 1L)\n } else {\n println(count * k)\n }\n}\n\nfun next() = readLine()!!\nfun nextLong() = next().toLong()\n\nfun println(value : Any) {\n pw.println(value)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 849, "cpu_time_ms": 210, "memory_kb": 33604}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s790239153", "group_id": "codeNet:p02891", "input_text": "import java.math.BigInteger;\nimport kotlin.system.exitProcess;\n\nfun main(args: Array){\n val s = readLine()!!\n val k = BigInteger(readLine())\n\n if( s.length == 1 ){\n println(k.divide(BigInteger(\"2\")))\n exitProcess(0)\n }\n\n if( s.length % 2 == 1 ){\n var i = 1;\n while(i < s.length){\n if( s[0] != s[i] )\n break;\n i++;\n }\n if( i == s.length ){\n println(k.multiply(BigInteger(s.length.toString())).divide(BigInteger(\"2\")));\n exitProcess(0);\n }\n }\n\n var result = 0;\n\n var i = 1;\n while( i < s.length+1 ){\n if( i < s.length && s[i] == s[i-1] ){\n result++;\n i++;\n }else if( i == s.length && s[s.length-1] == s[0] )\n result++;\n\n i++;\n }\n\n if( s[0] == s[s.length-1] ){\n var tmpL = 1;\n while( tmpL < s.length && s[0] == s[tmpL] )\n tmpL++;\n var tmpR = 1;\n while( tmpR < s.length && s[0] == s[s.length-1-tmpR] )\n tmpR++;\n if( tmpL % 2 == 0 && tmpR % 2 == 1 )\n result--;\n }\n\n println(BigInteger(result.toString()).multiply(k));\n}\n", "language": "Kotlin", "metadata": {"date": 1570325843, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s790239153.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s790239153", "user_id": "u657065743"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.math.BigInteger;\nimport kotlin.system.exitProcess;\n\nfun main(args: Array){\n val s = readLine()!!\n val k = BigInteger(readLine())\n\n if( s.length == 1 ){\n println(k.divide(BigInteger(\"2\")))\n exitProcess(0)\n }\n\n if( s.length % 2 == 1 ){\n var i = 1;\n while(i < s.length){\n if( s[0] != s[i] )\n break;\n i++;\n }\n if( i == s.length ){\n println(k.multiply(BigInteger(s.length.toString())).divide(BigInteger(\"2\")));\n exitProcess(0);\n }\n }\n\n var result = 0;\n\n var i = 1;\n while( i < s.length+1 ){\n if( i < s.length && s[i] == s[i-1] ){\n result++;\n i++;\n }else if( i == s.length && s[s.length-1] == s[0] )\n result++;\n\n i++;\n }\n\n if( s[0] == s[s.length-1] ){\n var tmpL = 1;\n while( tmpL < s.length && s[0] == s[tmpL] )\n tmpL++;\n var tmpR = 1;\n while( tmpR < s.length && s[0] == s[s.length-1-tmpR] )\n tmpR++;\n if( tmpL % 2 == 0 && tmpR % 2 == 1 )\n result--;\n }\n\n println(BigInteger(result.toString()).multiply(k));\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1038, "cpu_time_ms": 208, "memory_kb": 33796}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s737964302", "group_id": "codeNet:p02891", "input_text": "\nfun num(input: String) : Long {\n var i = 0L\n var r = 0L\n var prev = ' '\n input.forEach {\n if (prev != it) {\n r += i / 2\n i = 1\n } else {\n i++\n }\n prev = it\n }\n r += i / 2\n return r\n}\n\nfun main(args: Array) {\n val input = readLine()!!\n val k = readLine()!!.toLong()\n\n val one = num(input)\n val two = num(input.repeat(2))\n\n val allSame = input.all { it == input.first() }\n if (allSame) {\n println(input.length * k / 2)\n } else {\n println(two * (k / 2) + one * (k % 2))\n }\n}\n\n", "language": "Kotlin", "metadata": {"date": 1570325573, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s737964302.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s737964302", "user_id": "u895858420"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "\nfun num(input: String) : Long {\n var i = 0L\n var r = 0L\n var prev = ' '\n input.forEach {\n if (prev != it) {\n r += i / 2\n i = 1\n } else {\n i++\n }\n prev = it\n }\n r += i / 2\n return r\n}\n\nfun main(args: Array) {\n val input = readLine()!!\n val k = readLine()!!.toLong()\n\n val one = num(input)\n val two = num(input.repeat(2))\n\n val allSame = input.all { it == input.first() }\n if (allSame) {\n println(input.length * k / 2)\n } else {\n println(two * (k / 2) + one * (k % 2))\n }\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 602, "cpu_time_ms": 217, "memory_kb": 33784}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s427426571", "group_id": "codeNet:p02891", "input_text": "import java.math.BigInteger;\nimport kotlin.system.exitProcess;\n\nfun main(args: Array){\n val s = readLine()!!\n val k = BigInteger(readLine())\n\n if( s.length == 1 ){\n println(k.divide(BigInteger(\"2\")))\n exitProcess(0)\n }\n\n var result = 0;\n\n var i = 1;\n while( i < s.length+1 ){\n if( i < s.length && s[i] == s[i-1] ){\n result++;\n i++;\n }else if( i == s.length && s[s.length-1] == s[0] )\n result++;\n\n i++;\n }\n\n if( s[0] == s[s.length-1] ){\n var tmpL = 1;\n while( s[0] == s[tmpL] && tmpL < s.length )\n tmpL++;\n var tmpR = 1;\n while( s[0] == s[s.length-1-tmpR] && tmpR < s.length )\n tmpR++;\n if( tmpL % 2 == 0 && tmpR % 2 == 1 )\n result--;\n }\n\n println(BigInteger(result.toString()).multiply(k));\n}\n", "language": "Kotlin", "metadata": {"date": 1570325165, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s427426571.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s427426571", "user_id": "u657065743"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.math.BigInteger;\nimport kotlin.system.exitProcess;\n\nfun main(args: Array){\n val s = readLine()!!\n val k = BigInteger(readLine())\n\n if( s.length == 1 ){\n println(k.divide(BigInteger(\"2\")))\n exitProcess(0)\n }\n\n var result = 0;\n\n var i = 1;\n while( i < s.length+1 ){\n if( i < s.length && s[i] == s[i-1] ){\n result++;\n i++;\n }else if( i == s.length && s[s.length-1] == s[0] )\n result++;\n\n i++;\n }\n\n if( s[0] == s[s.length-1] ){\n var tmpL = 1;\n while( s[0] == s[tmpL] && tmpL < s.length )\n tmpL++;\n var tmpR = 1;\n while( s[0] == s[s.length-1-tmpR] && tmpR < s.length )\n tmpR++;\n if( tmpL % 2 == 0 && tmpR % 2 == 1 )\n result--;\n }\n\n println(BigInteger(result.toString()).multiply(k));\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 772, "cpu_time_ms": 207, "memory_kb": 31924}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s743591604", "group_id": "codeNet:p02891", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s = sc.next()\n val k = sc.nextLong()\n println(problemagc039(s, k))\n}\n\nfun problemagc039(s: String, k: Long): Long {\n val sa = s.toCharArray()\n var lastFrag = 0\n for (i in 0 until sa.size) {\n if (i == sa.size - 1) {\n if (sa[0] == sa[i]) {\n if (sa[i] != sa[i - 1]) {\n lastFrag = 1\n }\n sa[i] = 'x'\n }\n } else {\n if (i != 0 && sa[i] == sa[i + 1] && sa[i] != sa[i - 1]) {\n sa[i + 1] = 'x'\n }\n }\n }\n// debugLog(sa.toList())\n\n return sa.toList().count { it == 'x' }.toLong() * k - lastFrag\n}\n", "language": "Kotlin", "metadata": {"date": 1570325146, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s743591604.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s743591604", "user_id": "u073232808"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s = sc.next()\n val k = sc.nextLong()\n println(problemagc039(s, k))\n}\n\nfun problemagc039(s: String, k: Long): Long {\n val sa = s.toCharArray()\n var lastFrag = 0\n for (i in 0 until sa.size) {\n if (i == sa.size - 1) {\n if (sa[0] == sa[i]) {\n if (sa[i] != sa[i - 1]) {\n lastFrag = 1\n }\n sa[i] = 'x'\n }\n } else {\n if (i != 0 && sa[i] == sa[i + 1] && sa[i] != sa[i - 1]) {\n sa[i + 1] = 'x'\n }\n }\n }\n// debugLog(sa.toList())\n\n return sa.toList().count { it == 'x' }.toLong() * k - lastFrag\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 747, "cpu_time_ms": 219, "memory_kb": 34092}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s552197943", "group_id": "codeNet:p02891", "input_text": "fun main(args : Array) {\n val S = readLine()!!.toCharArray()\n val K = readLine()!!.toLong()\n\n\n var tailHeadSame = S.first() == S.last()\n var singleDups = 0L\n\n if (S.size == 1) {\n println(K /2)\n return\n }\n\n var prev = ' '\n var other = 0L\n for (i in 0 until S.size) {\n if (i == S.size - 1 && tailHeadSame && K != 1L) {\n other++\n } else if (S[i] == prev) {\n S[i] = 'X'\n singleDups++\n }\n prev = S[i]\n }\n\n println(\n singleDups * K + other * (K-1)\n )\n}", "language": "Kotlin", "metadata": {"date": 1570324875, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s552197943.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s552197943", "user_id": "u465133507"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(args : Array) {\n val S = readLine()!!.toCharArray()\n val K = readLine()!!.toLong()\n\n\n var tailHeadSame = S.first() == S.last()\n var singleDups = 0L\n\n if (S.size == 1) {\n println(K /2)\n return\n }\n\n var prev = ' '\n var other = 0L\n for (i in 0 until S.size) {\n if (i == S.size - 1 && tailHeadSame && K != 1L) {\n other++\n } else if (S[i] == prev) {\n S[i] = 'X'\n singleDups++\n }\n prev = S[i]\n }\n\n println(\n singleDups * K + other * (K-1)\n )\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 576, "cpu_time_ms": 227, "memory_kb": 32224}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s892021276", "group_id": "codeNet:p02891", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s = sc.next()\n val k = sc.nextLong()\n println(problemagc039(s, k))\n}\n\nfun problemagc039(s: String, k: Long): Long {\n val sa = s.toCharArray()\n var lastFrag = 0\n for (i in 0 until sa.size) {\n if (i == sa.size - 1) {\n if (sa[0] == sa[i]) {\n sa[i] = 'x'\n lastFrag = 1\n }\n } else {\n if (i != 0 && sa[i] == sa[i + 1] && sa[i] != sa[i - 1]) {\n sa[i + 1] = 'x'\n }\n }\n }\n// debugLog(sa.toList())\n\n return sa.toList().count { it == 'x' }.toLong() * k\n}", "language": "Kotlin", "metadata": {"date": 1570324870, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s892021276.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s892021276", "user_id": "u073232808"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s = sc.next()\n val k = sc.nextLong()\n println(problemagc039(s, k))\n}\n\nfun problemagc039(s: String, k: Long): Long {\n val sa = s.toCharArray()\n var lastFrag = 0\n for (i in 0 until sa.size) {\n if (i == sa.size - 1) {\n if (sa[0] == sa[i]) {\n sa[i] = 'x'\n lastFrag = 1\n }\n } else {\n if (i != 0 && sa[i] == sa[i + 1] && sa[i] != sa[i - 1]) {\n sa[i + 1] = 'x'\n }\n }\n }\n// debugLog(sa.toList())\n\n return sa.toList().count { it == 'x' }.toLong() * k\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 671, "cpu_time_ms": 211, "memory_kb": 35784}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s588012239", "group_id": "codeNet:p02891", "input_text": "import java.math.BigInteger;\nimport kotlin.system.exitProcess;\n\nfun main(args: Array){\n val s = readLine()!!\n val k = BigInteger(readLine())\n\n if( s.length == 1 ){\n println(k.divide(BigInteger(\"2\")))\n exitProcess(0)\n }\n\n var result = 0;\n\n var i = 1;\n while( i < s.length+1 ){\n if( i < s.length && s[i] == s[i-1] ){\n result++;\n i++;\n }else if( i == s.length && s[s.length-1] == s[0] )\n result++;\n\n i++;\n }\n\n println(BigInteger(result.toString()).multiply(k));\n}\n", "language": "Kotlin", "metadata": {"date": 1570324718, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02891.html", "problem_id": "p02891", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02891/input.txt", "sample_output_relpath": "derived/input_output/data/p02891/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02891/Kotlin/s588012239.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s588012239", "user_id": "u657065743"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "import java.math.BigInteger;\nimport kotlin.system.exitProcess;\n\nfun main(args: Array){\n val s = readLine()!!\n val k = BigInteger(readLine())\n\n if( s.length == 1 ){\n println(k.divide(BigInteger(\"2\")))\n exitProcess(0)\n }\n\n var result = 0;\n\n var i = 1;\n while( i < s.length+1 ){\n if( i < s.length && s[i] == s[i-1] ){\n result++;\n i++;\n }else if( i == s.length && s[s.length-1] == s[0] )\n result++;\n\n i++;\n }\n\n println(BigInteger(result.toString()).multiply(k));\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "sample_input": "issii\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02891", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S. Let T be the concatenation of K copies of S.\nWe can repeatedly perform the following operation: choose a character in T and replace it with a different character.\nFind the minimum number of operations required to satisfy the following condition: any two adjacent characters in T are different.\n\nConstraints\n\n1 \\leq |S| \\leq 100\n\nS consists of lowercase English letters.\n\n1 \\leq K \\leq 10^9\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\nissii\n2\n\nSample Output 1\n\n4\n\nT is issiiissii. For example, we can rewrite it into ispiqisyhi, and now any two adjacent characters are different.\n\nSample Input 2\n\nqq\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\ncooooooooonteeeeeeeeeest\n999993333\n\nSample Output 3\n\n8999939997", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 508, "cpu_time_ms": 213, "memory_kb": 31692}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s049144359", "group_id": "codeNet:p02912", "input_text": "import java.util.*\nimport kotlin.math.acos\nimport kotlin.math.cos\nimport kotlin.math.round\nimport kotlin.math.sin\n\nfun main(args: Array) {\n val (n, m) = readIntList()\n val a = readIntList()\n\n val pq = PriorityQueue(Collections.reverseOrder())\n pq.addAll(a)\n repeat(m) {\n val max = pq.poll()\n pq.add(max / 2)\n }\n var sum = 0L\n pq.forEach { sum += it }\n println(sum)\n}\n\n// read\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)", "language": "Kotlin", "metadata": {"date": 1599420685, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s049144359.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s049144359", "user_id": "u697467902"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*\nimport kotlin.math.acos\nimport kotlin.math.cos\nimport kotlin.math.round\nimport kotlin.math.sin\n\nfun main(args: Array) {\n val (n, m) = readIntList()\n val a = readIntList()\n\n val pq = PriorityQueue(Collections.reverseOrder())\n pq.addAll(a)\n repeat(m) {\n val max = pq.poll()\n pq.add(max / 2)\n }\n var sum = 0L\n pq.forEach { sum += it }\n println(sum)\n}\n\n// read\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 712, "cpu_time_ms": 371, "memory_kb": 58212}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s515548890", "group_id": "codeNet:p02912", "input_text": "import java.io.PrintWriter\nimport java.util.*\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun Iterable.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\nfun Array.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\n\nfun main() {\n val (N, M) = nextIntList()\n val A = PriorityQueue(compareByDescending { it })\n A.addAll(nextLongList())\n repeat(M) {\n A.add(A.poll() / 2)\n }\n println(A.sum())\n}", "language": "Kotlin", "metadata": {"date": 1593842686, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s515548890.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s515548890", "user_id": "u860789370"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun Iterable.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\nfun Array.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\n\nfun main() {\n val (N, M) = nextIntList()\n val A = PriorityQueue(compareByDescending { it })\n A.addAll(nextLongList())\n repeat(M) {\n A.add(A.poll() / 2)\n }\n println(A.sum())\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1055, "cpu_time_ms": 394, "memory_kb": 58504}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s674750943", "group_id": "codeNet:p02912", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map { it.toInt() }\n val a = readLine()!!.split(\" \").map { it.toLong() }.toMutableList()\n var total:Long = 0\n for (i in 0 until m){\n var maxim = a.indexOf(a.max())\n a[maxim] = a[maxim] / 2\n }\n for (i in 0 until n){\n total += a[i]\n }\n println(total)\n}\n", "language": "Kotlin", "metadata": {"date": 1587089710, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s674750943.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s674750943", "user_id": "u385678999"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map { it.toInt() }\n val a = readLine()!!.split(\" \").map { it.toLong() }.toMutableList()\n var total:Long = 0\n for (i in 0 until m){\n var maxim = a.indexOf(a.max())\n a[maxim] = a[maxim] / 2\n }\n for (i in 0 until n){\n total += a[i]\n }\n println(total)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 365, "cpu_time_ms": 2111, "memory_kb": 73552}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s897788563", "group_id": "codeNet:p02912", "input_text": "import java.util.*\n\nfun main(args: Array) = shojin06d()\n\nfun shojin06d() {\n val (n, m) = readLine()!!.split(' ').map { it.toInt() }\n val aList = readLine()!!.split(' ').map { it.toLong() }\n\n val queue =\n PriorityQueue(aList.size, Comparator { o1: Long, o2: Long -> if (o2 > o1) 1 else if (o2 == o1) 0 else -1 })\n queue.addAll(aList)\n\n repeat(m) {\n val poll = queue.poll()\n queue.add(poll / 2)\n }\n\n val answer = queue.sum()\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1586634482, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s897788563.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s897788563", "user_id": "u139478771"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) = shojin06d()\n\nfun shojin06d() {\n val (n, m) = readLine()!!.split(' ').map { it.toInt() }\n val aList = readLine()!!.split(' ').map { it.toLong() }\n\n val queue =\n PriorityQueue(aList.size, Comparator { o1: Long, o2: Long -> if (o2 > o1) 1 else if (o2 == o1) 0 else -1 })\n queue.addAll(aList)\n\n repeat(m) {\n val poll = queue.poll()\n queue.add(poll / 2)\n }\n\n val answer = queue.sum()\n\n println(answer)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 496, "cpu_time_ms": 580, "memory_kb": 72136}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s291292950", "group_id": "codeNet:p02912", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val (n, m) = readIntegerList()\n val alist = readLongList()\n val queue = PriorityQueue(alist.size) { a, b ->\n if (b - a > 0) {\n 1\n } else {\n 0\n }\n }\n for (i in alist) {\n queue.add(i)\n }\n\n repeat(m) {\n val max = queue.remove()\n queue.add(max / 2L)\n }\n println(queue.sum())\n}\n\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "language": "Kotlin", "metadata": {"date": 1583984784, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s291292950.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s291292950", "user_id": "u784448849"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val (n, m) = readIntegerList()\n val alist = readLongList()\n val queue = PriorityQueue(alist.size) { a, b ->\n if (b - a > 0) {\n 1\n } else {\n 0\n }\n }\n for (i in alist) {\n queue.add(i)\n }\n\n repeat(m) {\n val max = queue.remove()\n queue.add(max / 2L)\n }\n println(queue.sum())\n}\n\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 670, "cpu_time_ms": 608, "memory_kb": 74124}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s294845378", "group_id": "codeNet:p02912", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val (n, m) = readIntegerList()\n val alist = readIntegerList()\n val queue = PriorityQueue(alist.size) { a, b -> b - a }\n for (i in alist) {\n queue.add(i)\n }\n\n repeat(m) {\n val max = queue.remove()\n queue.add(max / 2)\n }\n println(queue.sum())\n}\n\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "language": "Kotlin", "metadata": {"date": 1583984609, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s294845378.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s294845378", "user_id": "u784448849"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val (n, m) = readIntegerList()\n val alist = readIntegerList()\n val queue = PriorityQueue(alist.size) { a, b -> b - a }\n for (i in alist) {\n queue.add(i)\n }\n\n repeat(m) {\n val max = queue.remove()\n queue.add(max / 2)\n }\n println(queue.sum())\n}\n\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 593, "cpu_time_ms": 619, "memory_kb": 74020}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s661259989", "group_id": "codeNet:p02912", "input_text": "import java.util.PriorityQueue\nimport kotlin.comparisons.compareByDescending\nfun main(args: Array) {\n var (N, M) = listOfInt()\n val A = listOfLong()\n val Q = PriorityQueue(N, compareByDescending { it })\n A.forEach { Q.add(it) }\n repeat (M) {\n val e = Q.poll()!!\n Q.add(e / 2)\n }\n var ans = 0L\n while (Q.size > 0) {\n ans += Q.poll()!!\n }\n println(ans)\n}\nfun next() = readLine()!!\nfun listOfString() = next().split(\" \")\nfun listOfInt(delta: Int = 0) = listOfString().map { Integer.parseInt(it) + delta }\nfun listOfLong(delta: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + delta }\n", "language": "Kotlin", "metadata": {"date": 1581626520, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s661259989.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s661259989", "user_id": "u043150661"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.PriorityQueue\nimport kotlin.comparisons.compareByDescending\nfun main(args: Array) {\n var (N, M) = listOfInt()\n val A = listOfLong()\n val Q = PriorityQueue(N, compareByDescending { it })\n A.forEach { Q.add(it) }\n repeat (M) {\n val e = Q.poll()!!\n Q.add(e / 2)\n }\n var ans = 0L\n while (Q.size > 0) {\n ans += Q.poll()!!\n }\n println(ans)\n}\nfun next() = readLine()!!\nfun listOfString() = next().split(\" \")\nfun listOfInt(delta: Int = 0) = listOfString().map { Integer.parseInt(it) + delta }\nfun listOfLong(delta: Long = 0L) = listOfString().map { java.lang.Long.parseLong(it) + delta }\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 662, "cpu_time_ms": 672, "memory_kb": 71888}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s665746240", "group_id": "codeNet:p02912", "input_text": "import java.util.*\n\n\nfun calc141D(N: Int, M: Int, A: List): Int {\n val queue= PriorityQueue(A.map { -it })\n\n for (i in 1..M){\n val m = queue.poll()\n queue.add(m/2)\n }\n return -queue.sum()\n}\n\n\nfun main(args: Array) {\n val (N, M) = readLine()!!.split(\" \").map { it.toInt() }\n val A = readLine()!!.split(\" \").map { it.toInt() }\n val ans = calc141D(N, M, A)\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1571199071, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s665746240.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s665746240", "user_id": "u846520687"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*\n\n\nfun calc141D(N: Int, M: Int, A: List): Int {\n val queue= PriorityQueue(A.map { -it })\n\n for (i in 1..M){\n val m = queue.poll()\n queue.add(m/2)\n }\n return -queue.sum()\n}\n\n\nfun main(args: Array) {\n val (N, M) = readLine()!!.split(\" \").map { it.toInt() }\n val A = readLine()!!.split(\" \").map { it.toInt() }\n val ans = calc141D(N, M, A)\n println(ans)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 421, "cpu_time_ms": 635, "memory_kb": 72064}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s465940241", "group_id": "codeNet:p02912", "input_text": "import java.util.PriorityQueue\nimport java.util.Collections\n\nfun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map(String::toInt)\n val a = PriorityQueue(n, Collections.reverseOrder()).apply {\n readLine()!!.split(\" \").forEach { add(it.toLong()) }\n }\n\n repeat(m) {\n a.run { add(poll() / 2) }\n }\n\n println(a.toList().sum())\n}", "language": "Kotlin", "metadata": {"date": 1569519069, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s465940241.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s465940241", "user_id": "u379804877"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.PriorityQueue\nimport java.util.Collections\n\nfun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map(String::toInt)\n val a = PriorityQueue(n, Collections.reverseOrder()).apply {\n readLine()!!.split(\" \").forEach { add(it.toLong()) }\n }\n\n repeat(m) {\n a.run { add(poll() / 2) }\n }\n\n println(a.toList().sum())\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 380, "cpu_time_ms": 620, "memory_kb": 71776}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s641953653", "group_id": "codeNet:p02912", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map { it.toLong() }\n val a = readLine()!!.split(\" \").map { -it.toLong()}\n\n var q = PriorityQueue(a)\n for (i in 0 until m){\n q.add(q.poll()/2)\n }\n println(-q.sum())\n}\n\n", "language": "Kotlin", "metadata": {"date": 1568752335, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s641953653.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s641953653", "user_id": "u520434261"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map { it.toLong() }\n val a = readLine()!!.split(\" \").map { -it.toLong()}\n\n var q = PriorityQueue(a)\n for (i in 0 until m){\n q.add(q.poll()/2)\n }\n println(-q.sum())\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 282, "cpu_time_ms": 602, "memory_kb": 69940}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s673403221", "group_id": "codeNet:p02912", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = java.util.Scanner(System.`in`)\n val n = sc.nextInt()\n val m = sc.nextInt()\n\n val pq: PriorityQueue = PriorityQueue(n, Collections.reverseOrder())\n sc.asSequence().take(n).map(String::toLong).toCollection(pq)\n\n (1..m).asSequence().forEach {\n val x = pq.poll()\n pq.add(x / 2)\n }\n println(pq.asSequence().sum())\n}\n", "language": "Kotlin", "metadata": {"date": 1568693151, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s673403221.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s673403221", "user_id": "u059223549"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = java.util.Scanner(System.`in`)\n val n = sc.nextInt()\n val m = sc.nextInt()\n\n val pq: PriorityQueue = PriorityQueue(n, Collections.reverseOrder())\n sc.asSequence().take(n).map(String::toLong).toCollection(pq)\n\n (1..m).asSequence().forEach {\n val x = pq.poll()\n pq.add(x / 2)\n }\n println(pq.asSequence().sum())\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 417, "cpu_time_ms": 766, "memory_kb": 54920}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s807437705", "group_id": "codeNet:p02912", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map(String::toInt)\n val array = readLine()!!.split(' ').map(String::toLong).sorted().toMutableList()\n repeat(m) {\n val num = array.last() / 2\n if (n >= 2 && array[n-2] <= num) {\n array[n-1] = num\n } else {\n array.removeAt(n - 1)\n var idx = array.binarySearch(num)\n if (idx < 0) idx = idx.inv()\n array.add(idx, num)\n }\n }\n println(array.sum())\n}\n", "language": "Kotlin", "metadata": {"date": 1568601268, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s807437705.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s807437705", "user_id": "u572745161"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map(String::toInt)\n val array = readLine()!!.split(' ').map(String::toLong).sorted().toMutableList()\n repeat(m) {\n val num = array.last() / 2\n if (n >= 2 && array[n-2] <= num) {\n array[n-1] = num\n } else {\n array.removeAt(n - 1)\n var idx = array.binarySearch(num)\n if (idx < 0) idx = idx.inv()\n array.add(idx, num)\n }\n }\n println(array.sum())\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 513, "cpu_time_ms": 2111, "memory_kb": 70412}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s147972708", "group_id": "codeNet:p02912", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map(String::toInt)\n val aList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n val origin = aList.toIntArray().copyOf()\n val count = Array(n) {0}\n for (i in 0 until m) {\n val maxIndex = aList.indices.maxBy { aList[it] } ?: -1\n aList[maxIndex] /= 2\n count[maxIndex]++\n }\n// println(origin.joinToString(\" \"))\n val xxx = origin.mapIndexed { index, i -> i / Math.pow(2.0, count[index].toDouble()).toInt() }\n\n println(xxx.map { it.toDouble() }.sum())\n}", "language": "Kotlin", "metadata": {"date": 1568599263, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s147972708.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s147972708", "user_id": "u634493908"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map(String::toInt)\n val aList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n val origin = aList.toIntArray().copyOf()\n val count = Array(n) {0}\n for (i in 0 until m) {\n val maxIndex = aList.indices.maxBy { aList[it] } ?: -1\n aList[maxIndex] /= 2\n count[maxIndex]++\n }\n// println(origin.joinToString(\" \"))\n val xxx = origin.mapIndexed { index, i -> i / Math.pow(2.0, count[index].toDouble()).toInt() }\n\n println(xxx.map { it.toDouble() }.sum())\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 578, "cpu_time_ms": 2111, "memory_kb": 141712}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s575753298", "group_id": "codeNet:p02912", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map(String::toInt)\n val aList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n val origin = aList.toIntArray().copyOf()\n val count = Array(n) {0}\n for (i in 0 until m) {\n val maxIndex = aList.indices.maxBy { aList[it] } ?: -1\n aList[maxIndex] /= 2\n count[maxIndex]++\n }\n// println(origin.joinToString(\" \"))\n val xxx = origin.mapIndexed { index, i -> i / Math.pow(2.0, count[index].toDouble()) }\n\n println(xxx.sum())\n}", "language": "Kotlin", "metadata": {"date": 1568599074, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s575753298.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s575753298", "user_id": "u634493908"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map(String::toInt)\n val aList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n val origin = aList.toIntArray().copyOf()\n val count = Array(n) {0}\n for (i in 0 until m) {\n val maxIndex = aList.indices.maxBy { aList[it] } ?: -1\n aList[maxIndex] /= 2\n count[maxIndex]++\n }\n// println(origin.joinToString(\" \"))\n val xxx = origin.mapIndexed { index, i -> i / Math.pow(2.0, count[index].toDouble()) }\n\n println(xxx.sum())\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 548, "cpu_time_ms": 2111, "memory_kb": 138216}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s419241441", "group_id": "codeNet:p02912", "input_text": "// Max Heap\nclass Heap> {\n private var heap: MutableList = mutableListOf()\n val size: Int\n get() = this.heap.size\n\n fun push(elem: T) {\n var i = heap.size // My node index\n heap.add(elem) // Add element as last child\n\n while (i > 0) {\n val p = (i - 1) / 2 // My parent node\n if (heap[p] >= elem) break // There is no reversal\n\n // Move parent to child\n heap[i] = heap[p]\n i = p\n }\n heap[i] = elem\n }\n\n fun pop(): T? {\n if (heap.size == 0) return null\n\n val ret = heap[0] // Maximum\n val x = heap.last() // Move last child to root\n heap.removeAt(heap.lastIndex)\n\n if(heap.size == 0) return ret\n\n var i = 0\n while (i * 2 + 1 < heap.size) {\n var a = i * 2 + 1 // Left child\n val b = i * 2 + 2 // Right child if exists\n\n if (b < heap.size && heap[b] > heap[a]) a = b // Move bigger to left\n\n if (heap[a] <= x) break // There is no reversal\n\n // Move child to parent\n heap[i] = heap[a]\n i = a\n }\n heap[i] = x\n\n return ret\n }\n}\n\nfun main(args: Array){\n val(n, m) = readLine()!!.split(' ').map { it.toInt() }\n val items = Heap()\n readLine()!!.split(' ').map { items.push(it.toInt()) }\n\n repeat(m){\n items.push(Math.floor(items.pop()!! / 2.0).toInt())\n }\n\n var ans: Long = 0\n repeat(items.size){\n ans += items.pop()!!\n }\n\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1568598889, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s419241441.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s419241441", "user_id": "u923488187"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "// Max Heap\nclass Heap> {\n private var heap: MutableList = mutableListOf()\n val size: Int\n get() = this.heap.size\n\n fun push(elem: T) {\n var i = heap.size // My node index\n heap.add(elem) // Add element as last child\n\n while (i > 0) {\n val p = (i - 1) / 2 // My parent node\n if (heap[p] >= elem) break // There is no reversal\n\n // Move parent to child\n heap[i] = heap[p]\n i = p\n }\n heap[i] = elem\n }\n\n fun pop(): T? {\n if (heap.size == 0) return null\n\n val ret = heap[0] // Maximum\n val x = heap.last() // Move last child to root\n heap.removeAt(heap.lastIndex)\n\n if(heap.size == 0) return ret\n\n var i = 0\n while (i * 2 + 1 < heap.size) {\n var a = i * 2 + 1 // Left child\n val b = i * 2 + 2 // Right child if exists\n\n if (b < heap.size && heap[b] > heap[a]) a = b // Move bigger to left\n\n if (heap[a] <= x) break // There is no reversal\n\n // Move child to parent\n heap[i] = heap[a]\n i = a\n }\n heap[i] = x\n\n return ret\n }\n}\n\nfun main(args: Array){\n val(n, m) = readLine()!!.split(' ').map { it.toInt() }\n val items = Heap()\n readLine()!!.split(' ').map { items.push(it.toInt()) }\n\n repeat(m){\n items.push(Math.floor(items.pop()!! / 2.0).toInt())\n }\n\n var ans: Long = 0\n repeat(items.size){\n ans += items.pop()!!\n }\n\n println(ans)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1584, "cpu_time_ms": 669, "memory_kb": 71732}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s993614592", "group_id": "codeNet:p02912", "input_text": "import java.util.*\nimport kotlin.comparisons.compareBy\n\nfun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map(String::toInt)\n var array = readLine()!!.split(' ').map(String::toLong).sorted().toMutableList()\n repeat(m) {\n val num = array.last() / 2\n array.removeAt(array.count() - 1)\n var idx = array.binarySearch(num, compareBy { it >= num })\n if (idx < 0) idx = 0\n array.add(idx, num)\n }\n println(array.sum())\n}\n", "language": "Kotlin", "metadata": {"date": 1568598637, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s993614592.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s993614592", "user_id": "u572745161"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.util.*\nimport kotlin.comparisons.compareBy\n\nfun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map(String::toInt)\n var array = readLine()!!.split(' ').map(String::toLong).sorted().toMutableList()\n repeat(m) {\n val num = array.last() / 2\n array.removeAt(array.count() - 1)\n var idx = array.binarySearch(num, compareBy { it >= num })\n if (idx < 0) idx = 0\n array.add(idx, num)\n }\n println(array.sum())\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 483, "cpu_time_ms": 1506, "memory_kb": 74056}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s841116616", "group_id": "codeNet:p02912", "input_text": "import java.math.BigInteger\n\nfun main(args: Array){\n var input = readLine()!!.split(\" \")\n val N = input[0].toInt()\n val M = input[1].toInt()\n input = readLine()!!.split(\" \")\n val A = Array(N){ input[it].toInt() }\n A.sortBy{ -it }\n\n var i = 0\n for( m in 1..M ){\n A[i] /= 2\n if( i == N-1 )\n i = 0\n else if( A[i] < A[i+1] )\n i++\n if( A[i] <= A[0] )\n i = 0\n }\n\n var all = BigInteger.ZERO\n for( a in A )\n all = all.plus(BigInteger(a.toString()))\n println(all)\n}\n", "language": "Kotlin", "metadata": {"date": 1568598330, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s841116616.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s841116616", "user_id": "u657065743"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "import java.math.BigInteger\n\nfun main(args: Array){\n var input = readLine()!!.split(\" \")\n val N = input[0].toInt()\n val M = input[1].toInt()\n input = readLine()!!.split(\" \")\n val A = Array(N){ input[it].toInt() }\n A.sortBy{ -it }\n\n var i = 0\n for( m in 1..M ){\n A[i] /= 2\n if( i == N-1 )\n i = 0\n else if( A[i] < A[i+1] )\n i++\n if( A[i] <= A[0] )\n i = 0\n }\n\n var all = BigInteger.ZERO\n for( a in A )\n all = all.plus(BigInteger(a.toString()))\n println(all)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 507, "cpu_time_ms": 1054, "memory_kb": 85932}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s545402234", "group_id": "codeNet:p02912", "input_text": "fun main(args: Array) {\n var tmp = readLine()!!.split(\" \").map { it.toInt() }\n val n = tmp[0]\n val m = tmp[1]\n var tmp1 = readLine()!!.split(\" \").map { it.toLong() }\n var a = arrayListOf()\n for (i in 0 until n){\n a.add(tmp1[i])\n }\n for (i in 0 until m){\n a.sort()\n a.reverse()\n a[0] = a[0]/2\n }\n println(a.sum())\n}", "language": "Kotlin", "metadata": {"date": 1568598086, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02912.html", "problem_id": "p02912", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02912/input.txt", "sample_output_relpath": "derived/input_output/data/p02912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02912/Kotlin/s545402234.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s545402234", "user_id": "u520434261"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "fun main(args: Array) {\n var tmp = readLine()!!.split(\" \").map { it.toInt() }\n val n = tmp[0]\n val m = tmp[1]\n var tmp1 = readLine()!!.split(\" \").map { it.toLong() }\n var a = arrayListOf()\n for (i in 0 until n){\n a.add(tmp1[i])\n }\n for (i in 0 until m){\n a.sort()\n a.reverse()\n a[0] = a[0]/2\n }\n println(a.sum())\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "sample_input": "3 3\n2 13 8\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02912", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi is going to buy N items one by one.\n\nThe price of the i-th item he buys is A_i yen (the currency of Japan).\n\nHe has M discount tickets, and he can use any number of them when buying an item.\n\nIf Y tickets are used when buying an item priced X yen, he can get the item for \\frac{X}{2^Y} (rounded down to the nearest integer) yen.\n\nWhat is the minimum amount of money required to buy all the items?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum amount of money required to buy all the items.\n\nSample Input 1\n\n3 3\n2 13 8\n\nSample Output 1\n\n9\n\nWe can buy all the items for 9 yen, as follows:\n\nBuy the 1-st item for 2 yen without tickets.\n\nBuy the 2-nd item for 3 yen with 2 tickets.\n\nBuy the 3-rd item for 4 yen with 1 ticket.\n\nSample Input 2\n\n4 4\n1 9 3 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1 100000\n1000000000\n\nSample Output 3\n\n0\n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\nSample Input 4\n\n10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 4\n\n9500000000", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 386, "cpu_time_ms": 2111, "memory_kb": 138120}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s907806742", "group_id": "codeNet:p02913", "input_text": "import java.io.*\nimport java.lang.*\nimport java.math.*\nimport java.util.*\n\n// Constant\n\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 9223372036854775807L\n\n// Main\n\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\n// Global\n\nfun solve() {\n val n = nextLong()\n val s = next()\n\n var ans = 0L\n for (i in 0 until n) {\n val t = s.substring(i.toInt())\n val lcp = zAlgo(t)\n\n for (j in 0 until t.len) {\n val len = min(lcp[j], j)\n ans = max(ans, len)\n }\n }\n\n println(ans)\n\n}\n\nfun zAlgo(s: String): LongArray {\n val n = s.len\n val res = longAry(n)\n var i = 1L\n var j = 0L\n while(i < n) {\n while (i + j < n && s[j] == s[i + j]) j++\n res[i] = j\n if(j == 0L) {\n i++\n continue\n }\n var k = 1L\n while (i + k < n && k + res[k] < j) {\n res[i + k] = res[k]\n k++\n }\n i += k\n j -= k\n }\n\n return res\n}\n\n\n\n// Rule\n\noperator fun String.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.set(index: Long, value: Char) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun IntArray.get(index: Long): Int {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun IntArray.set(index: Long, value: Int) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun LongArray.get(index: Long): Long {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun LongArray.set(index: Long, value: Long) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun DoubleArray.get(index: Long): Double {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun DoubleArray.set(index: Long, value: Double) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun Array.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun Array.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun MutableList.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun MutableList.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\n\nval LongArray.siz: Long\n get() = size.toLong()\nval Array.siz: Long\n get() = size.toLong()\nval MutableList.siz: Long\n get() = size.toLong()\nval MutableSet.siz: Long\n get() = size.toLong()\nval String.len: Long\n get() = length.toLong()\n\n// Output\n\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\n\nfun next() = sc.next()\nfun nextLong() = sc.nextLong()\nfun nextLongs() = readLine()!!.split(\" \").map { it.toLong() }\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Long): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextLongAry(n: Long): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Long): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\n\nfun ary(n: Long, init: String = \"\") = Array(n.toInt()) { init }\nfun longAry(n: Long, init: Long = 0L) = LongArray(n.toInt()) { init }\nfun doubleAry(n: Long, init: Double = 0.0) = DoubleArray(n.toInt()) { init }\nfun boolAry(n: Long, init: Boolean = false) = Array(n.toInt()) { init }\nfun nodeAry(n: Long) = Array(n.toInt()) { Node(it.toLong()) }\nfun ary2(n: Long, m: Long, init: String = \"\") = Array(n.toInt()) { ary(m, init) }\nfun longAry2(n: Long, m: Long, init: Long = 0) = Array(n.toInt()) { longAry(m, init) }\nfun doubleAry2(n: Long, m: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry(m, init) }\nfun boolAry2(n: Long, m: Long, init: Boolean = false) = Array(n.toInt()) { boolAry(m, init) }\nfun ary3(n: Long, m: Long, k: Long, init: String = \"\") = Array(n.toInt()) { ary2(m, k, init) }\nfun longAry3(n: Long, m: Long, k: Long, init: Long = 0L) = Array(n.toInt()) { longAry2(m, k, init) }\nfun doubleAry3(n: Long, m: Long, k: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry2(m, k, init) }\nfun boolAry3(n: Long, m: Long, k: Long, init: Boolean = false) = Array(n.toInt()) { boolAry2(m, k, init) }\nfun list() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\n\nval addFunc = {a: Long, b: Long -> a + b}\nval mulFunc = {a: Long, b: Long -> a * b}\nval maxFunc = {a: Long, b: Long -> max(a, b)}\nval minFunc = {a: Long, b: Long -> min(a, b)}\nval gcdFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\n\nfun LongArray.lowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1L)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Long) {\n repeat(n.toInt()) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Long) {\n repeat(n.toInt()) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\n\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Long) = if (values.isEmpty()) -INF else values.max()!!\nfun min(vararg values: Long) = if (values.isEmpty()) INF else values.min()!!\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun erathos(n: Long): LongArray {\n val res = LongArray(n.toInt() + 1) { it.toLong() }\n for (i in 2..n) {\n if(i * i > n) break\n for (j in i * i..n step i) {\n if(res[j] == j) res[j] = i\n }\n }\n res[0] = -1L\n res[1] = -1L\n return res\n}\nfun modAdd(a: Long, b: Long) = if(a + b >= MOD) a + b - MOD else a + b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Long) {\n private val fac = longAry(max)\n private val finv = longAry(max)\n private val inv = longAry(max)\n private val p = MOD\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Long, r: Long): Long = if (n < r || (n < 0 || r < 0)) 0L else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Long, private var searched: Long = 0L, private var nextIndex: Long = 0L) {\n private val size = fact(n)\n private val permList = longAry2(size, n)\n\n private tailrec fun fact(n: Long, ans: Long = 1L): Long {\n return if (n == 0L) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, longAry(n), boolAry(n))\n }\n\n private fun create(num: Long, list: LongArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): LongArray = permList[nextIndex++]\n}\n\n// Graph\n\ndata class Node(val id: Long, var past: Long = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Long, val to: Long, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Long, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Long): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size.toLong(), -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Long): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size.toLong(), INF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\nclass GridGraph(\n private val h: Long,\n private val w: Long,\n val nodes: Array = Array((h * w).toInt()) { Node(it.toLong()) },\n private val edges: IntArray = IntArray((h * w).toInt()) { 0 }\n) {\n private val up = 1\n private val right = 2\n private val down = 4\n private val left = 8\n private val queue: ArrayDeque = ArrayDeque()\n private val startPos = longList()\n\n private fun pos(y: Long, x: Long) = y * w + x\n fun canUp(v: Long) = (edges[v] and 1) == 1\n fun canRight(v: Long) = ((edges[v] shr 1) and 1) == 1\n fun canDown(v: Long) = ((edges[v] shr 2) and 1) == 1\n fun canLeft(v: Long) = ((edges[v] shr 3) and 1) == 1\n\n fun init(s: Array, check: Char = '.', road: Char = '.', start: Char = 'S') {\n for (i in 0 until h) {\n for (j in 0 until w) {\n if(s[i][j] != check && s[i][j] != start) continue\n if(i > 0 && s[i - 1][j] == road) edges[pos(i, j)] += up\n if(i < h - 1 && s[i + 1][j] == road) edges[pos(i, j)] += down\n if(j > 0 && s[i][j - 1] == road) edges[pos(i, j)] += left\n if(j < w - 1 && s[i][j + 1] == road) edges[pos(i, j)] += right\n if(s[i][j] == start) {\n queue.add(pos(i, j))\n startPos.add(pos(i, j))\n }\n }\n }\n }\n fun addStart(y: Long, x: Long) {\n startPos.add(pos(y, x))\n queue.add(pos(y, x))\n }\n\n fun bfs(): LongArray {\n val dist = longAry(h * w, -1L)\n for (i in startPos) {\n dist[i] = 0L\n }\n while (queue.isNotEmpty()) {\n val v = queue.poll()\n if(canUp(v) && dist[v - w] == -1L) {\n queue.add(v - w)\n dist[v - w] = dist[v] + 1L\n }\n if(canDown(v) && dist[v + w] == -1L) {\n queue.add(v + w)\n dist[v + w] = dist[v] + 1L\n }\n if(canLeft(v) && dist[v - 1] == -1L) {\n queue.add(v - 1)\n dist[v - 1] = dist[v] + 1L\n }\n if(canRight(v) && dist[v + 1] == -1L) {\n queue.add(v + 1)\n dist[v + 1] = dist[v] + 1L\n }\n }\n return dist\n }\n\n}\n\n// Data Structure\n\nclass UnionFind(size: Long) {\n private val par = LongArray(size.toInt()) { it.toLong() }\n private val size = longAry(size, 1L)\n private val diffWeight = longAry(size, 0L)\n fun root(x: Long): Long {\n return if (par[x] == x) {\n x\n } else {\n val r = root(par[x])\n diffWeight[x] += diffWeight[par[x]]\n par[x] = r\n par[x]\n }\n }\n fun weight(x: Long): Long {\n root(x)\n return diffWeight[x]\n }\n fun diff(x: Long, y: Long) = abs(weight(y) - weight(x))\n\n fun same(x: Long, y: Long): Boolean = root(x) == root(y)\n fun unite(x: Long, y: Long, d: Long) {\n var w = d\n w += weight(x)\n w -= weight(y)\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n w = -w\n }\n size[a] += size[b]\n par[b] = a\n diffWeight[b] = w\n }\n\n fun size(x: Long): Long = size[root(x)]\n}\n\nclass SegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2L * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Long, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Long, b: Long) = getSub(a, b, 0L, 0L, n.toLong())\n private fun getSub(a: Long, b: Long, k: Long, l: Long, r: Long): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\n\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n buflen > 0\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n// \"The world doesn't need you.\"\n//\n// fun nextInt(): Int {\n// val nl = nextLong()\n// if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n// return nl.toInt()\n// }\n}\n", "language": "Kotlin", "metadata": {"date": 1590750322, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Kotlin/s907806742.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s907806742", "user_id": "u581625805"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.*\nimport java.lang.*\nimport java.math.*\nimport java.util.*\n\n// Constant\n\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 9223372036854775807L\n\n// Main\n\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\n// Global\n\nfun solve() {\n val n = nextLong()\n val s = next()\n\n var ans = 0L\n for (i in 0 until n) {\n val t = s.substring(i.toInt())\n val lcp = zAlgo(t)\n\n for (j in 0 until t.len) {\n val len = min(lcp[j], j)\n ans = max(ans, len)\n }\n }\n\n println(ans)\n\n}\n\nfun zAlgo(s: String): LongArray {\n val n = s.len\n val res = longAry(n)\n var i = 1L\n var j = 0L\n while(i < n) {\n while (i + j < n && s[j] == s[i + j]) j++\n res[i] = j\n if(j == 0L) {\n i++\n continue\n }\n var k = 1L\n while (i + k < n && k + res[k] < j) {\n res[i + k] = res[k]\n k++\n }\n i += k\n j -= k\n }\n\n return res\n}\n\n\n\n// Rule\n\noperator fun String.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.set(index: Long, value: Char) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun IntArray.get(index: Long): Int {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun IntArray.set(index: Long, value: Int) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun LongArray.get(index: Long): Long {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun LongArray.set(index: Long, value: Long) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun DoubleArray.get(index: Long): Double {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun DoubleArray.set(index: Long, value: Double) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun Array.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun Array.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun MutableList.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun MutableList.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\n\nval LongArray.siz: Long\n get() = size.toLong()\nval Array.siz: Long\n get() = size.toLong()\nval MutableList.siz: Long\n get() = size.toLong()\nval MutableSet.siz: Long\n get() = size.toLong()\nval String.len: Long\n get() = length.toLong()\n\n// Output\n\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\n\nfun next() = sc.next()\nfun nextLong() = sc.nextLong()\nfun nextLongs() = readLine()!!.split(\" \").map { it.toLong() }\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Long): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextLongAry(n: Long): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Long): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\n\nfun ary(n: Long, init: String = \"\") = Array(n.toInt()) { init }\nfun longAry(n: Long, init: Long = 0L) = LongArray(n.toInt()) { init }\nfun doubleAry(n: Long, init: Double = 0.0) = DoubleArray(n.toInt()) { init }\nfun boolAry(n: Long, init: Boolean = false) = Array(n.toInt()) { init }\nfun nodeAry(n: Long) = Array(n.toInt()) { Node(it.toLong()) }\nfun ary2(n: Long, m: Long, init: String = \"\") = Array(n.toInt()) { ary(m, init) }\nfun longAry2(n: Long, m: Long, init: Long = 0) = Array(n.toInt()) { longAry(m, init) }\nfun doubleAry2(n: Long, m: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry(m, init) }\nfun boolAry2(n: Long, m: Long, init: Boolean = false) = Array(n.toInt()) { boolAry(m, init) }\nfun ary3(n: Long, m: Long, k: Long, init: String = \"\") = Array(n.toInt()) { ary2(m, k, init) }\nfun longAry3(n: Long, m: Long, k: Long, init: Long = 0L) = Array(n.toInt()) { longAry2(m, k, init) }\nfun doubleAry3(n: Long, m: Long, k: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry2(m, k, init) }\nfun boolAry3(n: Long, m: Long, k: Long, init: Boolean = false) = Array(n.toInt()) { boolAry2(m, k, init) }\nfun list() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\n\nval addFunc = {a: Long, b: Long -> a + b}\nval mulFunc = {a: Long, b: Long -> a * b}\nval maxFunc = {a: Long, b: Long -> max(a, b)}\nval minFunc = {a: Long, b: Long -> min(a, b)}\nval gcdFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\n\nfun LongArray.lowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1L)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Long) {\n repeat(n.toInt()) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Long) {\n repeat(n.toInt()) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\n\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Long) = if (values.isEmpty()) -INF else values.max()!!\nfun min(vararg values: Long) = if (values.isEmpty()) INF else values.min()!!\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun erathos(n: Long): LongArray {\n val res = LongArray(n.toInt() + 1) { it.toLong() }\n for (i in 2..n) {\n if(i * i > n) break\n for (j in i * i..n step i) {\n if(res[j] == j) res[j] = i\n }\n }\n res[0] = -1L\n res[1] = -1L\n return res\n}\nfun modAdd(a: Long, b: Long) = if(a + b >= MOD) a + b - MOD else a + b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Long) {\n private val fac = longAry(max)\n private val finv = longAry(max)\n private val inv = longAry(max)\n private val p = MOD\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Long, r: Long): Long = if (n < r || (n < 0 || r < 0)) 0L else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Long, private var searched: Long = 0L, private var nextIndex: Long = 0L) {\n private val size = fact(n)\n private val permList = longAry2(size, n)\n\n private tailrec fun fact(n: Long, ans: Long = 1L): Long {\n return if (n == 0L) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, longAry(n), boolAry(n))\n }\n\n private fun create(num: Long, list: LongArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): LongArray = permList[nextIndex++]\n}\n\n// Graph\n\ndata class Node(val id: Long, var past: Long = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Long, val to: Long, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Long, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Long): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size.toLong(), -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Long): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size.toLong(), INF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\nclass GridGraph(\n private val h: Long,\n private val w: Long,\n val nodes: Array = Array((h * w).toInt()) { Node(it.toLong()) },\n private val edges: IntArray = IntArray((h * w).toInt()) { 0 }\n) {\n private val up = 1\n private val right = 2\n private val down = 4\n private val left = 8\n private val queue: ArrayDeque = ArrayDeque()\n private val startPos = longList()\n\n private fun pos(y: Long, x: Long) = y * w + x\n fun canUp(v: Long) = (edges[v] and 1) == 1\n fun canRight(v: Long) = ((edges[v] shr 1) and 1) == 1\n fun canDown(v: Long) = ((edges[v] shr 2) and 1) == 1\n fun canLeft(v: Long) = ((edges[v] shr 3) and 1) == 1\n\n fun init(s: Array, check: Char = '.', road: Char = '.', start: Char = 'S') {\n for (i in 0 until h) {\n for (j in 0 until w) {\n if(s[i][j] != check && s[i][j] != start) continue\n if(i > 0 && s[i - 1][j] == road) edges[pos(i, j)] += up\n if(i < h - 1 && s[i + 1][j] == road) edges[pos(i, j)] += down\n if(j > 0 && s[i][j - 1] == road) edges[pos(i, j)] += left\n if(j < w - 1 && s[i][j + 1] == road) edges[pos(i, j)] += right\n if(s[i][j] == start) {\n queue.add(pos(i, j))\n startPos.add(pos(i, j))\n }\n }\n }\n }\n fun addStart(y: Long, x: Long) {\n startPos.add(pos(y, x))\n queue.add(pos(y, x))\n }\n\n fun bfs(): LongArray {\n val dist = longAry(h * w, -1L)\n for (i in startPos) {\n dist[i] = 0L\n }\n while (queue.isNotEmpty()) {\n val v = queue.poll()\n if(canUp(v) && dist[v - w] == -1L) {\n queue.add(v - w)\n dist[v - w] = dist[v] + 1L\n }\n if(canDown(v) && dist[v + w] == -1L) {\n queue.add(v + w)\n dist[v + w] = dist[v] + 1L\n }\n if(canLeft(v) && dist[v - 1] == -1L) {\n queue.add(v - 1)\n dist[v - 1] = dist[v] + 1L\n }\n if(canRight(v) && dist[v + 1] == -1L) {\n queue.add(v + 1)\n dist[v + 1] = dist[v] + 1L\n }\n }\n return dist\n }\n\n}\n\n// Data Structure\n\nclass UnionFind(size: Long) {\n private val par = LongArray(size.toInt()) { it.toLong() }\n private val size = longAry(size, 1L)\n private val diffWeight = longAry(size, 0L)\n fun root(x: Long): Long {\n return if (par[x] == x) {\n x\n } else {\n val r = root(par[x])\n diffWeight[x] += diffWeight[par[x]]\n par[x] = r\n par[x]\n }\n }\n fun weight(x: Long): Long {\n root(x)\n return diffWeight[x]\n }\n fun diff(x: Long, y: Long) = abs(weight(y) - weight(x))\n\n fun same(x: Long, y: Long): Boolean = root(x) == root(y)\n fun unite(x: Long, y: Long, d: Long) {\n var w = d\n w += weight(x)\n w -= weight(y)\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n w = -w\n }\n size[a] += size[b]\n par[b] = a\n diffWeight[b] = w\n }\n\n fun size(x: Long): Long = size[root(x)]\n}\n\nclass SegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2L * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Long, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Long, b: Long) = getSub(a, b, 0L, 0L, n.toLong())\n private fun getSub(a: Long, b: Long, k: Long, l: Long, r: Long): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\n\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n buflen > 0\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n// \"The world doesn't need you.\"\n//\n// fun nextInt(): Int {\n// val nl = nextLong()\n// if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n// return nl.toInt()\n// }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 18346, "cpu_time_ms": 499, "memory_kb": 70052}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s243225232", "group_id": "codeNet:p02913", "input_text": "fun main(args: Array) {\n val N = readInt()\n val S = readString()\n\n val dp = Array(N + 1) { Array(N + 1) { 0 } }\n for (i in N - 1 downTo 0) {\n for (j in i downTo 0) {\n if (S[i] == S[j]) {\n dp[i][j] = dp[i + 1][j + 1] + 1\n }\n }\n }\n\n var result = 0\n for (i in 0 until N) {\n for (j in i until N) {\n result = Math.max(result, Math.min(dp[i][j], j - i))\n }\n }\n println(result)\n}\n\nfun gcd(a: Int, b: Int): Int = if (a < b) gcd(b, a) else if (b == 0) a else gcd(b, a % b)\nfun gcd(a: Long, b: Long): Long = if (a < b) gcd(b, a) else if (b == 0L) a else gcd(b, a % b)\nfun lcm(a: Int, b: Int): Int = (a * b) / gcd(a, b)\nfun lcm(a: Long, b: Long): Long = (a * b) / gcd(a, b)\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readInts() = readLine()!!.split(\" \").map { it.toInt() }\nfun readLongs() = readLine()!!.split(\" \").map { it.toLong() }\n", "language": "Kotlin", "metadata": {"date": 1581897224, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Kotlin/s243225232.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s243225232", "user_id": "u979004569"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readInt()\n val S = readString()\n\n val dp = Array(N + 1) { Array(N + 1) { 0 } }\n for (i in N - 1 downTo 0) {\n for (j in i downTo 0) {\n if (S[i] == S[j]) {\n dp[i][j] = dp[i + 1][j + 1] + 1\n }\n }\n }\n\n var result = 0\n for (i in 0 until N) {\n for (j in i until N) {\n result = Math.max(result, Math.min(dp[i][j], j - i))\n }\n }\n println(result)\n}\n\nfun gcd(a: Int, b: Int): Int = if (a < b) gcd(b, a) else if (b == 0) a else gcd(b, a % b)\nfun gcd(a: Long, b: Long): Long = if (a < b) gcd(b, a) else if (b == 0L) a else gcd(b, a % b)\nfun lcm(a: Int, b: Int): Int = (a * b) / gcd(a, b)\nfun lcm(a: Long, b: Long): Long = (a * b) / gcd(a, b)\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readInts() = readLine()!!.split(\" \").map { it.toInt() }\nfun readLongs() = readLine()!!.split(\" \").map { it.toLong() }\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 906, "cpu_time_ms": 2119, "memory_kb": 288272}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s290223113", "group_id": "codeNet:p02913", "input_text": "fun main(args: Array) {\n val N = readInputLine().toInt()\n val S = readInputLine()\n \n var ans = 0\n \n for (i in 1..N / 2) {\n var ok = false\n for (j in 0 until N - i) {\n val subst = S.substring(j..i + j - 1)\n if (S.substring(i + j..N - 1).contains(subst)) {\n ok = true\n break\n }\n }\n if (!ok) {\n println(i - 1)\n return\n }\n }\n \n println(N / 2)\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "language": "Kotlin", "metadata": {"date": 1569165411, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Kotlin/s290223113.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s290223113", "user_id": "u505558493"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readInputLine().toInt()\n val S = readInputLine()\n \n var ans = 0\n \n for (i in 1..N / 2) {\n var ok = false\n for (j in 0 until N - i) {\n val subst = S.substring(j..i + j - 1)\n if (S.substring(i + j..N - 1).contains(subst)) {\n ok = true\n break\n }\n }\n if (!ok) {\n println(i - 1)\n return\n }\n }\n \n println(N / 2)\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 553, "cpu_time_ms": 2111, "memory_kb": 114372}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s206259606", "group_id": "codeNet:p02913", "input_text": "import java.util.*\nclass RollingHash(val N:Int,val S:String){\n val base = 1009L\n val mod = 10000000000009L\n val powBase = Array(N){1L}\n init{\n for(i in 1 until N){\n powBase[i] = powBase[i-1]*base%mod\n }\n }\n fun check(len:Int):Boolean{\n val T = TreeMap()\n var hash = 0L\n for(i in 0 until len){\n hash = (hash + S[i].toLong()*powBase[len-i-1])%mod\n }\n T.put(hash,0)\n for(i in 0 until N-len){\n hash = (hash - S[i].toLong()*powBase[len-1])*base+S[i+len].toLong()\n hash = hash%mod\n hash = if(hash>=0)hash else hash+mod\n if(T.containsKey(hash)&&i-T[hash]!!>=len){\n return true\n }\n T.put(hash,i+1)\n }\n return false\n }\n fun maxlen():Int{\n var left = 0\n var right = (N/2+1).toInt()\n while(right-left>1){\n val len = (right+left)/2.toInt()\n if(check(len))left = len else right = len\n }\n return left\n }\n}\nfun main(args:Array){\n val rh = RollingHash(readLine()!!.toInt(),readLine()!!)\n println(rh.maxlen())\n}\n", "language": "Kotlin", "metadata": {"date": 1568834692, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Kotlin/s206259606.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s206259606", "user_id": "u171144226"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\nclass RollingHash(val N:Int,val S:String){\n val base = 1009L\n val mod = 10000000000009L\n val powBase = Array(N){1L}\n init{\n for(i in 1 until N){\n powBase[i] = powBase[i-1]*base%mod\n }\n }\n fun check(len:Int):Boolean{\n val T = TreeMap()\n var hash = 0L\n for(i in 0 until len){\n hash = (hash + S[i].toLong()*powBase[len-i-1])%mod\n }\n T.put(hash,0)\n for(i in 0 until N-len){\n hash = (hash - S[i].toLong()*powBase[len-1])*base+S[i+len].toLong()\n hash = hash%mod\n hash = if(hash>=0)hash else hash+mod\n if(T.containsKey(hash)&&i-T[hash]!!>=len){\n return true\n }\n T.put(hash,i+1)\n }\n return false\n }\n fun maxlen():Int{\n var left = 0\n var right = (N/2+1).toInt()\n while(right-left>1){\n val len = (right+left)/2.toInt()\n if(check(len))left = len else right = len\n }\n return left\n }\n}\nfun main(args:Array){\n val rh = RollingHash(readLine()!!.toInt(),readLine()!!)\n println(rh.maxlen())\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1025, "cpu_time_ms": 348, "memory_kb": 40140}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s974822990", "group_id": "codeNet:p02913", "input_text": "import java.lang.Math.*\nfun main(args:Array){\n val N = readLine()!!.toInt()\n val S = readLine()!!\n val dp = Array(N+1){Array(N+1){0}}\n var max = 0\n for(i in 1 until N+1){\n if(N-i){\n val N = readLine()!!.toInt()\n val S = readLine()!!\n val dp = Array(N+1){Array(N+1){0}}\n var max = 0\n for(i in 1 until N+1){\n if(N-i){\n val N = readLine()!!.toInt()\n val S = readLine()!!\n val dp = Array(N+1){Array(N+1){0}}\n var max = 0\n for(i in 1 until N+1){\n for(j in 1 until N+1){\n if(S[i-1]==S[j-1]){\n dp[i][j] = min(dp[i-1][j-1]+1,j-i)\n max = max(dp[i][j],max)\n }\n }\n }\n println(max)\n}", "language": "Kotlin", "metadata": {"date": 1568722190, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Kotlin/s414478540.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s414478540", "user_id": "u171144226"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.lang.Math.*\nfun main(args:Array){\n val N = readLine()!!.toInt()\n val S = readLine()!!\n val dp = Array(N+1){Array(N+1){0}}\n var max = 0\n for(i in 1 until N+1){\n for(j in 1 until N+1){\n if(S[i-1]==S[j-1]){\n dp[i][j] = min(dp[i-1][j-1]+1,j-i)\n max = max(dp[i][j],max)\n }\n }\n }\n println(max)\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 346, "cpu_time_ms": 2119, "memory_kb": 297368}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s857789782", "group_id": "codeNet:p02913", "input_text": "//絶対時間足りないけど多分動くやつ\nfun main(args: Array){\n val N = readLine()!!.toInt()\n val S = readLine()!!\n\n var i = 0\n var result = 0\n var j: Int\n var k: Int\n while( i + result*2+1 < N ){\n j = 1\n while( i+j < N ){\n if( S[i] == S[i+j] ){\n k = 1\n while( i+j+k < N && S[i+k] == S[i+j+k] && i+k < i+j )\n k++\n if( result < k )\n result = k\n }\n j++\n }\n i++\n }\n\n println(result)\n}\n", "language": "Kotlin", "metadata": {"date": 1568599865, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02913.html", "problem_id": "p02913", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02913/input.txt", "sample_output_relpath": "derived/input_output/data/p02913/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02913/Kotlin/s857789782.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s857789782", "user_id": "u657065743"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "//絶対時間足りないけど多分動くやつ\nfun main(args: Array){\n val N = readLine()!!.toInt()\n val S = readLine()!!\n\n var i = 0\n var result = 0\n var j: Int\n var k: Int\n while( i + result*2+1 < N ){\n j = 1\n while( i+j < N ){\n if( S[i] == S[i+j] ){\n k = 1\n while( i+j+k < N && S[i+k] == S[i+j+k] && i+k < i+j )\n k++\n if( result < k )\n result = k\n }\n j++\n }\n i++\n }\n\n println(result)\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "sample_input": "5\nababa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02913", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven is a string S of length N.\n\nFind the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.\n\nMore formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \\leq l_1, l_2 \\leq N - len + 1 ) that satisfy the following:\n\nl_1 + len \\leq l_2\n\nS[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)\n\nIf there is no such integer len, print 0.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^3\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.\n\nSample Input 1\n\n5\nababa\n\nSample Output 1\n\n2\n\nThe strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.\nNote that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \\leq l_2.\n\nSample Input 2\n\n2\nxy\n\nSample Output 2\n\n0\n\nNo non-empty string satisfies the conditions.\n\nSample Input 3\n\n13\nstrangeorange\n\nSample Output 3\n\n5", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 476, "cpu_time_ms": 2111, "memory_kb": 33912}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s354285756", "group_id": "codeNet:p02933", "input_text": "import java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport kotlin.math.max\nimport kotlin.math.min\n\nval br = BufferedReader(InputStreamReader(System.`in`))\nval out = PrintWriter(System.out)\n\nfun main() {\n br.use { out.use {\n solve()\n out.flush()\n } }\n}\n\nfun solve() {\n val a = readInteger()\n val s = br.readLine()!!\n val ans = if (a >= 3200) s else \"red\"\n out.println(ans)\n}\n\nfun readInteger() = Integer.parseInt(br.readLine())\nfun readLong() = java.lang.Long.parseLong(br.readLine())\nfun readStringList() = br.readLine()!!.split(' ')\nfun readIntegerList() = readStringList().map(Integer::parseInt)\nfun readLongList() = readStringList().map(java.lang.Long::parseLong)\nfun readDoubleList() = readStringList().map(java.lang.Double::parseDouble)\n", "language": "Kotlin", "metadata": {"date": 1597552170, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s354285756.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s354285756", "user_id": "u784448849"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport kotlin.math.max\nimport kotlin.math.min\n\nval br = BufferedReader(InputStreamReader(System.`in`))\nval out = PrintWriter(System.out)\n\nfun main() {\n br.use { out.use {\n solve()\n out.flush()\n } }\n}\n\nfun solve() {\n val a = readInteger()\n val s = br.readLine()!!\n val ans = if (a >= 3200) s else \"red\"\n out.println(ans)\n}\n\nfun readInteger() = Integer.parseInt(br.readLine())\nfun readLong() = java.lang.Long.parseLong(br.readLine())\nfun readStringList() = br.readLine()!!.split(' ')\nfun readIntegerList() = readStringList().map(Integer::parseInt)\nfun readLongList() = readStringList().map(java.lang.Long::parseLong)\nfun readDoubleList() = readStringList().map(java.lang.Double::parseDouble)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 812, "cpu_time_ms": 89, "memory_kb": 34140}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s097821139", "group_id": "codeNet:p02933", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextInt()\n val s = sc.next()\n println(if (a < 3200) \"red\" else s)\n}", "language": "Kotlin", "metadata": {"date": 1583978487, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s097821139.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s097821139", "user_id": "u733811860"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextInt()\n val s = sc.next()\n println(if (a < 3200) \"red\" else s)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 174, "cpu_time_ms": 184, "memory_kb": 29480}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s087941897", "group_id": "codeNet:p02933", "input_text": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val s = readLine()!!.toString()\n if(a >= 3200) {\n println(\"pink\")\n } else if(a <= 3200) {\n println(\"red\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1580794759, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s087941897.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s087941897", "user_id": "u979282295"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val s = readLine()!!.toString()\n if(a >= 3200) {\n println(\"pink\")\n } else if(a <= 3200) {\n println(\"red\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 200, "memory_kb": 29824}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s369872295", "group_id": "codeNet:p02933", "input_text": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val s = readLine()\n println(if (a>= 3200)\"pink\" else s)\n}", "language": "Kotlin", "metadata": {"date": 1568752594, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s369872295.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s369872295", "user_id": "u520434261"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val s = readLine()\n println(if (a>= 3200)\"pink\" else s)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 129, "cpu_time_ms": 199, "memory_kb": 29948}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s461874142", "group_id": "codeNet:p02933", "input_text": "fun main(arr:Array) {\n val a = readLine()!!.toInt()\n val s = readLine()!!\n \n val ans = if(a >= 3200) s else \"red\"\n print(ans)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1567460421, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s461874142.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s461874142", "user_id": "u269969976"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "fun main(arr:Array) {\n val a = readLine()!!.toInt()\n val s = readLine()!!\n \n val ans = if(a >= 3200) s else \"red\"\n print(ans)\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 211, "memory_kb": 31796}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s219244085", "group_id": "codeNet:p02933", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val num = scanner.nextInt().toInt();\n \tif (num >= 3200) {\n println(num)\n } else {\n println(\"red\")\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1566889318, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s219244085.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s219244085", "user_id": "u595353351"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val num = scanner.nextInt().toInt();\n \tif (num >= 3200) {\n println(num)\n } else {\n println(\"red\")\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 215, "cpu_time_ms": 180, "memory_kb": 29468}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s540334578", "group_id": "codeNet:p02933", "input_text": "import java.util.*\n\nfun main(args: Array) {\n var a = readLine()!!.toInt()\n var s = readLine()!!\n if (a < 3200) println(\"red\") else println(s)\n}\n", "language": "Kotlin", "metadata": {"date": 1566773062, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s540334578.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s540334578", "user_id": "u796228844"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n var a = readLine()!!.toInt()\n var s = readLine()!!\n if (a < 3200) println(\"red\") else println(s)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 161, "cpu_time_ms": 202, "memory_kb": 31736}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s381541438", "group_id": "codeNet:p02933", "input_text": "fun main(argc:Array){\n val a = readLine()!!.toInt()\n if(a >= 3600){\n println(readLine()!!)\n }else{\n val TMP = readLine()\n println(\"red\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1566534326, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s381541438.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s381541438", "user_id": "u366696580"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "fun main(argc:Array){\n val a = readLine()!!.toInt()\n if(a >= 3600){\n println(readLine()!!)\n }else{\n val TMP = readLine()\n println(\"red\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 162, "cpu_time_ms": 203, "memory_kb": 31780}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s241023166", "group_id": "codeNet:p02933", "input_text": "fun main(args: Array)\n{\n val a = readInt()\n\n println(if (a >= 3200) \"s\" else \"red\" )\n\n}\n\n\n// Read an integer\n// Usage: val a = readInt()\nprivate fun readInt() = readLine()!!.toInt()\n\n// Read N integers separated by \" \"\n// Usage: val (a, b, c) = readNInts()\nprivate fun readNInts() = readLine()!!.split(\" \").map(String::toInt)\n\n// Read a string\n// Usage: val a = readString()\nprivate fun readString() = readLine()!!\n", "language": "Kotlin", "metadata": {"date": 1566178734, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s241023166.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s241023166", "user_id": "u118477733"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "fun main(args: Array)\n{\n val a = readInt()\n\n println(if (a >= 3200) \"s\" else \"red\" )\n\n}\n\n\n// Read an integer\n// Usage: val a = readInt()\nprivate fun readInt() = readLine()!!.toInt()\n\n// Read N integers separated by \" \"\n// Usage: val (a, b, c) = readNInts()\nprivate fun readNInts() = readLine()!!.split(\" \").map(String::toInt)\n\n// Read a string\n// Usage: val a = readString()\nprivate fun readString() = readLine()!!\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 429, "cpu_time_ms": 206, "memory_kb": 31808}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s497957100", "group_id": "codeNet:p02933", "input_text": "import java.util.*\n \nfun main(args: Array) {\n var a = readLine()!!.toInt()\n var s = readLine()!!\n if(a < 3200) {\n println(\"red\")\n } else {\n println(s)\n }\n}", "language": "Kotlin", "metadata": {"date": 1566176576, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s497957100.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s497957100", "user_id": "u394420840"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "import java.util.*\n \nfun main(args: Array) {\n var a = readLine()!!.toInt()\n var s = readLine()!!\n if(a < 3200) {\n println(\"red\")\n } else {\n println(s)\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 174, "cpu_time_ms": 202, "memory_kb": 29900}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s701431410", "group_id": "codeNet:p02933", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextInt()\n val s = sc.next()\n println(problem138a(a, s))\n}\n\nfun problem138a(a: Int, s: String): String {\n return if (a >= 3200) s else \"red\"\n}", "language": "Kotlin", "metadata": {"date": 1566176565, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s701431410.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s701431410", "user_id": "u073232808"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextInt()\n val s = sc.next()\n println(problem138a(a, s))\n}\n\nfun problem138a(a: Int, s: String): String {\n return if (a >= 3200) s else \"red\"\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 252, "cpu_time_ms": 179, "memory_kb": 31260}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s769560108", "group_id": "codeNet:p02933", "input_text": "fun main(args: Array) {\n\n val a = readLine()!!.toInt()\n\n val s = readLine()!!\n\n if(a >= 3200) println(s) else println(\"red\")\n}", "language": "Kotlin", "metadata": {"date": 1566176533, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s769560108.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s769560108", "user_id": "u108272327"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "fun main(args: Array) {\n\n val a = readLine()!!.toInt()\n\n val s = readLine()!!\n\n if(a >= 3200) println(s) else println(\"red\")\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 143, "cpu_time_ms": 203, "memory_kb": 29828}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s845379153", "group_id": "codeNet:p02933", "input_text": "fun main(args: Array) {\n val a = readInputLine().toInt()\n val s = readInputLine()\n \n if (a >= 3200) {\n println(s)\n } else {\n println(\"red\")\n }\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "language": "Kotlin", "metadata": {"date": 1566176490, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s845379153.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s845379153", "user_id": "u505558493"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "fun main(args: Array) {\n val a = readInputLine().toInt()\n val s = readInputLine()\n \n if (a >= 3200) {\n println(s)\n } else {\n println(\"red\")\n }\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 242, "cpu_time_ms": 203, "memory_kb": 31708}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s947811208", "group_id": "codeNet:p02933", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n \n val a = readInt()\n val s = read()\n println(if(a >=3200) s else \"red\")\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n }\n }\n return v.map { it.toList() }.toList()\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n if(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n a / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun isDecimal(v: Double): Boolean = ((v - Math.floor(v)) != 0.0)\n\n// Data Structures\nclass Stack(private var st: MutableList = mutableListOf()) {\n fun isEmpty() = st.isEmpty()\n fun top(): T = st.last()\n fun push(e: T) { st.add(e) }\n fun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n fun isEmpty() = que.isEmpty()\n fun top(): T = que.first()\n fun push(e: T) { que.add(e) }\n fun pop() { que = que.drop(1).toMutableList() }\n}\n", "language": "Kotlin", "metadata": {"date": 1566176483, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02933.html", "problem_id": "p02933", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02933/input.txt", "sample_output_relpath": "derived/input_output/data/p02933/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02933/Kotlin/s947811208.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s947811208", "user_id": "u026686258"}, "prompt_components": {"gold_output": "pink\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n \n val a = readInt()\n val s = read()\n println(if(a >=3200) s else \"red\")\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n }\n }\n return v.map { it.toList() }.toList()\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n if(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n a / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun isDecimal(v: Double): Boolean = ((v - Math.floor(v)) != 0.0)\n\n// Data Structures\nclass Stack(private var st: MutableList = mutableListOf()) {\n fun isEmpty() = st.isEmpty()\n fun top(): T = st.last()\n fun push(e: T) { st.add(e) }\n fun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n fun isEmpty() = que.isEmpty()\n fun top(): T = que.first()\n fun push(e: T) { que.add(e) }\n fun pop() { que = que.drop(1).toMutableList() }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "sample_input": "3200\npink\n"}, "reference_outputs": ["pink\n"], "source_document_id": "p02933", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given an integer a and a string s consisting of lowercase English letters as input.\n\nWrite a program that prints s if a is not less than 3200 and prints red if a is less than 3200.\n\nConstraints\n\n2800 \\leq a < 5000\n\ns is a string of length between 1 and 10 (inclusive).\n\nEach character of s is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\ns\n\nOutput\n\nIf a is not less than 3200, print s; if a is less than 3200, print red.\n\nSample Input 1\n\n3200\npink\n\nSample Output 1\n\npink\n\na = 3200 is not less than 3200, so we print s = pink.\n\nSample Input 2\n\n3199\npink\n\nSample Output 2\n\nred\n\na = 3199 is less than 3200, so we print red.\n\nSample Input 3\n\n4049\nred\n\nSample Output 3\n\nred\n\na = 4049 is not less than 3200, so we print s = red.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2700, "cpu_time_ms": 203, "memory_kb": 31972}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s941243393", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args: Array) {\n abc138d()\n}\n\nfun abc138d() {\n val (n, q) = readLine()!!.split(\" \").map { it.toInt() }\n val nodes = Array>(n + 1) { mutableListOf() }\n val count = IntArray(n + 1) { 0 }\n val operation = IntArray(n + 1) { 0 }\n repeat(n - 1) {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n nodes[a].add(b)\n nodes[b].add(a)\n }\n repeat(q) {\n val (p, x) = readLine()!!.split(\" \").map { it.toInt() }\n operation[p] += x\n }\n val visited = mutableSetOf()\n traverseTree(1, 0, nodes, operation, count, visited)\n println(count.copyOfRange(1, n + 1).joinToString(\" \"))\n}\n\nprivate fun traverseTree(currentNode: Int, total: Int, nodes: Array>, operation: IntArray, count: IntArray, visited: MutableSet) {\n val currentValue = total + operation[currentNode]\n count[currentNode] = currentValue\n visited.add(currentNode)\n for (n in nodes[currentNode]) {\n if (n in visited) continue\n traverseTree(n, currentValue, nodes, operation, count, visited)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1590705278, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s941243393.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s941243393", "user_id": "u628907033"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n abc138d()\n}\n\nfun abc138d() {\n val (n, q) = readLine()!!.split(\" \").map { it.toInt() }\n val nodes = Array>(n + 1) { mutableListOf() }\n val count = IntArray(n + 1) { 0 }\n val operation = IntArray(n + 1) { 0 }\n repeat(n - 1) {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n nodes[a].add(b)\n nodes[b].add(a)\n }\n repeat(q) {\n val (p, x) = readLine()!!.split(\" \").map { it.toInt() }\n operation[p] += x\n }\n val visited = mutableSetOf()\n traverseTree(1, 0, nodes, operation, count, visited)\n println(count.copyOfRange(1, n + 1).joinToString(\" \"))\n}\n\nprivate fun traverseTree(currentNode: Int, total: Int, nodes: Array>, operation: IntArray, count: IntArray, visited: MutableSet) {\n val currentValue = total + operation[currentNode]\n count[currentNode] = currentValue\n visited.add(currentNode)\n for (n in nodes[currentNode]) {\n if (n in visited) continue\n traverseTree(n, currentValue, nodes, operation, count, visited)\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1124, "cpu_time_ms": 2111, "memory_kb": 164468}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s240654584", "group_id": "codeNet:p02936", "input_text": "import java.util.ArrayDeque\n\ndata class Edge(val to: Int)\n\nfun main(args: Array){\n val (N, Q) = readLine()!!.split(\" \").map(String::toInt)\n val g = Array(N+1){ mutableSetOf() }\n repeat(N - 1){\n val (A, B) = readLine()!!.split(\" \").map(String::toInt)\n g[A].add(Edge(B))\n g[B].add(Edge(A))\n }\n \n val counter = IntArray(N+1)\n repeat(Q) {\n val (P, X) = readLine()!!.split(\" \").map(String::toInt)\n counter[P] += X\n }\n\n val queue = ArrayDeque(listOf(1))\n val visited = BooleanArray(N+1){ false }\n while(queue.isNotEmpty()){\n val cur = queue.poll()\n visited[cur] = true\n g[cur].forEach {\n if(!visited[it.to]){\n counter[it.to] += counter[cur]\n queue.add(it.to)\n }\n }\n }\n println(counter.takeLast(N).joinToString(separator = \" \"))\n}", "language": "Kotlin", "metadata": {"date": 1590479679, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s240654584.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s240654584", "user_id": "u531770859"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.ArrayDeque\n\ndata class Edge(val to: Int)\n\nfun main(args: Array){\n val (N, Q) = readLine()!!.split(\" \").map(String::toInt)\n val g = Array(N+1){ mutableSetOf() }\n repeat(N - 1){\n val (A, B) = readLine()!!.split(\" \").map(String::toInt)\n g[A].add(Edge(B))\n g[B].add(Edge(A))\n }\n \n val counter = IntArray(N+1)\n repeat(Q) {\n val (P, X) = readLine()!!.split(\" \").map(String::toInt)\n counter[P] += X\n }\n\n val queue = ArrayDeque(listOf(1))\n val visited = BooleanArray(N+1){ false }\n while(queue.isNotEmpty()){\n val cur = queue.poll()\n visited[cur] = true\n g[cur].forEach {\n if(!visited[it.to]){\n counter[it.to] += counter[cur]\n queue.add(it.to)\n }\n }\n }\n println(counter.takeLast(N).joinToString(separator = \" \"))\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 891, "cpu_time_ms": 2115, "memory_kb": 183516}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s791845351", "group_id": "codeNet:p02936", "input_text": "fun main(args: Array){\n val (N, Q) = readLine()!!.split(\" \").map(String::toInt)\n val g = Array(N+1){ IntArray(N+1) }\n for(i in 0 until N - 1){\n val (A, B) = readLine()!!.split(\" \").map(String::toInt)\n g[A][B] = 1\n g[B][A] = 1\n }\n val counter = IntArray(N+1)\n for(i in 0 until Q){\n val (P, X) = readLine()!!.split(\" \").map(String::toInt)\n counter[P] += X\n }\n\n val ans = IntArray(N+1)\n fun dfs(cur: Int, pre: Int, count: Int){\n val d = count + counter[cur]\n ans[cur] = d\n for(i in 1..N){\n if(g[cur][i] == 1 && i != pre){\n dfs(i, cur, d)\n }\n }\n }\n dfs(1, 0, 0)\n for(i in 1..N){\n println(ans[i])\n }\n}", "language": "Kotlin", "metadata": {"date": 1590473949, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s791845351.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s791845351", "user_id": "u531770859"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "fun main(args: Array){\n val (N, Q) = readLine()!!.split(\" \").map(String::toInt)\n val g = Array(N+1){ IntArray(N+1) }\n for(i in 0 until N - 1){\n val (A, B) = readLine()!!.split(\" \").map(String::toInt)\n g[A][B] = 1\n g[B][A] = 1\n }\n val counter = IntArray(N+1)\n for(i in 0 until Q){\n val (P, X) = readLine()!!.split(\" \").map(String::toInt)\n counter[P] += X\n }\n\n val ans = IntArray(N+1)\n fun dfs(cur: Int, pre: Int, count: Int){\n val d = count + counter[cur]\n ans[cur] = d\n for(i in 1..N){\n if(g[cur][i] == 1 && i != pre){\n dfs(i, cur, d)\n }\n }\n }\n dfs(1, 0, 0)\n for(i in 1..N){\n println(ans[i])\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 750, "cpu_time_ms": 515, "memory_kb": 289780}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s774380644", "group_id": "codeNet:p02936", "input_text": "import java.io.IOException\nimport java.io.InputStream\nimport java.util.*\n\n\nfun main(args: Array){\n val sc = FastScanner()\n val (N, Q) = sc.next().split(\" \").map(String::toInt)\n val g = Array(N+1){ mutableSetOf() }\n for(i in 0 until N - 1){\n val (A, B) = sc.next().split(\" \").map(String::toInt)\n g[A].add(B)\n g[B].add(A)\n }\n val counter = IntArray(N+1)\n for(i in 0 until Q){\n val (P, X) = sc.next().split(\" \").map(String::toInt)\n counter[P] += X\n }\n\n val ans = IntArray(N+1)\n fun dfs(e: Int, prevE: Int, count: Int){\n ans[e] = count + counter[e]\n g[e].forEach {\n if(it != prevE){\n dfs(it, e, ans[e])\n }\n }\n }\n dfs(1, 0, 0)\n for(i in 1..N){\n println(ans[i])\n }\n}\n\nclass FastScanner {\n private val `in`: InputStream = System.`in`\n private val buffer = ByteArray(1024)\n private var ptr = 0\n private var buflen = 0\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n\n private fun readByte(): Int {\n return if (hasNextByte()) buffer[ptr++].toInt() else -1\n }\n\n operator fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n operator fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByte()\n if (b == '-'.toInt()) {\n minus = true\n b = readByte()\n }\n if (b < '0'.toInt() || '9'.toInt() < b) {\n throw NumberFormatException()\n }\n while (true) {\n if ('0'.toInt() <= b && b <= '9'.toInt()) {\n n *= 10\n n += b - '0'.toInt().toLong()\n } else return if (b == -1 || !isPrintableChar(b)) {\n if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl < Int.MIN_VALUE || nl > Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun nextDouble(): Double {\n return next().toDouble()\n }\n\n companion object {\n private fun isPrintableChar(c: Int): Boolean {\n return c in 33..126\n }\n }\n}", "language": "Kotlin", "metadata": {"date": 1590471760, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s774380644.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s774380644", "user_id": "u531770859"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.io.IOException\nimport java.io.InputStream\nimport java.util.*\n\n\nfun main(args: Array){\n val sc = FastScanner()\n val (N, Q) = sc.next().split(\" \").map(String::toInt)\n val g = Array(N+1){ mutableSetOf() }\n for(i in 0 until N - 1){\n val (A, B) = sc.next().split(\" \").map(String::toInt)\n g[A].add(B)\n g[B].add(A)\n }\n val counter = IntArray(N+1)\n for(i in 0 until Q){\n val (P, X) = sc.next().split(\" \").map(String::toInt)\n counter[P] += X\n }\n\n val ans = IntArray(N+1)\n fun dfs(e: Int, prevE: Int, count: Int){\n ans[e] = count + counter[e]\n g[e].forEach {\n if(it != prevE){\n dfs(it, e, ans[e])\n }\n }\n }\n dfs(1, 0, 0)\n for(i in 1..N){\n println(ans[i])\n }\n}\n\nclass FastScanner {\n private val `in`: InputStream = System.`in`\n private val buffer = ByteArray(1024)\n private var ptr = 0\n private var buflen = 0\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n\n private fun readByte(): Int {\n return if (hasNextByte()) buffer[ptr++].toInt() else -1\n }\n\n operator fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n operator fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByte()\n if (b == '-'.toInt()) {\n minus = true\n b = readByte()\n }\n if (b < '0'.toInt() || '9'.toInt() < b) {\n throw NumberFormatException()\n }\n while (true) {\n if ('0'.toInt() <= b && b <= '9'.toInt()) {\n n *= 10\n n += b - '0'.toInt().toLong()\n } else return if (b == -1 || !isPrintableChar(b)) {\n if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl < Int.MIN_VALUE || nl > Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun nextDouble(): Double {\n return next().toDouble()\n }\n\n companion object {\n private fun isPrintableChar(c: Int): Boolean {\n return c in 33..126\n }\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3015, "cpu_time_ms": 206, "memory_kb": 33952}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s113410048", "group_id": "codeNet:p02936", "input_text": "@file:Suppress(\"DuplicatedCode\")\n\nimport java.io.IOException\nimport java.io.InputStream\nimport java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) {\n Thread(null, {\n PrintWriter(System.out).use { out ->\n D.solve(D.FastScanner(), out)\n out.flush()\n }\n }, \"\", 64 * 1024 * 1024).start()\n \n}\n\nprivate fun D.solve(sc: D.FastScanner, out: PrintWriter) {\n val n = sc.nextInt()\n val q = sc.nextInt()\n\n val nodeList = Array(n) { D.BitSet(n) }\n repeat(n - 1) {\n val a = sc.nextInt() - 1\n val b = sc.nextInt() - 1\n nodeList[a][b] = true\n nodeList[b][a] = true\n }\n\n val counter = IntArray(n)\n repeat(q) {\n val index = sc.nextInt() - 1\n counter[index] += sc.nextInt()\n }\n\n val queue = ArrayDeque(listOf(0 to 0))\n\n while (queue.isNotEmpty()) {\n val (from, to) = queue.removeFirst()\n nodeList[to].trueIterator().forEach {\n if (it != from) {\n counter[it] += counter[to]\n queue.addLast(to to it)\n }\n }\n }\n\n counter.forEach {\n out.println(it)\n }\n}\n\n@Suppress(\"MemberVisibilityCanBePrivate\")\nprivate object D {\n private const val zeroCode = '0'.toInt()\n private const val nineCode = '9'.toInt()\n\n class FastScanner {\n private val `in`: InputStream = System.`in`\n private val buffer = ByteArray(1024)\n private var ptr = 0\n private var buflen = 0\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n\n private fun readByte(): Int {\n return if (hasNextByte()) buffer[ptr++].toInt() else -1\n }\n\n operator fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n operator fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n\n return buildString {\n var b = readByte()\n\n while (isPrintableChar(b)) {\n appendCodePoint(b)\n b = readByte()\n }\n }\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByte()\n\n if (b == '-'.toInt()) {\n minus = true\n b = readByte()\n }\n\n if (b !in zeroCode..nineCode) {\n throw NumberFormatException()\n }\n\n while (true) {\n if (b in zeroCode..nineCode) {\n n *= 10\n n += b - zeroCode.toLong()\n } else if (b == -1 || !isPrintableChar(b)) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl < Int.MIN_VALUE || nl > Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun nextDouble(): Double {\n return next().toDouble()\n }\n\n fun readIntArray(n: Int): IntArray {\n val arr = IntArray(n)\n\n for (i in 0 until n) {\n arr[i] = nextInt()\n }\n\n return arr\n }\n\n fun readBigInt(capacity: Int): IntArray {\n if (!hasNext()) throw NoSuchElementException()\n\n val arr = IntArray(capacity)\n var len = 0\n arr[0] = readByte() - zeroCode\n while (arr[len] in 0..9) {\n len++\n arr[len] = readByte() - zeroCode\n }\n\n return arr.sliceArray(0 until len)\n }\n\n companion object {\n private fun isPrintableChar(c: Int): Boolean {\n return c in 33..126\n }\n }\n }\n\n class BitSet(capacity: Int) {\n val bitset = java.util.BitSet(capacity)\n\n val cardinality: Int\n get() = bitset.cardinality()\n\n override fun equals(other: Any?) = (other as? BitSet)?.let { it.bitset == bitset } ?: false\n\n operator fun set(n: Int, f: Boolean) {\n if (f) {\n bitset.set(n)\n } else {\n bitset.clear(n)\n }\n }\n\n operator fun get(n: Int) = bitset[n]\n\n fun trueIterator(startIndex: Int = 0) = object: IntIterator() {\n var nextPos = bitset.nextSetBit(startIndex)\n\n override fun hasNext() = nextPos in 0 until Int.MAX_VALUE\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.nextSetBit(nextPos + 1)\n return value\n }\n }\n\n fun falseIterator(startIndex: Int = 0) = object: IntIterator() {\n var nextPos = bitset.nextClearBit(startIndex)\n\n override fun hasNext() = nextPos in 0 until Int.MAX_VALUE\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.nextClearBit(nextPos + 1)\n return value\n }\n }\n\n fun trueIteratorReversed(startIndex: Int = bitset.length() - 1) = object: IntIterator() {\n var nextPos = bitset.previousSetBit(startIndex)\n\n override fun hasNext() = nextPos >= 0\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.previousSetBit(nextPos - 1)\n return value\n }\n }\n\n fun falseIteratorReversed(startIndex: Int = bitset.length() - 1) = object: IntIterator() {\n var nextPos = bitset.previousClearBit(startIndex)\n\n override fun hasNext() = nextPos >= 0\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.previousClearBit(nextPos - 1)\n return value\n }\n }\n\n fun and(other: BitSet) {\n bitset.and(other.bitset)\n }\n\n fun or(other: BitSet) {\n bitset.or(other.bitset)\n }\n\n fun xor(other: BitSet) {\n bitset.xor(other.bitset)\n }\n\n fun andNot(other: BitSet) {\n bitset.andNot(other.bitset)\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1589627481, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s113410048.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s113410048", "user_id": "u996672406"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "@file:Suppress(\"DuplicatedCode\")\n\nimport java.io.IOException\nimport java.io.InputStream\nimport java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) {\n Thread(null, {\n PrintWriter(System.out).use { out ->\n D.solve(D.FastScanner(), out)\n out.flush()\n }\n }, \"\", 64 * 1024 * 1024).start()\n \n}\n\nprivate fun D.solve(sc: D.FastScanner, out: PrintWriter) {\n val n = sc.nextInt()\n val q = sc.nextInt()\n\n val nodeList = Array(n) { D.BitSet(n) }\n repeat(n - 1) {\n val a = sc.nextInt() - 1\n val b = sc.nextInt() - 1\n nodeList[a][b] = true\n nodeList[b][a] = true\n }\n\n val counter = IntArray(n)\n repeat(q) {\n val index = sc.nextInt() - 1\n counter[index] += sc.nextInt()\n }\n\n val queue = ArrayDeque(listOf(0 to 0))\n\n while (queue.isNotEmpty()) {\n val (from, to) = queue.removeFirst()\n nodeList[to].trueIterator().forEach {\n if (it != from) {\n counter[it] += counter[to]\n queue.addLast(to to it)\n }\n }\n }\n\n counter.forEach {\n out.println(it)\n }\n}\n\n@Suppress(\"MemberVisibilityCanBePrivate\")\nprivate object D {\n private const val zeroCode = '0'.toInt()\n private const val nineCode = '9'.toInt()\n\n class FastScanner {\n private val `in`: InputStream = System.`in`\n private val buffer = ByteArray(1024)\n private var ptr = 0\n private var buflen = 0\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n\n private fun readByte(): Int {\n return if (hasNextByte()) buffer[ptr++].toInt() else -1\n }\n\n operator fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n operator fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n\n return buildString {\n var b = readByte()\n\n while (isPrintableChar(b)) {\n appendCodePoint(b)\n b = readByte()\n }\n }\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByte()\n\n if (b == '-'.toInt()) {\n minus = true\n b = readByte()\n }\n\n if (b !in zeroCode..nineCode) {\n throw NumberFormatException()\n }\n\n while (true) {\n if (b in zeroCode..nineCode) {\n n *= 10\n n += b - zeroCode.toLong()\n } else if (b == -1 || !isPrintableChar(b)) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl < Int.MIN_VALUE || nl > Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun nextDouble(): Double {\n return next().toDouble()\n }\n\n fun readIntArray(n: Int): IntArray {\n val arr = IntArray(n)\n\n for (i in 0 until n) {\n arr[i] = nextInt()\n }\n\n return arr\n }\n\n fun readBigInt(capacity: Int): IntArray {\n if (!hasNext()) throw NoSuchElementException()\n\n val arr = IntArray(capacity)\n var len = 0\n arr[0] = readByte() - zeroCode\n while (arr[len] in 0..9) {\n len++\n arr[len] = readByte() - zeroCode\n }\n\n return arr.sliceArray(0 until len)\n }\n\n companion object {\n private fun isPrintableChar(c: Int): Boolean {\n return c in 33..126\n }\n }\n }\n\n class BitSet(capacity: Int) {\n val bitset = java.util.BitSet(capacity)\n\n val cardinality: Int\n get() = bitset.cardinality()\n\n override fun equals(other: Any?) = (other as? BitSet)?.let { it.bitset == bitset } ?: false\n\n operator fun set(n: Int, f: Boolean) {\n if (f) {\n bitset.set(n)\n } else {\n bitset.clear(n)\n }\n }\n\n operator fun get(n: Int) = bitset[n]\n\n fun trueIterator(startIndex: Int = 0) = object: IntIterator() {\n var nextPos = bitset.nextSetBit(startIndex)\n\n override fun hasNext() = nextPos in 0 until Int.MAX_VALUE\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.nextSetBit(nextPos + 1)\n return value\n }\n }\n\n fun falseIterator(startIndex: Int = 0) = object: IntIterator() {\n var nextPos = bitset.nextClearBit(startIndex)\n\n override fun hasNext() = nextPos in 0 until Int.MAX_VALUE\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.nextClearBit(nextPos + 1)\n return value\n }\n }\n\n fun trueIteratorReversed(startIndex: Int = bitset.length() - 1) = object: IntIterator() {\n var nextPos = bitset.previousSetBit(startIndex)\n\n override fun hasNext() = nextPos >= 0\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.previousSetBit(nextPos - 1)\n return value\n }\n }\n\n fun falseIteratorReversed(startIndex: Int = bitset.length() - 1) = object: IntIterator() {\n var nextPos = bitset.previousClearBit(startIndex)\n\n override fun hasNext() = nextPos >= 0\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.previousClearBit(nextPos - 1)\n return value\n }\n }\n\n fun and(other: BitSet) {\n bitset.and(other.bitset)\n }\n\n fun or(other: BitSet) {\n bitset.or(other.bitset)\n }\n\n fun xor(other: BitSet) {\n bitset.xor(other.bitset)\n }\n\n fun andNot(other: BitSet) {\n bitset.andNot(other.bitset)\n }\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6791, "cpu_time_ms": 452, "memory_kb": 304736}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s748112769", "group_id": "codeNet:p02936", "input_text": "@file:Suppress(\"DuplicatedCode\")\n\nimport java.io.IOException\nimport java.io.InputStream\nimport java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) {\n PrintWriter(System.out).use { out ->\n D.solve(D.FastScanner(), out)\n out.flush()\n }\n}\n\nprivate fun D.solve(sc: D.FastScanner, out: PrintWriter) {\n val n = sc.nextInt()\n val q = sc.nextInt()\n\n val nodeList = Array(n) { D.BitSet(n) }\n repeat(n - 1) {\n val a = sc.nextInt() - 1\n val b = sc.nextInt() - 1\n nodeList[a][b] = true\n nodeList[b][a] = true\n }\n\n val counter = IntArray(n)\n repeat(q) {\n val index = sc.nextInt() - 1\n counter[index] += sc.nextInt()\n }\n val visited = D.BitSet(n)\n val queue = ArrayDeque(listOf(0 to 0))\n\n while (queue.isNotEmpty()) {\n val (current, sum) = queue.removeFirst()\n visited[current] = true\n counter[current] += sum\n nodeList[current].trueIterator().forEach {\n if (!visited[it]) {\n queue.add(it to counter[current])\n }\n }\n }\n\n counter.forEach {\n println(it)\n }\n}\n\n@Suppress(\"MemberVisibilityCanBePrivate\")\nprivate object D {\n private const val zeroCode = '0'.toInt()\n private const val nineCode = '9'.toInt()\n\n class FastScanner {\n private val `in`: InputStream = System.`in`\n private val buffer = ByteArray(1024)\n private var ptr = 0\n private var buflen = 0\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n\n private fun readByte(): Int {\n return if (hasNextByte()) buffer[ptr++].toInt() else -1\n }\n\n operator fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n operator fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n\n return buildString {\n var b = readByte()\n\n while (isPrintableChar(b)) {\n appendCodePoint(b)\n b = readByte()\n }\n }\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByte()\n\n if (b == '-'.toInt()) {\n minus = true\n b = readByte()\n }\n\n if (b !in zeroCode..nineCode) {\n throw NumberFormatException()\n }\n\n while (true) {\n if (b in zeroCode..nineCode) {\n n *= 10\n n += b - zeroCode.toLong()\n } else if (b == -1 || !isPrintableChar(b)) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl < Int.MIN_VALUE || nl > Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun nextDouble(): Double {\n return next().toDouble()\n }\n\n fun readIntArray(n: Int): IntArray {\n val arr = IntArray(n)\n\n for (i in 0 until n) {\n arr[i] = nextInt()\n }\n\n return arr\n }\n\n fun readBigInt(capacity: Int): IntArray {\n if (!hasNext()) throw NoSuchElementException()\n\n val arr = IntArray(capacity)\n var len = 0\n arr[0] = readByte() - zeroCode\n while (arr[len] in 0..9) {\n len++\n arr[len] = readByte() - zeroCode\n }\n\n return arr.sliceArray(0 until len)\n }\n\n companion object {\n private fun isPrintableChar(c: Int): Boolean {\n return c in 33..126\n }\n }\n }\n\n class BitSet(capacity: Int) {\n val bitset = java.util.BitSet(capacity)\n\n val cardinality: Int\n get() = bitset.cardinality()\n\n override fun equals(other: Any?) = (other as? BitSet)?.let { it.bitset == bitset } ?: false\n\n operator fun set(n: Int, f: Boolean) {\n if (f) {\n bitset.set(n)\n } else {\n bitset.clear(n)\n }\n }\n\n operator fun get(n: Int) = bitset[n]\n\n fun trueIterator(startIndex: Int = 0) = object: IntIterator() {\n var nextPos = bitset.nextSetBit(startIndex)\n\n override fun hasNext() = nextPos in 0 until Int.MAX_VALUE\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.nextSetBit(nextPos + 1)\n return value\n }\n }\n\n fun falseIterator(startIndex: Int = 0) = object: IntIterator() {\n var nextPos = bitset.nextClearBit(startIndex)\n\n override fun hasNext() = nextPos in 0 until Int.MAX_VALUE\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.nextClearBit(nextPos + 1)\n return value\n }\n }\n\n fun trueIteratorReversed(startIndex: Int = bitset.length() - 1) = object: IntIterator() {\n var nextPos = bitset.previousSetBit(startIndex)\n\n override fun hasNext() = nextPos >= 0\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.previousSetBit(nextPos - 1)\n return value\n }\n }\n\n fun falseIteratorReversed(startIndex: Int = bitset.length() - 1) = object: IntIterator() {\n var nextPos = bitset.previousClearBit(startIndex)\n\n override fun hasNext() = nextPos >= 0\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.previousClearBit(nextPos - 1)\n return value\n }\n }\n\n fun and(other: BitSet) {\n bitset.and(other.bitset)\n }\n\n fun or(other: BitSet) {\n bitset.or(other.bitset)\n }\n\n fun xor(other: BitSet) {\n bitset.xor(other.bitset)\n }\n\n fun andNot(other: BitSet) {\n bitset.andNot(other.bitset)\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1589625532, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s748112769.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s748112769", "user_id": "u996672406"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "@file:Suppress(\"DuplicatedCode\")\n\nimport java.io.IOException\nimport java.io.InputStream\nimport java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) {\n PrintWriter(System.out).use { out ->\n D.solve(D.FastScanner(), out)\n out.flush()\n }\n}\n\nprivate fun D.solve(sc: D.FastScanner, out: PrintWriter) {\n val n = sc.nextInt()\n val q = sc.nextInt()\n\n val nodeList = Array(n) { D.BitSet(n) }\n repeat(n - 1) {\n val a = sc.nextInt() - 1\n val b = sc.nextInt() - 1\n nodeList[a][b] = true\n nodeList[b][a] = true\n }\n\n val counter = IntArray(n)\n repeat(q) {\n val index = sc.nextInt() - 1\n counter[index] += sc.nextInt()\n }\n val visited = D.BitSet(n)\n val queue = ArrayDeque(listOf(0 to 0))\n\n while (queue.isNotEmpty()) {\n val (current, sum) = queue.removeFirst()\n visited[current] = true\n counter[current] += sum\n nodeList[current].trueIterator().forEach {\n if (!visited[it]) {\n queue.add(it to counter[current])\n }\n }\n }\n\n counter.forEach {\n println(it)\n }\n}\n\n@Suppress(\"MemberVisibilityCanBePrivate\")\nprivate object D {\n private const val zeroCode = '0'.toInt()\n private const val nineCode = '9'.toInt()\n\n class FastScanner {\n private val `in`: InputStream = System.`in`\n private val buffer = ByteArray(1024)\n private var ptr = 0\n private var buflen = 0\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n\n private fun readByte(): Int {\n return if (hasNextByte()) buffer[ptr++].toInt() else -1\n }\n\n operator fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n operator fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n\n return buildString {\n var b = readByte()\n\n while (isPrintableChar(b)) {\n appendCodePoint(b)\n b = readByte()\n }\n }\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByte()\n\n if (b == '-'.toInt()) {\n minus = true\n b = readByte()\n }\n\n if (b !in zeroCode..nineCode) {\n throw NumberFormatException()\n }\n\n while (true) {\n if (b in zeroCode..nineCode) {\n n *= 10\n n += b - zeroCode.toLong()\n } else if (b == -1 || !isPrintableChar(b)) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl < Int.MIN_VALUE || nl > Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun nextDouble(): Double {\n return next().toDouble()\n }\n\n fun readIntArray(n: Int): IntArray {\n val arr = IntArray(n)\n\n for (i in 0 until n) {\n arr[i] = nextInt()\n }\n\n return arr\n }\n\n fun readBigInt(capacity: Int): IntArray {\n if (!hasNext()) throw NoSuchElementException()\n\n val arr = IntArray(capacity)\n var len = 0\n arr[0] = readByte() - zeroCode\n while (arr[len] in 0..9) {\n len++\n arr[len] = readByte() - zeroCode\n }\n\n return arr.sliceArray(0 until len)\n }\n\n companion object {\n private fun isPrintableChar(c: Int): Boolean {\n return c in 33..126\n }\n }\n }\n\n class BitSet(capacity: Int) {\n val bitset = java.util.BitSet(capacity)\n\n val cardinality: Int\n get() = bitset.cardinality()\n\n override fun equals(other: Any?) = (other as? BitSet)?.let { it.bitset == bitset } ?: false\n\n operator fun set(n: Int, f: Boolean) {\n if (f) {\n bitset.set(n)\n } else {\n bitset.clear(n)\n }\n }\n\n operator fun get(n: Int) = bitset[n]\n\n fun trueIterator(startIndex: Int = 0) = object: IntIterator() {\n var nextPos = bitset.nextSetBit(startIndex)\n\n override fun hasNext() = nextPos in 0 until Int.MAX_VALUE\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.nextSetBit(nextPos + 1)\n return value\n }\n }\n\n fun falseIterator(startIndex: Int = 0) = object: IntIterator() {\n var nextPos = bitset.nextClearBit(startIndex)\n\n override fun hasNext() = nextPos in 0 until Int.MAX_VALUE\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.nextClearBit(nextPos + 1)\n return value\n }\n }\n\n fun trueIteratorReversed(startIndex: Int = bitset.length() - 1) = object: IntIterator() {\n var nextPos = bitset.previousSetBit(startIndex)\n\n override fun hasNext() = nextPos >= 0\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.previousSetBit(nextPos - 1)\n return value\n }\n }\n\n fun falseIteratorReversed(startIndex: Int = bitset.length() - 1) = object: IntIterator() {\n var nextPos = bitset.previousClearBit(startIndex)\n\n override fun hasNext() = nextPos >= 0\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.previousClearBit(nextPos - 1)\n return value\n }\n }\n\n fun and(other: BitSet) {\n bitset.and(other.bitset)\n }\n\n fun or(other: BitSet) {\n bitset.or(other.bitset)\n }\n\n fun xor(other: BitSet) {\n bitset.xor(other.bitset)\n }\n\n fun andNot(other: BitSet) {\n bitset.andNot(other.bitset)\n }\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6781, "cpu_time_ms": 432, "memory_kb": 301272}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s814366391", "group_id": "codeNet:p02936", "input_text": "@file:Suppress(\"DuplicatedCode\")\n\nimport java.io.IOException\nimport java.io.InputStream\nimport java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) {\n PrintWriter(System.out).use { out ->\n D.solve(D.FastScanner(), out)\n out.flush()\n }\n}\n\nprivate fun D.solve(sc: D.FastScanner, out: PrintWriter) {\n val n = sc.nextInt()\n val q = sc.nextInt()\n\n val nodeList = Array(n) { D.BitSet(n) }\n repeat(n - 1) {\n val a = sc.nextInt() - 1\n val b = sc.nextInt() - 1\n nodeList[a][b] = true\n nodeList[b][a] = true\n }\n\n val counter = IntArray(n)\n repeat(q) {\n val index = sc.nextInt() - 1\n counter[index] += sc.nextInt()\n }\n\n val result = IntArray(n)\n val visited = D.BitSet(n)\n fun loop(currentIndex: Int, point: Int) {\n val currentCounter = point + counter[currentIndex]\n result[currentIndex] = currentCounter\n\n if (nodeList[currentIndex].cardinality == 0) {\n return\n }\n\n visited[currentIndex] = true\n\n nodeList[currentIndex].trueIterator(0).forEach {\n if (visited[it]) return@forEach\n loop(it, currentCounter)\n }\n }\n\n loop(0, 0)\n\n result.forEach {\n println(it)\n }\n}\n\n@Suppress(\"MemberVisibilityCanBePrivate\")\nprivate object D {\n private const val zeroCode = '0'.toInt()\n private const val nineCode = '9'.toInt()\n\n class FastScanner {\n private val `in`: InputStream = System.`in`\n private val buffer = ByteArray(1024)\n private var ptr = 0\n private var buflen = 0\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n\n private fun readByte(): Int {\n return if (hasNextByte()) buffer[ptr++].toInt() else -1\n }\n\n operator fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n operator fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n\n return buildString {\n var b = readByte()\n\n while (isPrintableChar(b)) {\n appendCodePoint(b)\n b = readByte()\n }\n }\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByte()\n\n if (b == '-'.toInt()) {\n minus = true\n b = readByte()\n }\n\n if (b !in zeroCode..nineCode) {\n throw NumberFormatException()\n }\n\n while (true) {\n if (b in zeroCode..nineCode) {\n n *= 10\n n += b - zeroCode.toLong()\n } else if (b == -1 || !isPrintableChar(b)) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl < Int.MIN_VALUE || nl > Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun nextDouble(): Double {\n return next().toDouble()\n }\n\n fun readIntArray(n: Int): IntArray {\n val arr = IntArray(n)\n\n for (i in 0 until n) {\n arr[i] = nextInt()\n }\n\n return arr\n }\n\n fun readBigInt(capacity: Int): IntArray {\n if (!hasNext()) throw NoSuchElementException()\n\n val arr = IntArray(capacity)\n var len = 0\n arr[0] = readByte() - zeroCode\n while (arr[len] in 0..9) {\n len++\n arr[len] = readByte() - zeroCode\n }\n\n return arr.sliceArray(0 until len)\n }\n\n companion object {\n private fun isPrintableChar(c: Int): Boolean {\n return c in 33..126\n }\n }\n }\n\n class BitSet(capacity: Int) {\n val bitset = java.util.BitSet(capacity)\n\n val cardinality: Int\n get() = bitset.cardinality()\n\n override fun equals(other: Any?) = (other as? BitSet)?.let { it.bitset == bitset } ?: false\n\n operator fun set(n: Int, f: Boolean) {\n if (f) {\n bitset.set(n)\n } else {\n bitset.clear(n)\n }\n }\n\n operator fun get(n: Int) = bitset[n]\n\n fun trueIterator(startIndex: Int = 0) = object: IntIterator() {\n var nextPos = bitset.nextSetBit(startIndex)\n\n override fun hasNext() = nextPos in 0 until Int.MAX_VALUE\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.nextSetBit(nextPos + 1)\n return value\n }\n }\n\n fun falseIterator(startIndex: Int = 0) = object: IntIterator() {\n var nextPos = bitset.nextClearBit(startIndex)\n\n override fun hasNext() = nextPos in 0 until Int.MAX_VALUE\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.nextClearBit(nextPos + 1)\n return value\n }\n }\n\n fun trueIteratorReversed(startIndex: Int = bitset.length() - 1) = object: IntIterator() {\n var nextPos = bitset.previousSetBit(startIndex)\n\n override fun hasNext() = nextPos >= 0\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.previousSetBit(nextPos - 1)\n return value\n }\n }\n\n fun falseIteratorReversed(startIndex: Int = bitset.length() - 1) = object: IntIterator() {\n var nextPos = bitset.previousClearBit(startIndex)\n\n override fun hasNext() = nextPos >= 0\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.previousClearBit(nextPos - 1)\n return value\n }\n }\n\n fun and(other: BitSet) {\n bitset.and(other.bitset)\n }\n\n fun or(other: BitSet) {\n bitset.or(other.bitset)\n }\n\n fun xor(other: BitSet) {\n bitset.xor(other.bitset)\n }\n\n fun andNot(other: BitSet) {\n bitset.andNot(other.bitset)\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1589624524, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s814366391.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s814366391", "user_id": "u996672406"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "@file:Suppress(\"DuplicatedCode\")\n\nimport java.io.IOException\nimport java.io.InputStream\nimport java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) {\n PrintWriter(System.out).use { out ->\n D.solve(D.FastScanner(), out)\n out.flush()\n }\n}\n\nprivate fun D.solve(sc: D.FastScanner, out: PrintWriter) {\n val n = sc.nextInt()\n val q = sc.nextInt()\n\n val nodeList = Array(n) { D.BitSet(n) }\n repeat(n - 1) {\n val a = sc.nextInt() - 1\n val b = sc.nextInt() - 1\n nodeList[a][b] = true\n nodeList[b][a] = true\n }\n\n val counter = IntArray(n)\n repeat(q) {\n val index = sc.nextInt() - 1\n counter[index] += sc.nextInt()\n }\n\n val result = IntArray(n)\n val visited = D.BitSet(n)\n fun loop(currentIndex: Int, point: Int) {\n val currentCounter = point + counter[currentIndex]\n result[currentIndex] = currentCounter\n\n if (nodeList[currentIndex].cardinality == 0) {\n return\n }\n\n visited[currentIndex] = true\n\n nodeList[currentIndex].trueIterator(0).forEach {\n if (visited[it]) return@forEach\n loop(it, currentCounter)\n }\n }\n\n loop(0, 0)\n\n result.forEach {\n println(it)\n }\n}\n\n@Suppress(\"MemberVisibilityCanBePrivate\")\nprivate object D {\n private const val zeroCode = '0'.toInt()\n private const val nineCode = '9'.toInt()\n\n class FastScanner {\n private val `in`: InputStream = System.`in`\n private val buffer = ByteArray(1024)\n private var ptr = 0\n private var buflen = 0\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n\n private fun readByte(): Int {\n return if (hasNextByte()) buffer[ptr++].toInt() else -1\n }\n\n operator fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n operator fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n\n return buildString {\n var b = readByte()\n\n while (isPrintableChar(b)) {\n appendCodePoint(b)\n b = readByte()\n }\n }\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByte()\n\n if (b == '-'.toInt()) {\n minus = true\n b = readByte()\n }\n\n if (b !in zeroCode..nineCode) {\n throw NumberFormatException()\n }\n\n while (true) {\n if (b in zeroCode..nineCode) {\n n *= 10\n n += b - zeroCode.toLong()\n } else if (b == -1 || !isPrintableChar(b)) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl < Int.MIN_VALUE || nl > Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun nextDouble(): Double {\n return next().toDouble()\n }\n\n fun readIntArray(n: Int): IntArray {\n val arr = IntArray(n)\n\n for (i in 0 until n) {\n arr[i] = nextInt()\n }\n\n return arr\n }\n\n fun readBigInt(capacity: Int): IntArray {\n if (!hasNext()) throw NoSuchElementException()\n\n val arr = IntArray(capacity)\n var len = 0\n arr[0] = readByte() - zeroCode\n while (arr[len] in 0..9) {\n len++\n arr[len] = readByte() - zeroCode\n }\n\n return arr.sliceArray(0 until len)\n }\n\n companion object {\n private fun isPrintableChar(c: Int): Boolean {\n return c in 33..126\n }\n }\n }\n\n class BitSet(capacity: Int) {\n val bitset = java.util.BitSet(capacity)\n\n val cardinality: Int\n get() = bitset.cardinality()\n\n override fun equals(other: Any?) = (other as? BitSet)?.let { it.bitset == bitset } ?: false\n\n operator fun set(n: Int, f: Boolean) {\n if (f) {\n bitset.set(n)\n } else {\n bitset.clear(n)\n }\n }\n\n operator fun get(n: Int) = bitset[n]\n\n fun trueIterator(startIndex: Int = 0) = object: IntIterator() {\n var nextPos = bitset.nextSetBit(startIndex)\n\n override fun hasNext() = nextPos in 0 until Int.MAX_VALUE\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.nextSetBit(nextPos + 1)\n return value\n }\n }\n\n fun falseIterator(startIndex: Int = 0) = object: IntIterator() {\n var nextPos = bitset.nextClearBit(startIndex)\n\n override fun hasNext() = nextPos in 0 until Int.MAX_VALUE\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.nextClearBit(nextPos + 1)\n return value\n }\n }\n\n fun trueIteratorReversed(startIndex: Int = bitset.length() - 1) = object: IntIterator() {\n var nextPos = bitset.previousSetBit(startIndex)\n\n override fun hasNext() = nextPos >= 0\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.previousSetBit(nextPos - 1)\n return value\n }\n }\n\n fun falseIteratorReversed(startIndex: Int = bitset.length() - 1) = object: IntIterator() {\n var nextPos = bitset.previousClearBit(startIndex)\n\n override fun hasNext() = nextPos >= 0\n\n override fun nextInt(): Int {\n val value = nextPos\n nextPos = bitset.previousClearBit(nextPos - 1)\n return value\n }\n }\n\n fun and(other: BitSet) {\n bitset.and(other.bitset)\n }\n\n fun or(other: BitSet) {\n bitset.or(other.bitset)\n }\n\n fun xor(other: BitSet) {\n bitset.xor(other.bitset)\n }\n\n fun andNot(other: BitSet) {\n bitset.andNot(other.bitset)\n }\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6902, "cpu_time_ms": 440, "memory_kb": 301180}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s803748317", "group_id": "codeNet:p02936", "input_text": "import java.io.PrintWriter\n\nfun main(args: Array) = Thread(null, ::abc138d_test, \"\", 64 * 1024 * 1024).start()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc138d_test() {\n\n val pw = PrintWriter(System.out)\n\n val (n, q) = readLine()!!.split(' ').map { it.toInt() }\n\n val paths = Array(n) { java.util.ArrayDeque() }\n val values = IntArray(n) { 0 }\n\n repeat(n - 1) {\n val line = readLine()!!.split(' ').map { it.toInt() }\n paths[line[0] - 1].add(line[1] - 1)\n paths[line[1] - 1].add(line[0] - 1)\n }\n\n repeat(q) {\n val line = readLine()!!.split(' ').map { it.toInt() }\n values[line[0] - 1] += line[1]\n }\n val visited = BooleanArray(n) { false }\n\n fun dfs(i: Int) {\n visited[i] = true\n\n repeat(paths[i].size) {\n val index = paths[i].poll()\n if (!visited[index]) {\n values[index] += values[i]\n dfs(index)\n }\n }\n }\n\n dfs(0)\n\n pw.print(values[0])\n values.drop(1).forEach {\n pw.print(\" $it\")\n }\n\n pw.println()\n pw.flush()\n}\n", "language": "Kotlin", "metadata": {"date": 1589434656, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s803748317.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s803748317", "user_id": "u139478771"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun main(args: Array) = Thread(null, ::abc138d_test, \"\", 64 * 1024 * 1024).start()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc138d_test() {\n\n val pw = PrintWriter(System.out)\n\n val (n, q) = readLine()!!.split(' ').map { it.toInt() }\n\n val paths = Array(n) { java.util.ArrayDeque() }\n val values = IntArray(n) { 0 }\n\n repeat(n - 1) {\n val line = readLine()!!.split(' ').map { it.toInt() }\n paths[line[0] - 1].add(line[1] - 1)\n paths[line[1] - 1].add(line[0] - 1)\n }\n\n repeat(q) {\n val line = readLine()!!.split(' ').map { it.toInt() }\n values[line[0] - 1] += line[1]\n }\n val visited = BooleanArray(n) { false }\n\n fun dfs(i: Int) {\n visited[i] = true\n\n repeat(paths[i].size) {\n val index = paths[i].poll()\n if (!visited[index]) {\n values[index] += values[i]\n dfs(index)\n }\n }\n }\n\n dfs(0)\n\n pw.print(values[0])\n values.drop(1).forEach {\n pw.print(\" $it\")\n }\n\n pw.println()\n pw.flush()\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1104, "cpu_time_ms": 1928, "memory_kb": 139276}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s554631771", "group_id": "codeNet:p02936", "input_text": "import java.io.PrintWriter\n\nfun main() = abc138d()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc138d() = IO_abc138d().exec {\n val (n, q) = readLine()!!.split(' ').map { it.toInt() }\n\n val paths = Array(n) { mutableSetOf() }\n val values = IntArray(n)\n\n repeat(n - 1) {\n val (a, b) = readLine()!!.split(' ').map { it.toInt() - 1 }\n paths[a].add(b)\n paths[b].add(a)\n }\n\n repeat(q) {\n val (p, x) = readLine()!!.split(' ').map { it.toInt() }\n values[p - 1] += x\n }\n\n val visited = mutableSetOf(0)\n\n fun dfs(i: Int) {\n paths[i].filter { visited.add(it) }.forEach {\n values[it] += values[i]\n dfs(it)\n }\n }\n\n dfs(0)\n\n val answer = values.joinToString(\" \")\n\n println(answer)\n}\n\n//region\n@Suppress(\"unused\", \"ClassName\", \"SpellCheckingInspection\", \"ConvertToStringTemplate\")\nprivate class IO_abc138d {\n private val input = System.`in`\n private val buffer = ByteArray(1024)\n private var pointer = 0\n private var bufferLength = 0\n private val pw = PrintWriter(System.out)\n private fun Byte.isPrintable() = this in 33..126\n private fun Byte.isNumeric() = this in '0'.toByte()..'9'.toByte()\n private fun Byte.toNumVal() =\n if (this.isNumeric()) this - '0'.toByte() else error(this.toString() + \" is not numeric\")\n\n private fun hasNextByte(): Boolean {\n return if (pointer < bufferLength) true else {\n pointer = 0\n bufferLength = input.read(buffer)\n bufferLength > 0\n }\n }\n\n private fun readByte(): Byte = if (hasNextByte()) buffer[pointer++] else -1\n private fun skipUnprintable() = run { while (hasNextByte() && !buffer[pointer].isPrintable()) pointer++ }\n private fun hasNext(): Boolean = run { skipUnprintable() }.run { hasNextByte() }\n private fun hasNextOrError() = if (!hasNext()) error(\"has no next element.\") else Unit\n\n fun readString(): String {\n hasNextOrError()\n val sb = StringBuilder()\n var b = readByte()\n while (b.isPrintable()) {\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun readLong(): Long {\n hasNextOrError()\n var n = 0L\n var negative = false\n var b = readByte()\n if (b == '-'.toByte()) {\n negative = true\n b = readByte()\n }\n if (!b.isNumeric()) error(b.toString() + \" is not numeric.\")\n while (true) {\n when {\n b.isNumeric() -> n = n * 10 + b.toNumVal()\n b.toInt() == -1 || !b.isPrintable() -> return if (negative) -n else n\n else -> error(\"failed to parse. [n=\" + n + \", b=\" + b + \"]\")\n }\n b = readByte()\n }\n }\n\n fun readInt() = readLong()\n .let { if (it in Int.MIN_VALUE..Int.MAX_VALUE) it.toInt() else error(it.toString() + \" is not in range of Int.\") }\n\n fun readDouble(): Double {\n var n = 0.0\n var div = 1.0\n var negative = false\n var b = readByte()\n if (b == '-'.toByte()) {\n negative = true\n b = readByte()\n }\n do n = n * 10 + b.toNumVal()\n while (run { b = readByte() }.run { b.isNumeric() })\n if (b == '.'.toByte()) {\n while (run { b = readByte() }.run { b.isNumeric() })\n n += b.toNumVal() / (run { div *= 10 }.run { div })\n }\n return if (negative) -n else n\n }\n\n fun readStringList(size: Int) = readList(size) { readString() }\n fun readIntList(size: Int) = readList(size) { readInt() }\n fun readLongList(size: Int) = readList(size) { readLong() }\n fun readDoubleList(size: Int) = readList(size) { readDouble() }\n fun readIntArray(size: Int) = IntArray(size) { readInt() }\n fun readLongArray(size: Int) = LongArray(size) { readLong() }\n fun readDoubleArray(size: Int) = DoubleArray(size) { readDouble() }\n inline fun readArray(size: Int, init: () -> T) = Array(size) { init() }\n inline fun readList(size: Int, init: () -> T) = List(size) { init() }\n fun println() = pw.println()\n fun print(o: Any?) = pw.print(o)\n fun println(o: Any?) = pw.println(o)\n fun exec(code: IO_abc138d.() -> Unit) = run { code() }.run { pw.flush() }\n}\n// endregion\n", "language": "Kotlin", "metadata": {"date": 1589430015, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s554631771.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s554631771", "user_id": "u139478771"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun main() = abc138d()\n\n@OptIn(ExperimentalStdlibApi::class)\nfun abc138d() = IO_abc138d().exec {\n val (n, q) = readLine()!!.split(' ').map { it.toInt() }\n\n val paths = Array(n) { mutableSetOf() }\n val values = IntArray(n)\n\n repeat(n - 1) {\n val (a, b) = readLine()!!.split(' ').map { it.toInt() - 1 }\n paths[a].add(b)\n paths[b].add(a)\n }\n\n repeat(q) {\n val (p, x) = readLine()!!.split(' ').map { it.toInt() }\n values[p - 1] += x\n }\n\n val visited = mutableSetOf(0)\n\n fun dfs(i: Int) {\n paths[i].filter { visited.add(it) }.forEach {\n values[it] += values[i]\n dfs(it)\n }\n }\n\n dfs(0)\n\n val answer = values.joinToString(\" \")\n\n println(answer)\n}\n\n//region\n@Suppress(\"unused\", \"ClassName\", \"SpellCheckingInspection\", \"ConvertToStringTemplate\")\nprivate class IO_abc138d {\n private val input = System.`in`\n private val buffer = ByteArray(1024)\n private var pointer = 0\n private var bufferLength = 0\n private val pw = PrintWriter(System.out)\n private fun Byte.isPrintable() = this in 33..126\n private fun Byte.isNumeric() = this in '0'.toByte()..'9'.toByte()\n private fun Byte.toNumVal() =\n if (this.isNumeric()) this - '0'.toByte() else error(this.toString() + \" is not numeric\")\n\n private fun hasNextByte(): Boolean {\n return if (pointer < bufferLength) true else {\n pointer = 0\n bufferLength = input.read(buffer)\n bufferLength > 0\n }\n }\n\n private fun readByte(): Byte = if (hasNextByte()) buffer[pointer++] else -1\n private fun skipUnprintable() = run { while (hasNextByte() && !buffer[pointer].isPrintable()) pointer++ }\n private fun hasNext(): Boolean = run { skipUnprintable() }.run { hasNextByte() }\n private fun hasNextOrError() = if (!hasNext()) error(\"has no next element.\") else Unit\n\n fun readString(): String {\n hasNextOrError()\n val sb = StringBuilder()\n var b = readByte()\n while (b.isPrintable()) {\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun readLong(): Long {\n hasNextOrError()\n var n = 0L\n var negative = false\n var b = readByte()\n if (b == '-'.toByte()) {\n negative = true\n b = readByte()\n }\n if (!b.isNumeric()) error(b.toString() + \" is not numeric.\")\n while (true) {\n when {\n b.isNumeric() -> n = n * 10 + b.toNumVal()\n b.toInt() == -1 || !b.isPrintable() -> return if (negative) -n else n\n else -> error(\"failed to parse. [n=\" + n + \", b=\" + b + \"]\")\n }\n b = readByte()\n }\n }\n\n fun readInt() = readLong()\n .let { if (it in Int.MIN_VALUE..Int.MAX_VALUE) it.toInt() else error(it.toString() + \" is not in range of Int.\") }\n\n fun readDouble(): Double {\n var n = 0.0\n var div = 1.0\n var negative = false\n var b = readByte()\n if (b == '-'.toByte()) {\n negative = true\n b = readByte()\n }\n do n = n * 10 + b.toNumVal()\n while (run { b = readByte() }.run { b.isNumeric() })\n if (b == '.'.toByte()) {\n while (run { b = readByte() }.run { b.isNumeric() })\n n += b.toNumVal() / (run { div *= 10 }.run { div })\n }\n return if (negative) -n else n\n }\n\n fun readStringList(size: Int) = readList(size) { readString() }\n fun readIntList(size: Int) = readList(size) { readInt() }\n fun readLongList(size: Int) = readList(size) { readLong() }\n fun readDoubleList(size: Int) = readList(size) { readDouble() }\n fun readIntArray(size: Int) = IntArray(size) { readInt() }\n fun readLongArray(size: Int) = LongArray(size) { readLong() }\n fun readDoubleArray(size: Int) = DoubleArray(size) { readDouble() }\n inline fun readArray(size: Int, init: () -> T) = Array(size) { init() }\n inline fun readList(size: Int, init: () -> T) = List(size) { init() }\n fun println() = pw.println()\n fun print(o: Any?) = pw.print(o)\n fun println(o: Any?) = pw.println(o)\n fun exec(code: IO_abc138d.() -> Unit) = run { code() }.run { pw.flush() }\n}\n// endregion\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4341, "cpu_time_ms": 1996, "memory_kb": 149172}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s265769540", "group_id": "codeNet:p02936", "input_text": "import java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) {\n abc138d()\n}\n\nfun abc138d() {\n val pw = PrintWriter(System.out)\n\n val (n, q) = readLine()!!.split(' ').map { it.toInt() }\n\n val paths = Array(n) { ArrayDeque() }\n val values = IntArray(n) { 0 }\n\n repeat(n - 1) {\n val line = readLine()!!.split(' ').map { it.toInt() }\n paths[line[0] - 1].add(line[1] - 1)\n paths[line[1] - 1].add(line[0] - 1)\n }\n\n repeat(q) {\n val line = readLine()!!.split(' ').map { it.toInt() }\n values[line[0] - 1] += line[1]\n }\n\n val visited = BooleanArray(n) { false }\n\n fun dfs(i: Int) {\n visited[i] = true\n\n repeat(paths[i].size) {\n val index = paths[i].poll()\n if (!visited[index]) {\n values[index] += values[i]\n dfs(index)\n }\n }\n }\n\n dfs(0)\n\n val answer = values.joinToString(\" \") { it.toString() }\n\n pw.println(answer)\n pw.flush()\n}\n", "language": "Kotlin", "metadata": {"date": 1589428939, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s265769540.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s265769540", "user_id": "u139478771"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) {\n abc138d()\n}\n\nfun abc138d() {\n val pw = PrintWriter(System.out)\n\n val (n, q) = readLine()!!.split(' ').map { it.toInt() }\n\n val paths = Array(n) { ArrayDeque() }\n val values = IntArray(n) { 0 }\n\n repeat(n - 1) {\n val line = readLine()!!.split(' ').map { it.toInt() }\n paths[line[0] - 1].add(line[1] - 1)\n paths[line[1] - 1].add(line[0] - 1)\n }\n\n repeat(q) {\n val line = readLine()!!.split(' ').map { it.toInt() }\n values[line[0] - 1] += line[1]\n }\n\n val visited = BooleanArray(n) { false }\n\n fun dfs(i: Int) {\n visited[i] = true\n\n repeat(paths[i].size) {\n val index = paths[i].poll()\n if (!visited[index]) {\n values[index] += values[i]\n dfs(index)\n }\n }\n }\n\n dfs(0)\n\n val answer = values.joinToString(\" \") { it.toString() }\n\n pw.println(answer)\n pw.flush()\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1010, "cpu_time_ms": 1700, "memory_kb": 101712}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s772557204", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args: Array) {\n Thread.setDefaultUncaughtExceptionHandler { t, e -> System.exit(1) }\n Thread(null, {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n }, \"\", 256 * 1024 * 1024).start()\n}\n\nobject Problem {\n lateinit var dfs: (Int, Int) -> Unit\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val Q = sc.next().toInt()\n\n val to = Array(N + 2) { mutableListOf() }\n repeat(N - 1) {\n val a = sc.next().toInt()\n val b = sc.next().toInt()\n to[b].add(a)\n to[a].add(b)\n }\n\n val ans = LongArray(N + 2) { 0L }\n repeat(Q) {\n val p = sc.next().toInt()\n val x = sc.next().toLong()\n ans[p] += x\n }\n\n dfs = { v: Int, p: Int ->\n to[v].forEach { u ->\n if (u != p) {\n ans[u] += ans[v]\n dfs(u, v)\n }\n }\n }\n dfs(1, 0)\n\n pw.println((1..N).map { ans[it] }.joinToString(\" \"))\n }\n}", "language": "Kotlin", "metadata": {"date": 1587862191, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s772557204.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s772557204", "user_id": "u297767059"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n Thread.setDefaultUncaughtExceptionHandler { t, e -> System.exit(1) }\n Thread(null, {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n }, \"\", 256 * 1024 * 1024).start()\n}\n\nobject Problem {\n lateinit var dfs: (Int, Int) -> Unit\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val Q = sc.next().toInt()\n\n val to = Array(N + 2) { mutableListOf() }\n repeat(N - 1) {\n val a = sc.next().toInt()\n val b = sc.next().toInt()\n to[b].add(a)\n to[a].add(b)\n }\n\n val ans = LongArray(N + 2) { 0L }\n repeat(Q) {\n val p = sc.next().toInt()\n val x = sc.next().toLong()\n ans[p] += x\n }\n\n dfs = { v: Int, p: Int ->\n to[v].forEach { u ->\n if (u != p) {\n ans[u] += ans[v]\n dfs(u, v)\n }\n }\n }\n dfs(1, 0)\n\n pw.println((1..N).map { ans[it] }.joinToString(\" \"))\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1166, "cpu_time_ms": 2111, "memory_kb": 164616}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s767087300", "group_id": "codeNet:p02936", "input_text": "\ndata class Edge(val to: Int)\n\nfun main(arg: Array) {\n\n val (N, Q) = readLine()!!.split(\" \").map { it.toInt() }\n\n val parents = IntArray(N)\n val neighbors = Array(N){ mutableListOf()}\n val points = LongArray(N){0}\n\n repeat(N-1){\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n parents[b-1] = a-1\n neighbors[a-1].add(Edge(b-1))\n neighbors[b-1].add(Edge(a-1))\n }\n\n repeat(Q){\n val (p, x ) = readLine()!!.split(\" \" ).map { it.toInt() }\n points[p-1] = points[p-1] + x\n }\n\n\n val seen = BooleanArray(N){false}\n\n fun dfs(i: Int, point: Long){\n seen[i] = true\n points[i] = points[i] + point\n\n for(j in neighbors[i]){\n if(!seen[j.to]){\n dfs(j.to, points[i])\n }\n }\n }\n dfs(0,0)\n\n print(points.joinToString(\" \"))\n\n\n\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n//data class Edge(val to: Int)\n//\n//fun main(args: Array) {\n// val (N, Q) = readLine()!!.split(\" \").map {it.toInt()}\n//\n// var parent = IntArray(N)\n// var points = LongArray(N)\n// var neighbors = Array(N){ mutableListOf()}\n// repeat(N-1){\n// val (a,b) = readLine()!!.split(\" \").map { it.toInt() }\n//// parent[b-1] = a-1\n// neighbors[a-1].add(Edge(b-1))\n// neighbors[b-1].add(Edge(a-1))\n// }\n//\n// repeat(Q){\n// val (p,x) = readLine()!!.split(\" \").map { it.toInt() }\n// points[p-1] = points[p-1]+ x\n// }\n//\n// val queue = ArrayDeque(N)\n// val seen = BooleanArray(N)\n//\n// queue.addLast(0)\n// while (queue.isNotEmpty()){\n// val current = queue.removeFirst()\n// for(e in neighbors[current]){\n// if(seen[e.to]){\n// continue\n// }\n// points[e.to] += points[current]\n// queue.addLast(e.to)\n// }\n// seen[current] = true\n//\n// }\n//\n// print(points.joinToString(\" \"))\n//\n//}\n", "language": "Kotlin", "metadata": {"date": 1587637421, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s767087300.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s767087300", "user_id": "u049930986"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "\ndata class Edge(val to: Int)\n\nfun main(arg: Array) {\n\n val (N, Q) = readLine()!!.split(\" \").map { it.toInt() }\n\n val parents = IntArray(N)\n val neighbors = Array(N){ mutableListOf()}\n val points = LongArray(N){0}\n\n repeat(N-1){\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n parents[b-1] = a-1\n neighbors[a-1].add(Edge(b-1))\n neighbors[b-1].add(Edge(a-1))\n }\n\n repeat(Q){\n val (p, x ) = readLine()!!.split(\" \" ).map { it.toInt() }\n points[p-1] = points[p-1] + x\n }\n\n\n val seen = BooleanArray(N){false}\n\n fun dfs(i: Int, point: Long){\n seen[i] = true\n points[i] = points[i] + point\n\n for(j in neighbors[i]){\n if(!seen[j.to]){\n dfs(j.to, points[i])\n }\n }\n }\n dfs(0,0)\n\n print(points.joinToString(\" \"))\n\n\n\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n//data class Edge(val to: Int)\n//\n//fun main(args: Array) {\n// val (N, Q) = readLine()!!.split(\" \").map {it.toInt()}\n//\n// var parent = IntArray(N)\n// var points = LongArray(N)\n// var neighbors = Array(N){ mutableListOf()}\n// repeat(N-1){\n// val (a,b) = readLine()!!.split(\" \").map { it.toInt() }\n//// parent[b-1] = a-1\n// neighbors[a-1].add(Edge(b-1))\n// neighbors[b-1].add(Edge(a-1))\n// }\n//\n// repeat(Q){\n// val (p,x) = readLine()!!.split(\" \").map { it.toInt() }\n// points[p-1] = points[p-1]+ x\n// }\n//\n// val queue = ArrayDeque(N)\n// val seen = BooleanArray(N)\n//\n// queue.addLast(0)\n// while (queue.isNotEmpty()){\n// val current = queue.removeFirst()\n// for(e in neighbors[current]){\n// if(seen[e.to]){\n// continue\n// }\n// points[e.to] += points[current]\n// queue.addLast(e.to)\n// }\n// seen[current] = true\n//\n// }\n//\n// print(points.joinToString(\" \"))\n//\n//}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1959, "cpu_time_ms": 2111, "memory_kb": 159952}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s737877685", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args: Array) {\n Thread(null, {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n }, \"\", 256 * 1024 * 1024).start()\n}\n\nobject Problem {\n lateinit var dfs: (Int, Int) -> Unit\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val Q = sc.next().toInt()\n\n val to = Array(N + 2) { mutableListOf() }\n repeat(N - 1) {\n val a = sc.next().toInt()\n val b = sc.next().toInt()\n to[b].add(a)\n to[a].add(b)\n }\n\n val ans = LongArray(N + 2) { 0L }\n repeat(Q) {\n val p = sc.next().toInt()\n val x = sc.next().toLong()\n ans[p] += x\n }\n\n dfs = { v: Int, p: Int ->\n to[v].forEach { u ->\n if (u != p) {\n ans[u] += ans[v]\n dfs(u, v)\n }\n }\n }\n dfs(1, 0)\n\n pw.println((1..N).map { ans[it] }.joinToString(\" \"))\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1587519358, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s737877685.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s737877685", "user_id": "u297767059"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n Thread(null, {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n }, \"\", 256 * 1024 * 1024).start()\n}\n\nobject Problem {\n lateinit var dfs: (Int, Int) -> Unit\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val Q = sc.next().toInt()\n\n val to = Array(N + 2) { mutableListOf() }\n repeat(N - 1) {\n val a = sc.next().toInt()\n val b = sc.next().toInt()\n to[b].add(a)\n to[a].add(b)\n }\n\n val ans = LongArray(N + 2) { 0L }\n repeat(Q) {\n val p = sc.next().toInt()\n val x = sc.next().toLong()\n ans[p] += x\n }\n\n dfs = { v: Int, p: Int ->\n to[v].forEach { u ->\n if (u != p) {\n ans[u] += ans[v]\n dfs(u, v)\n }\n }\n }\n dfs(1, 0)\n\n pw.println((1..N).map { ans[it] }.joinToString(\" \"))\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1094, "cpu_time_ms": 2111, "memory_kb": 164312}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s692400316", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args: Array) {\n Thread(null, {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n }, \"\", 16 * 1024 * 1024).start()\n}\n\nobject Problem {\n lateinit var dfs: (Int, Int) -> Unit\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val Q = sc.next().toInt()\n\n val to = Array(N + 2) { mutableListOf() }\n repeat(N - 1) {\n val a = sc.next().toInt()\n val b = sc.next().toInt()\n to[b].add(a)\n to[a].add(b)\n }\n\n val ans = IntArray(N + 2) { 0 }\n repeat(Q) {\n val p = sc.next().toInt()\n val x = sc.next().toInt()\n ans[p] += x\n }\n\n dfs = { v: Int, p: Int ->\n to[v].forEach { u ->\n if (u != p) {\n ans[u] += ans[v]\n dfs(u, v)\n }\n }\n }\n try {\n dfs(1, 0)\n } catch (e: StackOverflowError) {\n ans[300000] = 10\n }\n\n pw.println((1..N).map { ans[it] }.joinToString(\" \"))\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1587518937, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s692400316.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s692400316", "user_id": "u297767059"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n Thread(null, {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n }, \"\", 16 * 1024 * 1024).start()\n}\n\nobject Problem {\n lateinit var dfs: (Int, Int) -> Unit\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val Q = sc.next().toInt()\n\n val to = Array(N + 2) { mutableListOf() }\n repeat(N - 1) {\n val a = sc.next().toInt()\n val b = sc.next().toInt()\n to[b].add(a)\n to[a].add(b)\n }\n\n val ans = IntArray(N + 2) { 0 }\n repeat(Q) {\n val p = sc.next().toInt()\n val x = sc.next().toInt()\n ans[p] += x\n }\n\n dfs = { v: Int, p: Int ->\n to[v].forEach { u ->\n if (u != p) {\n ans[u] += ans[v]\n dfs(u, v)\n }\n }\n }\n try {\n dfs(1, 0)\n } catch (e: StackOverflowError) {\n ans[300000] = 10\n }\n\n pw.println((1..N).map { ans[it] }.joinToString(\" \"))\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1189, "cpu_time_ms": 1801, "memory_kb": 161612}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s981833475", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n try {\n Problem.solve(Scanner(System.`in`), pw)\n } catch (e: StackOverflowError) {\n pw.println(\"ERROR\")\n }\n pw.flush()\n}\n\nobject Problem {\n lateinit var dfs: (Int, Int) -> Unit\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val Q = sc.next().toInt()\n\n val to = Array(N + 2) { mutableListOf() }\n repeat(N - 1) {\n val a = sc.next().toInt()\n val b = sc.next().toInt()\n to[b].add(a)\n to[a].add(b)\n }\n\n val ans = IntArray(N + 2) { 0 }\n repeat(Q) {\n val p = sc.next().toInt()\n val x = sc.next().toInt()\n ans[p] += x\n }\n\n dfs = { v: Int, p: Int ->\n to[v].forEach { u ->\n if (u != p) {\n ans[u] += ans[v]\n dfs(u, v)\n }\n }\n }\n try {\n dfs(1, 0)\n } catch (e: StackOverflowError) {\n ans[300000] = 10\n }\n\n pw.println((1..N).map { ans[it] }.joinToString(\" \"))\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1587518851, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s981833475.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s981833475", "user_id": "u297767059"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n try {\n Problem.solve(Scanner(System.`in`), pw)\n } catch (e: StackOverflowError) {\n pw.println(\"ERROR\")\n }\n pw.flush()\n}\n\nobject Problem {\n lateinit var dfs: (Int, Int) -> Unit\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val Q = sc.next().toInt()\n\n val to = Array(N + 2) { mutableListOf() }\n repeat(N - 1) {\n val a = sc.next().toInt()\n val b = sc.next().toInt()\n to[b].add(a)\n to[a].add(b)\n }\n\n val ans = IntArray(N + 2) { 0 }\n repeat(Q) {\n val p = sc.next().toInt()\n val x = sc.next().toInt()\n ans[p] += x\n }\n\n dfs = { v: Int, p: Int ->\n to[v].forEach { u ->\n if (u != p) {\n ans[u] += ans[v]\n dfs(u, v)\n }\n }\n }\n try {\n dfs(1, 0)\n } catch (e: StackOverflowError) {\n ans[300000] = 10\n }\n\n pw.println((1..N).map { ans[it] }.joinToString(\" \"))\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1207, "cpu_time_ms": 2111, "memory_kb": 164988}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s170427669", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nvar seen: BooleanArray = BooleanArray(0)\nvar points : LongArray = LongArray(0)\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n\n val n = sc.nextInt()\n val q = sc.nextInt()\n\n\n var map = HashMap>()\n points = LongArray(n)\n for(i in 0 until n){\n map[i] = mutableListOf()\n }\n\n for(i in 0 until n-1){\n val a = sc.nextInt() -1\n val b = sc.nextInt() -1\n map[a]!!.add(b)\n }\n\n\n for(i in 0 until q){\n val p = sc.nextInt() -1\n val x = sc.nextInt()\n seen = BooleanArray(n)\n dfs(p,x,map)\n }\n\n\n print(points.joinToString(\" \"))\n}\n\nprivate fun dfs(n: Int, point: Int, map: HashMap>){\n if(seen[n]){\n return\n }\n seen[n] = true\n points[n] = points[n] + point\n\n\n for(e in map[n]!!){\n\n if(seen[n]){\n continue\n }\n dfs(e,point,map)\n }\n}", "language": "Kotlin", "metadata": {"date": 1587429455, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s170427669.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s170427669", "user_id": "u049930986"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nvar seen: BooleanArray = BooleanArray(0)\nvar points : LongArray = LongArray(0)\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n\n val n = sc.nextInt()\n val q = sc.nextInt()\n\n\n var map = HashMap>()\n points = LongArray(n)\n for(i in 0 until n){\n map[i] = mutableListOf()\n }\n\n for(i in 0 until n-1){\n val a = sc.nextInt() -1\n val b = sc.nextInt() -1\n map[a]!!.add(b)\n }\n\n\n for(i in 0 until q){\n val p = sc.nextInt() -1\n val x = sc.nextInt()\n seen = BooleanArray(n)\n dfs(p,x,map)\n }\n\n\n print(points.joinToString(\" \"))\n}\n\nprivate fun dfs(n: Int, point: Int, map: HashMap>){\n if(seen[n]){\n return\n }\n seen[n] = true\n points[n] = points[n] + point\n\n\n for(e in map[n]!!){\n\n if(seen[n]){\n continue\n }\n dfs(e,point,map)\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 940, "cpu_time_ms": 2111, "memory_kb": 159120}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s079927268", "group_id": "codeNet:p02936", "input_text": "fun main(args: Array) {\n Problem.solve(java.util.Scanner(System.`in`))\n}\n\nobject Problem {\n lateinit var dfs: (Int, Int) -> Unit\n\n fun solve(sc: java.util.Scanner) {\n val N = sc.nextInt()\n val Q = sc.nextInt()\n\n val to = Array(N) { mutableListOf() }\n for (i in 0 until N - 1) {\n val a = sc.nextInt() - 1\n val b = sc.nextInt() - 1\n to[b].add(a)\n to[a].add(b)\n }\n\n val ans = IntArray(N) { 0 }\n for (i in 0 until Q) {\n val p = sc.nextInt() - 1\n val x = sc.nextInt()\n ans[p] += x\n }\n\n dfs = { v: Int, p: Int ->\n for (u in to[v]) {\n if (u == p) continue\n ans[u] += ans[v]\n dfs(u, v)\n }\n }\n dfs(0, -1)\n\n println((0 until N).map { ans[it] }.joinToString(\" \"))\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1585712735, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s079927268.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s079927268", "user_id": "u297767059"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "fun main(args: Array) {\n Problem.solve(java.util.Scanner(System.`in`))\n}\n\nobject Problem {\n lateinit var dfs: (Int, Int) -> Unit\n\n fun solve(sc: java.util.Scanner) {\n val N = sc.nextInt()\n val Q = sc.nextInt()\n\n val to = Array(N) { mutableListOf() }\n for (i in 0 until N - 1) {\n val a = sc.nextInt() - 1\n val b = sc.nextInt() - 1\n to[b].add(a)\n to[a].add(b)\n }\n\n val ans = IntArray(N) { 0 }\n for (i in 0 until Q) {\n val p = sc.nextInt() - 1\n val x = sc.nextInt()\n ans[p] += x\n }\n\n dfs = { v: Int, p: Int ->\n for (u in to[v]) {\n if (u == p) continue\n ans[u] += ans[v]\n dfs(u, v)\n }\n }\n dfs(0, -1)\n\n println((0 until N).map { ans[it] }.joinToString(\" \"))\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 911, "cpu_time_ms": 2111, "memory_kb": 166844}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s863279020", "group_id": "codeNet:p02936", "input_text": "fun main(args: Array) {\n solve(java.util.Scanner(System.`in`))\n}\n\nfun dfs(v: Int, p: Int, ans: IntArray, to: Array>) {\n for (u in to[v]) {\n if (u == p) continue\n ans[u] += ans[v]\n dfs(u, v, ans, to)\n }\n}\n\nfun solve(sc: java.util.Scanner) {\n val N = sc.nextInt()\n val Q = sc.nextInt()\n\n val to = Array(N) { mutableListOf() }\n for (i in 0 until N - 1) {\n val a = sc.nextInt() - 1\n val b = sc.nextInt() - 1\n to[b].add(a)\n to[a].add(b)\n }\n\n val ans = IntArray(N) { 0 }\n for (i in 0 until Q) {\n val p = sc.nextInt() - 1\n val x = sc.nextInt()\n ans[p] += x\n }\n\n dfs(0, -1, ans, to)\n\n for (i in 0 until N) {\n println(ans[i])\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1585710985, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s863279020.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s863279020", "user_id": "u297767059"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "fun main(args: Array) {\n solve(java.util.Scanner(System.`in`))\n}\n\nfun dfs(v: Int, p: Int, ans: IntArray, to: Array>) {\n for (u in to[v]) {\n if (u == p) continue\n ans[u] += ans[v]\n dfs(u, v, ans, to)\n }\n}\n\nfun solve(sc: java.util.Scanner) {\n val N = sc.nextInt()\n val Q = sc.nextInt()\n\n val to = Array(N) { mutableListOf() }\n for (i in 0 until N - 1) {\n val a = sc.nextInt() - 1\n val b = sc.nextInt() - 1\n to[b].add(a)\n to[a].add(b)\n }\n\n val ans = IntArray(N) { 0 }\n for (i in 0 until Q) {\n val p = sc.nextInt() - 1\n val x = sc.nextInt()\n ans[p] += x\n }\n\n dfs(0, -1, ans, to)\n\n for (i in 0 until N) {\n println(ans[i])\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 771, "cpu_time_ms": 2119, "memory_kb": 163740}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s958791040", "group_id": "codeNet:p02936", "input_text": "fun main(args: Array) {\n solve(java.util.Scanner(System.`in`))\n}\n\nfun solve(sc: java.util.Scanner) {\n val N = sc.nextInt()\n val Q = sc.nextInt()\n val ab = Array(N - 1) { Pair(sc.nextInt(), sc.nextInt()) }\n val px = Array(Q) { Pair(sc.nextInt(), sc.nextInt()) }\n\n val tree = Array(N) { mutableSetOf() }\n ab.forEach {\n val a = it.first - 1\n val b = it.second - 1\n tree[b].add(a)\n tree[a].add(b)\n }\n\n val count = Array(N) { 0 }\n px.forEach {\n val p = it.first - 1\n val x = it.second\n count[p] += x\n }\n\n c(0, -1, tree, count)\n\n println(count.joinToString(\" \"))\n}\n\nfun c(i: Int, prev: Int, tree: Array>, count: Array) {\n if (prev >= 0) {\n count[i] += count[prev]\n }\n tree[i].filter { it != prev }.forEach {\n c(it, i, tree, count)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1585704404, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s958791040.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s958791040", "user_id": "u297767059"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "fun main(args: Array) {\n solve(java.util.Scanner(System.`in`))\n}\n\nfun solve(sc: java.util.Scanner) {\n val N = sc.nextInt()\n val Q = sc.nextInt()\n val ab = Array(N - 1) { Pair(sc.nextInt(), sc.nextInt()) }\n val px = Array(Q) { Pair(sc.nextInt(), sc.nextInt()) }\n\n val tree = Array(N) { mutableSetOf() }\n ab.forEach {\n val a = it.first - 1\n val b = it.second - 1\n tree[b].add(a)\n tree[a].add(b)\n }\n\n val count = Array(N) { 0 }\n px.forEach {\n val p = it.first - 1\n val x = it.second\n count[p] += x\n }\n\n c(0, -1, tree, count)\n\n println(count.joinToString(\" \"))\n}\n\nfun c(i: Int, prev: Int, tree: Array>, count: Array) {\n if (prev >= 0) {\n count[i] += count[prev]\n }\n tree[i].filter { it != prev }.forEach {\n c(it, i, tree, count)\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 878, "cpu_time_ms": 2115, "memory_kb": 222148}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s385233235", "group_id": "codeNet:p02936", "input_text": "fun main(args: Array) {\n solve(java.util.Scanner(System.`in`))\n}\n\nfun solve(sc: java.util.Scanner) {\n val N = sc.nextInt()\n val Q = sc.nextInt()\n val ab = Array(N - 1) { Pair(sc.nextInt(), sc.nextInt()) }\n val px = Array(Q) { Pair(sc.nextInt(), sc.nextInt()) }\n\n val parent = Array(N) { -1 }\n ab.forEach {\n val a = it.first - 1\n val b = it.second - 1\n parent[b] = a\n }\n\n val count = Array(N) { 0 }\n px.forEach {\n val p = it.first - 1\n val x = it.second\n count[p] += x\n }\n\n println((0 until N).map { i ->\n c(i, count, parent)\n }.joinToString(\" \"))\n}\n\nfun c(i: Int, count: Array, parent: Array): Int {\n var c = count[i]\n if (parent[i] >= 0) {\n c += c(parent[i], count, parent)\n }\n return c\n}", "language": "Kotlin", "metadata": {"date": 1585703062, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s385233235.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s385233235", "user_id": "u297767059"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "fun main(args: Array) {\n solve(java.util.Scanner(System.`in`))\n}\n\nfun solve(sc: java.util.Scanner) {\n val N = sc.nextInt()\n val Q = sc.nextInt()\n val ab = Array(N - 1) { Pair(sc.nextInt(), sc.nextInt()) }\n val px = Array(Q) { Pair(sc.nextInt(), sc.nextInt()) }\n\n val parent = Array(N) { -1 }\n ab.forEach {\n val a = it.first - 1\n val b = it.second - 1\n parent[b] = a\n }\n\n val count = Array(N) { 0 }\n px.forEach {\n val p = it.first - 1\n val x = it.second\n count[p] += x\n }\n\n println((0 until N).map { i ->\n c(i, count, parent)\n }.joinToString(\" \"))\n}\n\nfun c(i: Int, count: Array, parent: Array): Int {\n var c = count[i]\n if (parent[i] >= 0) {\n c += c(parent[i], count, parent)\n }\n return c\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 814, "cpu_time_ms": 2111, "memory_kb": 155128}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s423061075", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args : Array) {\n val (n, q) = readLine()!!.split(\" \").map { it.toInt() }\n val nodes = Array(n) { mutableSetOf() }\n val seen = mutableMapOf()\n val scores = LongArray(n) { 0L }\n val counters = LongArray(n) { 0L }\n\n repeat(n-1) {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n nodes[a-1].add(b-1)\n nodes[b-1].add(a-1)\n }\n\n repeat(q) {\n val (p, x) = readLine()!!.split(\" \").map { it.toInt() }\n scores[p-1] += x.toLong()\n }\n\n val stack = Stack()\n stack.add(0)\n\n while (stack.isNotEmpty()) {\n val idx = stack.pop()\n counters[idx] += scores[idx]\n seen[idx] = true\n\n nodes[idx].forEach {\n if (seen[it] != true) {\n stack.add(it)\n counters[it] += counters[idx]\n }\n }\n }\n\n println(counters.joinToString(separator = \" \"))\n}", "language": "Kotlin", "metadata": {"date": 1582634191, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s423061075.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s423061075", "user_id": "u262403099"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args : Array) {\n val (n, q) = readLine()!!.split(\" \").map { it.toInt() }\n val nodes = Array(n) { mutableSetOf() }\n val seen = mutableMapOf()\n val scores = LongArray(n) { 0L }\n val counters = LongArray(n) { 0L }\n\n repeat(n-1) {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n nodes[a-1].add(b-1)\n nodes[b-1].add(a-1)\n }\n\n repeat(q) {\n val (p, x) = readLine()!!.split(\" \").map { it.toInt() }\n scores[p-1] += x.toLong()\n }\n\n val stack = Stack()\n stack.add(0)\n\n while (stack.isNotEmpty()) {\n val idx = stack.pop()\n counters[idx] += scores[idx]\n seen[idx] = true\n\n nodes[idx].forEach {\n if (seen[it] != true) {\n stack.add(it)\n counters[it] += counters[idx]\n }\n }\n }\n\n println(counters.joinToString(separator = \" \"))\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 947, "cpu_time_ms": 2119, "memory_kb": 190076}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s374304870", "group_id": "codeNet:p02936", "input_text": "fun main(args: Array) {\n val (N, Q) = listOfInt()\n val Y = Array(N) { mutableListOf() }\n val C = IntArray(N)\n repeat(N - 1) {\n val (a, b) = listOfInt(-1)\n if (a > b) Y[a].add(b)\n else Y[b].add(a)\n }\n repeat(Q) {\n val (p, x) = listOfInt()\n C[p - 1] += x\n }\n for (n in 1 until N) {\n if (Y[n].size > 0) C[n] += C[Y[n].first()]\n }\n println(C.joinToString(separator = \" \"))\n}\nfun next() = readLine()!!\nfun listOfString() = next().split(\" \")\nfun listOfInt(delta: Int = 0) = listOfString().map { Integer.parseInt(it) + delta }\n", "language": "Kotlin", "metadata": {"date": 1581524816, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s374304870.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s374304870", "user_id": "u043150661"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, Q) = listOfInt()\n val Y = Array(N) { mutableListOf() }\n val C = IntArray(N)\n repeat(N - 1) {\n val (a, b) = listOfInt(-1)\n if (a > b) Y[a].add(b)\n else Y[b].add(a)\n }\n repeat(Q) {\n val (p, x) = listOfInt()\n C[p - 1] += x\n }\n for (n in 1 until N) {\n if (Y[n].size > 0) C[n] += C[Y[n].first()]\n }\n println(C.joinToString(separator = \" \"))\n}\nfun next() = readLine()!!\nfun listOfString() = next().split(\" \")\nfun listOfInt(delta: Int = 0) = listOfString().map { Integer.parseInt(it) + delta }\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 606, "cpu_time_ms": 1101, "memory_kb": 151672}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s094914660", "group_id": "codeNet:p02936", "input_text": "import java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) {\n abc138d()\n}\n\nfun abc138d() {\n val pw = PrintWriter(System.out)\n\n val (n, q) = readLine()!!.split(' ').map { it.toInt() }\n\n val paths = Array(n) { ArrayDeque(n) }\n val values = IntArray(n) { 0 }\n\n repeat(n - 1) {\n val line = readLine()!!.split(' ').map { it.toInt() }\n paths[line[0] - 1].add(line[1] - 1)\n paths[line[1] - 1].add(line[0] - 1)\n }\n\n repeat(q) {\n val line = readLine()!!.split(' ').map { it.toInt() }\n values[line[0] - 1] += line[1]\n }\n\n val visited = BooleanArray(n) { false }\n\n fun dfs(i: Int) {\n visited[i] = true\n\n repeat(paths[i].size) {\n val index = paths[i].poll()\n if (!visited[index]) {\n values[index] += values[i]\n dfs(index)\n }\n }\n }\n\n dfs(0)\n\n val answer = values.joinToString(\" \") { it.toString() }\n\n pw.println(answer)\n pw.flush()\n}\n", "language": "Kotlin", "metadata": {"date": 1573801702, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s094914660.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s094914660", "user_id": "u139478771"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) {\n abc138d()\n}\n\nfun abc138d() {\n val pw = PrintWriter(System.out)\n\n val (n, q) = readLine()!!.split(' ').map { it.toInt() }\n\n val paths = Array(n) { ArrayDeque(n) }\n val values = IntArray(n) { 0 }\n\n repeat(n - 1) {\n val line = readLine()!!.split(' ').map { it.toInt() }\n paths[line[0] - 1].add(line[1] - 1)\n paths[line[1] - 1].add(line[0] - 1)\n }\n\n repeat(q) {\n val line = readLine()!!.split(' ').map { it.toInt() }\n values[line[0] - 1] += line[1]\n }\n\n val visited = BooleanArray(n) { false }\n\n fun dfs(i: Int) {\n visited[i] = true\n\n repeat(paths[i].size) {\n val index = paths[i].poll()\n if (!visited[index]) {\n values[index] += values[i]\n dfs(index)\n }\n }\n }\n\n dfs(0)\n\n val answer = values.joinToString(\" \") { it.toString() }\n\n pw.println(answer)\n pw.flush()\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1011, "cpu_time_ms": 883, "memory_kb": 285880}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s013819788", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args: Array) {\n abc138d()\n}\n\nfun abc138d() {\n val (n, q) = readLine()!!.split(' ').map { it.toInt() }\n\n val paths = Array(n) { ArrayDeque() }\n val values = IntArray(n) { 0 }\n\n (1 until n).forEach {\n val line = readLine()!!.split(' ').map { it.toInt() }\n paths[line[0] - 1].add(line[1] - 1)\n paths[line[1] - 1].add(line[0] - 1)\n }\n\n (1..q).forEach {\n val line = readLine()!!.split(' ').map { it.toInt() }\n values[line[0] - 1] += line[1]\n }\n\n val visited = BooleanArray(n) { false }\n\n fun dfs(i: Int) {\n visited[i] = true\n\n val deque = paths[i]\n repeat(deque.size) {\n val index = deque.poll()\n if (!visited[index]) {\n values[index] += values[i]\n dfs(index)\n }\n }\n }\n\n dfs(0)\n\n val answer = values.joinToString(\" \") { it.toString() }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1573800806, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s013819788.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s013819788", "user_id": "u139478771"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n abc138d()\n}\n\nfun abc138d() {\n val (n, q) = readLine()!!.split(' ').map { it.toInt() }\n\n val paths = Array(n) { ArrayDeque() }\n val values = IntArray(n) { 0 }\n\n (1 until n).forEach {\n val line = readLine()!!.split(' ').map { it.toInt() }\n paths[line[0] - 1].add(line[1] - 1)\n paths[line[1] - 1].add(line[0] - 1)\n }\n\n (1..q).forEach {\n val line = readLine()!!.split(' ').map { it.toInt() }\n values[line[0] - 1] += line[1]\n }\n\n val visited = BooleanArray(n) { false }\n\n fun dfs(i: Int) {\n visited[i] = true\n\n val deque = paths[i]\n repeat(deque.size) {\n val index = deque.poll()\n if (!visited[index]) {\n values[index] += values[i]\n dfs(index)\n }\n }\n }\n\n dfs(0)\n\n val answer = values.joinToString(\" \") { it.toString() }\n\n println(answer)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 961, "cpu_time_ms": 2103, "memory_kb": 149684}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s645498642", "group_id": "codeNet:p02936", "input_text": "import java.util.*\nimport java.io.PrintWriter\n\n\n\nfun main(args: Array){\n\tval cin = Scanner(System.`in`)\n val cout = PrintWriter(System.`out`)\n // val n = cin.nextInt()\n // val q = cin.nextInt()\n\n val (n, q) = readLine()!!.split(\" \").map(String::toInt)\n\n val c = Array>(n, { mutableListOf() })\n\n for (i in 0..n-2) {\n val (a, b) = readLine()!!.split(\" \").map(String::toInt)\n c[a - 1].add(b - 1)\n c[b - 1].add(a - 1)\n }\n\n val has = Array(n, { 0 })\n for (i in 0..q-1) {\n // val p = cin.nextInt() - 1\n // val x = cin.nextInt()\n val (p, x) = readLine()!!.split(\" \").map(String::toInt)\n has[p - 1] += x\n }\n\n val queue : MutableList = mutableListOf(0)\n\n while (queue.size > 0) {\n val r = queue.removeAt(0)\n for (child in c[r]) {\n if (c[child].size != 0) {\n has[child] += has[r]\n queue.add(child)\n }\n }\n c[r] = mutableListOf()\n }\n\n for (i in 0..n-1) {\n cout.println(has[i])\n }\n \n cout.flush()\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nclass Point(x: Int, y: Int) : Comparable {\n val x = x\n val y = y\n \n override operator fun compareTo(other : Point) : Int {\n if (x > other.x) {\n return 1\n } else if (x < other.x) {\n return -1\n } else {\n if (y > other.y) {\n return 1\n } else if (y < other.y) {\n return -1\n } else {\n return 0\n }\n }\n }\n\n\n override fun equals(other : Any?) : Boolean {\n if (this == other) {\n return true\n }\n if (javaClass != other?.javaClass) {\n return false\n }\n other as Point\n if (x == other.x && y == other.y) {\n return true\n }\n return false\n }\n}\n\n\n\n\n\ninline fun segTree(m: Int, noinline f: (T, T)->T, noinline g: (T, E)->T, noinline h:(E, E)->E, ti: T, ei: E, ini: Array): SegTree {\n val n = cover(m)\n val ini_tree = Array(2*n - 1, { i ->\n if (i < m) {\n ini[i]\n } else {\n ti\n }\n })\n val lazy = Array(2*n - 1, { ei })\n return SegTree(n, f, g, h, ti, ei, ini_tree, lazy)\n}\n\nfun cover(m: Int): Int {\n var n = 1\n while (n < m) {\n n *= 2\n }\n return n\n}\n\nfun cover_d(m: Int): Int {\n var d = 0\n var n = 1\n while (n < m) {\n n *= 2\n d += 1\n }\n return d\n}\n\nclass SegTree (n: Int, f: (T, T)->T, g: (T, E)->T, h: (E, E)->E, ti: T, ei: E, node: Array, lazy: Array) {\n val n = n\n val f = f\n val g = g\n val h = h\n val ti = ti\n val ei = ei\n val node = node\n val lazy = lazy\n val size = node.size\n val height = cover_d(n)\n\n fun trans(i: Int): Int {\n return i + n - 1\n }\n\n fun left(i: Int): Int {\n return 2*i + 1\n }\n\n fun right(i: Int): Int {\n return 2*i + 2\n }\n\n fun parent(i: Int): Int {\n if (i == 0) {\n return -1\n }\n return (i - 1)/2\n }\n\n fun ancestor(i: Int, d: Int): Int {\n return ((i + 1) shr d) - 1\n }\n\n fun isRight(i: Int): Boolean {\n return ((i and 1) == 0)\n }\n\n fun isLeaf(i: Int): Boolean {\n return (left(i) > size)\n }\n\n fun reflect(k: Int): T {\n if (k >= size) {\n return ti\n }\n if (lazy[k] == ei) {\n return node[k]\n }\n return g(node[k], lazy[k])\n }\n\n fun eval(k: Int) {\n if (lazy[k] == ei) {\n return\n }\n if (left(k) < size) {\n lazy[left(k)] = h(lazy[left(k)], lazy[k])\n lazy[right(k)] = h(lazy[right(k)], lazy[k])\n }\n node[k] = reflect(k)\n lazy[k] = ei\n }\n\n fun thrust(k: Int) {\n // if (k > 0) {\n // thrust(parent(k))\n // }\n for (i in 0..height) {\n eval(ancestor(k, height - i))\n }\n // eval(k)\n }\n\n fun recalc(k: Int) {\n var i = parent(k)\n while (i >= 0) {\n node[i] = f(reflect(left(i)), reflect(right(i)))\n i = parent(i)\n }\n }\n\n fun update(a: Int, b: Int, x: E) {\n val l0 = trans(a)\n val r0 = trans(b)\n thrust(l0)\n thrust(r0 - 1)\n\n var l = l0\n var r = r0\n while (l < r) {\n if (isRight(l)) {\n lazy[l] = h(lazy[l], x)\n l += 1\n }\n if (isRight(r)) {\n r -= 1\n lazy[r] = h(lazy[r], x)\n }\n l = l shr 1\n r = r shr 1\n }\n recalc(l0)\n recalc(r0 - 1)\n }\n\n fun set_val(a: Int, x: T) {\n val ta = trans(a)\n thrust(ta)\n node[ta] = x\n lazy[ta] = ei\n recalc(ta)\n }\n\n fun query(a: Int, b: Int): T {\n var l = trans(a)\n var r = trans(b)\n thrust(l)\n thrust(r - 1)\n\n var vl = ti\n var vr = ti\n\n while (l < r) {\n if (isRight(l)) {\n vl = f(vl, reflect(l))\n l += 1\n }\n if (isRight(r)) {\n r -= 1\n vr = f(reflect(r), vr)\n }\n }\n \n return f(vl, vr)\n }\n}", "language": "Kotlin", "metadata": {"date": 1567903001, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s645498642.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s645498642", "user_id": "u111421568"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\nimport java.io.PrintWriter\n\n\n\nfun main(args: Array){\n\tval cin = Scanner(System.`in`)\n val cout = PrintWriter(System.`out`)\n // val n = cin.nextInt()\n // val q = cin.nextInt()\n\n val (n, q) = readLine()!!.split(\" \").map(String::toInt)\n\n val c = Array>(n, { mutableListOf() })\n\n for (i in 0..n-2) {\n val (a, b) = readLine()!!.split(\" \").map(String::toInt)\n c[a - 1].add(b - 1)\n c[b - 1].add(a - 1)\n }\n\n val has = Array(n, { 0 })\n for (i in 0..q-1) {\n // val p = cin.nextInt() - 1\n // val x = cin.nextInt()\n val (p, x) = readLine()!!.split(\" \").map(String::toInt)\n has[p - 1] += x\n }\n\n val queue : MutableList = mutableListOf(0)\n\n while (queue.size > 0) {\n val r = queue.removeAt(0)\n for (child in c[r]) {\n if (c[child].size != 0) {\n has[child] += has[r]\n queue.add(child)\n }\n }\n c[r] = mutableListOf()\n }\n\n for (i in 0..n-1) {\n cout.println(has[i])\n }\n \n cout.flush()\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nclass Point(x: Int, y: Int) : Comparable {\n val x = x\n val y = y\n \n override operator fun compareTo(other : Point) : Int {\n if (x > other.x) {\n return 1\n } else if (x < other.x) {\n return -1\n } else {\n if (y > other.y) {\n return 1\n } else if (y < other.y) {\n return -1\n } else {\n return 0\n }\n }\n }\n\n\n override fun equals(other : Any?) : Boolean {\n if (this == other) {\n return true\n }\n if (javaClass != other?.javaClass) {\n return false\n }\n other as Point\n if (x == other.x && y == other.y) {\n return true\n }\n return false\n }\n}\n\n\n\n\n\ninline fun segTree(m: Int, noinline f: (T, T)->T, noinline g: (T, E)->T, noinline h:(E, E)->E, ti: T, ei: E, ini: Array): SegTree {\n val n = cover(m)\n val ini_tree = Array(2*n - 1, { i ->\n if (i < m) {\n ini[i]\n } else {\n ti\n }\n })\n val lazy = Array(2*n - 1, { ei })\n return SegTree(n, f, g, h, ti, ei, ini_tree, lazy)\n}\n\nfun cover(m: Int): Int {\n var n = 1\n while (n < m) {\n n *= 2\n }\n return n\n}\n\nfun cover_d(m: Int): Int {\n var d = 0\n var n = 1\n while (n < m) {\n n *= 2\n d += 1\n }\n return d\n}\n\nclass SegTree (n: Int, f: (T, T)->T, g: (T, E)->T, h: (E, E)->E, ti: T, ei: E, node: Array, lazy: Array) {\n val n = n\n val f = f\n val g = g\n val h = h\n val ti = ti\n val ei = ei\n val node = node\n val lazy = lazy\n val size = node.size\n val height = cover_d(n)\n\n fun trans(i: Int): Int {\n return i + n - 1\n }\n\n fun left(i: Int): Int {\n return 2*i + 1\n }\n\n fun right(i: Int): Int {\n return 2*i + 2\n }\n\n fun parent(i: Int): Int {\n if (i == 0) {\n return -1\n }\n return (i - 1)/2\n }\n\n fun ancestor(i: Int, d: Int): Int {\n return ((i + 1) shr d) - 1\n }\n\n fun isRight(i: Int): Boolean {\n return ((i and 1) == 0)\n }\n\n fun isLeaf(i: Int): Boolean {\n return (left(i) > size)\n }\n\n fun reflect(k: Int): T {\n if (k >= size) {\n return ti\n }\n if (lazy[k] == ei) {\n return node[k]\n }\n return g(node[k], lazy[k])\n }\n\n fun eval(k: Int) {\n if (lazy[k] == ei) {\n return\n }\n if (left(k) < size) {\n lazy[left(k)] = h(lazy[left(k)], lazy[k])\n lazy[right(k)] = h(lazy[right(k)], lazy[k])\n }\n node[k] = reflect(k)\n lazy[k] = ei\n }\n\n fun thrust(k: Int) {\n // if (k > 0) {\n // thrust(parent(k))\n // }\n for (i in 0..height) {\n eval(ancestor(k, height - i))\n }\n // eval(k)\n }\n\n fun recalc(k: Int) {\n var i = parent(k)\n while (i >= 0) {\n node[i] = f(reflect(left(i)), reflect(right(i)))\n i = parent(i)\n }\n }\n\n fun update(a: Int, b: Int, x: E) {\n val l0 = trans(a)\n val r0 = trans(b)\n thrust(l0)\n thrust(r0 - 1)\n\n var l = l0\n var r = r0\n while (l < r) {\n if (isRight(l)) {\n lazy[l] = h(lazy[l], x)\n l += 1\n }\n if (isRight(r)) {\n r -= 1\n lazy[r] = h(lazy[r], x)\n }\n l = l shr 1\n r = r shr 1\n }\n recalc(l0)\n recalc(r0 - 1)\n }\n\n fun set_val(a: Int, x: T) {\n val ta = trans(a)\n thrust(ta)\n node[ta] = x\n lazy[ta] = ei\n recalc(ta)\n }\n\n fun query(a: Int, b: Int): T {\n var l = trans(a)\n var r = trans(b)\n thrust(l)\n thrust(r - 1)\n\n var vl = ti\n var vr = ti\n\n while (l < r) {\n if (isRight(l)) {\n vl = f(vl, reflect(l))\n l += 1\n }\n if (isRight(r)) {\n r -= 1\n vr = f(reflect(r), vr)\n }\n }\n \n return f(vl, vr)\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5359, "cpu_time_ms": 2111, "memory_kb": 153692}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s998966154", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args: Array) {\n var (N, Q) = readLine()!!.split(\" \"). map { it.toInt() } \n val node = Array(N+1) { hashSetOf()}\n val count = Array(N) {0}\n fun add(from:Int, n: Int, point: Long) {\n count[n-1] += point\n for (i in node[n]) {\n if (i != from) {\n add(n, i, count[n-1])\n }\n } \n }\n\n for (i in 1 until N) {\n var (a, b) = readLine()!!.split(\" \").map {it.toInt()}\n node[a].add(b)\n node[b].add(a)\n }\n for (i in 1 .. Q) {\n var (p, x) = readLine()!!.split(\" \").map {it.toInt()}\n count[p-1] += x.toLong()\n }\n add(0, 1, 0)\n for(i in 0 until N) {\n if (i != 0) print(\" \")\n print(count[i])\n }\n println()\n}", "language": "Kotlin", "metadata": {"date": 1566783792, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s998966154.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s998966154", "user_id": "u796228844"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n var (N, Q) = readLine()!!.split(\" \"). map { it.toInt() } \n val node = Array(N+1) { hashSetOf()}\n val count = Array(N) {0}\n fun add(from:Int, n: Int, point: Long) {\n count[n-1] += point\n for (i in node[n]) {\n if (i != from) {\n add(n, i, count[n-1])\n }\n } \n }\n\n for (i in 1 until N) {\n var (a, b) = readLine()!!.split(\" \").map {it.toInt()}\n node[a].add(b)\n node[b].add(a)\n }\n for (i in 1 .. Q) {\n var (p, x) = readLine()!!.split(\" \").map {it.toInt()}\n count[p-1] += x.toLong()\n }\n add(0, 1, 0)\n for(i in 0 until N) {\n if (i != 0) print(\" \")\n print(count[i])\n }\n println()\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 789, "cpu_time_ms": 2115, "memory_kb": 182984}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s848909340", "group_id": "codeNet:p02936", "input_text": "fun main(args: Array) {\n abc138d()\n}\n\nfun abc138d() {\n val (n, q) = readLine()!!.split(\" \").map { it.toLong() }\n val lines = (1 until n).map { readLine()!!.split(\" \") }.map { list -> list.map { it.toLong() } }\n .map { list -> Pair(list[0] - 1, list[1] - 1) }\n val points = (1..q).map { readLine()!!.split(\" \") }.map { list -> list.map { it.toLong() } }\n .map { list -> Pair(list[0] - 1, list[1]) }\n\n val nodes = (1..n).map { Node(null, 0) }.toTypedArray()\n lines.forEach { pair ->\n nodes[pair.second.toInt()] = Node(nodes[pair.first.toInt()], 0)\n }\n\n points.forEachIndexed { index, pair ->\n nodes[pair.first.toInt()].value += pair.second\n }\n\n for (i in 0 until nodes.size) {\n nodes[i].addParentsValue()\n }\n\n println(nodes.map { it.value }.joinToString(separator = \" \"))\n}\n\ndata class Node(val parent: Node?, var value: Long) {\n fun addParentsValue() {\n parent?.let { value += parent.value }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1566439944, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s848909340.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s848909340", "user_id": "u139478771"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "fun main(args: Array) {\n abc138d()\n}\n\nfun abc138d() {\n val (n, q) = readLine()!!.split(\" \").map { it.toLong() }\n val lines = (1 until n).map { readLine()!!.split(\" \") }.map { list -> list.map { it.toLong() } }\n .map { list -> Pair(list[0] - 1, list[1] - 1) }\n val points = (1..q).map { readLine()!!.split(\" \") }.map { list -> list.map { it.toLong() } }\n .map { list -> Pair(list[0] - 1, list[1]) }\n\n val nodes = (1..n).map { Node(null, 0) }.toTypedArray()\n lines.forEach { pair ->\n nodes[pair.second.toInt()] = Node(nodes[pair.first.toInt()], 0)\n }\n\n points.forEachIndexed { index, pair ->\n nodes[pair.first.toInt()].value += pair.second\n }\n\n for (i in 0 until nodes.size) {\n nodes[i].addParentsValue()\n }\n\n println(nodes.map { it.value }.joinToString(separator = \" \"))\n}\n\ndata class Node(val parent: Node?, var value: Long) {\n fun addParentsValue() {\n parent?.let { value += parent.value }\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 988, "cpu_time_ms": 1799, "memory_kb": 192960}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s771951715", "group_id": "codeNet:p02936", "input_text": "var n = 0\nvar q = 0\nvar p = IntArray(0)\nvar x = LongArray(0)\nvar g = Array(0){IntVec()}\nvar queries = LongArray(0)\nvar scores = LongArray(0)\n\nfun main(args: Array) = IO().exec {\n n = int()\n q = int()\n g = Array(n){IntVec()}\n for (i in n-1) {\n val a = int()-1\n val b = int()-1\n g[a].add(b)\n g[b].add(a)\n }\n p = IntArray(q)\n x = LongArray(q)\n queries = LongArray(n)\n scores = LongArray(n)\n for (i in q) {\n p[i] = int()-1\n x[i] = long()\n queries[p[i]] += x[i]\n }\n rec(0, -1, 0)\n println(scores.joinToString(\" \"))\n}\n\nfun rec(cur: Int, pre: Int, delta: Long) {\n val d = delta + queries[cur]\n scores[cur] = d\n for (v in g[cur]) {\n if (v == pre) continue\n rec(v, cur, d)\n }\n}\n\nclass IntVec(capacity: Int = 8) {\n var array = IntArray(capacity)\n var size = 0\n operator fun get(i: Int): Int = array[i]\n operator fun set(i: Int, v: Int) {\n array[i] = v\n }\n fun add(v: Int) {\n if (size < array.size) array[size++] = v\n else {\n grow()\n array[size++] = v\n }\n }\n private fun grow() {\n for (i in 0 until 10000) {\n val newCapacity = array.size * 2\n val newArray = IntArray(newCapacity)\n System.arraycopy(array, 0, newArray, 0, array.size)\n array = newArray\n return\n }\n }\n override fun toString(): String {\n return array.slice(0 until size).toString()\n }\n operator fun iterator(): Iterator = array.sliceArray(0 until size).iterator()\n}\n\n// region template\noperator fun Int.iterator() = 0.until(this).iterator()\n\nclass IO {\n val printable = 33..126\n val buffer = ByteArray(1024)\n var ptr = 0\n var buflen = 0\n val out = java.io.PrintWriter(System.out)\n fun hasNextByte(): Boolean = if (ptr < buflen) true else {\n ptr = 0\n buflen = System.`in`.read(buffer)\n buflen > 0\n }\n\n fun readByte(): Byte = if (hasNextByte()) buffer[ptr++] else -1\n fun hasNext(): Boolean {\n while (hasNextByte() && buffer[ptr] !in printable) ptr++\n return hasNextByte()\n }\n\n fun string(): String {\n if (!hasNext()) throw java.util.NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (b in printable) {\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun long(): Long {\n if (!hasNext()) throw java.util.NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b == '-'.toByte()) {\n minus = true\n b = readByte()\n }\n if (b !in '0'.toByte()..'9'.toByte()) {\n throw NumberFormatException()\n }\n while (true) {\n if (b in '0'.toByte()..'9'.toByte()) {\n n *= 10\n n += b - '0'.toByte()\n } else if (b == (-1).toByte() || b !in printable) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun int(): Int {\n val nl = long()\n if (nl !in Integer.MIN_VALUE..Integer.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun double(): Double = string().toDouble()\n fun print(obj: Any) = out.print(obj)\n fun print(i: Int) = out.print(i)\n fun print(l: Long) = out.print(l)\n fun println(obj: Any) = out.println(obj)\n fun println(i: Int) = out.println(i)\n fun println(l: Long) = out.println(l)\n inline fun exec(block: IO.() -> Unit) {\n block()\n out.flush()\n }\n}\n// endregion\n", "language": "Kotlin", "metadata": {"date": 1566350106, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s771951715.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s771951715", "user_id": "u095834727"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "var n = 0\nvar q = 0\nvar p = IntArray(0)\nvar x = LongArray(0)\nvar g = Array(0){IntVec()}\nvar queries = LongArray(0)\nvar scores = LongArray(0)\n\nfun main(args: Array) = IO().exec {\n n = int()\n q = int()\n g = Array(n){IntVec()}\n for (i in n-1) {\n val a = int()-1\n val b = int()-1\n g[a].add(b)\n g[b].add(a)\n }\n p = IntArray(q)\n x = LongArray(q)\n queries = LongArray(n)\n scores = LongArray(n)\n for (i in q) {\n p[i] = int()-1\n x[i] = long()\n queries[p[i]] += x[i]\n }\n rec(0, -1, 0)\n println(scores.joinToString(\" \"))\n}\n\nfun rec(cur: Int, pre: Int, delta: Long) {\n val d = delta + queries[cur]\n scores[cur] = d\n for (v in g[cur]) {\n if (v == pre) continue\n rec(v, cur, d)\n }\n}\n\nclass IntVec(capacity: Int = 8) {\n var array = IntArray(capacity)\n var size = 0\n operator fun get(i: Int): Int = array[i]\n operator fun set(i: Int, v: Int) {\n array[i] = v\n }\n fun add(v: Int) {\n if (size < array.size) array[size++] = v\n else {\n grow()\n array[size++] = v\n }\n }\n private fun grow() {\n for (i in 0 until 10000) {\n val newCapacity = array.size * 2\n val newArray = IntArray(newCapacity)\n System.arraycopy(array, 0, newArray, 0, array.size)\n array = newArray\n return\n }\n }\n override fun toString(): String {\n return array.slice(0 until size).toString()\n }\n operator fun iterator(): Iterator = array.sliceArray(0 until size).iterator()\n}\n\n// region template\noperator fun Int.iterator() = 0.until(this).iterator()\n\nclass IO {\n val printable = 33..126\n val buffer = ByteArray(1024)\n var ptr = 0\n var buflen = 0\n val out = java.io.PrintWriter(System.out)\n fun hasNextByte(): Boolean = if (ptr < buflen) true else {\n ptr = 0\n buflen = System.`in`.read(buffer)\n buflen > 0\n }\n\n fun readByte(): Byte = if (hasNextByte()) buffer[ptr++] else -1\n fun hasNext(): Boolean {\n while (hasNextByte() && buffer[ptr] !in printable) ptr++\n return hasNextByte()\n }\n\n fun string(): String {\n if (!hasNext()) throw java.util.NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (b in printable) {\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun long(): Long {\n if (!hasNext()) throw java.util.NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b == '-'.toByte()) {\n minus = true\n b = readByte()\n }\n if (b !in '0'.toByte()..'9'.toByte()) {\n throw NumberFormatException()\n }\n while (true) {\n if (b in '0'.toByte()..'9'.toByte()) {\n n *= 10\n n += b - '0'.toByte()\n } else if (b == (-1).toByte() || b !in printable) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun int(): Int {\n val nl = long()\n if (nl !in Integer.MIN_VALUE..Integer.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun double(): Double = string().toDouble()\n fun print(obj: Any) = out.print(obj)\n fun print(i: Int) = out.print(i)\n fun print(l: Long) = out.print(l)\n fun println(obj: Any) = out.println(obj)\n fun println(i: Int) = out.println(i)\n fun println(l: Long) = out.println(l)\n inline fun exec(block: IO.() -> Unit) {\n block()\n out.flush()\n }\n}\n// endregion\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3762, "cpu_time_ms": 1795, "memory_kb": 98616}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s380905675", "group_id": "codeNet:p02936", "input_text": "import java.io.*\nimport java.util.*\n\nfun solve(N: Int, Q: Int, a: IntArray, b: IntArray, p: IntArray, x: IntArray) {\n // score(i) = score(i.parent) + x[pi = i]\n data class Node(val edges: ArrayDeque, var score: Int = 0)\n val nodes = Array(N) { Node(ArrayDeque()) }\n for (i in 0 until N - 1) {\n nodes[a[i] - 1].edges.add(b[i] - 1)\n nodes[b[i] - 1].edges.add(a[i] - 1)\n }\n val scores = mutableMapOf()\n repeat(Q) {\n scores[p[it] - 1] = x[it] + scores.getOrElse(p[it] - 1) { 0 }\n }\n val root = 0\n val queue = ArrayDeque>()\n val isCalced = BooleanArray(N){ false }\n queue.addLast(root to 0)\n while (queue.size > 0) {\n val (nd, s) = queue.removeFirst()\n if (isCalced[nd]) continue\n nodes[nd].score = s + scores.getOrElse(nd) { 0 }\n isCalced[nd] = true\n nodes[nd].edges.filter{ !isCalced[it] }.forEach { queue.addLast(it to nodes[nd].score) }\n }\n println(nodes.map { it.score }.joinToString(separator = \" \"))\n return\n}\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val N = sc.next().toInt()\n val Q = sc.next().toInt()\n val a = IntArray((N - 1))\n val b = IntArray((N - 1))\n for (i in 0 until (N - 1)) {\n a[i] = sc.next().toInt()\n b[i] = sc.next().toInt()\n }\n val p = IntArray(Q)\n val x = IntArray(Q)\n for (i in 0 until Q) {\n p[i] = sc.next().toInt()\n x[i] = sc.next().toInt()\n }\n solve(N, Q, a, b, p, x)\n}\n", "language": "Kotlin", "metadata": {"date": 1566234797, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s380905675.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380905675", "user_id": "u329232967"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.io.*\nimport java.util.*\n\nfun solve(N: Int, Q: Int, a: IntArray, b: IntArray, p: IntArray, x: IntArray) {\n // score(i) = score(i.parent) + x[pi = i]\n data class Node(val edges: ArrayDeque, var score: Int = 0)\n val nodes = Array(N) { Node(ArrayDeque()) }\n for (i in 0 until N - 1) {\n nodes[a[i] - 1].edges.add(b[i] - 1)\n nodes[b[i] - 1].edges.add(a[i] - 1)\n }\n val scores = mutableMapOf()\n repeat(Q) {\n scores[p[it] - 1] = x[it] + scores.getOrElse(p[it] - 1) { 0 }\n }\n val root = 0\n val queue = ArrayDeque>()\n val isCalced = BooleanArray(N){ false }\n queue.addLast(root to 0)\n while (queue.size > 0) {\n val (nd, s) = queue.removeFirst()\n if (isCalced[nd]) continue\n nodes[nd].score = s + scores.getOrElse(nd) { 0 }\n isCalced[nd] = true\n nodes[nd].edges.filter{ !isCalced[it] }.forEach { queue.addLast(it to nodes[nd].score) }\n }\n println(nodes.map { it.score }.joinToString(separator = \" \"))\n return\n}\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val N = sc.next().toInt()\n val Q = sc.next().toInt()\n val a = IntArray((N - 1))\n val b = IntArray((N - 1))\n for (i in 0 until (N - 1)) {\n a[i] = sc.next().toInt()\n b[i] = sc.next().toInt()\n }\n val p = IntArray(Q)\n val x = IntArray(Q)\n for (i in 0 until Q) {\n p[i] = sc.next().toInt()\n x[i] = sc.next().toInt()\n }\n solve(N, Q, a, b, p, x)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1989, "cpu_time_ms": 1540, "memory_kb": 153708}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s328841249", "group_id": "codeNet:p02936", "input_text": "private var nodes = emptyArray>()\nprivate var counter = emptyArray()\nprivate var ans = emptyArray()\nprivate var check = emptyArray()\n\nfun main(args: Array) {\n\n val (N, Q) = readLine()!!.split(\" \").map(String::toInt)\n\n nodes = Array(N) { emptyArray() }\n counter = Array(N) { 0 }\n ans = Array(N) { 0 }\n check = Array(N) { 0 }\n\n repeat(N - 1) {\n val (l, r) = readLine()!!.split(\" \").map(String::toInt)\n nodes[l - 1] = nodes[l - 1].plus(r - 1)\n nodes[r - 1] = nodes[r - 1].plus(l - 1)\n }\n\n repeat(Q) {\n val (node,count) = readLine()!!.split(\" \").map(String::toInt)\n counter[node - 1] += count\n }\n\n dfs(0, 0)\n\n ans.joinToString(\" \").let(::println)\n\n}\n\nprivate fun dfs(node: Int, score: Int) {\n\n check[node] = 1\n\n ans[node] = score + counter[node]\n for (n in nodes[node]) {\n if (check[n] == 0) {\n dfs(n, ans[node])\n }\n }\n\n}", "language": "Kotlin", "metadata": {"date": 1566232452, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s328841249.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s328841249", "user_id": "u085288971"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "private var nodes = emptyArray>()\nprivate var counter = emptyArray()\nprivate var ans = emptyArray()\nprivate var check = emptyArray()\n\nfun main(args: Array) {\n\n val (N, Q) = readLine()!!.split(\" \").map(String::toInt)\n\n nodes = Array(N) { emptyArray() }\n counter = Array(N) { 0 }\n ans = Array(N) { 0 }\n check = Array(N) { 0 }\n\n repeat(N - 1) {\n val (l, r) = readLine()!!.split(\" \").map(String::toInt)\n nodes[l - 1] = nodes[l - 1].plus(r - 1)\n nodes[r - 1] = nodes[r - 1].plus(l - 1)\n }\n\n repeat(Q) {\n val (node,count) = readLine()!!.split(\" \").map(String::toInt)\n counter[node - 1] += count\n }\n\n dfs(0, 0)\n\n ans.joinToString(\" \").let(::println)\n\n}\n\nprivate fun dfs(node: Int, score: Int) {\n\n check[node] = 1\n\n ans[node] = score + counter[node]\n for (n in nodes[node]) {\n if (check[n] == 0) {\n dfs(n, ans[node])\n }\n }\n\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 961, "cpu_time_ms": 2111, "memory_kb": 163348}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s182445475", "group_id": "codeNet:p02936", "input_text": "\nclass D(val childOf: Array>, val ans: Array)\n\nfun main(args: Array)\n{\n val (n, q) = readNInts()\n val d = D(Array>(n, {mutableListOf()}), Array(n, {0}))\n // childOf = Array>(n, {mutableListOf()})\n for (i in 1..n-1) {\n val (a, b) = readNInts()\n d.childOf[a-1].add(b-1)\n d.childOf[b-1].add(a-1)\n }\n\n // ans = Array(n, {0})\n for (i in 1..q) {\n val (p, x) = readNInts()\n d.ans[p-1] += x\n }\n\n search(0, d)\n\n for (i in 1..n-1) {\n print(\"${d.ans[i-1]} \")\n }\n println(d.ans[n-1])\n}\n\nprivate fun search(v: Int, d: D, p: Int = -1) {\n // if (!d.childOf[parent].isNotEmpty()) return\n\n // for (child in d.childOf[parent]) {\n // d.ans[child] += d.ans[parent]\n // search(child, d)\n // }\n for (child in d.childOf[v]) {\n if (child == p) continue\n d.ans[child] += d.ans[v]\n search(child, d, v)\n }\n}\n\n\n// Read an integer\n// Usage: val a = readInt()\nprivate fun readInt() = readLine()!!.toInt()\n\n// Read N integers separated by \" \"\n// Usage: val (a, b, c) = readNInts()\nprivate fun readNInts() = readLine()!!.split(\" \").map(String::toInt)\n\n// Read a string\n// Usage: val a = readString()\nprivate fun readString() = readLine()!!\n", "language": "Kotlin", "metadata": {"date": 1566223886, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s182445475.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s182445475", "user_id": "u118477733"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "\nclass D(val childOf: Array>, val ans: Array)\n\nfun main(args: Array)\n{\n val (n, q) = readNInts()\n val d = D(Array>(n, {mutableListOf()}), Array(n, {0}))\n // childOf = Array>(n, {mutableListOf()})\n for (i in 1..n-1) {\n val (a, b) = readNInts()\n d.childOf[a-1].add(b-1)\n d.childOf[b-1].add(a-1)\n }\n\n // ans = Array(n, {0})\n for (i in 1..q) {\n val (p, x) = readNInts()\n d.ans[p-1] += x\n }\n\n search(0, d)\n\n for (i in 1..n-1) {\n print(\"${d.ans[i-1]} \")\n }\n println(d.ans[n-1])\n}\n\nprivate fun search(v: Int, d: D, p: Int = -1) {\n // if (!d.childOf[parent].isNotEmpty()) return\n\n // for (child in d.childOf[parent]) {\n // d.ans[child] += d.ans[parent]\n // search(child, d)\n // }\n for (child in d.childOf[v]) {\n if (child == p) continue\n d.ans[child] += d.ans[v]\n search(child, d, v)\n }\n}\n\n\n// Read an integer\n// Usage: val a = readInt()\nprivate fun readInt() = readLine()!!.toInt()\n\n// Read N integers separated by \" \"\n// Usage: val (a, b, c) = readNInts()\nprivate fun readNInts() = readLine()!!.split(\" \").map(String::toInt)\n\n// Read a string\n// Usage: val a = readString()\nprivate fun readString() = readLine()!!\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1320, "cpu_time_ms": 2111, "memory_kb": 161812}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s363905228", "group_id": "codeNet:p02936", "input_text": "private var parents: Array = emptyArray()\nprivate var counter: Array = emptyArray()\nprivate var memo = mutableMapOf()\nfun main(args: Array) {\n\n val (N, Q) = readLine()!!.split(\" \").map(String::toInt)\n val a = Array(N - 1) { readLine()!!.split(\" \").map(String::toInt).let { Pair(it[0], it[1]) } }\n val p = Array(Q) { readLine()!!.split(\" \").map(String::toInt).let { Pair(it[0], it[1]) } }\n\n\n parents = arrayOfNulls(N)\n for ((parent, child) in a) {\n parents[child - 1] = parent - 1\n }\n\n counter = Array(N) { 0 }\n for ((node, count) in p) {\n counter[node - 1] += count\n }\n\n (0..a.size).map {\n calc(it)\n }.joinToString(\" \")\n .let(::println)\n}\n\nprivate fun calc(node: Int): Int {\n if (memo.containsKey(node)) {\n return memo[node]!!\n }\n val parentNode = parents.getOrNull(node) ?: return counter[node]\n return memo.getOrPut(node) { counter[node] + calc(parentNode) }\n}", "language": "Kotlin", "metadata": {"date": 1566220996, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s363905228.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s363905228", "user_id": "u085288971"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "private var parents: Array = emptyArray()\nprivate var counter: Array = emptyArray()\nprivate var memo = mutableMapOf()\nfun main(args: Array) {\n\n val (N, Q) = readLine()!!.split(\" \").map(String::toInt)\n val a = Array(N - 1) { readLine()!!.split(\" \").map(String::toInt).let { Pair(it[0], it[1]) } }\n val p = Array(Q) { readLine()!!.split(\" \").map(String::toInt).let { Pair(it[0], it[1]) } }\n\n\n parents = arrayOfNulls(N)\n for ((parent, child) in a) {\n parents[child - 1] = parent - 1\n }\n\n counter = Array(N) { 0 }\n for ((node, count) in p) {\n counter[node - 1] += count\n }\n\n (0..a.size).map {\n calc(it)\n }.joinToString(\" \")\n .let(::println)\n}\n\nprivate fun calc(node: Int): Int {\n if (memo.containsKey(node)) {\n return memo[node]!!\n }\n val parentNode = parents.getOrNull(node) ?: return counter[node]\n return memo.getOrPut(node) { counter[node] + calc(parentNode) }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 976, "cpu_time_ms": 1819, "memory_kb": 164760}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s114109836", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val n = scanner.nextInt()\n val q = scanner.nextInt()\n //var array = Array>(400000, {Pair(0,0)})\n var list = ArrayList>()\n //var array2 = Array>(q, {Pair(0,0)})\n var numbers = Array(n, {0L})\n var result = Array(n, {0L})\n for(i in 0..n-2){\n var pair = Pair(scanner.nextInt(), scanner.nextInt())\n list.add(pair)\n }\n for(i in 0..q-1){\n var pair = Pair(scanner.nextInt(), scanner.nextLong())\n numbers[pair.first-1] += pair.second\n //array2[i] = pair\n }\n var numbersCheck = Array(n, {0})\n for(i in 0..n-2){\n val left = list[i].first\n val right = list[i].second\n if(numbersCheck[left-1] !== 1) {\n result[left-1] += numbers[left-1]\n numbersCheck[left-1] = 1\n }\n result[right-1] += result[left-1]\n }\n for(i in 0..n-1){\n if(numbersCheck[i] !== 1) print(\"${result[i]+numbers[i]} \")\n else print(\"${result[i]} \")\n }\n}", "language": "Kotlin", "metadata": {"date": 1566189798, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s114109836.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s114109836", "user_id": "u046105273"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val n = scanner.nextInt()\n val q = scanner.nextInt()\n //var array = Array>(400000, {Pair(0,0)})\n var list = ArrayList>()\n //var array2 = Array>(q, {Pair(0,0)})\n var numbers = Array(n, {0L})\n var result = Array(n, {0L})\n for(i in 0..n-2){\n var pair = Pair(scanner.nextInt(), scanner.nextInt())\n list.add(pair)\n }\n for(i in 0..q-1){\n var pair = Pair(scanner.nextInt(), scanner.nextLong())\n numbers[pair.first-1] += pair.second\n //array2[i] = pair\n }\n var numbersCheck = Array(n, {0})\n for(i in 0..n-2){\n val left = list[i].first\n val right = list[i].second\n if(numbersCheck[left-1] !== 1) {\n result[left-1] += numbers[left-1]\n numbersCheck[left-1] = 1\n }\n result[right-1] += result[left-1]\n }\n for(i in 0..n-1){\n if(numbersCheck[i] !== 1) print(\"${result[i]+numbers[i]} \")\n else print(\"${result[i]} \")\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1094, "cpu_time_ms": 1854, "memory_kb": 138892}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s970368494", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val n = scanner.nextInt()\n val q = scanner.nextInt()\n var list = ArrayList>()\n var numbers = Array(n,{0L})\n var result = Array(n,{0L})\n for(i in 0L..n.toLong()-2L){\n var pair = Pair(scanner.nextLong(), scanner.nextLong())\n list.add(pair)\n }\n for(i in 0L..q.toLong()-1L){\n var pair = Pair(scanner.nextLong(), scanner.nextLong())\n numbers[(pair.first-1L).toInt()] += pair.second\n //array2[i] = pair\n }\n var numbersCheck = Array(n,{0L})\n for(i in 0L..n.toLong()-2L){\n val left = list[i.toInt()].first\n val right = list[i.toInt()].second\n if(numbersCheck[(left-1L).toInt()] !== 1L) {\n result[(left-1L).toInt()] += numbers[(left-1).toInt()]\n numbersCheck[(left-1L).toInt()] = 1L\n }\n result[(right-1L).toInt()] += result[(left-1L).toInt()]\n }\n for(i in 0L..n.toLong()-1L){\n if(numbersCheck[i.toInt()] !== 1L) print(\"${result[i.toInt()]+numbers[i.toInt()]} \")\n else print(\"${result[i.toInt()]} \")\n }\n}", "language": "Kotlin", "metadata": {"date": 1566189621, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s970368494.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s970368494", "user_id": "u046105273"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val n = scanner.nextInt()\n val q = scanner.nextInt()\n var list = ArrayList>()\n var numbers = Array(n,{0L})\n var result = Array(n,{0L})\n for(i in 0L..n.toLong()-2L){\n var pair = Pair(scanner.nextLong(), scanner.nextLong())\n list.add(pair)\n }\n for(i in 0L..q.toLong()-1L){\n var pair = Pair(scanner.nextLong(), scanner.nextLong())\n numbers[(pair.first-1L).toInt()] += pair.second\n //array2[i] = pair\n }\n var numbersCheck = Array(n,{0L})\n for(i in 0L..n.toLong()-2L){\n val left = list[i.toInt()].first\n val right = list[i.toInt()].second\n if(numbersCheck[(left-1L).toInt()] !== 1L) {\n result[(left-1L).toInt()] += numbers[(left-1).toInt()]\n numbersCheck[(left-1L).toInt()] = 1L\n }\n result[(right-1L).toInt()] += result[(left-1L).toInt()]\n }\n for(i in 0L..n.toLong()-1L){\n if(numbersCheck[i.toInt()] !== 1L) print(\"${result[i.toInt()]+numbers[i.toInt()]} \")\n else print(\"${result[i.toInt()]} \")\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1152, "cpu_time_ms": 2090, "memory_kb": 150816}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s324937133", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val n = scanner.nextInt()\n val q = scanner.nextInt()\n //var array = Array>(400000, {Pair(0,0)})\n var list = ArrayList>()\n //var array2 = Array>(q, {Pair(0,0)})\n var numbers = Array(n, {0})\n var result = Array(n, {0})\n while(scanner.hasNext()){\n var pair = Pair(scanner.nextInt(), scanner.nextInt())\n list.add(pair)\n }\n //var max = 0\n for(i in list.size-q..list.size-1){\n //var pair = Pair(scanner.nextInt(), scanner.nextInt())\n //max += pair.second\n numbers[list[i].first-1] += list[i].second\n //array2[i] = pair\n }\n var numbersCheck = Array(n, {0})\n for(i in 0..list.size-q-1){\n val left = list[i].first\n val right = list[i].second\n if(numbersCheck[left-1] !== 1) {\n result[left-1] += numbers[left-1]\n numbersCheck[left-1] = 1\n }\n result[right-1] += result[left-1]\n }\n\n}", "language": "Kotlin", "metadata": {"date": 1566187345, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s324937133.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s324937133", "user_id": "u046105273"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val n = scanner.nextInt()\n val q = scanner.nextInt()\n //var array = Array>(400000, {Pair(0,0)})\n var list = ArrayList>()\n //var array2 = Array>(q, {Pair(0,0)})\n var numbers = Array(n, {0})\n var result = Array(n, {0})\n while(scanner.hasNext()){\n var pair = Pair(scanner.nextInt(), scanner.nextInt())\n list.add(pair)\n }\n //var max = 0\n for(i in list.size-q..list.size-1){\n //var pair = Pair(scanner.nextInt(), scanner.nextInt())\n //max += pair.second\n numbers[list[i].first-1] += list[i].second\n //array2[i] = pair\n }\n var numbersCheck = Array(n, {0})\n for(i in 0..list.size-q-1){\n val left = list[i].first\n val right = list[i].second\n if(numbersCheck[left-1] !== 1) {\n result[left-1] += numbers[left-1]\n numbersCheck[left-1] = 1\n }\n result[right-1] += result[left-1]\n }\n\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1051, "cpu_time_ms": 1624, "memory_kb": 156040}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s169853894", "group_id": "codeNet:p02936", "input_text": "fun main(args: Array) {\n\n val (N, Q) = readLine()!!.split(\" \").map(String::toInt)\n val a = Array(N - 1) { readLine()!!.split(\" \").map(String::toInt).let { Pair(it[0], it[1]) } }\n val p = Array(Q) { readLine()!!.split(\" \").map(String::toInt).let { Pair(it[0], it[1]) } }\n\n val rootNode = Node(a.first().first)\n\n for ((root, leaf) in a) {\n val node = rootNode.find(root)!!\n node.children.add(Node(leaf))\n }\n\n\n\n for ((node, count) in p) {\n rootNode.find(node)!!.add(count)\n }\n rootNode.toList().sortedBy { it.value }.forEach { println(it.count) }\n}\n\nprivate class Node(val value: Int) {\n val children: MutableList = mutableListOf()\n var count = 0\n fun find(value: Int): Node? {\n if (this.value == value) {\n return this\n }\n for (child in children) {\n val n = child.find(value)\n if (n != null) {\n return n\n }\n }\n return null\n }\n\n fun add(count: Int) {\n this.count += count\n children.forEach { it.add(count) }\n }\n\n fun toList(): List {\n if (children.isEmpty()) {\n return listOf(this)\n }\n return listOf(this).plus(children.map(Node::toList).flatten())\n }\n}", "language": "Kotlin", "metadata": {"date": 1566182162, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s169853894.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s169853894", "user_id": "u085288971"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "fun main(args: Array) {\n\n val (N, Q) = readLine()!!.split(\" \").map(String::toInt)\n val a = Array(N - 1) { readLine()!!.split(\" \").map(String::toInt).let { Pair(it[0], it[1]) } }\n val p = Array(Q) { readLine()!!.split(\" \").map(String::toInt).let { Pair(it[0], it[1]) } }\n\n val rootNode = Node(a.first().first)\n\n for ((root, leaf) in a) {\n val node = rootNode.find(root)!!\n node.children.add(Node(leaf))\n }\n\n\n\n for ((node, count) in p) {\n rootNode.find(node)!!.add(count)\n }\n rootNode.toList().sortedBy { it.value }.forEach { println(it.count) }\n}\n\nprivate class Node(val value: Int) {\n val children: MutableList = mutableListOf()\n var count = 0\n fun find(value: Int): Node? {\n if (this.value == value) {\n return this\n }\n for (child in children) {\n val n = child.find(value)\n if (n != null) {\n return n\n }\n }\n return null\n }\n\n fun add(count: Int) {\n this.count += count\n children.forEach { it.add(count) }\n }\n\n fun toList(): List {\n if (children.isEmpty()) {\n return listOf(this)\n }\n return listOf(this).plus(children.map(Node::toList).flatten())\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1281, "cpu_time_ms": 2111, "memory_kb": 132412}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s777911476", "group_id": "codeNet:p02936", "input_text": "fun main(args: Array) {\n val (n, q) = readLine()!!.split(\" \").map(String::toInt)\n val nodes = Array(n) { Node() }\n for (i in 1.until(n)) {\n val (a, b) = readLine()!!.split(\" \").map(String::toInt)\n nodes[b - 1].parent = nodes[a - 1]\n }\n for (i in 1..q) {\n val (p, x) = readLine()!!.split(\" \").map(String::toInt)\n nodes[p - 1].num += x\n }\n\n println(nodes.joinToString(\" \") { String.format(\"%.0f\", it.getCount()) })\n}\n\nclass Node () {\n var num: Double = 0.0\n var parent: Node? = null\n\n fun getCount(): Double {\n return if (this.parent != null) {\n this.parent!!.getCount() + this.num\n } else {\n this.num\n }\n }\n}", "language": "Kotlin", "metadata": {"date": 1566180141, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s777911476.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s777911476", "user_id": "u938650438"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, q) = readLine()!!.split(\" \").map(String::toInt)\n val nodes = Array(n) { Node() }\n for (i in 1.until(n)) {\n val (a, b) = readLine()!!.split(\" \").map(String::toInt)\n nodes[b - 1].parent = nodes[a - 1]\n }\n for (i in 1..q) {\n val (p, x) = readLine()!!.split(\" \").map(String::toInt)\n nodes[p - 1].num += x\n }\n\n println(nodes.joinToString(\" \") { String.format(\"%.0f\", it.getCount()) })\n}\n\nclass Node () {\n var num: Double = 0.0\n var parent: Node? = null\n\n fun getCount(): Double {\n return if (this.parent != null) {\n this.parent!!.getCount() + this.num\n } else {\n this.num\n }\n }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 719, "cpu_time_ms": 2111, "memory_kb": 137352}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s848604740", "group_id": "codeNet:p02936", "input_text": "import java.io.PrintWriter\nimport java.lang.Math.sqrt\nimport java.util.*\n\nconst val MOD = 1000000007L\nconst val INF = Long.MAX_VALUE - 1\n\nfun main(args: Array) {\n val reader = System.`in`.bufferedReader()\n\n val (n, q) = reader.readLine()!!.split(\" \").map(Integer::parseInt)\n\n\n val edges = Array(n) {\n return@Array Edge(it)\n }\n\n for (i in 0 until n - 1) {\n val (a, b) = reader.readLine()!!.split(\" \").map(Integer::parseInt)\n edges[a - 1].nexts.add(b - 1)\n }\n\n for (i in 0 until q) {\n val (p, x) = reader.readLine()!!.split(\" \").map(Integer::parseInt)\n edges[p - 1].count += x\n }\n\n val ans = Array(n) {\n return@Array -1L\n }\n\n fun dfs(n: Int, ret: Long) {\n if (ans[n] != -1L) return\n val now = ret + edges[n].count\n ans[n] = now\n\n for (next in edges[n].nexts) {\n dfs(next, now)\n }\n }\n\n// dfs(0, 0)\n\n val pw = PrintWriter(System.out)\n pw.println(ans.joinToString(\" \"))\n pw.flush()\n}\n\ndata class Edge(var num: Int, var count: Int = 0, val nexts: MutableList = emptyList().toMutableList())\n\nfun readList() = readLine()!!.split(' ')\nfun readInt() = readIntList().first()\nfun readIntList() = readList().map(String::toInt)\nfun readLong() = readLongList().first()\nfun readLongList() = readList().map(String::toLong)\nfun readDoubleList() = readList().map(String::toDouble)\n\nfun readClass(n: Int, body: (List) -> T): List {\n val ret = mutableListOf()\n for (i in 0 until n) {\n ret.add(body(readList()))\n }\n return ret\n}\n\nfun readPair(): Pair {\n val splite = readLine()!!.split(' ')\n return Pair(splite[0], splite[1])\n}\n\nfun List.copy() = this.map { it }\n\nfun Long.toBinaryString(): String {\n var t = this\n var res = \"\"\n while (t > 0) {\n res += (t % 2).toString()\n t /= 2\n }\n return res\n}\n\ninline fun dualArray(h: Int, w: Int, init: (Int, Int) -> T) {\n Array(h) { i ->\n return@Array Array(w) { j ->\n return@Array init(i, j)\n }\n }\n}\n\n// 速度のためforEachは避ける\ninline fun Int.rep(start: Int = 0, shiftLast: Boolean = false, body: (Int) -> Unit) {\n for (i in start until if (shiftLast) this + start else this) {\n body(i)\n }\n}\n\ninline fun Long.rep(start: Long = 0, shiftLast: Boolean = false, body: (Long) -> Unit) {\n for (i in start until if (shiftLast) this + start else this) {\n body(i)\n }\n}\n\n// 約数のList\nfun divisor(value: Long): List {\n val max = sqrt(value.toDouble()).toLong()\n val former = mutableListOf()\n val latter = mutableListOf()\n (1..max).filter { value % it == 0L }\n .forEach {\n former.add(it)\n latter.add(value / it)\n }\n former.addAll(latter.reversed())\n return former\n}\n\n// 範囲内の素数を取得\n// fromだけ指定すると戻り値の個数で素数判定ができる\nfun prime(from: Long, to: Long = from): List {\n return (from..to).filter { i ->\n val max = Math.sqrt(i.toDouble()).toLong()\n (2..max).all { j -> i % j != 0L }\n }\n}\n\n// 素因数分解\nfun decom(value: Long): List {\n if (value == 1L) return listOf(1)\n val max = Math.sqrt(value.toDouble()).toLong()\n return prime(2, max).filter { value % it == 0L }\n}\n\n// 最大公約数\nfun gcd(a: Long, b: Long): Long {\n return if (a % b == 0L) b else gcd(b, a % b)\n}\n\n// 文字列を入れ替え\nfun swap(base: String, a: String, b: String): String {\n return base.map {\n when (it) {\n a.toCharArray()[0] -> b\n b.toCharArray()[0] -> a\n else -> it.toString()\n }\n }.joinToString()\n}\n\n// bit全探索\nfun bitAllSearch(n: Int, body: (Array) -> Unit) {\n for (bit in 0 until (1 shl n)) {\n val s = Array(n) {\n return@Array false\n }\n for (i in 0 until n) {\n if ((bit and (1 shl i)) shr i == 1) { // i が bit に入るかどうか\n s[i] = true\n }\n }\n body(s)\n }\n}\n\ninternal class UnionFindTree(size: Int) {\n\n private val parent = Array(size) {\n return@Array it\n }\n private val rank = Array(size) {\n return@Array 0\n }\n\n fun union(x: Int, y: Int): Int {\n val xRoot = find(x)\n val yRoot = find(y)\n\n if (xRoot == yRoot) return xRoot\n\n when {\n rank[xRoot] > rank[yRoot] -> parent[yRoot] = xRoot\n rank[xRoot] < rank[yRoot] -> parent[xRoot] = yRoot\n xRoot != yRoot -> {\n parent[yRoot] = xRoot\n rank[xRoot]++\n }\n }\n return parent[xRoot]\n }\n\n fun find(i: Int): Int {\n if (i != parent[i]) {\n parent[i] = find(parent[i])\n }\n return parent[i]\n }\n\n fun same(x: Int, y: Int): Boolean {\n return find(x) == find(y)\n }\n}\n\nfun Map.toMutableMap(): MutableMap {\n return HashMap(this)\n}", "language": "Kotlin", "metadata": {"date": 1566179790, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s848604740.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s848604740", "user_id": "u515548399"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.lang.Math.sqrt\nimport java.util.*\n\nconst val MOD = 1000000007L\nconst val INF = Long.MAX_VALUE - 1\n\nfun main(args: Array) {\n val reader = System.`in`.bufferedReader()\n\n val (n, q) = reader.readLine()!!.split(\" \").map(Integer::parseInt)\n\n\n val edges = Array(n) {\n return@Array Edge(it)\n }\n\n for (i in 0 until n - 1) {\n val (a, b) = reader.readLine()!!.split(\" \").map(Integer::parseInt)\n edges[a - 1].nexts.add(b - 1)\n }\n\n for (i in 0 until q) {\n val (p, x) = reader.readLine()!!.split(\" \").map(Integer::parseInt)\n edges[p - 1].count += x\n }\n\n val ans = Array(n) {\n return@Array -1L\n }\n\n fun dfs(n: Int, ret: Long) {\n if (ans[n] != -1L) return\n val now = ret + edges[n].count\n ans[n] = now\n\n for (next in edges[n].nexts) {\n dfs(next, now)\n }\n }\n\n// dfs(0, 0)\n\n val pw = PrintWriter(System.out)\n pw.println(ans.joinToString(\" \"))\n pw.flush()\n}\n\ndata class Edge(var num: Int, var count: Int = 0, val nexts: MutableList = emptyList().toMutableList())\n\nfun readList() = readLine()!!.split(' ')\nfun readInt() = readIntList().first()\nfun readIntList() = readList().map(String::toInt)\nfun readLong() = readLongList().first()\nfun readLongList() = readList().map(String::toLong)\nfun readDoubleList() = readList().map(String::toDouble)\n\nfun readClass(n: Int, body: (List) -> T): List {\n val ret = mutableListOf()\n for (i in 0 until n) {\n ret.add(body(readList()))\n }\n return ret\n}\n\nfun readPair(): Pair {\n val splite = readLine()!!.split(' ')\n return Pair(splite[0], splite[1])\n}\n\nfun List.copy() = this.map { it }\n\nfun Long.toBinaryString(): String {\n var t = this\n var res = \"\"\n while (t > 0) {\n res += (t % 2).toString()\n t /= 2\n }\n return res\n}\n\ninline fun dualArray(h: Int, w: Int, init: (Int, Int) -> T) {\n Array(h) { i ->\n return@Array Array(w) { j ->\n return@Array init(i, j)\n }\n }\n}\n\n// 速度のためforEachは避ける\ninline fun Int.rep(start: Int = 0, shiftLast: Boolean = false, body: (Int) -> Unit) {\n for (i in start until if (shiftLast) this + start else this) {\n body(i)\n }\n}\n\ninline fun Long.rep(start: Long = 0, shiftLast: Boolean = false, body: (Long) -> Unit) {\n for (i in start until if (shiftLast) this + start else this) {\n body(i)\n }\n}\n\n// 約数のList\nfun divisor(value: Long): List {\n val max = sqrt(value.toDouble()).toLong()\n val former = mutableListOf()\n val latter = mutableListOf()\n (1..max).filter { value % it == 0L }\n .forEach {\n former.add(it)\n latter.add(value / it)\n }\n former.addAll(latter.reversed())\n return former\n}\n\n// 範囲内の素数を取得\n// fromだけ指定すると戻り値の個数で素数判定ができる\nfun prime(from: Long, to: Long = from): List {\n return (from..to).filter { i ->\n val max = Math.sqrt(i.toDouble()).toLong()\n (2..max).all { j -> i % j != 0L }\n }\n}\n\n// 素因数分解\nfun decom(value: Long): List {\n if (value == 1L) return listOf(1)\n val max = Math.sqrt(value.toDouble()).toLong()\n return prime(2, max).filter { value % it == 0L }\n}\n\n// 最大公約数\nfun gcd(a: Long, b: Long): Long {\n return if (a % b == 0L) b else gcd(b, a % b)\n}\n\n// 文字列を入れ替え\nfun swap(base: String, a: String, b: String): String {\n return base.map {\n when (it) {\n a.toCharArray()[0] -> b\n b.toCharArray()[0] -> a\n else -> it.toString()\n }\n }.joinToString()\n}\n\n// bit全探索\nfun bitAllSearch(n: Int, body: (Array) -> Unit) {\n for (bit in 0 until (1 shl n)) {\n val s = Array(n) {\n return@Array false\n }\n for (i in 0 until n) {\n if ((bit and (1 shl i)) shr i == 1) { // i が bit に入るかどうか\n s[i] = true\n }\n }\n body(s)\n }\n}\n\ninternal class UnionFindTree(size: Int) {\n\n private val parent = Array(size) {\n return@Array it\n }\n private val rank = Array(size) {\n return@Array 0\n }\n\n fun union(x: Int, y: Int): Int {\n val xRoot = find(x)\n val yRoot = find(y)\n\n if (xRoot == yRoot) return xRoot\n\n when {\n rank[xRoot] > rank[yRoot] -> parent[yRoot] = xRoot\n rank[xRoot] < rank[yRoot] -> parent[xRoot] = yRoot\n xRoot != yRoot -> {\n parent[yRoot] = xRoot\n rank[xRoot]++\n }\n }\n return parent[xRoot]\n }\n\n fun find(i: Int): Int {\n if (i != parent[i]) {\n parent[i] = find(parent[i])\n }\n return parent[i]\n }\n\n fun same(x: Int, y: Int): Boolean {\n return find(x) == find(y)\n }\n}\n\nfun Map.toMutableMap(): MutableMap {\n return HashMap(this)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5039, "cpu_time_ms": 1142, "memory_kb": 135616}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s072551911", "group_id": "codeNet:p02936", "input_text": "import java.io.PrintWriter\nimport java.lang.Math.sqrt\nimport java.util.*\n\nconst val MOD = 1000000007L\nconst val INF = Long.MAX_VALUE - 1\n\nfun main(args: Array) {\n val reader = System.`in`.bufferedReader()\n\n val (n, q) = reader.readLine()!!.split(\" \").map(Integer::parseInt)\n\n\n val edges = Array(n) {\n return@Array Edge(it)\n }\n\n for (i in 0 until n - 1) {\n val (a, b) = reader.readLine()!!.split(\" \").map(Integer::parseInt)\n edges[a - 1].nexts.add(b - 1)\n }\n\n for (i in 0 until q) {\n val (p, x) = reader.readLine()!!.split(\" \").map(Integer::parseInt)\n edges[p - 1].count += x\n }\n\n val ans = Array(n) {\n return@Array -1L\n }\n\n fun dfs(n: Int, ret: Long) {\n if (ans[n] != -1L) return\n val now = ret + edges[n].count\n ans[n] = now\n\n for (next in edges[n].nexts) {\n dfs(next, now)\n }\n }\n\n dfs(0, 0)\n\n val pw = PrintWriter(System.out)\n ans.forEach {\n pw.print(\"$it \")\n }\n pw.flush()\n}\n\nclass Edge(var num: Int) {\n var count = 0\n val nexts = emptyList().toMutableList()\n}\n\n\nfun readList() = readLine()!!.split(' ')\nfun readInt() = readIntList().first()\nfun readIntList() = readList().map(String::toInt)\nfun readLong() = readLongList().first()\nfun readLongList() = readList().map(String::toLong)\nfun readDoubleList() = readList().map(String::toDouble)\n\nfun readClass(n: Int, body: (List) -> T): List {\n val ret = mutableListOf()\n for (i in 0 until n) {\n ret.add(body(readList()))\n }\n return ret\n}\n\nfun readPair(): Pair {\n val splite = readLine()!!.split(' ')\n return Pair(splite[0], splite[1])\n}\n\nfun List.copy() = this.map { it }\n\nfun Long.toBinaryString(): String {\n var t = this\n var res = \"\"\n while (t > 0) {\n res += (t % 2).toString()\n t /= 2\n }\n return res\n}\n\ninline fun dualArray(h: Int, w: Int, init: (Int, Int) -> T) {\n Array(h) { i ->\n return@Array Array(w) { j ->\n return@Array init(i, j)\n }\n }\n}\n\n// 速度のためforEachは避ける\ninline fun Int.rep(start: Int = 0, shiftLast: Boolean = false, body: (Int) -> Unit) {\n for (i in start until if (shiftLast) this + start else this) {\n body(i)\n }\n}\n\ninline fun Long.rep(start: Long = 0, shiftLast: Boolean = false, body: (Long) -> Unit) {\n for (i in start until if (shiftLast) this + start else this) {\n body(i)\n }\n}\n\n// 約数のList\nfun divisor(value: Long): List {\n val max = sqrt(value.toDouble()).toLong()\n val former = mutableListOf()\n val latter = mutableListOf()\n (1..max).filter { value % it == 0L }\n .forEach {\n former.add(it)\n latter.add(value / it)\n }\n former.addAll(latter.reversed())\n return former\n}\n\n// 範囲内の素数を取得\n// fromだけ指定すると戻り値の個数で素数判定ができる\nfun prime(from: Long, to: Long = from): List {\n return (from..to).filter { i ->\n val max = Math.sqrt(i.toDouble()).toLong()\n (2..max).all { j -> i % j != 0L }\n }\n}\n\n// 素因数分解\nfun decom(value: Long): List {\n if (value == 1L) return listOf(1)\n val max = Math.sqrt(value.toDouble()).toLong()\n return prime(2, max).filter { value % it == 0L }\n}\n\n// 最大公約数\nfun gcd(a: Long, b: Long): Long {\n return if (a % b == 0L) b else gcd(b, a % b)\n}\n\n// 文字列を入れ替え\nfun swap(base: String, a: String, b: String): String {\n return base.map {\n when (it) {\n a.toCharArray()[0] -> b\n b.toCharArray()[0] -> a\n else -> it.toString()\n }\n }.joinToString()\n}\n\n// bit全探索\nfun bitAllSearch(n: Int, body: (Array) -> Unit) {\n for (bit in 0 until (1 shl n)) {\n val s = Array(n) {\n return@Array false\n }\n for (i in 0 until n) {\n if ((bit and (1 shl i)) shr i == 1) { // i が bit に入るかどうか\n s[i] = true\n }\n }\n body(s)\n }\n}\n\ninternal class UnionFindTree(size: Int) {\n\n private val parent = Array(size) {\n return@Array it\n }\n private val rank = Array(size) {\n return@Array 0\n }\n\n fun union(x: Int, y: Int): Int {\n val xRoot = find(x)\n val yRoot = find(y)\n\n if (xRoot == yRoot) return xRoot\n\n when {\n rank[xRoot] > rank[yRoot] -> parent[yRoot] = xRoot\n rank[xRoot] < rank[yRoot] -> parent[xRoot] = yRoot\n xRoot != yRoot -> {\n parent[yRoot] = xRoot\n rank[xRoot]++\n }\n }\n return parent[xRoot]\n }\n\n fun find(i: Int): Int {\n if (i != parent[i]) {\n parent[i] = find(parent[i])\n }\n return parent[i]\n }\n\n fun same(x: Int, y: Int): Boolean {\n return find(x) == find(y)\n }\n}\n\nfun Map.toMutableMap(): MutableMap {\n return HashMap(this)\n}", "language": "Kotlin", "metadata": {"date": 1566179221, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s072551911.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s072551911", "user_id": "u515548399"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.lang.Math.sqrt\nimport java.util.*\n\nconst val MOD = 1000000007L\nconst val INF = Long.MAX_VALUE - 1\n\nfun main(args: Array) {\n val reader = System.`in`.bufferedReader()\n\n val (n, q) = reader.readLine()!!.split(\" \").map(Integer::parseInt)\n\n\n val edges = Array(n) {\n return@Array Edge(it)\n }\n\n for (i in 0 until n - 1) {\n val (a, b) = reader.readLine()!!.split(\" \").map(Integer::parseInt)\n edges[a - 1].nexts.add(b - 1)\n }\n\n for (i in 0 until q) {\n val (p, x) = reader.readLine()!!.split(\" \").map(Integer::parseInt)\n edges[p - 1].count += x\n }\n\n val ans = Array(n) {\n return@Array -1L\n }\n\n fun dfs(n: Int, ret: Long) {\n if (ans[n] != -1L) return\n val now = ret + edges[n].count\n ans[n] = now\n\n for (next in edges[n].nexts) {\n dfs(next, now)\n }\n }\n\n dfs(0, 0)\n\n val pw = PrintWriter(System.out)\n ans.forEach {\n pw.print(\"$it \")\n }\n pw.flush()\n}\n\nclass Edge(var num: Int) {\n var count = 0\n val nexts = emptyList().toMutableList()\n}\n\n\nfun readList() = readLine()!!.split(' ')\nfun readInt() = readIntList().first()\nfun readIntList() = readList().map(String::toInt)\nfun readLong() = readLongList().first()\nfun readLongList() = readList().map(String::toLong)\nfun readDoubleList() = readList().map(String::toDouble)\n\nfun readClass(n: Int, body: (List) -> T): List {\n val ret = mutableListOf()\n for (i in 0 until n) {\n ret.add(body(readList()))\n }\n return ret\n}\n\nfun readPair(): Pair {\n val splite = readLine()!!.split(' ')\n return Pair(splite[0], splite[1])\n}\n\nfun List.copy() = this.map { it }\n\nfun Long.toBinaryString(): String {\n var t = this\n var res = \"\"\n while (t > 0) {\n res += (t % 2).toString()\n t /= 2\n }\n return res\n}\n\ninline fun dualArray(h: Int, w: Int, init: (Int, Int) -> T) {\n Array(h) { i ->\n return@Array Array(w) { j ->\n return@Array init(i, j)\n }\n }\n}\n\n// 速度のためforEachは避ける\ninline fun Int.rep(start: Int = 0, shiftLast: Boolean = false, body: (Int) -> Unit) {\n for (i in start until if (shiftLast) this + start else this) {\n body(i)\n }\n}\n\ninline fun Long.rep(start: Long = 0, shiftLast: Boolean = false, body: (Long) -> Unit) {\n for (i in start until if (shiftLast) this + start else this) {\n body(i)\n }\n}\n\n// 約数のList\nfun divisor(value: Long): List {\n val max = sqrt(value.toDouble()).toLong()\n val former = mutableListOf()\n val latter = mutableListOf()\n (1..max).filter { value % it == 0L }\n .forEach {\n former.add(it)\n latter.add(value / it)\n }\n former.addAll(latter.reversed())\n return former\n}\n\n// 範囲内の素数を取得\n// fromだけ指定すると戻り値の個数で素数判定ができる\nfun prime(from: Long, to: Long = from): List {\n return (from..to).filter { i ->\n val max = Math.sqrt(i.toDouble()).toLong()\n (2..max).all { j -> i % j != 0L }\n }\n}\n\n// 素因数分解\nfun decom(value: Long): List {\n if (value == 1L) return listOf(1)\n val max = Math.sqrt(value.toDouble()).toLong()\n return prime(2, max).filter { value % it == 0L }\n}\n\n// 最大公約数\nfun gcd(a: Long, b: Long): Long {\n return if (a % b == 0L) b else gcd(b, a % b)\n}\n\n// 文字列を入れ替え\nfun swap(base: String, a: String, b: String): String {\n return base.map {\n when (it) {\n a.toCharArray()[0] -> b\n b.toCharArray()[0] -> a\n else -> it.toString()\n }\n }.joinToString()\n}\n\n// bit全探索\nfun bitAllSearch(n: Int, body: (Array) -> Unit) {\n for (bit in 0 until (1 shl n)) {\n val s = Array(n) {\n return@Array false\n }\n for (i in 0 until n) {\n if ((bit and (1 shl i)) shr i == 1) { // i が bit に入るかどうか\n s[i] = true\n }\n }\n body(s)\n }\n}\n\ninternal class UnionFindTree(size: Int) {\n\n private val parent = Array(size) {\n return@Array it\n }\n private val rank = Array(size) {\n return@Array 0\n }\n\n fun union(x: Int, y: Int): Int {\n val xRoot = find(x)\n val yRoot = find(y)\n\n if (xRoot == yRoot) return xRoot\n\n when {\n rank[xRoot] > rank[yRoot] -> parent[yRoot] = xRoot\n rank[xRoot] < rank[yRoot] -> parent[xRoot] = yRoot\n xRoot != yRoot -> {\n parent[yRoot] = xRoot\n rank[xRoot]++\n }\n }\n return parent[xRoot]\n }\n\n fun find(i: Int): Int {\n if (i != parent[i]) {\n parent[i] = find(parent[i])\n }\n return parent[i]\n }\n\n fun same(x: Int, y: Int): Boolean {\n return find(x) == find(y)\n }\n}\n\nfun Map.toMutableMap(): MutableMap {\n return HashMap(this)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5031, "cpu_time_ms": 2107, "memory_kb": 145056}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s546713421", "group_id": "codeNet:p02936", "input_text": "import java.io.PrintWriter\nimport java.lang.Math.sqrt\nimport java.util.*\n\nconst val MOD = 1000000007L\nconst val INF = Long.MAX_VALUE - 1\n\nfun main(args: Array) {\n val (n, q) = readIntList()\n\n\n val edges = Array(n) {\n return@Array Edge(it)\n }\n\n (n - 1).rep {\n val (a, b) = readIntList()\n edges[a - 1].nexts.add(b - 1)\n }\n\n q.rep {\n val (p, x) = readIntList()\n edges[p - 1].count += x\n }\n\n val ans = Array(n) {\n return@Array -1L\n }\n\n fun dfs(n: Int, ret: Long) {\n println(\"hge\")\n if (ans[n] != -1L) return\n val now = ret + edges[n].count\n ans[n] = now\n\n for (next in edges[n].nexts) {\n dfs(next, now)\n }\n }\n\n// dfs(0, 0)\n\n val pw = PrintWriter(System.out)\n ans.forEach {\n pw.print(\"$it \")\n }\n pw.flush()\n}\n\nclass Edge(var num: Int) {\n var count = 0\n val nexts = emptyList().toMutableList()\n}\n\n\nfun readList() = readLine()!!.split(' ')\nfun readInt() = readIntList().first()\nfun readIntList() = readList().map(String::toInt)\nfun readLong() = readLongList().first()\nfun readLongList() = readList().map(String::toLong)\nfun readDoubleList() = readList().map(String::toDouble)\n\nfun readClass(n: Int, body: (List) -> T): List {\n val ret = mutableListOf()\n for (i in 0 until n) {\n ret.add(body(readList()))\n }\n return ret\n}\n\nfun readPair(): Pair {\n val splite = readLine()!!.split(' ')\n return Pair(splite[0], splite[1])\n}\n\nfun List.copy() = this.map { it }\n\nfun Long.toBinaryString(): String {\n var t = this\n var res = \"\"\n while (t > 0) {\n res += (t % 2).toString()\n t /= 2\n }\n return res\n}\n\ninline fun dualArray(h: Int, w: Int, init: (Int, Int) -> T) {\n Array(h) { i ->\n return@Array Array(w) { j ->\n return@Array init(i, j)\n }\n }\n}\n\n// 速度のためforEachは避ける\ninline fun Int.rep(start: Int = 0, shiftLast: Boolean = false, body: (Int) -> Unit) {\n for (i in start until if (shiftLast) this + start else this) {\n body(i)\n }\n}\n\ninline fun Long.rep(start: Long = 0, shiftLast: Boolean = false, body: (Long) -> Unit) {\n for (i in start until if (shiftLast) this + start else this) {\n body(i)\n }\n}\n\n// 約数のList\nfun divisor(value: Long): List {\n val max = sqrt(value.toDouble()).toLong()\n val former = mutableListOf()\n val latter = mutableListOf()\n (1..max).filter { value % it == 0L }\n .forEach {\n former.add(it)\n latter.add(value / it)\n }\n former.addAll(latter.reversed())\n return former\n}\n\n// 範囲内の素数を取得\n// fromだけ指定すると戻り値の個数で素数判定ができる\nfun prime(from: Long, to: Long = from): List {\n return (from..to).filter { i ->\n val max = Math.sqrt(i.toDouble()).toLong()\n (2..max).all { j -> i % j != 0L }\n }\n}\n\n// 素因数分解\nfun decom(value: Long): List {\n if (value == 1L) return listOf(1)\n val max = Math.sqrt(value.toDouble()).toLong()\n return prime(2, max).filter { value % it == 0L }\n}\n\n// 最大公約数\nfun gcd(a: Long, b: Long): Long {\n return if (a % b == 0L) b else gcd(b, a % b)\n}\n\n// 文字列を入れ替え\nfun swap(base: String, a: String, b: String): String {\n return base.map {\n when (it) {\n a.toCharArray()[0] -> b\n b.toCharArray()[0] -> a\n else -> it.toString()\n }\n }.joinToString()\n}\n\n// bit全探索\nfun bitAllSearch(n: Int, body: (Array) -> Unit) {\n for (bit in 0 until (1 shl n)) {\n val s = Array(n) {\n return@Array false\n }\n for (i in 0 until n) {\n if ((bit and (1 shl i)) shr i == 1) { // i が bit に入るかどうか\n s[i] = true\n }\n }\n body(s)\n }\n}\n\ninternal class UnionFindTree(size: Int) {\n\n private val parent = Array(size) {\n return@Array it\n }\n private val rank = Array(size) {\n return@Array 0\n }\n\n fun union(x: Int, y: Int): Int {\n val xRoot = find(x)\n val yRoot = find(y)\n\n if (xRoot == yRoot) return xRoot\n\n when {\n rank[xRoot] > rank[yRoot] -> parent[yRoot] = xRoot\n rank[xRoot] < rank[yRoot] -> parent[xRoot] = yRoot\n xRoot != yRoot -> {\n parent[yRoot] = xRoot\n rank[xRoot]++\n }\n }\n return parent[xRoot]\n }\n\n fun find(i: Int): Int {\n if (i != parent[i]) {\n parent[i] = find(parent[i])\n }\n return parent[i]\n }\n\n fun same(x: Int, y: Int): Boolean {\n return find(x) == find(y)\n }\n}\n\nfun Map.toMutableMap(): MutableMap {\n return HashMap(this)\n}", "language": "Kotlin", "metadata": {"date": 1566178886, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s546713421.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s546713421", "user_id": "u515548399"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.lang.Math.sqrt\nimport java.util.*\n\nconst val MOD = 1000000007L\nconst val INF = Long.MAX_VALUE - 1\n\nfun main(args: Array) {\n val (n, q) = readIntList()\n\n\n val edges = Array(n) {\n return@Array Edge(it)\n }\n\n (n - 1).rep {\n val (a, b) = readIntList()\n edges[a - 1].nexts.add(b - 1)\n }\n\n q.rep {\n val (p, x) = readIntList()\n edges[p - 1].count += x\n }\n\n val ans = Array(n) {\n return@Array -1L\n }\n\n fun dfs(n: Int, ret: Long) {\n println(\"hge\")\n if (ans[n] != -1L) return\n val now = ret + edges[n].count\n ans[n] = now\n\n for (next in edges[n].nexts) {\n dfs(next, now)\n }\n }\n\n// dfs(0, 0)\n\n val pw = PrintWriter(System.out)\n ans.forEach {\n pw.print(\"$it \")\n }\n pw.flush()\n}\n\nclass Edge(var num: Int) {\n var count = 0\n val nexts = emptyList().toMutableList()\n}\n\n\nfun readList() = readLine()!!.split(' ')\nfun readInt() = readIntList().first()\nfun readIntList() = readList().map(String::toInt)\nfun readLong() = readLongList().first()\nfun readLongList() = readList().map(String::toLong)\nfun readDoubleList() = readList().map(String::toDouble)\n\nfun readClass(n: Int, body: (List) -> T): List {\n val ret = mutableListOf()\n for (i in 0 until n) {\n ret.add(body(readList()))\n }\n return ret\n}\n\nfun readPair(): Pair {\n val splite = readLine()!!.split(' ')\n return Pair(splite[0], splite[1])\n}\n\nfun List.copy() = this.map { it }\n\nfun Long.toBinaryString(): String {\n var t = this\n var res = \"\"\n while (t > 0) {\n res += (t % 2).toString()\n t /= 2\n }\n return res\n}\n\ninline fun dualArray(h: Int, w: Int, init: (Int, Int) -> T) {\n Array(h) { i ->\n return@Array Array(w) { j ->\n return@Array init(i, j)\n }\n }\n}\n\n// 速度のためforEachは避ける\ninline fun Int.rep(start: Int = 0, shiftLast: Boolean = false, body: (Int) -> Unit) {\n for (i in start until if (shiftLast) this + start else this) {\n body(i)\n }\n}\n\ninline fun Long.rep(start: Long = 0, shiftLast: Boolean = false, body: (Long) -> Unit) {\n for (i in start until if (shiftLast) this + start else this) {\n body(i)\n }\n}\n\n// 約数のList\nfun divisor(value: Long): List {\n val max = sqrt(value.toDouble()).toLong()\n val former = mutableListOf()\n val latter = mutableListOf()\n (1..max).filter { value % it == 0L }\n .forEach {\n former.add(it)\n latter.add(value / it)\n }\n former.addAll(latter.reversed())\n return former\n}\n\n// 範囲内の素数を取得\n// fromだけ指定すると戻り値の個数で素数判定ができる\nfun prime(from: Long, to: Long = from): List {\n return (from..to).filter { i ->\n val max = Math.sqrt(i.toDouble()).toLong()\n (2..max).all { j -> i % j != 0L }\n }\n}\n\n// 素因数分解\nfun decom(value: Long): List {\n if (value == 1L) return listOf(1)\n val max = Math.sqrt(value.toDouble()).toLong()\n return prime(2, max).filter { value % it == 0L }\n}\n\n// 最大公約数\nfun gcd(a: Long, b: Long): Long {\n return if (a % b == 0L) b else gcd(b, a % b)\n}\n\n// 文字列を入れ替え\nfun swap(base: String, a: String, b: String): String {\n return base.map {\n when (it) {\n a.toCharArray()[0] -> b\n b.toCharArray()[0] -> a\n else -> it.toString()\n }\n }.joinToString()\n}\n\n// bit全探索\nfun bitAllSearch(n: Int, body: (Array) -> Unit) {\n for (bit in 0 until (1 shl n)) {\n val s = Array(n) {\n return@Array false\n }\n for (i in 0 until n) {\n if ((bit and (1 shl i)) shr i == 1) { // i が bit に入るかどうか\n s[i] = true\n }\n }\n body(s)\n }\n}\n\ninternal class UnionFindTree(size: Int) {\n\n private val parent = Array(size) {\n return@Array it\n }\n private val rank = Array(size) {\n return@Array 0\n }\n\n fun union(x: Int, y: Int): Int {\n val xRoot = find(x)\n val yRoot = find(y)\n\n if (xRoot == yRoot) return xRoot\n\n when {\n rank[xRoot] > rank[yRoot] -> parent[yRoot] = xRoot\n rank[xRoot] < rank[yRoot] -> parent[xRoot] = yRoot\n xRoot != yRoot -> {\n parent[yRoot] = xRoot\n rank[xRoot]++\n }\n }\n return parent[xRoot]\n }\n\n fun find(i: Int): Int {\n if (i != parent[i]) {\n parent[i] = find(parent[i])\n }\n return parent[i]\n }\n\n fun same(x: Int, y: Int): Boolean {\n return find(x) == find(y)\n }\n}\n\nfun Map.toMutableMap(): MutableMap {\n return HashMap(this)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4861, "cpu_time_ms": 1067, "memory_kb": 133000}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s977334863", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val n = scanner.nextInt()\n val q = scanner.nextInt()\n\n val children = Array(n + 1) { emptyList() }\n (1 until n).forEach {\n val a = scanner.nextInt()\n val b = scanner.nextInt()\n children[a] = children[a] + b\n }\n\n val count = LongArray(n + 1) { 0 }\n (1..q).forEach {\n val p = scanner.nextInt()\n val x = scanner.nextLong()\n count[p] = count[p] + x\n }\n\n fun rec(p: Int, c: Long) {\n count[p] = count[p] + c\n children[p].forEach { child ->\n rec(child, count[p])\n }\n }\n\n rec(1, 0)\n\n (1 until n).forEach {\n print(count[it])\n print(\" \")\n }\n print(count[n])\n}\n\n", "language": "Kotlin", "metadata": {"date": 1566178477, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s977334863.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s977334863", "user_id": "u153537680"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val n = scanner.nextInt()\n val q = scanner.nextInt()\n\n val children = Array(n + 1) { emptyList() }\n (1 until n).forEach {\n val a = scanner.nextInt()\n val b = scanner.nextInt()\n children[a] = children[a] + b\n }\n\n val count = LongArray(n + 1) { 0 }\n (1..q).forEach {\n val p = scanner.nextInt()\n val x = scanner.nextLong()\n count[p] = count[p] + x\n }\n\n fun rec(p: Int, c: Long) {\n count[p] = count[p] + c\n children[p].forEach { child ->\n rec(child, count[p])\n }\n }\n\n rec(1, 0)\n\n (1 until n).forEach {\n print(count[it])\n print(\" \")\n }\n print(count[n])\n}\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 778, "cpu_time_ms": 2111, "memory_kb": 147944}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s300618713", "group_id": "codeNet:p02936", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val (n, q) = readLine()!!.split(' ').map(String::toInt)\n val ansArray = Array(n + 1) { 0L }\n val tree = Array(n + 1) { mutableListOf() }\n val cost = Array(n + 1) { 0L }\n\n (1 until n).forEach {\n val (a, b) = readLine()!!.split(' ').map(String::toInt)\n tree[a].add(b)\n }\n (1..q).forEach {\n val (p, x) = readLine()!!.split(' ').map(String::toInt)\n cost[p] = cost[p] + x\n }\n\n val queue = ArrayDeque()\n queue.add(1)\n while (queue.isNotEmpty()) {\n val index = queue.pollLast()!!\n ansArray[index] = cost[index]\n val to = tree[index]\n to.let {\n for (t in to) {\n queue.add(t)\n cost[t] = cost[index] + cost[t]\n }\n }\n }\n\n (1..n).forEach {\n print(\"${ansArray[it]} \")\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1566178407, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02936.html", "problem_id": "p02936", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02936/input.txt", "sample_output_relpath": "derived/input_output/data/p02936/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02936/Kotlin/s300618713.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s300618713", "user_id": "u099066216"}, "prompt_components": {"gold_output": "100 110 111 110\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val (n, q) = readLine()!!.split(' ').map(String::toInt)\n val ansArray = Array(n + 1) { 0L }\n val tree = Array(n + 1) { mutableListOf() }\n val cost = Array(n + 1) { 0L }\n\n (1 until n).forEach {\n val (a, b) = readLine()!!.split(' ').map(String::toInt)\n tree[a].add(b)\n }\n (1..q).forEach {\n val (p, x) = readLine()!!.split(' ').map(String::toInt)\n cost[p] = cost[p] + x\n }\n\n val queue = ArrayDeque()\n queue.add(1)\n while (queue.isNotEmpty()) {\n val index = queue.pollLast()!!\n ansArray[index] = cost[index]\n val to = tree[index]\n to.let {\n for (t in to) {\n queue.add(t)\n cost[t] = cost[index] + cost[t]\n }\n }\n }\n\n (1..n).forEach {\n print(\"${ansArray[it]} \")\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "sample_input": "4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n"}, "reference_outputs": ["100 110 111 110\n"], "source_document_id": "p02936", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a rooted tree with N vertices numbered 1 to N.\nThe root is Vertex 1, and the i-th edge (1 \\leq i \\leq N - 1) connects Vertex a_i and b_i.\n\nEach of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.\n\nNow, the following Q operations will be performed:\n\nOperation j (1 \\leq j \\leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.\n\nFind the value of the counter on each vertex after all operations.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n1 \\leq a_i < b_i \\leq N\n\n1 \\leq p_j \\leq N\n\n1 \\leq x_j \\leq 10^4\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1\n:\na_{N-1} b_{N-1}\np_1 x_1\n:\np_Q x_Q\n\nOutput\n\nPrint the values of the counters on Vertex 1, 2, \\ldots, N after all operations, in this order, with spaces in between.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n2 4\n2 10\n1 100\n3 1\n\nSample Output 1\n\n100 110 111 110\n\nThe tree in this input is as follows:\n\nEach operation changes the values of the counters on the vertices as follows:\n\nOperation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.\n\nOperation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.\n\nOperation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.\n\nSample Input 2\n\n6 2\n1 2\n1 3\n2 4\n3 6\n2 5\n1 10\n1 10\n\nSample Output 2\n\n20 20 20 20 20 20", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 887, "cpu_time_ms": 1906, "memory_kb": 154508}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s818126812", "group_id": "codeNet:p02949", "input_text": "class Node(val id: Long) {\n private val edges = mutableListOf()\n var distance: Long = Long.MAX_VALUE\n var predecessor: Node? = null\n fun addEdge(edge: Edge) = edges.add(edge)\n}\n\nclass Edge(val from: Long, val to: Long, val cost: Long) {\n\n}\n\nclass Graph(val nodes: Array, val edges: Array) {\n private val nodesMap = mutableMapOf()\n\n init {\n for (node in nodes) {\n nodesMap[node.id] = node\n }\n for (edge in edges) {\n nodesMap[edge.from]?.addEdge(edge)\n }\n }\n\n fun node(id: Long): Node = nodesMap[id]!!\n\n fun solveBellmanFord(startId: Long) {\n// init\n nodesMap[startId]!!.distance = 0\n// relaxing\n for (i in 1 until nodes.size) {\n for (edge in edges) {\n val u = nodesMap[edge.from]!!\n val v = nodesMap[edge.to]!!\n if (u.distance == Long.MAX_VALUE) continue\n if (v.distance > u.distance + edge.cost) {\n v.distance = u.distance + edge.cost\n v.predecessor = u\n }\n }\n }\n val ans = nodes.last().distance\n// check negative circle\n for (i in 1 until nodes.size) {\n for (edge in edges) {\n val u = nodesMap[edge.from]!!\n val v = nodesMap[edge.to]!!\n if (u.distance == Long.MAX_VALUE) continue\n if (v.distance > u.distance + edge.cost) {\n v.distance = u.distance + edge.cost\n v.predecessor = u\n }\n }\n }\n val ans2 = nodes.last().distance\n if (ans != ans2) throw RuntimeException(\"negative circle detect!\")\n }\n}\n\nfun main(args: Array) {\n val (N, M, P) = readLine()!!.split(' ').map(String::toLong)\n val nodes = Array(N.toInt()) { Node(it.toLong() + 1) }\n val edges = Array(M.toInt()) {\n val (a, b, c) = readLine()!!.split(' ').map(String::toLong)\n Edge(a, b, -(c - P))\n }\n val graph = Graph(nodes, edges)\n try {\n graph.solveBellmanFord(1L)\n val ans = -graph.node(N).distance\n println(if (ans >= 0) ans else 0)\n } catch (e: RuntimeException) {\n// println(e)\n println(-1)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1565654062, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Kotlin/s818126812.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s818126812", "user_id": "u572745161"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "class Node(val id: Long) {\n private val edges = mutableListOf()\n var distance: Long = Long.MAX_VALUE\n var predecessor: Node? = null\n fun addEdge(edge: Edge) = edges.add(edge)\n}\n\nclass Edge(val from: Long, val to: Long, val cost: Long) {\n\n}\n\nclass Graph(val nodes: Array, val edges: Array) {\n private val nodesMap = mutableMapOf()\n\n init {\n for (node in nodes) {\n nodesMap[node.id] = node\n }\n for (edge in edges) {\n nodesMap[edge.from]?.addEdge(edge)\n }\n }\n\n fun node(id: Long): Node = nodesMap[id]!!\n\n fun solveBellmanFord(startId: Long) {\n// init\n nodesMap[startId]!!.distance = 0\n// relaxing\n for (i in 1 until nodes.size) {\n for (edge in edges) {\n val u = nodesMap[edge.from]!!\n val v = nodesMap[edge.to]!!\n if (u.distance == Long.MAX_VALUE) continue\n if (v.distance > u.distance + edge.cost) {\n v.distance = u.distance + edge.cost\n v.predecessor = u\n }\n }\n }\n val ans = nodes.last().distance\n// check negative circle\n for (i in 1 until nodes.size) {\n for (edge in edges) {\n val u = nodesMap[edge.from]!!\n val v = nodesMap[edge.to]!!\n if (u.distance == Long.MAX_VALUE) continue\n if (v.distance > u.distance + edge.cost) {\n v.distance = u.distance + edge.cost\n v.predecessor = u\n }\n }\n }\n val ans2 = nodes.last().distance\n if (ans != ans2) throw RuntimeException(\"negative circle detect!\")\n }\n}\n\nfun main(args: Array) {\n val (N, M, P) = readLine()!!.split(' ').map(String::toLong)\n val nodes = Array(N.toInt()) { Node(it.toLong() + 1) }\n val edges = Array(M.toInt()) {\n val (a, b, c) = readLine()!!.split(' ').map(String::toLong)\n Edge(a, b, -(c - P))\n }\n val graph = Graph(nodes, edges)\n try {\n graph.solveBellmanFord(1L)\n val ans = -graph.node(N).distance\n println(if (ans >= 0) ans else 0)\n } catch (e: RuntimeException) {\n// println(e)\n println(-1)\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2298, "cpu_time_ms": 1883, "memory_kb": 116012}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s617072067", "group_id": "codeNet:p02949", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val (n, m, p) = readLine()!!.split(\" \").map { it.toInt() }\n val bell = BellmanFord(n)\n repeat(m) {\n readLine()!!.split(\" \").map { it.toInt() }.let { bell.addEdge(it[0] - 1, it[1] - 1, -it[2] + p) }\n }\n val pair = bell.build(0, n - 1)\n if (pair.first) {\n println(-1)\n } else {\n println(Math.max(0, -pair.second))\n }\n}\n\nclass Edge(val from: Int, val to: Int, val cost: Int)\n\nclass BellmanFord(private val n: Int) {\n private val used = Array(n) { false }\n private val reach = Array(n) { false }\n private val g = Array(n) {\n ArrayList()\n }\n private val edges = ArrayList()\n\n fun addEdge(from: Int, to: Int, cost: Int) {\n edges.add(Edge(from, to, cost))\n g[from].add(to)\n }\n\n private fun dfs(v: Int) {\n if (used[v]) return\n used[v] = true\n g[v].forEach { dfs(it) }\n }\n\n fun build(from: Int, to: Int): Pair {\n for (i in 0 until n) {\n used.fill(false)\n dfs(i)\n reach[i] = used[to]\n }\n val inf = Int.MAX_VALUE / 2\n val d = Array(n) { inf }\n d[from] = 0\n for (j in 0 until n) {\n var update = false\n for (edge in edges) {\n if (!reach[edge.from] || !reach[edge.to] || d[edge.from] == inf) continue\n if (d[edge.to] > d[edge.from] + edge.cost) {\n d[edge.to] = edge.from + edge.cost\n update = true\n }\n }\n if (!update) break\n if (j == n - 1) {\n return Pair(true, inf)\n }\n }\n return Pair(false, d[to])\n }\n}", "language": "Kotlin", "metadata": {"date": 1565553302, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Kotlin/s617072067.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s617072067", "user_id": "u719622470"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val (n, m, p) = readLine()!!.split(\" \").map { it.toInt() }\n val bell = BellmanFord(n)\n repeat(m) {\n readLine()!!.split(\" \").map { it.toInt() }.let { bell.addEdge(it[0] - 1, it[1] - 1, -it[2] + p) }\n }\n val pair = bell.build(0, n - 1)\n if (pair.first) {\n println(-1)\n } else {\n println(Math.max(0, -pair.second))\n }\n}\n\nclass Edge(val from: Int, val to: Int, val cost: Int)\n\nclass BellmanFord(private val n: Int) {\n private val used = Array(n) { false }\n private val reach = Array(n) { false }\n private val g = Array(n) {\n ArrayList()\n }\n private val edges = ArrayList()\n\n fun addEdge(from: Int, to: Int, cost: Int) {\n edges.add(Edge(from, to, cost))\n g[from].add(to)\n }\n\n private fun dfs(v: Int) {\n if (used[v]) return\n used[v] = true\n g[v].forEach { dfs(it) }\n }\n\n fun build(from: Int, to: Int): Pair {\n for (i in 0 until n) {\n used.fill(false)\n dfs(i)\n reach[i] = used[to]\n }\n val inf = Int.MAX_VALUE / 2\n val d = Array(n) { inf }\n d[from] = 0\n for (j in 0 until n) {\n var update = false\n for (edge in edges) {\n if (!reach[edge.from] || !reach[edge.to] || d[edge.from] == inf) continue\n if (d[edge.to] > d[edge.from] + edge.cost) {\n d[edge.to] = edge.from + edge.cost\n update = true\n }\n }\n if (!update) break\n if (j == n - 1) {\n return Pair(true, inf)\n }\n }\n return Pair(false, d[to])\n }\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1741, "cpu_time_ms": 1102, "memory_kb": 110072}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s989799561", "group_id": "codeNet:p02949", "input_text": "fun main(args: Array) {\n val (n, m, c) = readLine()!!.split(\" \").map { it.toInt() }\n val edges = Array(m) {\n readLine()!!.split(\" \").map { it.toInt() }.let { Edge(it[0] - 1, it[1] - 1, -it[2] + c) }\n }\n val d = Array(n) { Int.MAX_VALUE / 2 }\n fun bellmanFord(sv: Int): Boolean {\n d.fill(Int.MAX_VALUE / 2)\n d[sv] = 0\n\n repeat(n) {\n edges.forEach {\n if (d[it.from] + it.cost < d[it.to]) {\n d[it.to] = d[it.from] + it.cost\n }\n }\n }\n val lengthOfNAfterN = d[n - 1]\n repeat(n) {\n edges.forEach {\n if (d[it.from] + it.cost < d[it.to]) {\n d[it.to] = d[it.from] + it.cost\n }\n }\n }\n return lengthOfNAfterN == d[n - 1]\n }\n if (bellmanFord(0)) {\n println(Math.max(-d[n - 1], 0))\n } else {\n println(-1)\n }\n}\n\nclass Edge(val from: Int, val to: Int, val cost: Int)", "language": "Kotlin", "metadata": {"date": 1565542475, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02949.html", "problem_id": "p02949", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02949/input.txt", "sample_output_relpath": "derived/input_output/data/p02949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02949/Kotlin/s989799561.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s989799561", "user_id": "u719622470"}, "prompt_components": {"gold_output": "35\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m, c) = readLine()!!.split(\" \").map { it.toInt() }\n val edges = Array(m) {\n readLine()!!.split(\" \").map { it.toInt() }.let { Edge(it[0] - 1, it[1] - 1, -it[2] + c) }\n }\n val d = Array(n) { Int.MAX_VALUE / 2 }\n fun bellmanFord(sv: Int): Boolean {\n d.fill(Int.MAX_VALUE / 2)\n d[sv] = 0\n\n repeat(n) {\n edges.forEach {\n if (d[it.from] + it.cost < d[it.to]) {\n d[it.to] = d[it.from] + it.cost\n }\n }\n }\n val lengthOfNAfterN = d[n - 1]\n repeat(n) {\n edges.forEach {\n if (d[it.from] + it.cost < d[it.to]) {\n d[it.to] = d[it.from] + it.cost\n }\n }\n }\n return lengthOfNAfterN == d[n - 1]\n }\n if (bellmanFord(0)) {\n println(Math.max(-d[n - 1], 0))\n } else {\n println(-1)\n }\n}\n\nclass Edge(val from: Int, val to: Int, val cost: Int)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "sample_input": "3 3 10\n1 2 20\n2 3 30\n1 3 45\n"}, "reference_outputs": ["35\n"], "source_document_id": "p02949", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a directed graph with N vertices numbered 1 to N and M edges.\nThe i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins \bplaced along that edge.\nAdditionally, there is a button on Vertex N.\n\nWe will play a game on this graph.\nYou start the game on Vertex 1 with zero coins, and head for Vertex N by traversing the edges while collecting coins.\nIt takes one minute to traverse an edge, and you can collect the coins placed along the edge each time you traverse it.\nAs usual in games, even if you traverse an edge once and collect the coins, the same number of coins will reappear next time you traverse that edge, which you can collect again.\n\nWhen you reach Vertex N, you can end the game by pressing the button. (You can also choose to leave Vertex N without pressing the button and continue traveling.)\nHowever, when you end the game, you will be asked to pay T \\times P coins, where T is the number of minutes elapsed since the start of the game. If you have less than T \\times P coins, you will have to pay all of your coins instead.\n\nYour score will be the number of coins you have after this payment.\nDetermine if there exists a maximum value of the score that can be obtained. If the answer is yes, find that maximum value.\n\nConstraints\n\n2 \\leq N \\leq 2500\n\n1 \\leq M \\leq 5000\n\n1 \\leq A_i, B_i \\leq N\n\n1 \\leq C_i \\leq 10^5\n\n0 \\leq P \\leq 10^5\n\nAll values in input are integers.\n\nVertex N can be reached from Vertex 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M P\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nIf there exists a maximum value of the score that can be obtained, print that maximum value; otherwise, print -1.\n\nSample Input 1\n\n3 3 10\n1 2 20\n2 3 30\n1 3 45\n\nSample Output 1\n\n35\n\nThere are two ways to travel from Vertex 1 to Vertex 3:\n\nVertex 1 \\rightarrow 2 \\rightarrow 3: You collect 20 + 30 = 50 coins on the way. After two minutes from the start of the game, you press the button, pay 2 \\times 10 = 20 coins, and you have 50 - 20 = 30 coins left.\n\nVertex 1 \\rightarrow 2: You collect 45 coins on the way. After one minute from the start of the game, you press the button, pay 1 \\times 10 = 10 coins, and you have 45 - 10 = 35 coins left.\n\nThus, the maximum score that can be obtained is 35.\n\nSample Input 2\n\n2 2 10\n1 2 100\n2 2 100\n\nSample Output 2\n\n-1\n\nThe edge extending from Vertex 1 takes you to Vertex 2. If you then traverse the edge extending from Vertex 2 to itself t times and press the button, your score will be 90 + 90t. Thus, you can infinitely increase your score, which means there is no maximum value of the score that can be obtained.\n\nSample Input 3\n\n4 5 10\n1 2 1\n1 4 1\n3 4 1\n2 2 100\n3 3 100\n\nSample Output 3\n\n0\n\nThere is no way to travel from Vertex 1 to Vertex 4 other than traversing the edge leading from Vertex 1 to Vertex 4 directly. You will pick up one coin along this edge, but after being asked to paying 10 coins, your score will be 0.\n\nNote that you can collect an infinite number of coins if you traverse the edge leading from Vertex 1 to Vertex 2, but this is pointless since you can no longer reach Vertex 4 and end the game.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1005, "cpu_time_ms": 1081, "memory_kb": 107032}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s540996642", "group_id": "codeNet:p02953", "input_text": "fun main() {\n val n= readLine()!!.toInt()\n val h= readLine()!!.split(\" \").map { it.toInt() }.toIntArray()\n var now=0\n for (i in 0 until h.size){\n if (i==0){now=h[0]-1}\n else{\n if (nowh[i]){now=-1;break}\n }\n }\n if (now==-1){\n println(\"No\")\n }else{\n println(\"Yes\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1600479854, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s540996642.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s540996642", "user_id": "u456173040"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main() {\n val n= readLine()!!.toInt()\n val h= readLine()!!.split(\" \").map { it.toInt() }.toIntArray()\n var now=0\n for (i in 0 until h.size){\n if (i==0){now=h[0]-1}\n else{\n if (nowh[i]){now=-1;break}\n }\n }\n if (now==-1){\n println(\"No\")\n }else{\n println(\"Yes\")\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 413, "cpu_time_ms": 316, "memory_kb": 52316}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s441381339", "group_id": "codeNet:p02953", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val h = (1..n).map { sc.nextInt() }.toIntArray()\n\n\n val hh = IntArray(n) { h[it] }\n for (i in 0 until n - 1) {\n if (hh[i] > hh[i + 1]) {\n hh[i] = hh[i] - 1\n }\n }\n\n for (i in 0 until n - 1) {\n if (hh[i] > hh[i + 1]) {\n println(\"No\")\n return\n }\n }\n\n println(\"Yes\")\n}", "language": "Kotlin", "metadata": {"date": 1591462913, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s441381339.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s441381339", "user_id": "u323522006"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val h = (1..n).map { sc.nextInt() }.toIntArray()\n\n\n val hh = IntArray(n) { h[it] }\n for (i in 0 until n - 1) {\n if (hh[i] > hh[i + 1]) {\n hh[i] = hh[i] - 1\n }\n }\n\n for (i in 0 until n - 1) {\n if (hh[i] > hh[i + 1]) {\n println(\"No\")\n return\n }\n }\n\n println(\"Yes\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 406, "cpu_time_ms": 583, "memory_kb": 56148}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s712265232", "group_id": "codeNet:p02953", "input_text": "fun main(array: Array) {\n val n = readLine()!!.toInt()\n val list = readLine()!!.split(\" \").map { it.toInt() }\n var max = 0\n for(i in list.indices) {\n if(list[i] <= max - 2) {\n print(\"No\")\n return\n }\n else {\n if(list[i] > max) {\n max = list[i]\n }\n }\n }\n print(\"Yes\")\n}", "language": "Kotlin", "metadata": {"date": 1591046230, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s712265232.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s712265232", "user_id": "u124119858"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(array: Array) {\n val n = readLine()!!.toInt()\n val list = readLine()!!.split(\" \").map { it.toInt() }\n var max = 0\n for(i in list.indices) {\n if(list[i] <= max - 2) {\n print(\"No\")\n return\n }\n else {\n if(list[i] > max) {\n max = list[i]\n }\n }\n }\n print(\"Yes\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 380, "cpu_time_ms": 492, "memory_kb": 57812}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s878396368", "group_id": "codeNet:p02953", "input_text": "fun main(args: Array) {\n val n = readLine()!!.split(\" \").map { it.toInt() }[0]\n val h = readLine()!!.split(\" \").map { it.toLong() }.toMutableList()\n h[0] = h[0] - 1\n var flag = 0\n for (i in 1 until n){\n if (h[i] > h[i-1]){\n h[i] = h[i] - 1\n } else if (h[i] < h[i-1]){\n flag = 1\n break\n }\n }\n if (flag == 0){\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1587785246, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s878396368.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s878396368", "user_id": "u385678999"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.split(\" \").map { it.toInt() }[0]\n val h = readLine()!!.split(\" \").map { it.toLong() }.toMutableList()\n h[0] = h[0] - 1\n var flag = 0\n for (i in 1 until n){\n if (h[i] > h[i-1]){\n h[i] = h[i] - 1\n } else if (h[i] < h[i-1]){\n flag = 1\n break\n }\n }\n if (flag == 0){\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 456, "cpu_time_ms": 550, "memory_kb": 68060}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s314637723", "group_id": "codeNet:p02953", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val H = IntArray(N) { sc.next().toInt() }\n var prev = H[0]\n H.forEach { h ->\n if (h < prev) {\n pw.println(\"No\")\n return\n } else if (h != prev) {\n prev = h - 1\n }\n }\n pw.println(\"Yes\")\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1587774639, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s314637723.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s314637723", "user_id": "u297767059"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val H = IntArray(N) { sc.next().toInt() }\n var prev = H[0]\n H.forEach { h ->\n if (h < prev) {\n pw.println(\"No\")\n return\n } else if (h != prev) {\n prev = h - 1\n }\n }\n pw.println(\"Yes\")\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 570, "cpu_time_ms": 584, "memory_kb": 44424}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s931383334", "group_id": "codeNet:p02953", "input_text": "fun main(args: Array) {\n // Your code here!\n val n = readLine()!!.toLong()\n var list = readLine()!!.split(\" \").map{it.toLong()}\n var msg = \"Yes\"\n \n if(n > 1L){\n for(i in 1..(n-1).toInt()){\n if(list[i-1] -1L > list[i]){\n msg = \"No\"\n break\n }\n }\n }\n print(msg)\n}", "language": "Kotlin", "metadata": {"date": 1587746694, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s931383334.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s931383334", "user_id": "u808976884"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n // Your code here!\n val n = readLine()!!.toLong()\n var list = readLine()!!.split(\" \").map{it.toLong()}\n var msg = \"Yes\"\n \n if(n > 1L){\n for(i in 1..(n-1).toInt()){\n if(list[i-1] -1L > list[i]){\n msg = \"No\"\n break\n }\n }\n }\n print(msg)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 353, "cpu_time_ms": 495, "memory_kb": 59148}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s746449300", "group_id": "codeNet:p02953", "input_text": "fun main(args: Array) {\n abc000X()\n}\n\nfun abc000X() {\n val n = readLine()!!.toInt()\n val h = readLine()!!.split(\" \").map(String::toInt)\n\n var mem = -2\n for (i in 0 until n) {\n if (mem == -2) {\n mem = h[i]\n continue\n }\n var diff = h[i] - h[i - 1]\n \n if (diff == 0) {\n } else if (diff > -1) {\n mem = 0\n } else if (diff == -1 && mem == -1) {\n println(\"No\")\n return\n } else if (diff == -1) {\n mem = -1\n } else {\n println(\"No\")\n return\n }\n }\n\n println(\"Yes\")\n}\n", "language": "Kotlin", "metadata": {"date": 1586740706, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s746449300.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s746449300", "user_id": "u111160776"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n abc000X()\n}\n\nfun abc000X() {\n val n = readLine()!!.toInt()\n val h = readLine()!!.split(\" \").map(String::toInt)\n\n var mem = -2\n for (i in 0 until n) {\n if (mem == -2) {\n mem = h[i]\n continue\n }\n var diff = h[i] - h[i - 1]\n \n if (diff == 0) {\n } else if (diff > -1) {\n mem = 0\n } else if (diff == -1 && mem == -1) {\n println(\"No\")\n return\n } else if (diff == -1) {\n mem = -1\n } else {\n println(\"No\")\n return\n }\n }\n\n println(\"Yes\")\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 643, "cpu_time_ms": 494, "memory_kb": 57556}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s697128805", "group_id": "codeNet:p02953", "input_text": "import java.io.BufferedReader\nimport java.io.PrintWriter\nimport java.lang.StrictMath.abs\n\n\nvar out: PrintWriter = PrintWriter(System.out) // これを使って出力すると早い\nfun main(args: Array) {\n try {\n val n = ReadLib.readInt()\n if (n == 1){\n out.println(\"Yes\")\n return\n }\n \n val h = ReadLib.readIntArray()\n\n var prev = h.first()\n for (i in 1 until h.count()) {\n if (prev <= h[1]) {\n prev = h[1]\n continue\n }\n\n if (prev == h[1] - 1){\n prev = h[1] - 1\n continue\n }\n\n out.println(\"No\")\n return\n }\n\n out.println(\"Yes\")\n return\n\n } finally {\n out.flush() // 消さない\n }\n}\n\n/**\n * 読み取り\n */\nclass ReadLib {\n companion object {\n private var reader: BufferedReader = System.`in`.bufferedReader()\n\n fun reset() {\n reader = System.`in`.bufferedReader()\n }\n\n fun readInt(): Int {\n return Integer.parseInt(reader.readLine())\n }\n\n // Int\n fun readIntArray(delimiters: String = \" \"): IntArray {\n return reader\n .readLine()\n .split(delimiters)\n .map { s -> Integer.parseInt(s) }\n .toIntArray()\n }\n\n fun readNTimesInt(n: Int): IntArray {\n return (1..n).map { readInt() }.toIntArray()\n }\n\n fun readNTimesIntArray(n: Int): Array {\n return (1..n).map { readIntArray() }.toTypedArray()\n }\n\n // long\n // TODO 別の方法を考える\n fun readLong(): Long {\n return reader.readLine().toLong()\n }\n\n fun readLongArray(delimiters: String = \" \"): LongArray {\n return reader.readLine()\n .split(delimiters)\n .map { s -> s.toLong() }\n .toLongArray()\n }\n\n fun readNTimesLong(n: Int): LongArray {\n return (1..n).map { readLong() }.toLongArray()\n }\n\n fun readString(): String {\n return reader.readLine()\n }\n\n fun readStringArray(delimiters: String = \" \"): Array {\n return readString().split(delimiters).toTypedArray()\n }\n\n fun readNTimesCharArray(n: Int): Array {\n return (1..n).map { readString().toCharArray() }.toTypedArray()\n }\n\n fun readNTimesString(n: Int): Array {\n return (1..n).map { readString() }.toTypedArray()\n }\n\n }\n}\n\n/**\n * 要素とその個数を出力\n */\nfun Array.ofCountMap(): Map {\n return this.groupBy { it }.mapValues { it.value.count() }\n}\n\n/**\n * 文字とその個数を出力\n */\nfun String.ofCountMap(): Map {\n return this.toCharArray().ofCountMap()\n}\n\n/**\n * 文字とその個数を出力\n */\nfun CharArray.ofCountMap(): Map {\n return this.groupBy { it }.mapValues { it.value.count() }\n}\n\n/**\n * Combination, nCk mod p を求める\n * https://ja.wikipedia.org/wiki/%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%A9%E9%80%86%E6%95%B0\n * http://drken1215.hatenablog.com/entry/2018/06/08/210000\n * @param maxN 最大のn\n * @param mod 素数p\n */\nclass ModCombination(private val maxN: Int, private val mod: Int = 1000000007) {\n val fac: IntArray = IntArray(maxN)\n val finv: IntArray = IntArray(maxN)\n\n init {\n val inv: IntArray = IntArray(maxN)\n fac[0] = 1\n fac[1] = 1\n\n inv[0] = 1\n inv[1] = 1\n for (i in 2..maxN) {\n fac[i] = fac[i - 1] * i % mod // 累積\n // mod % i < i\n inv[i] = mod - ((inv[mod % i].toLong()) * (mod / i) % mod).toInt()\n finv[i] = finv[i - 1] * inv[i] % mod\n }\n }\n\n /**\n * nCk mod p\n */\n fun Calc(n: Int, k: Int): Int {\n if (n < k || n < 0 || k < 0) {\n return 0\n }\n\n return ((fac[n].toLong() * finv[k] % mod) * finv[n - k] % mod).toInt()\n }\n}\n\nclass MyMath {\n companion object {\n fun gcd(m: Long, n: Long) {\n\n }\n }\n}", "language": "Kotlin", "metadata": {"date": 1570994312, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s697128805.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s697128805", "user_id": "u368201579"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.PrintWriter\nimport java.lang.StrictMath.abs\n\n\nvar out: PrintWriter = PrintWriter(System.out) // これを使って出力すると早い\nfun main(args: Array) {\n try {\n val n = ReadLib.readInt()\n if (n == 1){\n out.println(\"Yes\")\n return\n }\n \n val h = ReadLib.readIntArray()\n\n var prev = h.first()\n for (i in 1 until h.count()) {\n if (prev <= h[1]) {\n prev = h[1]\n continue\n }\n\n if (prev == h[1] - 1){\n prev = h[1] - 1\n continue\n }\n\n out.println(\"No\")\n return\n }\n\n out.println(\"Yes\")\n return\n\n } finally {\n out.flush() // 消さない\n }\n}\n\n/**\n * 読み取り\n */\nclass ReadLib {\n companion object {\n private var reader: BufferedReader = System.`in`.bufferedReader()\n\n fun reset() {\n reader = System.`in`.bufferedReader()\n }\n\n fun readInt(): Int {\n return Integer.parseInt(reader.readLine())\n }\n\n // Int\n fun readIntArray(delimiters: String = \" \"): IntArray {\n return reader\n .readLine()\n .split(delimiters)\n .map { s -> Integer.parseInt(s) }\n .toIntArray()\n }\n\n fun readNTimesInt(n: Int): IntArray {\n return (1..n).map { readInt() }.toIntArray()\n }\n\n fun readNTimesIntArray(n: Int): Array {\n return (1..n).map { readIntArray() }.toTypedArray()\n }\n\n // long\n // TODO 別の方法を考える\n fun readLong(): Long {\n return reader.readLine().toLong()\n }\n\n fun readLongArray(delimiters: String = \" \"): LongArray {\n return reader.readLine()\n .split(delimiters)\n .map { s -> s.toLong() }\n .toLongArray()\n }\n\n fun readNTimesLong(n: Int): LongArray {\n return (1..n).map { readLong() }.toLongArray()\n }\n\n fun readString(): String {\n return reader.readLine()\n }\n\n fun readStringArray(delimiters: String = \" \"): Array {\n return readString().split(delimiters).toTypedArray()\n }\n\n fun readNTimesCharArray(n: Int): Array {\n return (1..n).map { readString().toCharArray() }.toTypedArray()\n }\n\n fun readNTimesString(n: Int): Array {\n return (1..n).map { readString() }.toTypedArray()\n }\n\n }\n}\n\n/**\n * 要素とその個数を出力\n */\nfun Array.ofCountMap(): Map {\n return this.groupBy { it }.mapValues { it.value.count() }\n}\n\n/**\n * 文字とその個数を出力\n */\nfun String.ofCountMap(): Map {\n return this.toCharArray().ofCountMap()\n}\n\n/**\n * 文字とその個数を出力\n */\nfun CharArray.ofCountMap(): Map {\n return this.groupBy { it }.mapValues { it.value.count() }\n}\n\n/**\n * Combination, nCk mod p を求める\n * https://ja.wikipedia.org/wiki/%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%A9%E9%80%86%E6%95%B0\n * http://drken1215.hatenablog.com/entry/2018/06/08/210000\n * @param maxN 最大のn\n * @param mod 素数p\n */\nclass ModCombination(private val maxN: Int, private val mod: Int = 1000000007) {\n val fac: IntArray = IntArray(maxN)\n val finv: IntArray = IntArray(maxN)\n\n init {\n val inv: IntArray = IntArray(maxN)\n fac[0] = 1\n fac[1] = 1\n\n inv[0] = 1\n inv[1] = 1\n for (i in 2..maxN) {\n fac[i] = fac[i - 1] * i % mod // 累積\n // mod % i < i\n inv[i] = mod - ((inv[mod % i].toLong()) * (mod / i) % mod).toInt()\n finv[i] = finv[i - 1] * inv[i] % mod\n }\n }\n\n /**\n * nCk mod p\n */\n fun Calc(n: Int, k: Int): Int {\n if (n < k || n < 0 || k < 0) {\n return 0\n }\n\n return ((fac[n].toLong() * finv[k] % mod) * finv[n - k] % mod).toInt()\n }\n}\n\nclass MyMath {\n companion object {\n fun gcd(m: Long, n: Long) {\n\n }\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4189, "cpu_time_ms": 479, "memory_kb": 62316}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s727429021", "group_id": "codeNet:p02953", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val hList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n for (i in n-2 downTo 0) {\n if(hList[i] > hList[i+1] + 1) {\n println(\"No\")\n return\n } else if (hList[i] == hList[i+1] + 1) hList[i] -= 1\n }\n println(\"Yes\")\n}", "language": "Kotlin", "metadata": {"date": 1566353203, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s727429021.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s727429021", "user_id": "u634493908"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val hList = readLine()!!.split(\" \").map(String::toInt).toMutableList()\n for (i in n-2 downTo 0) {\n if(hList[i] > hList[i+1] + 1) {\n println(\"No\")\n return\n } else if (hList[i] == hList[i+1] + 1) hList[i] -= 1\n }\n println(\"Yes\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 342, "cpu_time_ms": 491, "memory_kb": 59528}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s916696301", "group_id": "codeNet:p02953", "input_text": "import java.util.*\n\nfun main(args : Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextLong()\n val h = (0 until n).map { sc.next().toLong() }\n\n println(problem136c(n, h))\n}\n\nfun problem136c(n: Long, h:List): String {\n h.forEachIndexed { i, hi ->\n if (i == 0) return@forEachIndexed\n if (hi < h[i - 1] - 1) {\n return \"No\"\n }\n if (i >= 2 && hi < h[i - 2] - 1) {\n return \"No\"\n }\n }\n return \"Yes\"\n}", "language": "Kotlin", "metadata": {"date": 1565453605, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s916696301.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s916696301", "user_id": "u073232808"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main(args : Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextLong()\n val h = (0 until n).map { sc.next().toLong() }\n\n println(problem136c(n, h))\n}\n\nfun problem136c(n: Long, h:List): String {\n h.forEachIndexed { i, hi ->\n if (i == 0) return@forEachIndexed\n if (hi < h[i - 1] - 1) {\n return \"No\"\n }\n if (i >= 2 && hi < h[i - 2] - 1) {\n return \"No\"\n }\n }\n return \"Yes\"\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 490, "cpu_time_ms": 649, "memory_kb": 49724}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s698227235", "group_id": "codeNet:p02953", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val l = readLine()!!.split(' ').map(String::toLong).reversed().toMutableList()\n\n for (i in 0 until n - 1) {\n when(l[i] - l[i + 1]){\n in(2..Long.MAX_VALUE) -> {\n println(\"No\")\n return\n }\n 1L -> l[i + 1] -= 1L\n }\n\n }\n println(\"Yes\")\n}\n", "language": "Kotlin", "metadata": {"date": 1565354624, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s698227235.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s698227235", "user_id": "u227189389"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val l = readLine()!!.split(' ').map(String::toLong).reversed().toMutableList()\n\n for (i in 0 until n - 1) {\n when(l[i] - l[i + 1]){\n in(2..Long.MAX_VALUE) -> {\n println(\"No\")\n return\n }\n 1L -> l[i + 1] -= 1L\n }\n\n }\n println(\"Yes\")\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 388, "cpu_time_ms": 498, "memory_kb": 59448}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s719811352", "group_id": "codeNet:p02953", "input_text": "import kotlin.system.exitProcess\n\nfun main() {\n readLine()\n val list = IO.readIntList().asReversed()\n var old = list[0]\n list.forEachIndexed { index: Int, value:Int ->\n if (index != 0) {\n var v = value\n if (v > old) v = v - 1\n if (v > old) {\n println(\"No\")\n exitProcess(0)\n }\n old = v\n }\n }\n println(\"Yes\")\n}\n\nobject IO {\n fun readIntList(): List {\n return readLine()!!.split(\" \").map(String::toInt)\n }\n}", "language": "Kotlin", "metadata": {"date": 1565310535, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s719811352.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s719811352", "user_id": "u796228844"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import kotlin.system.exitProcess\n\nfun main() {\n readLine()\n val list = IO.readIntList().asReversed()\n var old = list[0]\n list.forEachIndexed { index: Int, value:Int ->\n if (index != 0) {\n var v = value\n if (v > old) v = v - 1\n if (v > old) {\n println(\"No\")\n exitProcess(0)\n }\n old = v\n }\n }\n println(\"Yes\")\n}\n\nobject IO {\n fun readIntList(): List {\n return readLine()!!.split(\" \").map(String::toInt)\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 511, "cpu_time_ms": 157, "memory_kb": 31260}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s183618498", "group_id": "codeNet:p02953", "input_text": "import java.util.*\n\nfun main() {\n readLine()\n val list = readIntList().asReversed()\n var old = list[0]\n list.forEachIndexed { index, value ->\n if (index != 0) {\n var v = value\n if (v > old) v = v - 1\n if (v > old) {\n println(\"No\")\n return\n }\n old = v\n }\n }\n println(\"Yes\")\n}\n\nfun readIntList(): List {\n return readLine()!!.split(\" \").map(String::toInt)\n}", "language": "Kotlin", "metadata": {"date": 1565309687, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s183618498.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s183618498", "user_id": "u796228844"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main() {\n readLine()\n val list = readIntList().asReversed()\n var old = list[0]\n list.forEachIndexed { index, value ->\n if (index != 0) {\n var v = value\n if (v > old) v = v - 1\n if (v > old) {\n println(\"No\")\n return\n }\n old = v\n }\n }\n println(\"Yes\")\n}\n\nfun readIntList(): List {\n return readLine()!!.split(\" \").map(String::toInt)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 449, "cpu_time_ms": 162, "memory_kb": 31388}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s093708147", "group_id": "codeNet:p02953", "input_text": "fun main(args: Array) {\n\n val n = readLine()!!.toInt()\n\n val h = readLine()!!.split(\" \").map { it.toInt() }.toTypedArray()\n\n if (n == 1) {\n println(\"Yes\")\n return\n }\n\n var c = 0\n\n for (i in n - 2 downTo 0) {\n\n if(h[i] <= h[i+1]) continue\n\n if (h[i] - h[i+1] == 1){\n h[i] -= 1\n continue\n }\n\n c++\n break\n }\n\n if (c == 1) println(\"No\") else println(\"Yes\")\n}\n", "language": "Kotlin", "metadata": {"date": 1564973634, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s093708147.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s093708147", "user_id": "u108272327"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n\n val n = readLine()!!.toInt()\n\n val h = readLine()!!.split(\" \").map { it.toInt() }.toTypedArray()\n\n if (n == 1) {\n println(\"Yes\")\n return\n }\n\n var c = 0\n\n for (i in n - 2 downTo 0) {\n\n if(h[i] <= h[i+1]) continue\n\n if (h[i] - h[i+1] == 1){\n h[i] -= 1\n continue\n }\n\n c++\n break\n }\n\n if (c == 1) println(\"No\") else println(\"Yes\")\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 458, "cpu_time_ms": 483, "memory_kb": 59600}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s731488903", "group_id": "codeNet:p02953", "input_text": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val n = nextInt()\n \tval h = listOfInt().toMutableList()\n \tfor(i in 1 until n){\n if(h[i] < h[i-1]){\n if((i == 1 || h[i]>=h[i-2]-1) && h[i-1]-h[i] == 1){\n h[i-1]--\n if(h[i]==h[i-2]-1) h[i-2]--\n }\n else{\n println(\"No\")\n return\n }\n }\n }\n \n println(\"Yes\")\n}\n\n// 入力取得\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() =listOfString().map { it.toInt() }\nfun listOfLong() =listOfString().map { it.toLong() }\nfun listOfDouble() =listOfString().map { it.toDouble() }\n", "language": "Kotlin", "metadata": {"date": 1564972674, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s731488903.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s731488903", "user_id": "u957679320"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val n = nextInt()\n \tval h = listOfInt().toMutableList()\n \tfor(i in 1 until n){\n if(h[i] < h[i-1]){\n if((i == 1 || h[i]>=h[i-2]-1) && h[i-1]-h[i] == 1){\n h[i-1]--\n if(h[i]==h[i-2]-1) h[i-2]--\n }\n else{\n println(\"No\")\n return\n }\n }\n }\n \n println(\"Yes\")\n}\n\n// 入力取得\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() =listOfString().map { it.toInt() }\nfun listOfLong() =listOfString().map { it.toLong() }\nfun listOfDouble() =listOfString().map { it.toDouble() }\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 817, "cpu_time_ms": 499, "memory_kb": 59452}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s154528007", "group_id": "codeNet:p02953", "input_text": "import java.util.*\n \nfun main(args: Array) {\n var count = readLine()!!.toInt()\n var nums = readLine()!!.split(\" \").map{it -> it.toInt() }\n var descCount = 0\n var enable = true\n count = count - 1\n \n for ((index,num) in nums.withIndex()) {\n\n if (count-index != 0) {\n if (descCount == 1) { // １つ前の処理で-1している\n if(nums[count-index].minus(1).minus(nums[count-index-1]) == -1) {\n descCount++\n } else if(nums[count-index].minus(1).minus(nums[count-index-1]) < -1) {\n enable = false\n } else {\n descCount--\n }\n } else { // していない=処理の余地がある\n if(nums[count-index].minus(nums[count-index-1]) == -1) {\n descCount++\n } else if(nums[count-index].minus(nums[count-index-1]) < -1) {\n enable = false\n } else { // する必要なし\n }\n }\n }\n }\n if (enable){\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1564972240, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s154528007.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s154528007", "user_id": "u394420840"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n \nfun main(args: Array) {\n var count = readLine()!!.toInt()\n var nums = readLine()!!.split(\" \").map{it -> it.toInt() }\n var descCount = 0\n var enable = true\n count = count - 1\n \n for ((index,num) in nums.withIndex()) {\n\n if (count-index != 0) {\n if (descCount == 1) { // １つ前の処理で-1している\n if(nums[count-index].minus(1).minus(nums[count-index-1]) == -1) {\n descCount++\n } else if(nums[count-index].minus(1).minus(nums[count-index-1]) < -1) {\n enable = false\n } else {\n descCount--\n }\n } else { // していない=処理の余地がある\n if(nums[count-index].minus(nums[count-index-1]) == -1) {\n descCount++\n } else if(nums[count-index].minus(nums[count-index-1]) < -1) {\n enable = false\n } else { // する必要なし\n }\n }\n }\n }\n if (enable){\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 976, "cpu_time_ms": 519, "memory_kb": 57920}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s550759336", "group_id": "codeNet:p02953", "input_text": "fun main(args: Array) {\n\n val n = readLine()!!.toInt()\n\n val h = readLine()!!.split(\" \").map { it.toInt() }.toTypedArray()\n\n if (n == 1) {\n println(\"Yes\")\n return\n }\n\n var c = 0\n\n for (i in 0 until n - 1) {\n\n for(j in i + 1 until n){\n if(h[i] - 2 >= h[j]) {\n c++\n break\n }\n }\n\n if (h[i] > h[i + 1] && h[i] - h[i + 1] > 1) {\n c++\n break\n }\n }\n\n if (c > 0) println(\"No\") else println(\"Yes\")\n}", "language": "Kotlin", "metadata": {"date": 1564972095, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s550759336.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s550759336", "user_id": "u108272327"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n\n val n = readLine()!!.toInt()\n\n val h = readLine()!!.split(\" \").map { it.toInt() }.toTypedArray()\n\n if (n == 1) {\n println(\"Yes\")\n return\n }\n\n var c = 0\n\n for (i in 0 until n - 1) {\n\n for(j in i + 1 until n){\n if(h[i] - 2 >= h[j]) {\n c++\n break\n }\n }\n\n if (h[i] > h[i + 1] && h[i] - h[i + 1] > 1) {\n c++\n break\n }\n }\n\n if (c > 0) println(\"No\") else println(\"Yes\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 538, "cpu_time_ms": 2111, "memory_kb": 59544}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s641900523", "group_id": "codeNet:p02953", "input_text": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val n = nextInt()\n val heights = listOfInt()\n\n if (n == 1) {\n println(\"Yes\")\n return\n }\n\n var lastH = heights[n-1]\n for (i in n-2 downTo 0) {\n if (lastH < heights[i]) {\n if (lastH < heights[i] - 1) {\n println(\"No\")\n return\n }\n lastH = heights[i] - 1\n } else {\n lastH = heights[i]\n }\n }\n\n println(\"Yes\")\n}\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map { it.toInt() }\n\nfun println(value : Any) {\n pw.println(value)\n}", "language": "Kotlin", "metadata": {"date": 1564969509, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s641900523.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s641900523", "user_id": "u262403099"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val n = nextInt()\n val heights = listOfInt()\n\n if (n == 1) {\n println(\"Yes\")\n return\n }\n\n var lastH = heights[n-1]\n for (i in n-2 downTo 0) {\n if (lastH < heights[i]) {\n if (lastH < heights[i] - 1) {\n println(\"No\")\n return\n }\n lastH = heights[i] - 1\n } else {\n lastH = heights[i]\n }\n }\n\n println(\"Yes\")\n}\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map { it.toInt() }\n\nfun println(value : Any) {\n pw.println(value)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 775, "cpu_time_ms": 490, "memory_kb": 56176}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s946292525", "group_id": "codeNet:p02953", "input_text": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n\n // length N\n val squares = readLine()!!.split(\" \").map { it.toInt() }.toMutableList()\n\n var strictlyIncreasing = true\n\n var min = if (squares[0] == 1) 0 else squares[0] -1\n\n for (i in 1 until N) {\n if (squares[i] < squares[i - 1] - 1 || squares[i] < min) {\n strictlyIncreasing = false\n break\n } else {\n min = Math.max(squares[i] - 1, min)\n }\n }\n\n if (strictlyIncreasing) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n\n", "language": "Kotlin", "metadata": {"date": 1564968790, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s946292525.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s946292525", "user_id": "u712335892"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n\n // length N\n val squares = readLine()!!.split(\" \").map { it.toInt() }.toMutableList()\n\n var strictlyIncreasing = true\n\n var min = if (squares[0] == 1) 0 else squares[0] -1\n\n for (i in 1 until N) {\n if (squares[i] < squares[i - 1] - 1 || squares[i] < min) {\n strictlyIncreasing = false\n break\n } else {\n min = Math.max(squares[i] - 1, min)\n }\n }\n\n if (strictlyIncreasing) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 582, "cpu_time_ms": 542, "memory_kb": 61332}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s699449309", "group_id": "codeNet:p02953", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val hList = readLine()!!.split(\" \").map { it.toInt() }.toMutableList()\n\n for (i in 0 until n) {\n if (i < n - 1 && hList[i] > hList[i + 1]) hList[i]--\n }\n\n for (i in 0 until n - 1) {\n if (hList[i] > hList[i + 1]) {\n println(\"No\")\n return\n }\n }\n\n println(\"Yes\")\n}\n\n", "language": "Kotlin", "metadata": {"date": 1564968789, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s699449309.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s699449309", "user_id": "u979004569"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val hList = readLine()!!.split(\" \").map { it.toInt() }.toMutableList()\n\n for (i in 0 until n) {\n if (i < n - 1 && hList[i] > hList[i + 1]) hList[i]--\n }\n\n for (i in 0 until n - 1) {\n if (hList[i] > hList[i + 1]) {\n println(\"No\")\n return\n }\n }\n\n println(\"Yes\")\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 352, "cpu_time_ms": 500, "memory_kb": 61592}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s697683610", "group_id": "codeNet:p02953", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val hList = readLine()!!.split(' ').map(String::toLong).reversed().toMutableList()\n\n for (i in 0 until n - 1) {\n if (hList[i] + 1 < hList[i + 1]) {\n println(\"No\")\n return\n } else if (hList[i] < hList[i + 1]) {\n hList[i + 1] = hList[i + 1] - 1\n }\n }\n println(\"Yes\")\n}", "language": "Kotlin", "metadata": {"date": 1564968472, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s697683610.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s697683610", "user_id": "u099066216"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val hList = readLine()!!.split(' ').map(String::toLong).reversed().toMutableList()\n\n for (i in 0 until n - 1) {\n if (hList[i] + 1 < hList[i + 1]) {\n println(\"No\")\n return\n } else if (hList[i] < hList[i + 1]) {\n hList[i + 1] = hList[i + 1] - 1\n }\n }\n println(\"Yes\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 398, "cpu_time_ms": 485, "memory_kb": 59680}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s601262467", "group_id": "codeNet:p02953", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val h = readLine()!!.split(\" \").map { it.toInt() }.toMutableList()\n if (n == 1) {\n println(\"Yes\")\n return\n }\n if (n < 4) {\n if (h[0] <= h[1] && h[1] < h[2]) println(\"Yes\")\n else if (h[0] < h[1] && h[1] <= h[0]) println(\"Yes\")\n else println(\"No\")\n return\n }\n for (i in n - 1 downTo 2) {\n if (h[i] < h[i - 1]) {\n h[i - 1] = h[i]\n }\n }\n if (h[0] > h[1]) {\n println(\"No\")\n } else {\n println(\"Yes\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1564968172, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s601262467.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s601262467", "user_id": "u122997134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val h = readLine()!!.split(\" \").map { it.toInt() }.toMutableList()\n if (n == 1) {\n println(\"Yes\")\n return\n }\n if (n < 4) {\n if (h[0] <= h[1] && h[1] < h[2]) println(\"Yes\")\n else if (h[0] < h[1] && h[1] <= h[0]) println(\"Yes\")\n else println(\"No\")\n return\n }\n for (i in n - 1 downTo 2) {\n if (h[i] < h[i - 1]) {\n h[i - 1] = h[i]\n }\n }\n if (h[0] > h[1]) {\n println(\"No\")\n } else {\n println(\"Yes\")\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 575, "cpu_time_ms": 493, "memory_kb": 59808}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s996043009", "group_id": "codeNet:p02953", "input_text": "import java.util.*\nimport java.math.*\n\nfun main(args: Array) {\n\n// var (A,B,C,D) = readLine()!!.split(\" \").map { it.toLong() }\n var N = readLine()!!.toInt()\n// val D = readLine()!!.split(\" \").map { it.toLong() }\n val H = readLine()!!.split(\" \").map { it.toLong() }.toLongArray()\n\n var ans = \"Yes\"\n var max = H[0]\n for (h in H.drop(1)) {\n if (max-h >= 2) ans = \"No\"\n if (max < h) max = h\n }\n println(ans)\n\n// println(\"%.9f\".format(ans))\n}\n", "language": "Kotlin", "metadata": {"date": 1564968109, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s996043009.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s996043009", "user_id": "u043557308"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\nimport java.math.*\n\nfun main(args: Array) {\n\n// var (A,B,C,D) = readLine()!!.split(\" \").map { it.toLong() }\n var N = readLine()!!.toInt()\n// val D = readLine()!!.split(\" \").map { it.toLong() }\n val H = readLine()!!.split(\" \").map { it.toLong() }.toLongArray()\n\n var ans = \"Yes\"\n var max = H[0]\n for (h in H.drop(1)) {\n if (max-h >= 2) ans = \"No\"\n if (max < h) max = h\n }\n println(ans)\n\n// println(\"%.9f\".format(ans))\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 490, "cpu_time_ms": 518, "memory_kb": 64112}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s940135071", "group_id": "codeNet:p02953", "input_text": "import java.lang.Math.abs\n\nfun main(args: Array) {\n readLine()!!\n val hList = readLine()!!.split(\" \").map { it.toLong() }\n\n for (i in 0 until hList.size-1) {\n if (abs(hList[i] - hList[i + 1]) > 1) {\n println(\"No\")\n return\n }\n }\n\n println(\"Yes\")\n}\n", "language": "Kotlin", "metadata": {"date": 1564967997, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s940135071.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s940135071", "user_id": "u139478771"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.lang.Math.abs\n\nfun main(args: Array) {\n readLine()!!\n val hList = readLine()!!.split(\" \").map { it.toLong() }\n\n for (i in 0 until hList.size-1) {\n if (abs(hList[i] - hList[i + 1]) > 1) {\n println(\"No\")\n return\n }\n }\n\n println(\"Yes\")\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 306, "cpu_time_ms": 486, "memory_kb": 59508}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s965343675", "group_id": "codeNet:p02953", "input_text": "import java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) = IO().exec {\n val n = int()\n val h = LongArray(n){long()}\n for (i in 0 until n-1)\n if (h[i] > h[i+1]) h[i]--\n var isOk = true\n for (i in 0 until n-1)\n if (h[i] > h[i+1]) isOk = false\n println(if (isOk) \"Yes\" else \"No\")\n}\n\nclass IO {\n val printable = 33..126\n val buffer = ByteArray(1024)\n var ptr = 0\n var buflen = 0\n val out = PrintWriter(System.out)\n fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n buflen = System.`in`.read(buffer)\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n fun readByte(): Byte {\n return if (hasNextByte()) buffer[ptr++] else return -1\n }\n fun hasNext(): Boolean {\n while (hasNextByte() && buffer[ptr] !in printable) ptr++\n return hasNextByte()\n }\n fun string(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (b in printable) {\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n fun long(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b == '-'.toByte()) {\n minus = true\n b = readByte()\n }\n if (b !in '0'.toByte()..'9'.toByte()) {\n throw NumberFormatException()\n }\n while (true) {\n if (b in '0'.toByte()..'9'.toByte()) {\n n *= 10\n n += b - '0'.toByte()\n } else if (b == (-1).toByte() || b !in printable) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n fun int(): Int {\n val nl = long()\n if (nl !in Integer.MIN_VALUE..Integer.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n fun double(): Double {\n return string().toDouble()\n }\n fun print(obj: Any) = out.print(obj)\n fun print(i: Int) = out.print(i)\n fun print(l: Long) = out.print(l)\n fun println(obj: Any) = out.println(obj)\n fun println(i: Int) = out.println(i)\n fun println(l: Long) = out.println(l)\n inline fun exec(block: IO.() -> Unit) {\n block()\n out.flush()\n }\n}", "language": "Kotlin", "metadata": {"date": 1564967276, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02953.html", "problem_id": "p02953", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02953/input.txt", "sample_output_relpath": "derived/input_output/data/p02953/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02953/Kotlin/s965343675.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s965343675", "user_id": "u095834727"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\n\nfun main(args: Array) = IO().exec {\n val n = int()\n val h = LongArray(n){long()}\n for (i in 0 until n-1)\n if (h[i] > h[i+1]) h[i]--\n var isOk = true\n for (i in 0 until n-1)\n if (h[i] > h[i+1]) isOk = false\n println(if (isOk) \"Yes\" else \"No\")\n}\n\nclass IO {\n val printable = 33..126\n val buffer = ByteArray(1024)\n var ptr = 0\n var buflen = 0\n val out = PrintWriter(System.out)\n fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n buflen = System.`in`.read(buffer)\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n fun readByte(): Byte {\n return if (hasNextByte()) buffer[ptr++] else return -1\n }\n fun hasNext(): Boolean {\n while (hasNextByte() && buffer[ptr] !in printable) ptr++\n return hasNextByte()\n }\n fun string(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (b in printable) {\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n fun long(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b == '-'.toByte()) {\n minus = true\n b = readByte()\n }\n if (b !in '0'.toByte()..'9'.toByte()) {\n throw NumberFormatException()\n }\n while (true) {\n if (b in '0'.toByte()..'9'.toByte()) {\n n *= 10\n n += b - '0'.toByte()\n } else if (b == (-1).toByte() || b !in printable) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n fun int(): Int {\n val nl = long()\n if (nl !in Integer.MIN_VALUE..Integer.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n fun double(): Double {\n return string().toDouble()\n }\n fun print(obj: Any) = out.print(obj)\n fun print(i: Int) = out.print(i)\n fun print(l: Long) = out.print(l)\n fun println(obj: Any) = out.println(obj)\n fun println(i: Int) = out.println(i)\n fun println(l: Long) = out.println(l)\n inline fun exec(block: IO.() -> Unit) {\n block()\n out.flush()\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "sample_input": "5\n1 2 1 1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02953", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.\n\nFor each square, you will perform either of the following operations once:\n\nDecrease the height of the square by 1.\n\nDo nothing.\n\nDetermine if it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nIf it is possible to perform the operations so that the heights of the squares are non-decreasing from left to right, print Yes; otherwise, print No.\n\nSample Input 1\n\n5\n1 2 1 1 3\n\nSample Output 1\n\nYes\n\nYou can achieve the objective by decreasing the height of only the second square from the left by 1.\n\nSample Input 2\n\n4\n1 3 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n1 2 3 4 5\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2545, "cpu_time_ms": 208, "memory_kb": 33452}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s468978525", "group_id": "codeNet:p02983", "input_text": "import java.lang.Long.min\n\nfun main(args: Array) {\n val (l, r) = readIntList()\n\n var ans = Long.MAX_VALUE\n for (i in l until r) {\n for (j in i + 1..r) {\n val tmp = i.toLong() * j.toLong() % 2019L\n ans = min(ans, tmp)\n if (ans == 0L) {\n println(0)\n return\n }\n }\n }\n println(ans)\n}\n\n// Tools\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)", "language": "Kotlin", "metadata": {"date": 1596678241, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s468978525.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s468978525", "user_id": "u697467902"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.lang.Long.min\n\nfun main(args: Array) {\n val (l, r) = readIntList()\n\n var ans = Long.MAX_VALUE\n for (i in l until r) {\n for (j in i + 1..r) {\n val tmp = i.toLong() * j.toLong() % 2019L\n ans = min(ans, tmp)\n if (ans == 0L) {\n println(0)\n return\n }\n }\n }\n println(ans)\n}\n\n// Tools\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 618, "cpu_time_ms": 116, "memory_kb": 36436}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s046365480", "group_id": "codeNet:p02983", "input_text": "fun main() {\n val (L, R) = readInts()\n val l = L\n val r = minOf(L + 2019, R)\n var min = Long.MAX_VALUE\n for (i in l until r) {\n for (j in (i + 1)..r) {\n min = minOf(min, (i.toLong() * j) % 2019)\n }\n }\n println(min)\n}\n\nfun gcd(a: Int, b: Int): Int = if (a < b) gcd(b, a) else if (b == 0) a else gcd(b, a % b)\nfun gcd(a: Long, b: Long): Long = if (a < b) gcd(b, a) else if (b == 0L) a else gcd(b, a % b)\nfun lcm(a: Int, b: Int): Int = (a * b) / gcd(a, b)\nfun lcm(a: Long, b: Long): Long = (a * b) / gcd(a, b)\n\nfun readString() = readLine()!!\nfun readStrings() = readLine()!!.split(\" \")\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readInts() = readLine()!!.split(\" \").map { it.toInt() }\nfun readLongs() = readLine()!!.split(\" \").map { it.toLong() }\n\nfun myBinarySearch(begin: Int, end: Int, isOk: (key: Int) -> Boolean): Int {\n var ng = begin\n var ok = end\n\n while (Math.abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (isOk(mid)) {\n ok = mid\n } else {\n ng = mid\n }\n }\n\n return ok\n}\n\nfun List.myBinarySearch(isOk: (T) -> Boolean): Int {\n return myBinarySearch(-1, size) { index -> isOk(get(index)) }\n}\n\nfun Array.myBinarySearch(isOk: (T) -> Boolean): Int {\n return myBinarySearch(-1, size) { index -> isOk(get(index)) }\n}\n", "language": "Kotlin", "metadata": {"date": 1596336964, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s046365480.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s046365480", "user_id": "u979004569"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main() {\n val (L, R) = readInts()\n val l = L\n val r = minOf(L + 2019, R)\n var min = Long.MAX_VALUE\n for (i in l until r) {\n for (j in (i + 1)..r) {\n min = minOf(min, (i.toLong() * j) % 2019)\n }\n }\n println(min)\n}\n\nfun gcd(a: Int, b: Int): Int = if (a < b) gcd(b, a) else if (b == 0) a else gcd(b, a % b)\nfun gcd(a: Long, b: Long): Long = if (a < b) gcd(b, a) else if (b == 0L) a else gcd(b, a % b)\nfun lcm(a: Int, b: Int): Int = (a * b) / gcd(a, b)\nfun lcm(a: Long, b: Long): Long = (a * b) / gcd(a, b)\n\nfun readString() = readLine()!!\nfun readStrings() = readLine()!!.split(\" \")\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readInts() = readLine()!!.split(\" \").map { it.toInt() }\nfun readLongs() = readLine()!!.split(\" \").map { it.toLong() }\n\nfun myBinarySearch(begin: Int, end: Int, isOk: (key: Int) -> Boolean): Int {\n var ng = begin\n var ok = end\n\n while (Math.abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (isOk(mid)) {\n ok = mid\n } else {\n ng = mid\n }\n }\n\n return ok\n}\n\nfun List.myBinarySearch(isOk: (T) -> Boolean): Int {\n return myBinarySearch(-1, size) { index -> isOk(get(index)) }\n}\n\nfun Array.myBinarySearch(isOk: (T) -> Boolean): Int {\n return myBinarySearch(-1, size) { index -> isOk(get(index)) }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1317, "cpu_time_ms": 130, "memory_kb": 36496}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s056470020", "group_id": "codeNet:p02983", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val l = sc.nextLong()\n val r = sc.nextLong()\n\n var ans = 2019L\n for (i in l..r) {\n for (j in l+1L..r) {\n val ij = i * j\n val tmp = ij % 2019L\n if (tmp == 0L) {\n println(0)\n return\n }\n if (tmp < ans) {\n ans = tmp\n }\n\n }\n }\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1592965848, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s056470020.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s056470020", "user_id": "u323522006"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val l = sc.nextLong()\n val r = sc.nextLong()\n\n var ans = 2019L\n for (i in l..r) {\n for (j in l+1L..r) {\n val ij = i * j\n val tmp = ij % 2019L\n if (tmp == 0L) {\n println(0)\n return\n }\n if (tmp < ans) {\n ans = tmp\n }\n\n }\n }\n println(ans)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 386, "cpu_time_ms": 131, "memory_kb": 36404}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s873720683", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array){\n val (l, r) = readLine()!!.split(\" \").map { it.toInt() }\n\n if(l / 2019 != r / 2019){\n println(0)\n }else{\n var min = Long.MAX_VALUE / 10\n for(i in l..r - 1){\n for(j in i + 1..r){\n min = Math.min(min, (i % 2019L) * (j % 2019L) % 2019L)\n }\n }\n println(min)\n }\n}", "language": "Kotlin", "metadata": {"date": 1589419584, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s873720683.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s873720683", "user_id": "u531770859"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array){\n val (l, r) = readLine()!!.split(\" \").map { it.toInt() }\n\n if(l / 2019 != r / 2019){\n println(0)\n }else{\n var min = Long.MAX_VALUE / 10\n for(i in l..r - 1){\n for(j in i + 1..r){\n min = Math.min(min, (i % 2019L) * (j % 2019L) % 2019L)\n }\n }\n println(min)\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 373, "cpu_time_ms": 244, "memory_kb": 38004}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s603950375", "group_id": "codeNet:p02983", "input_text": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun dprint(v: Any?, indent: Int = 0) {\n val indentStr = (1..indent).joinToString(\"\") { \" \" }\n when (v) {\n is Iterable<*> -> {\n System.err.println(\"$indentStr[\")\n v.forEach { dprint(it, indent + 1) }\n System.err.println(\"$indentStr]\")\n }\n is Array<*> -> {\n System.err.println(\"$indentStr[\")\n v.forEach { dprint(it, indent + 1) }\n System.err.println(\"$indentStr]\")\n }\n is IntArray -> System.err.println(indentStr + \"[\" + v.joinToString(\",\") + \"]\")\n is LongArray -> System.err.println(indentStr + \"[\" + v.joinToString(\",\") + \"]\")\n is DoubleArray -> System.err.println(indentStr + \"[\" + v.joinToString(\",\") + \"]\")\n else -> System.err.println(indentStr + v)\n }\n}\n\nfun > min(a: A, b: A) = if (a < b) a else b\nfun > min(vararg a: A) = a.reduce { acc, x -> min(acc, x) }\nfun > max(a: A, b: A) = if (a > b) a else b\nfun > max(vararg a: A) = a.reduce { acc, x -> max(acc, x) }\n\n////////////////////////////////////////////////////////////////////////\n\n////////////////////////////////////////////////////////////////////////\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n val sc = Scanner(System.`in`)\n// for (t in 1..sc.next().toInt()) {\n Problem.solve(sc, pw)\n// }\n pw.flush()\n}\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val L = sc.next().toLong() % 2019\n var R = sc.next().toLong() % 2019\n if (L > R) R += 2019\n var min = 2019L\n for (i in L until R) {\n for (j in i + 1..R) {\n val r = i * j % 2019\n if (min > r) {\n min = r\n }\n }\n }\n pw.println(min % 2019)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1589419184, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s603950375.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s603950375", "user_id": "u297767059"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun dprint(v: Any?, indent: Int = 0) {\n val indentStr = (1..indent).joinToString(\"\") { \" \" }\n when (v) {\n is Iterable<*> -> {\n System.err.println(\"$indentStr[\")\n v.forEach { dprint(it, indent + 1) }\n System.err.println(\"$indentStr]\")\n }\n is Array<*> -> {\n System.err.println(\"$indentStr[\")\n v.forEach { dprint(it, indent + 1) }\n System.err.println(\"$indentStr]\")\n }\n is IntArray -> System.err.println(indentStr + \"[\" + v.joinToString(\",\") + \"]\")\n is LongArray -> System.err.println(indentStr + \"[\" + v.joinToString(\",\") + \"]\")\n is DoubleArray -> System.err.println(indentStr + \"[\" + v.joinToString(\",\") + \"]\")\n else -> System.err.println(indentStr + v)\n }\n}\n\nfun > min(a: A, b: A) = if (a < b) a else b\nfun > min(vararg a: A) = a.reduce { acc, x -> min(acc, x) }\nfun > max(a: A, b: A) = if (a > b) a else b\nfun > max(vararg a: A) = a.reduce { acc, x -> max(acc, x) }\n\n////////////////////////////////////////////////////////////////////////\n\n////////////////////////////////////////////////////////////////////////\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n val sc = Scanner(System.`in`)\n// for (t in 1..sc.next().toInt()) {\n Problem.solve(sc, pw)\n// }\n pw.flush()\n}\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val L = sc.next().toLong() % 2019\n var R = sc.next().toLong() % 2019\n if (L > R) R += 2019\n var min = 2019L\n for (i in L until R) {\n for (j in i + 1..R) {\n val r = i * j % 2019\n if (min > r) {\n min = r\n }\n }\n }\n pw.println(min % 2019)\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2426, "cpu_time_ms": 166, "memory_kb": 31388}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s829790010", "group_id": "codeNet:p02983", "input_text": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun dprint(v: Any?, indent: Int = 0) {\n val indentStr = (1..indent).joinToString(\"\") { \" \" }\n when (v) {\n is Iterable<*> -> {\n System.err.println(\"$indentStr[\")\n v.forEach { dprint(it, indent + 1) }\n System.err.println(\"$indentStr]\")\n }\n is Array<*> -> {\n System.err.println(\"$indentStr[\")\n v.forEach { dprint(it, indent + 1) }\n System.err.println(\"$indentStr]\")\n }\n is IntArray -> System.err.println(indentStr + \"[\" + v.joinToString(\",\") + \"]\")\n is LongArray -> System.err.println(indentStr + \"[\" + v.joinToString(\",\") + \"]\")\n is DoubleArray -> System.err.println(indentStr + \"[\" + v.joinToString(\",\") + \"]\")\n else -> System.err.println(indentStr + v)\n }\n}\n\nfun > min(a: A, b: A) = if (a < b) a else b\nfun > min(vararg a: A) = a.reduce { acc, x -> min(acc, x) }\nfun > max(a: A, b: A) = if (a > b) a else b\nfun > max(vararg a: A) = a.reduce { acc, x -> max(acc, x) }\n\n////////////////////////////////////////////////////////////////////////\n\n////////////////////////////////////////////////////////////////////////\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n val sc = Scanner(System.`in`)\n// for (t in 1..sc.next().toInt()) {\n Problem.solve(sc, pw)\n// }\n pw.flush()\n}\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val L = sc.next().toInt() % 2019\n var R = sc.next().toInt() % 2019\n if (L > R) R += 2019\n var min = 2019\n for (i in L until R) {\n for (j in i + 1..R) {\n val r = i * j % 2019\n if (min > r) {\n min = r\n }\n }\n }\n pw.println(min)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1589418880, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s829790010.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s829790010", "user_id": "u297767059"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun dprint(v: Any?, indent: Int = 0) {\n val indentStr = (1..indent).joinToString(\"\") { \" \" }\n when (v) {\n is Iterable<*> -> {\n System.err.println(\"$indentStr[\")\n v.forEach { dprint(it, indent + 1) }\n System.err.println(\"$indentStr]\")\n }\n is Array<*> -> {\n System.err.println(\"$indentStr[\")\n v.forEach { dprint(it, indent + 1) }\n System.err.println(\"$indentStr]\")\n }\n is IntArray -> System.err.println(indentStr + \"[\" + v.joinToString(\",\") + \"]\")\n is LongArray -> System.err.println(indentStr + \"[\" + v.joinToString(\",\") + \"]\")\n is DoubleArray -> System.err.println(indentStr + \"[\" + v.joinToString(\",\") + \"]\")\n else -> System.err.println(indentStr + v)\n }\n}\n\nfun > min(a: A, b: A) = if (a < b) a else b\nfun > min(vararg a: A) = a.reduce { acc, x -> min(acc, x) }\nfun > max(a: A, b: A) = if (a > b) a else b\nfun > max(vararg a: A) = a.reduce { acc, x -> max(acc, x) }\n\n////////////////////////////////////////////////////////////////////////\n\n////////////////////////////////////////////////////////////////////////\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n val sc = Scanner(System.`in`)\n// for (t in 1..sc.next().toInt()) {\n Problem.solve(sc, pw)\n// }\n pw.flush()\n}\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val L = sc.next().toInt() % 2019\n var R = sc.next().toInt() % 2019\n if (L > R) R += 2019\n var min = 2019\n for (i in L until R) {\n for (j in i + 1..R) {\n val r = i * j % 2019\n if (min > r) {\n min = r\n }\n }\n }\n pw.println(min)\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2416, "cpu_time_ms": 175, "memory_kb": 29476}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s291552978", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array){\n val (l, r) = readLine()!!.split(\" \").map { it.toInt() }\n val a = l % 2019\n val b = r % 2019\n var min = 2019\n if (r - l > 2019) min = 0\n if (a < b) {\n for (i in a until b+1) {\n if (b - a == 1) {\n min = a * b % 2019\n break\n }\n for (j in i + 1 until b+1) {\n val x = i * j\n val modX = x % 2019\n if (min > modX) min = modX\n }\n }\n } else {\n for (i in b until a+1) {\n if (a - b == 1) {\n min = a * b % 2019\n break\n }\n for (j in i + 1 until a+1) {\n val x = i * j\n val modX = x % 2019\n if (min > modX) min = modX\n }\n }\n }\n println(min)\n}", "language": "Kotlin", "metadata": {"date": 1588202852, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s291552978.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s291552978", "user_id": "u385678999"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array){\n val (l, r) = readLine()!!.split(\" \").map { it.toInt() }\n val a = l % 2019\n val b = r % 2019\n var min = 2019\n if (r - l > 2019) min = 0\n if (a < b) {\n for (i in a until b+1) {\n if (b - a == 1) {\n min = a * b % 2019\n break\n }\n for (j in i + 1 until b+1) {\n val x = i * j\n val modX = x % 2019\n if (min > modX) min = modX\n }\n }\n } else {\n for (i in b until a+1) {\n if (a - b == 1) {\n min = a * b % 2019\n break\n }\n for (j in i + 1 until a+1) {\n val x = i * j\n val modX = x % 2019\n if (min > modX) min = modX\n }\n }\n }\n println(min)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 852, "cpu_time_ms": 245, "memory_kb": 36084}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s971995261", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array){\n val (l, r) = readLine()!!.split(\" \").map { it.toInt() }\n val a = l % 2019\n val b = r % 2019\n var min = 2019\n if (r - l > 2019) min = 0\n if (a == b) min == 0\n if (a < b) {\n for (i in a until b) {\n if (b - a == 1) {\n min = a * b % 2019\n break\n }\n for (j in i + 1 until b) {\n val x = i * j\n val modX = x % 2019\n if (min > modX) min = modX\n }\n }\n } else {\n for (i in b until a) {\n if (a - b == 1) {\n min = a * b % 2019\n break\n }\n for (j in i + 1 until a) {\n val x = i * j\n val modX = x % 2019\n if (min > modX) min = modX\n }\n }\n }\n println(min)\n}", "language": "Kotlin", "metadata": {"date": 1588202262, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s971995261.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s971995261", "user_id": "u385678999"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array){\n val (l, r) = readLine()!!.split(\" \").map { it.toInt() }\n val a = l % 2019\n val b = r % 2019\n var min = 2019\n if (r - l > 2019) min = 0\n if (a == b) min == 0\n if (a < b) {\n for (i in a until b) {\n if (b - a == 1) {\n min = a * b % 2019\n break\n }\n for (j in i + 1 until b) {\n val x = i * j\n val modX = x % 2019\n if (min > modX) min = modX\n }\n }\n } else {\n for (i in b until a) {\n if (a - b == 1) {\n min = a * b % 2019\n break\n }\n for (j in i + 1 until a) {\n val x = i * j\n val modX = x % 2019\n if (min > modX) min = modX\n }\n }\n }\n println(min)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 869, "cpu_time_ms": 250, "memory_kb": 37832}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s443737799", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(java.util.Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n fun solve(sc: java.util.Scanner, pw: java.io.PrintWriter) {\n val L = sc.next().toLong()\n val R = sc.next().toLong()\n var ans = 2020L\n for (l in (L until R)) {\n for (r in (l + 1)..R) {\n val a = ((l % 2019) * r) % 2019\n if (a == 0L) {\n pw.println(\"0\")\n return\n }\n if (ans > a) {\n ans = a\n }\n }\n }\n pw.println(ans)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1586035756, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s443737799.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s443737799", "user_id": "u297767059"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(java.util.Scanner(System.`in`), pw)\n pw.flush()\n}\n\nobject Problem {\n fun solve(sc: java.util.Scanner, pw: java.io.PrintWriter) {\n val L = sc.next().toLong()\n val R = sc.next().toLong()\n var ans = 2020L\n for (l in (L until R)) {\n for (r in (l + 1)..R) {\n val a = ((l % 2019) * r) % 2019\n if (a == 0L) {\n pw.println(\"0\")\n return\n }\n if (ans > a) {\n ans = a\n }\n }\n }\n pw.println(ans)\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 686, "cpu_time_ms": 192, "memory_kb": 31268}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s373785901", "group_id": "codeNet:p02983", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val l = sc.nextLong()\n val r = sc.nextLong()\n println(problem133c(l, r))\n}\n\nfun problem133c(l: Long, r: Long): Long {\n var min = Long.MAX_VALUE\n var l = l % 2019\n var r = r % 2019\n for (i in l..r) {\n for (j in i+1..r) {\n min = Math.min(min, (i * j) % 2019)\n }\n }\n if (min == Long.MAX_VALUE) min = 0\n return min\n}", "language": "Kotlin", "metadata": {"date": 1579215028, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s373785901.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s373785901", "user_id": "u073232808"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val l = sc.nextLong()\n val r = sc.nextLong()\n println(problem133c(l, r))\n}\n\nfun problem133c(l: Long, r: Long): Long {\n var min = Long.MAX_VALUE\n var l = l % 2019\n var r = r % 2019\n for (i in l..r) {\n for (j in i+1..r) {\n min = Math.min(min, (i * j) % 2019)\n }\n }\n if (min == Long.MAX_VALUE) min = 0\n return min\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 454, "cpu_time_ms": 180, "memory_kb": 31396}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s991742703", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n val (l, r) = readLine()!!.split(' ').map { it.toInt() }\n (l .. Math.min(r, l + 4038)).map { it % 2019 }.sorted().take(2).let { println(it[0] * it[1] % 2019) }\n}\n", "language": "Kotlin", "metadata": {"date": 1576296870, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s991742703.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s991742703", "user_id": "u863309603"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (l, r) = readLine()!!.split(' ').map { it.toInt() }\n (l .. Math.min(r, l + 4038)).map { it % 2019 }.sorted().take(2).let { println(it[0] * it[1] % 2019) }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 200, "cpu_time_ms": 246, "memory_kb": 38336}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s288513400", "group_id": "codeNet:p02983", "input_text": "import java.util.*;\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val L = sc.nextLong()\n val R = sc.nextLong()\n \n if(R-L>2019){\n println(0);\n }\n else{\n \tvar ans:Long=2000000000000000000\n for(i in L..R){\n for(j in i+1..R){\n var tmp:Long=i*j\n ans=Math.min(tmp%2019,ans)\n }\n }\n println(ans)\n }\n}", "language": "Kotlin", "metadata": {"date": 1573696029, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s288513400.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s288513400", "user_id": "u385617244"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*;\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val L = sc.nextLong()\n val R = sc.nextLong()\n \n if(R-L>2019){\n println(0);\n }\n else{\n \tvar ans:Long=2000000000000000000\n for(i in L..R){\n for(j in i+1..R){\n var tmp:Long=i*j\n ans=Math.min(tmp%2019,ans)\n }\n }\n println(ans)\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 417, "cpu_time_ms": 182, "memory_kb": 31264}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s396381837", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n\n val (l, r) = readLine()!!.split(\" \").map(String::toLong)\n\n println(func133c(l, r))\n}\n\nfun func133c(l: Long, r: Long): Any? {\n\n var rmin = Math.min(r, 2019 * 2)\n\n var ans = 2018\n for (i in l until rmin) {\n\n for (j in i + 1..rmin) {\n val x = i * j % 2019\n ans = Math.min(ans, x.toInt())\n }\n }\n\n return ans\n}\n", "language": "Kotlin", "metadata": {"date": 1568937102, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s396381837.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s396381837", "user_id": "u536308232"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n\n val (l, r) = readLine()!!.split(\" \").map(String::toLong)\n\n println(func133c(l, r))\n}\n\nfun func133c(l: Long, r: Long): Any? {\n\n var rmin = Math.min(r, 2019 * 2)\n\n var ans = 2018\n for (i in l until rmin) {\n\n for (j in i + 1..rmin) {\n val x = i * j % 2019\n ans = Math.min(ans, x.toInt())\n }\n }\n\n return ans\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 397, "cpu_time_ms": 269, "memory_kb": 37872}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s485509839", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n val (L, R) = readLine()!!.split(\" \").map(String::toLong)\n\n if (2019 <= R - L) {\n println(0)\n return\n }\n\n var min = Long.MAX_VALUE\n for (i in L until R) {\n for (l in L + 1..R) {\n min = Math.min(i * l % 2019, min)\n if (min == 0L) {\n println(0)\n return\n }\n }\n }\n println(min)\n}\n\n\n", "language": "Kotlin", "metadata": {"date": 1567616636, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s485509839.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s485509839", "user_id": "u085288971"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (L, R) = readLine()!!.split(\" \").map(String::toLong)\n\n if (2019 <= R - L) {\n println(0)\n return\n }\n\n var min = Long.MAX_VALUE\n for (i in L until R) {\n for (l in L + 1..R) {\n min = Math.min(i * l % 2019, min)\n if (min == 0L) {\n println(0)\n return\n }\n }\n }\n println(min)\n}\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 422, "cpu_time_ms": 249, "memory_kb": 37612}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s440429268", "group_id": "codeNet:p02983", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val (l, r) = readListOfLong()\n val ans = \n if(r - l >= 2019) 0L \n else {\n var min = (l * r) % 2019\n for(i in l .. r) {\n for(j in i+1 .. r) {\n val tmp = (i * j) % 2019\n if(tmp < min) {\n min = tmp\n }\n }\n }\n min\n }\n println(ans)\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n\n// Extensions\nfun List.toBuckets(bucketKeys: List): Map {\n val buckets = bucketKeys.associate { t -> Pair(t, 0) }.toMutableMap()\n this.forEach { t ->\n buckets[t] = buckets[t]!! + 1\n }\n return buckets\n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n }\n }\n return v.map { it.toList() }.toList()\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n if(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n a / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\nclass Stack(private var st: MutableList = mutableListOf()) {\n fun isEmpty() = st.isEmpty()\n fun top(): T = st.last()\n fun push(e: T) { st.add(e) }\n fun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n fun isEmpty() = que.isEmpty()\n fun top(): T = que.first()\n fun push(e: T) { que.add(e) }\n fun pop() { que = que.drop(1).toMutableList() }\n}\n", "language": "Kotlin", "metadata": {"date": 1567136825, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s440429268.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s440429268", "user_id": "u026686258"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val (l, r) = readListOfLong()\n val ans = \n if(r - l >= 2019) 0L \n else {\n var min = (l * r) % 2019\n for(i in l .. r) {\n for(j in i+1 .. r) {\n val tmp = (i * j) % 2019\n if(tmp < min) {\n min = tmp\n }\n }\n }\n min\n }\n println(ans)\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\n\n// Extensions\nfun List.toBuckets(bucketKeys: List): Map {\n val buckets = bucketKeys.associate { t -> Pair(t, 0) }.toMutableMap()\n this.forEach { t ->\n buckets[t] = buckets[t]!! + 1\n }\n return buckets\n}\n\nfun Map.toMutableMap(): MutableMap = HashMap(this)\n\n// Util Functions\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n }\n }\n return v.map { it.toList() }.toList()\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n if(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n a / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun Double.isDecimal(): Boolean = ((this - Math.floor(this)) != 0.0)\n\n// Data Structures\nclass Stack(private var st: MutableList = mutableListOf()) {\n fun isEmpty() = st.isEmpty()\n fun top(): T = st.last()\n fun push(e: T) { st.add(e) }\n fun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n fun isEmpty() = que.isEmpty()\n fun top(): T = que.first()\n fun push(e: T) { que.add(e) }\n fun pop() { que = que.drop(1).toMutableList() }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3359, "cpu_time_ms": 239, "memory_kb": 37916}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s722460030", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array)\n{\n val (l, r) =readNInts()\n\n if (r - l + 1 >= 2019)\n {\n println(0)\n }\n else\n {\n var ans = 10000L\n for (i in l until r) {\n for (k in i+1..r) {\n val rem = (i * k) % 2019\n ans = if (ans > rem) rem else ans\n }\n }\n\n println(ans)\n }\n}\n\n\n// Read an integer\n// Usage: val a = readInt()\nprivate fun readInt() = readLine()!!.toInt()\n\n// Read N integers separated by \" \"\n// Usage: val (a, b, c) = readNInts()\nprivate fun readNInts() = readLine()!!.split(\" \").map(String::toLong)\n\n// Read a string\n// Usage: val a = readString()\nprivate fun readString() = readLine()!!\n", "language": "Kotlin", "metadata": {"date": 1566231746, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s722460030.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s722460030", "user_id": "u118477733"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array)\n{\n val (l, r) =readNInts()\n\n if (r - l + 1 >= 2019)\n {\n println(0)\n }\n else\n {\n var ans = 10000L\n for (i in l until r) {\n for (k in i+1..r) {\n val rem = (i * k) % 2019\n ans = if (ans > rem) rem else ans\n }\n }\n\n println(ans)\n }\n}\n\n\n// Read an integer\n// Usage: val a = readInt()\nprivate fun readInt() = readLine()!!.toInt()\n\n// Read N integers separated by \" \"\n// Usage: val (a, b, c) = readNInts()\nprivate fun readNInts() = readLine()!!.split(\" \").map(String::toLong)\n\n// Read a string\n// Usage: val a = readString()\nprivate fun readString() = readLine()!!\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 696, "cpu_time_ms": 245, "memory_kb": 37860}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s897205581", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array)\n{\n val (l, r) =readNInts()\n\n val rem = IntArray(r-l + 1)\n for (i in 0..rem.size-1) {\n rem[i] = (l+i) % 2019\n }\n\n val remso = rem.sorted()\n println(remso[0] * remso[1])\n}\n\n\n// Read an integer\n// Usage: val a = readInt()\nprivate fun readInt() = readLine()!!.toInt()\n\n// Read N integers separated by \" \"\n// Usage: val (a, b, c) = readNInts()\nprivate fun readNInts() = readLine()!!.split(\" \").map(String::toInt)\n\n// Read a string\n// Usage: val a = readString()\nprivate fun readString() = readLine()!!\n", "language": "Kotlin", "metadata": {"date": 1566230068, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s897205581.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s897205581", "user_id": "u118477733"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array)\n{\n val (l, r) =readNInts()\n\n val rem = IntArray(r-l + 1)\n for (i in 0..rem.size-1) {\n rem[i] = (l+i) % 2019\n }\n\n val remso = rem.sorted()\n println(remso[0] * remso[1])\n}\n\n\n// Read an integer\n// Usage: val a = readInt()\nprivate fun readInt() = readLine()!!.toInt()\n\n// Read N integers separated by \" \"\n// Usage: val (a, b, c) = readNInts()\nprivate fun readNInts() = readLine()!!.split(\" \").map(String::toInt)\n\n// Read a string\n// Usage: val a = readString()\nprivate fun readString() = readLine()!!\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 553, "cpu_time_ms": 657, "memory_kb": 58720}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s721826171", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n val (l, r) = readLine()!!.split(\" \").map { it.toLong() }\n var min = 2019.toLong()\n\n for (i in l until r) {\n for (j in l + 1..r) {\n val ij = i * j\n val ijmod = ij % 2019\n if (ijmod < min) min = ijmod\n }\n }\n println(min)\n}\n", "language": "Kotlin", "metadata": {"date": 1565234047, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s721826171.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s721826171", "user_id": "u139478771"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (l, r) = readLine()!!.split(\" \").map { it.toLong() }\n var min = 2019.toLong()\n\n for (i in l until r) {\n for (j in l + 1..r) {\n val ij = i * j\n val ijmod = ij % 2019\n if (ijmod < min) min = ijmod\n }\n }\n println(min)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 316, "cpu_time_ms": 2111, "memory_kb": 37924}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s241021727", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n val (L, R) = readLine()!!.split(' ').map { it.toLong() }\n var modMin = 2019L\n for (i in L until Math.min(R, L + 2019)) {\n for (j in L until Math.min(R, L + 2019) + 1) {\n if (i < j) {\n modMin = Math.min(i.times(j) % 2019, modMin)\n }\n }\n }\n println(modMin)\n}\n", "language": "Kotlin", "metadata": {"date": 1564253040, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s241021727.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s241021727", "user_id": "u562388762"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (L, R) = readLine()!!.split(' ').map { it.toLong() }\n var modMin = 2019L\n for (i in L until Math.min(R, L + 2019)) {\n for (j in L until Math.min(R, L + 2019) + 1) {\n if (i < j) {\n modMin = Math.min(i.times(j) % 2019, modMin)\n }\n }\n }\n println(modMin)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 356, "cpu_time_ms": 243, "memory_kb": 38300}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s583138446", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n val (L, R) = readLine()!!.split(' ').map { it.toLong() }\n var min = 2019\n val l = (L % 2019).toInt()\n val r = (R % 2019).toInt()\n for (i in l until r) {\n for (j in l + 1 until r + 1) {\n if (i < j) {\n if (i.times(j) % 2019 < min) {\n min = i.times(j) % 2019\n }\n }\n }\n }\n println(min)\n}", "language": "Kotlin", "metadata": {"date": 1564252471, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s583138446.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s583138446", "user_id": "u562388762"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (L, R) = readLine()!!.split(' ').map { it.toLong() }\n var min = 2019\n val l = (L % 2019).toInt()\n val r = (R % 2019).toInt()\n for (i in l until r) {\n for (j in l + 1 until r + 1) {\n if (i < j) {\n if (i.times(j) % 2019 < min) {\n min = i.times(j) % 2019\n }\n }\n }\n }\n println(min)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 422, "cpu_time_ms": 255, "memory_kb": 38124}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s245223647", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n val (L, R) = readLine()!!.split(' ').map { it.toLong() }\n var min = 2019\n val l = (L % 2019).toInt()\n val r = (R % 2019).toInt()\n for (i in l until r) {\n for (j in l + 1 until r + 1) {\n if (i.times(j) == 0) {\n min = 0\n } else if (i.times(j) % 2019 < min) {\n min = i.times(j) % 2019\n }\n }\n }\n println(min)\n}\n", "language": "Kotlin", "metadata": {"date": 1564252342, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s245223647.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s245223647", "user_id": "u562388762"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (L, R) = readLine()!!.split(' ').map { it.toLong() }\n var min = 2019\n val l = (L % 2019).toInt()\n val r = (R % 2019).toInt()\n for (i in l until r) {\n for (j in l + 1 until r + 1) {\n if (i.times(j) == 0) {\n min = 0\n } else if (i.times(j) % 2019 < min) {\n min = i.times(j) % 2019\n }\n }\n }\n println(min)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 438, "cpu_time_ms": 245, "memory_kb": 38220}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s164189614", "group_id": "codeNet:p02983", "input_text": "import java.util.Scanner\n\nvar max=2020L\nval mod=2019L\nfun main(args:Array){\n val sc=Scanner(System.`in`)\n var L=sc.nextLong()\n var R=sc.nextLong()\n\n for( i in (L+1)..Math.min(L+2019,R)){\n for(j in L..(i-1)){\n max=Math.min(max,i*j%mod)\n }\n }\n println(max)\n}", "language": "Kotlin", "metadata": {"date": 1564178211, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s164189614.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s164189614", "user_id": "u913110564"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.Scanner\n\nvar max=2020L\nval mod=2019L\nfun main(args:Array){\n val sc=Scanner(System.`in`)\n var L=sc.nextLong()\n var R=sc.nextLong()\n\n for( i in (L+1)..Math.min(L+2019,R)){\n for(j in L..(i-1)){\n max=Math.min(max,i*j%mod)\n }\n }\n println(max)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 307, "cpu_time_ms": 185, "memory_kb": 31516}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s845066565", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toInt() }\n var minMod = Integer.MAX_VALUE\n for (i in L until R) {\n for (j in (L + 1)..R) {\n minMod = Math.min(minMod, (i * j) % 2019)\n if (minMod == 0) {\n println(0)\n return\n }\n }\n }\n\n println(minMod)\n}\n", "language": "Kotlin", "metadata": {"date": 1564018350, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s845066565.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s845066565", "user_id": "u712335892"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toInt() }\n var minMod = Integer.MAX_VALUE\n for (i in L until R) {\n for (j in (L + 1)..R) {\n minMod = Math.min(minMod, (i * j) % 2019)\n if (minMod == 0) {\n println(0)\n return\n }\n }\n }\n\n println(minMod)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 402, "cpu_time_ms": 2111, "memory_kb": 38040}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s599763391", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toInt() }\n var minMod = Long.MAX_VALUE\n for (i in L..R) {\n for (j in L..R) {\n if (i < j) {\n val mod = (i * j) % 2019\n if (mod == 0) {\n println(0)\n return\n }\n\n if (mod < minMod) {\n minMod = mod.toLong()\n }\n }\n }\n }\n\n println(minMod.toInt())\n}\n", "language": "Kotlin", "metadata": {"date": 1564017930, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s599763391.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s599763391", "user_id": "u712335892"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toInt() }\n var minMod = Long.MAX_VALUE\n for (i in L..R) {\n for (j in L..R) {\n if (i < j) {\n val mod = (i * j) % 2019\n if (mod == 0) {\n println(0)\n return\n }\n\n if (mod < minMod) {\n minMod = mod.toLong()\n }\n }\n }\n }\n\n println(minMod.toInt())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 504, "cpu_time_ms": 245, "memory_kb": 37824}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s885241666", "group_id": "codeNet:p02983", "input_text": "import java.io.*\nimport java.util.*\n\nvar pw = PrintWriter(System.out)\nconst val MOD = 2019\nfun solve(L: Int, R: Int){\n var ans = 2019*2019\n val range = when{\n R - L >= 2019 -> IntArray(2019){ it }.toList()\n else -> (L..R).toList().map{ it % 2019 }\n }\n // println(range.toString())\n for (i in 0 until range.size){\n for (j in i+1 until range.size){\n ans = Math.min(ans, (range[i] * range[j]) % 2019)\n }\n }\n println(ans)\n return\n}\n\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val L = sc.next().toInt()\n val R = sc.next().toInt()\n solve(L, R)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1562597407, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s885241666.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s885241666", "user_id": "u329232967"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.*\nimport java.util.*\n\nvar pw = PrintWriter(System.out)\nconst val MOD = 2019\nfun solve(L: Int, R: Int){\n var ans = 2019*2019\n val range = when{\n R - L >= 2019 -> IntArray(2019){ it }.toList()\n else -> (L..R).toList().map{ it % 2019 }\n }\n // println(range.toString())\n for (i in 0 until range.size){\n for (j in i+1 until range.size){\n ans = Math.min(ans, (range[i] * range[j]) % 2019)\n }\n }\n println(ans)\n return\n}\n\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val L = sc.next().toInt()\n val R = sc.next().toInt()\n solve(L, R)\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1107, "cpu_time_ms": 221, "memory_kb": 31920}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s923938799", "group_id": "codeNet:p02983", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val argList = Scanner(System.`in`)\n\n\n val firstLine = argList.nextLine().split(\" \")\n val l = firstLine[0].toLong()\n val r = firstLine[1].toLong()\n\n val e = RemainderMinimization2019()\n println(e.execute(l, r))\n\n}\n\nclass RemainderMinimization2019 {\n private val r2019 = 2019\n fun execute(l: Long, r: Long): Long {\n\n val lMod = l % r2019\n val rMod = r % r2019\n\n if (lMod == 0L || rMod == 0L) return 0\n\n if (l + (r2019 - lMod) <= r ) {\n // 2019以上離れている場合、\n // 2019の倍数を選べばよいので、modの最小値は0\n return 0\n }\n\n var ans: Long = 2018\n for (n in l..r) {\n for (i in n + 1..r) {\n val result = n * i % r2019\n\n if (result == 0L) return 0\n\n if (ans > result) {\n ans = result\n }\n }\n }\n\n return ans\n }\n}", "language": "Kotlin", "metadata": {"date": 1562593773, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s923938799.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s923938799", "user_id": "u156266692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val argList = Scanner(System.`in`)\n\n\n val firstLine = argList.nextLine().split(\" \")\n val l = firstLine[0].toLong()\n val r = firstLine[1].toLong()\n\n val e = RemainderMinimization2019()\n println(e.execute(l, r))\n\n}\n\nclass RemainderMinimization2019 {\n private val r2019 = 2019\n fun execute(l: Long, r: Long): Long {\n\n val lMod = l % r2019\n val rMod = r % r2019\n\n if (lMod == 0L || rMod == 0L) return 0\n\n if (l + (r2019 - lMod) <= r ) {\n // 2019以上離れている場合、\n // 2019の倍数を選べばよいので、modの最小値は0\n return 0\n }\n\n var ans: Long = 2018\n for (n in l..r) {\n for (i in n + 1..r) {\n val result = n * i % r2019\n\n if (result == 0L) return 0\n\n if (ans > result) {\n ans = result\n }\n }\n }\n\n return ans\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1011, "cpu_time_ms": 226, "memory_kb": 36212}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s828569842", "group_id": "codeNet:p02983", "input_text": "import java.util.*\n \nfun main(args: Array) {\n val argList = Scanner(System.`in`)\n \n \n val firstLine = argList.nextLine().split(\" \")\n val l = firstLine[0].toLong()\n val r = firstLine[1].toLong()\n \n val e = RemainderMinimization2019()\n println(e.execute(l, r))\n \n}\n \nclass RemainderMinimization2019 {\n private val r2019 = 2019\n fun execute(l: Long, r: Long): Long {\n \n val lMod = l % r2019\n val rMod = r % r2019\n \n if (lMod == 0L || rMod == 0L) return 0\n \n if (l + (r2019 - lMod) <= r ) {\n // 2019以上離れている場合、\n // 2019の倍数を選べばよいので、modの最小値は0\n return 0\n }\n \n var ans: Long = 2018\n for (n in l..r) {\n for (i in n + 1..r) {\n val result = n * i % r2019\n if (ans > result) {\n ans = result\n }\n }\n }\n \n return ans\n }\n}", "language": "Kotlin", "metadata": {"date": 1562560220, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s828569842.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s828569842", "user_id": "u499889187"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n \nfun main(args: Array) {\n val argList = Scanner(System.`in`)\n \n \n val firstLine = argList.nextLine().split(\" \")\n val l = firstLine[0].toLong()\n val r = firstLine[1].toLong()\n \n val e = RemainderMinimization2019()\n println(e.execute(l, r))\n \n}\n \nclass RemainderMinimization2019 {\n private val r2019 = 2019\n fun execute(l: Long, r: Long): Long {\n \n val lMod = l % r2019\n val rMod = r % r2019\n \n if (lMod == 0L || rMod == 0L) return 0\n \n if (l + (r2019 - lMod) <= r ) {\n // 2019以上離れている場合、\n // 2019の倍数を選べばよいので、modの最小値は0\n return 0\n }\n \n var ans: Long = 2018\n for (n in l..r) {\n for (i in n + 1..r) {\n val result = n * i % r2019\n if (ans > result) {\n ans = result\n }\n }\n }\n \n return ans\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 977, "cpu_time_ms": 245, "memory_kb": 36080}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s315217770", "group_id": "codeNet:p02983", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val argList = Scanner(System.`in`)\n\n\n val firstLine = argList.nextLine().split(\" \")\n val l = firstLine[0].toLong()\n val r = firstLine[1].toLong()\n\n val e = RemainderMinimization2019()\n println(e.execute(l, r))\n\n}\n\nclass RemainderMinimization2019 {\n private val r2019 = 2019\n fun execute(l: Long, r: Long): Long {\n if (l < r2019 && r < r2019) return l * (l + 1)\n\n val lMod = l % r2019\n val rMod = r % r2019\n\n if (l + (r2019 - lMod) <= r ) {\n // 2019以上離れている場合、\n // 2019の倍数を選べばよいので、modの最小値は0\n return 0\n }\n\n var ans: Long = 2018\n for (n in l..r) {\n for (i in n + 1..r) {\n val result = n * (n + i) % r2019\n if (ans > result) {\n ans = result\n }\n }\n }\n \n return ans\n }\n}", "language": "Kotlin", "metadata": {"date": 1562556958, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s315217770.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s315217770", "user_id": "u156266692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val argList = Scanner(System.`in`)\n\n\n val firstLine = argList.nextLine().split(\" \")\n val l = firstLine[0].toLong()\n val r = firstLine[1].toLong()\n\n val e = RemainderMinimization2019()\n println(e.execute(l, r))\n\n}\n\nclass RemainderMinimization2019 {\n private val r2019 = 2019\n fun execute(l: Long, r: Long): Long {\n if (l < r2019 && r < r2019) return l * (l + 1)\n\n val lMod = l % r2019\n val rMod = r % r2019\n\n if (l + (r2019 - lMod) <= r ) {\n // 2019以上離れている場合、\n // 2019の倍数を選べばよいので、modの最小値は0\n return 0\n }\n\n var ans: Long = 2018\n for (n in l..r) {\n for (i in n + 1..r) {\n val result = n * (n + i) % r2019\n if (ans > result) {\n ans = result\n }\n }\n }\n \n return ans\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 987, "cpu_time_ms": 263, "memory_kb": 36020}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s915805830", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n var split = readLine()!!.split(\" \")\n val L = split[0].toLong()!!\n val R = split[1].toLong()!!\n val a = L / 2019\n val b = R / 2019\n val am = L % 2019\n val bm = R % 2019\n if (a == b) {\n val i = L\n val j = L + 1\n val result = (i % 2019 * j % 2019)\n println(result)\n } else {\n println(0)\n }\n}", "language": "Kotlin", "metadata": {"date": 1562553173, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s915805830.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s915805830", "user_id": "u017460970"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n var split = readLine()!!.split(\" \")\n val L = split[0].toLong()!!\n val R = split[1].toLong()!!\n val a = L / 2019\n val b = R / 2019\n val am = L % 2019\n val bm = R % 2019\n if (a == b) {\n val i = L\n val j = L + 1\n val result = (i % 2019 * j % 2019)\n println(result)\n } else {\n println(0)\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 346, "cpu_time_ms": 234, "memory_kb": 36020}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s685353956", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n val sc = java.util.Scanner(System.`in`)\n val L = sc.nextLong()\n val R = sc.nextLong()\n\n\n var t = 99999999999L\n (L..Math.min(R - 1, L + 2020)).map { l1 ->\n (Math.max(L + 1, R - 2020)..R).map { r1 ->\n t = Math.min(t, (l1 * r1) % 2019)\n }\n }\n\n println(t)\n}\n", "language": "Kotlin", "metadata": {"date": 1562553064, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s685353956.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s685353956", "user_id": "u059223549"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val sc = java.util.Scanner(System.`in`)\n val L = sc.nextLong()\n val R = sc.nextLong()\n\n\n var t = 99999999999L\n (L..Math.min(R - 1, L + 2020)).map { l1 ->\n (Math.max(L + 1, R - 2020)..R).map { r1 ->\n t = Math.min(t, (l1 * r1) % 2019)\n }\n }\n\n println(t)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 333, "cpu_time_ms": 925, "memory_kb": 75732}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s149882151", "group_id": "codeNet:p02983", "input_text": "fun main(argc:Array){\n val (L,R) = readLine()!!.split(\" \").map{it.toInt()}\n var min = L*R\n for(i in L..R){\n for(j in L..i){\n if(i == j || R == j){\n continue\n }\n if(((i*j)%2019) < min){\n min = (i*j)%2019\n }\n }\n }\n println(min)\n}", "language": "Kotlin", "metadata": {"date": 1562552614, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s149882151.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s149882151", "user_id": "u366696580"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(argc:Array){\n val (L,R) = readLine()!!.split(\" \").map{it.toInt()}\n var min = L*R\n for(i in L..R){\n for(j in L..i){\n if(i == j || R == j){\n continue\n }\n if(((i*j)%2019) < min){\n min = (i*j)%2019\n }\n }\n }\n println(min)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 319, "cpu_time_ms": 2111, "memory_kb": 36028}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s235227101", "group_id": "codeNet:p02983", "input_text": "fun main(args : Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toLong() }\n val MOD = 2019\n val l = (L % MOD).toInt()\n val r = (R % MOD).toInt()\n\n\n val candidates = mutableListOf()\n var i = l\n candidates.add(i)\n while (i < r) {\n i = (i+1).mod(MOD)\n candidates.add(i)\n }\n\n val size = candidates.size\n\n if (size <= 1) {\n println(0)\n return\n }\n\n var answer = Int.MAX_VALUE\n candidates.sort()\n (0..(size - 1)).forEach { i ->\n ((i+1)..(size - 1)).forEach { j ->\n answer = Math.min(answer, (candidates[i] * candidates[j]).mod(2019))\n }\n }\n\n if (candidates.contains(3) && candidates.contains(673)) {\n println(0)\n return\n }\n\n println(answer)\n}", "language": "Kotlin", "metadata": {"date": 1562552044, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s235227101.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s235227101", "user_id": "u465133507"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args : Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toLong() }\n val MOD = 2019\n val l = (L % MOD).toInt()\n val r = (R % MOD).toInt()\n\n\n val candidates = mutableListOf()\n var i = l\n candidates.add(i)\n while (i < r) {\n i = (i+1).mod(MOD)\n candidates.add(i)\n }\n\n val size = candidates.size\n\n if (size <= 1) {\n println(0)\n return\n }\n\n var answer = Int.MAX_VALUE\n candidates.sort()\n (0..(size - 1)).forEach { i ->\n ((i+1)..(size - 1)).forEach { j ->\n answer = Math.min(answer, (candidates[i] * candidates[j]).mod(2019))\n }\n }\n\n if (candidates.contains(3) && candidates.contains(673)) {\n println(0)\n return\n }\n\n println(answer)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 780, "cpu_time_ms": 304, "memory_kb": 38564}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s472432044", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n\n val (l, r) = readLine()!!.split(\" \").map { it.toInt() }\n\n val sortedArray = (l..r).map { it % 2019 }.sorted().toTypedArray()\n\n println(sortedArray[0]*sortedArray[1])\n}", "language": "Kotlin", "metadata": {"date": 1562551078, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s472432044.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s472432044", "user_id": "u108272327"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n\n val (l, r) = readLine()!!.split(\" \").map { it.toInt() }\n\n val sortedArray = (l..r).map { it % 2019 }.sorted().toTypedArray()\n\n println(sortedArray[0]*sortedArray[1])\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 210, "cpu_time_ms": 2119, "memory_kb": 302104}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s686811611", "group_id": "codeNet:p02983", "input_text": "import java.math.BigDecimal\nimport java.util.*\n\nfun main(args: Array) {\n val sc = java.util.Scanner(System.`in`)\n val L = sc.nextLong()\n val R = sc.nextLong()\n\n var min: Long = R % 2019\n (L until R).forEach {\n min = Math.min(min, it % 2019)\n if (min == 0L) {\n println(0)\n return\n }\n }\n val min0 = min\n\n min = R % 673\n run loop@ {\n (L until R).forEach {\n min = Math.min(min, it % 673)\n if (min == 0L) {\n\n min = R % 3\n (L until R).forEach {\n min = Math.min(min, it % 3)\n if (min == 0L) {\n println(0)\n return\n }\n }\n\n return@loop\n }\n }\n }\n\n println(min0 * (min0 + 1L))\n}\n", "language": "Kotlin", "metadata": {"date": 1562550240, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s686811611.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s686811611", "user_id": "u059223549"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.math.BigDecimal\nimport java.util.*\n\nfun main(args: Array) {\n val sc = java.util.Scanner(System.`in`)\n val L = sc.nextLong()\n val R = sc.nextLong()\n\n var min: Long = R % 2019\n (L until R).forEach {\n min = Math.min(min, it % 2019)\n if (min == 0L) {\n println(0)\n return\n }\n }\n val min0 = min\n\n min = R % 673\n run loop@ {\n (L until R).forEach {\n min = Math.min(min, it % 673)\n if (min == 0L) {\n\n min = R % 3\n (L until R).forEach {\n min = Math.min(min, it % 3)\n if (min == 0L) {\n println(0)\n return\n }\n }\n\n return@loop\n }\n }\n }\n\n println(min0 * (min0 + 1L))\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 861, "cpu_time_ms": 200, "memory_kb": 29604}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s374927152", "group_id": "codeNet:p02983", "input_text": "import java.lang.Math.*\n\n\nfun main(args: Array) {\n val (l, r) = readDoubleList()\n val l2 = (l % 2019).toInt()\n val r2 = (r % 2019).toInt()\n var ans = 2019\n if (r2 <= l2 || r - l >= 2019 || l2 == 0) {\n println(0)\n } else {\n (r2 + 1).rep(l2, { i ->\n (r2 + 1).rep(l2, { j ->\n if (i == j) {\n } else {\n ans = min(ans, (i * j) % 2019)\n }\n })\n })\n }\n println(ans)\n}\n\n\nfun readList() = readLine()!!.split(' ')\nfun readIntList() = readList().map(String::toInt)\nfun readLongList() = readList().map(String::toLong)\nfun readDoubleList() = readList().map(String::toDouble)\n\nfun readPair(): Pair {\n val splite = readLine()!!.split(' ')\n return Pair(splite[0], splite[1])\n}\n\nfun List.copy() = this.map { it }\n\n// 速度のためforEachは避ける\nfun Int.rep(start: Int = 0, body: (Int) -> Unit) {\n for (i in start until this) {\n body(i)\n }\n}\n\nfun Long.rep(start: Long = 0, body: (Long) -> Unit) {\n for (i in start until this) {\n body(i)\n }\n}\n\n// 約数のList\nfun divisor(value: Long): List {\n val max = sqrt(value.toDouble()).toLong()\n return (1..max)\n .filter { value % it == 0L }\n .map { listOf(it, value / it) }\n .flatten()\n .sorted()\n}\n\n// 範囲内の素数を取得\n// fromだけ指定すると戻り値の個数で素数判定ができる\nfun prime(from: Long, to: Long = from): List {\n return (from..to).filter { i ->\n val max = Math.sqrt(i.toDouble()).toLong()\n (2..max).all { j -> i % j != 0L }\n }\n}\n\n// 素因数分解\nfun decom(value: Long): List {\n if (value == 1L) return listOf(1)\n val max = Math.sqrt(value.toDouble()).toLong()\n return prime(2, max).filter { value % it == 0L }\n}\n\n// 最大公約数\nfun gcd(a: Long, b: Long): Long {\n return if (a % b == 0L) b else gcd(b, a % b)\n}\n\n// 文字列を入れ替え\nfun swap(base: String, a: String, b: String): String {\n return base.map {\n when (it) {\n a.toCharArray()[0] -> b\n b.toCharArray()[0] -> a\n else -> it.toString()\n }\n }.joinToString()\n}", "language": "Kotlin", "metadata": {"date": 1562550228, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s374927152.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s374927152", "user_id": "u718935188"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.lang.Math.*\n\n\nfun main(args: Array) {\n val (l, r) = readDoubleList()\n val l2 = (l % 2019).toInt()\n val r2 = (r % 2019).toInt()\n var ans = 2019\n if (r2 <= l2 || r - l >= 2019 || l2 == 0) {\n println(0)\n } else {\n (r2 + 1).rep(l2, { i ->\n (r2 + 1).rep(l2, { j ->\n if (i == j) {\n } else {\n ans = min(ans, (i * j) % 2019)\n }\n })\n })\n }\n println(ans)\n}\n\n\nfun readList() = readLine()!!.split(' ')\nfun readIntList() = readList().map(String::toInt)\nfun readLongList() = readList().map(String::toLong)\nfun readDoubleList() = readList().map(String::toDouble)\n\nfun readPair(): Pair {\n val splite = readLine()!!.split(' ')\n return Pair(splite[0], splite[1])\n}\n\nfun List.copy() = this.map { it }\n\n// 速度のためforEachは避ける\nfun Int.rep(start: Int = 0, body: (Int) -> Unit) {\n for (i in start until this) {\n body(i)\n }\n}\n\nfun Long.rep(start: Long = 0, body: (Long) -> Unit) {\n for (i in start until this) {\n body(i)\n }\n}\n\n// 約数のList\nfun divisor(value: Long): List {\n val max = sqrt(value.toDouble()).toLong()\n return (1..max)\n .filter { value % it == 0L }\n .map { listOf(it, value / it) }\n .flatten()\n .sorted()\n}\n\n// 範囲内の素数を取得\n// fromだけ指定すると戻り値の個数で素数判定ができる\nfun prime(from: Long, to: Long = from): List {\n return (from..to).filter { i ->\n val max = Math.sqrt(i.toDouble()).toLong()\n (2..max).all { j -> i % j != 0L }\n }\n}\n\n// 素因数分解\nfun decom(value: Long): List {\n if (value == 1L) return listOf(1)\n val max = Math.sqrt(value.toDouble()).toLong()\n return prime(2, max).filter { value % it == 0L }\n}\n\n// 最大公約数\nfun gcd(a: Long, b: Long): Long {\n return if (a % b == 0L) b else gcd(b, a % b)\n}\n\n// 文字列を入れ替え\nfun swap(base: String, a: String, b: String): String {\n return base.map {\n when (it) {\n a.toCharArray()[0] -> b\n b.toCharArray()[0] -> a\n else -> it.toString()\n }\n }.joinToString()\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2228, "cpu_time_ms": 303, "memory_kb": 48508}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s310510460", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n var lr = readLine()!!.split(\" \").map { it.toLong() }.map {it % 2019}.toMutableList()\n if (lr[1] <= lr[0]) lr[1] += 2019L\n var min = 2019L\n var tmp: Long\n for (i in lr[0] until lr[1] ){\n for (j in i+1 until lr[1]+1){\n tmp = (i * j) % 2019L\n if (tmp < min) min = tmp\n }\n }\n println(min)\n}\n", "language": "Kotlin", "metadata": {"date": 1562550160, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s310510460.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s310510460", "user_id": "u520434261"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n var lr = readLine()!!.split(\" \").map { it.toLong() }.map {it % 2019}.toMutableList()\n if (lr[1] <= lr[0]) lr[1] += 2019L\n var min = 2019L\n var tmp: Long\n for (i in lr[0] until lr[1] ){\n for (j in i+1 until lr[1]+1){\n tmp = (i * j) % 2019L\n if (tmp < min) min = tmp\n }\n }\n println(min)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 377, "cpu_time_ms": 249, "memory_kb": 37956}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s893920331", "group_id": "codeNet:p02983", "input_text": "fun main(args : Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toLong() }\n val MOD = 2019\n val l = (L % MOD).toInt()\n val r = (R % MOD).toInt()\n\n\n val candidates = mutableListOf()\n var i = l\n candidates.add(i)\n while (i < r) {\n i = (i+1).mod(MOD)\n candidates.add(i)\n }\n\n val size = candidates.size\n\n if (size <= 1) {\n println(0)\n return\n }\n\n var answer = Int.MAX_VALUE\n (0..(size - 1)).forEach { i ->\n ((i+1)..(size - 1)).forEach { j ->\n answer = Math.min(answer, (candidates[i] * candidates[j]).mod(2019))\n }\n }\n\n println(answer)\n}", "language": "Kotlin", "metadata": {"date": 1562550156, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s893920331.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s893920331", "user_id": "u465133507"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args : Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toLong() }\n val MOD = 2019\n val l = (L % MOD).toInt()\n val r = (R % MOD).toInt()\n\n\n val candidates = mutableListOf()\n var i = l\n candidates.add(i)\n while (i < r) {\n i = (i+1).mod(MOD)\n candidates.add(i)\n }\n\n val size = candidates.size\n\n if (size <= 1) {\n println(0)\n return\n }\n\n var answer = Int.MAX_VALUE\n (0..(size - 1)).forEach { i ->\n ((i+1)..(size - 1)).forEach { j ->\n answer = Math.min(answer, (candidates[i] * candidates[j]).mod(2019))\n }\n }\n\n println(answer)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 655, "cpu_time_ms": 284, "memory_kb": 36024}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s769333405", "group_id": "codeNet:p02983", "input_text": "fun main(args : Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toLong() }\n val MOD = 2019\n\n val candidates = mutableListOf()\n var i = L\n candidates.add(i)\n (0..2019 * 2).forEach {\n i++\n if (i < R) {\n candidates.add(i.mod(2019))\n }\n }\n\n candidates.sort()\n if (candidates.size == 1) {\n println(0)\n } else {\n println(candidates[0] * candidates[1])\n }\n}", "language": "Kotlin", "metadata": {"date": 1562549420, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s769333405.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s769333405", "user_id": "u465133507"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args : Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toLong() }\n val MOD = 2019\n\n val candidates = mutableListOf()\n var i = L\n candidates.add(i)\n (0..2019 * 2).forEach {\n i++\n if (i < R) {\n candidates.add(i.mod(2019))\n }\n }\n\n candidates.sort()\n if (candidates.size == 1) {\n println(0)\n } else {\n println(candidates[0] * candidates[1])\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 451, "cpu_time_ms": 248, "memory_kb": 36140}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s490849250", "group_id": "codeNet:p02983", "input_text": "\nfun main(args: Array) {\n val (l, r) = readLine()!!.split(' ').map(String::toInt)\n val ml = l % 2019\n val mr = r % 2019\n print(when{\n ml > mr -> 0\n ml == 0 || mr == 0 -> 0\n else -> {\n val ls = (ml..mr).toList()\n ls.indices.flatMap { i -> (i+1 until ls.size).map { j ->\n ls[i] * ls[j] % 2019\n }\n }.min()\n }\n })\n}", "language": "Kotlin", "metadata": {"date": 1562549384, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s490849250.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s490849250", "user_id": "u526818046"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\nfun main(args: Array) {\n val (l, r) = readLine()!!.split(' ').map(String::toInt)\n val ml = l % 2019\n val mr = r % 2019\n print(when{\n ml > mr -> 0\n ml == 0 || mr == 0 -> 0\n else -> {\n val ls = (ml..mr).toList()\n ls.indices.flatMap { i -> (i+1 until ls.size).map { j ->\n ls[i] * ls[j] % 2019\n }\n }.min()\n }\n })\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 421, "cpu_time_ms": 952, "memory_kb": 115204}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s156926861", "group_id": "codeNet:p02983", "input_text": "\nimport java.io.PrintWriter\n\nval squares = (1..127).map { it * it }\n\nfun check(x: List, y: List): Boolean {\n val distanceSquared = x.zip(y).map { (it.first - it.second) * (it.first - it.second)}.sum()\n return distanceSquared in squares\n}\n\nfun solve(out: PrintWriter): Boolean = with(out) {\n val (L, R) = readLine()!!.split(\" \").map { it.toInt() }\n\n val Lmod2019 = if ((L/2019+1) * 2019 <= R) 0 else L % 2019\n val Rmod2019 = if ((R/2019) * 2019 >= L) 2018 else R % 2019\n\n var m = Int.MAX_VALUE\n for (i in Lmod2019..Rmod2019) {\n for (j in i+1..Rmod2019) {\n if (m > i*j%2019)\n m = i*j%2019\n }\n }\n println(m)\n return false\n}\n\n// with(PrintWriter(System.out))\n// with(File(\"out.txt\").printWriter())\n// with(File(args[1]).printWriter())\nfun main(args: Array) = with(PrintWriter(System.out)){\n// System.setIn(File(args[0]).inputStream())\n while(solve(this));\n flush()\n}", "language": "Kotlin", "metadata": {"date": 1562549239, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s156926861.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s156926861", "user_id": "u775999110"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\nimport java.io.PrintWriter\n\nval squares = (1..127).map { it * it }\n\nfun check(x: List, y: List): Boolean {\n val distanceSquared = x.zip(y).map { (it.first - it.second) * (it.first - it.second)}.sum()\n return distanceSquared in squares\n}\n\nfun solve(out: PrintWriter): Boolean = with(out) {\n val (L, R) = readLine()!!.split(\" \").map { it.toInt() }\n\n val Lmod2019 = if ((L/2019+1) * 2019 <= R) 0 else L % 2019\n val Rmod2019 = if ((R/2019) * 2019 >= L) 2018 else R % 2019\n\n var m = Int.MAX_VALUE\n for (i in Lmod2019..Rmod2019) {\n for (j in i+1..Rmod2019) {\n if (m > i*j%2019)\n m = i*j%2019\n }\n }\n println(m)\n return false\n}\n\n// with(PrintWriter(System.out))\n// with(File(\"out.txt\").printWriter())\n// with(File(args[1]).printWriter())\nfun main(args: Array) = with(PrintWriter(System.out)){\n// System.setIn(File(args[0]).inputStream())\n while(solve(this));\n flush()\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 959, "cpu_time_ms": 246, "memory_kb": 36104}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s071623894", "group_id": "codeNet:p02983", "input_text": "fun main(args : Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toLong() }\n val MOD = 2019\n val l = (L % MOD).toInt()\n val r = (R % MOD).toInt()\n\n\n val candidates = mutableListOf()\n var i = l\n candidates.add(i)\n while ((i+1).mod(MOD) <= r) {\n i = (i+1).mod(MOD)\n candidates.add(i)\n }\n\n\n\n candidates.sort()\n println(candidates[0] * candidates[1])\n}", "language": "Kotlin", "metadata": {"date": 1562548989, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s071623894.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s071623894", "user_id": "u465133507"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args : Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toLong() }\n val MOD = 2019\n val l = (L % MOD).toInt()\n val r = (R % MOD).toInt()\n\n\n val candidates = mutableListOf()\n var i = l\n candidates.add(i)\n while ((i+1).mod(MOD) <= r) {\n i = (i+1).mod(MOD)\n candidates.add(i)\n }\n\n\n\n candidates.sort()\n println(candidates[0] * candidates[1])\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 415, "cpu_time_ms": 2103, "memory_kb": 303584}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s229501706", "group_id": "codeNet:p02983", "input_text": "fun main(args : Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toLong() }\n val MOD = 2019\n val l = (L % MOD).toInt()\n val r = (R % MOD).toInt()\n\n\n val candidates = mutableListOf()\n var i = l\n candidates.add(i)\n while (i < r) {\n i = (i+1).mod(MOD)\n candidates.add(i)\n }\n\n val size = candidates.size\n\n var answer = Int.MAX_VALUE\n (0..(size - 1)).forEach { i ->\n ((i+1)..(size - 1)).forEach { j ->\n answer = Math.min(answer, (candidates[i] * candidates[j]).mod(2019))\n }\n }\n\n println(answer)\n}", "language": "Kotlin", "metadata": {"date": 1562548883, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s229501706.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s229501706", "user_id": "u465133507"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args : Array) {\n val (L, R) = readLine()!!.split(\" \").map { it.toLong() }\n val MOD = 2019\n val l = (L % MOD).toInt()\n val r = (R % MOD).toInt()\n\n\n val candidates = mutableListOf()\n var i = l\n candidates.add(i)\n while (i < r) {\n i = (i+1).mod(MOD)\n candidates.add(i)\n }\n\n val size = candidates.size\n\n var answer = Int.MAX_VALUE\n (0..(size - 1)).forEach { i ->\n ((i+1)..(size - 1)).forEach { j ->\n answer = Math.min(answer, (candidates[i] * candidates[j]).mod(2019))\n }\n }\n\n println(answer)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 593, "cpu_time_ms": 283, "memory_kb": 37740}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s825014814", "group_id": "codeNet:p02983", "input_text": "import java.util.*\nfun main(args: Array){\n\tval cin = Scanner(System.`in`)\n val l = cin.nextInt()\n val r = cin.nextInt()\n\n val l_a = l / 2019\n val l_b = l % 2019\n val r_a = r / 2019\n val r_b = r % 2019\n\n if (l_a != r_a) {\n println(0)\n } else {\n var ans = 2018\n for (i in l_b..r_b-1) {\n for (j in i+1..r_b) {\n if (ans > (i*j)%2019) {\n ans = (i*j)%2019\n }\n }\n }\n println(ans)\n }\n}", "language": "Kotlin", "metadata": {"date": 1562548589, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s825014814.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s825014814", "user_id": "u111421568"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\nfun main(args: Array){\n\tval cin = Scanner(System.`in`)\n val l = cin.nextInt()\n val r = cin.nextInt()\n\n val l_a = l / 2019\n val l_b = l % 2019\n val r_a = r / 2019\n val r_b = r % 2019\n\n if (l_a != r_a) {\n println(0)\n } else {\n var ans = 2018\n for (i in l_b..r_b-1) {\n for (j in i+1..r_b) {\n if (ans > (i*j)%2019) {\n ans = (i*j)%2019\n }\n }\n }\n println(ans)\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 518, "cpu_time_ms": 185, "memory_kb": 29600}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s848974297", "group_id": "codeNet:p02983", "input_text": "fun main(args: Array) {\n val (l, r) = readLine()!!.split(\" \").map { it.toLong() }\n if (r - l >= 2100) {\n println(0)\n return\n }\n var ans = Long.MAX_VALUE\n for (i in l..r) {\n for (j in (i + 1)..r) {\n if (i * j % 2019 < ans) {\n ans = i * j % 2019\n }\n }\n }\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1562548262, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p02983.html", "problem_id": "p02983", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p02983/input.txt", "sample_output_relpath": "derived/input_output/data/p02983/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02983/Kotlin/s848974297.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848974297", "user_id": "u771276542"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (l, r) = readLine()!!.split(\" \").map { it.toLong() }\n if (r - l >= 2100) {\n println(0)\n return\n }\n var ans = Long.MAX_VALUE\n for (i in l..r) {\n for (j in (i + 1)..r) {\n if (i * j % 2019 < ans) {\n ans = i * j % 2019\n }\n }\n }\n println(ans)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "sample_input": "2020 2040\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02983", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two non-negative integers L and R.\nWe will choose two integers i and j such that L \\leq i < j \\leq R.\nFind the minimum possible value of (i \\times j) \\mbox{ mod } 2019.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq L < R \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R\n\nOutput\n\nPrint the minimum possible value of (i \\times j) \\mbox{ mod } 2019 when i and j are chosen under the given condition.\n\nSample Input 1\n\n2020 2040\n\nSample Output 1\n\n2\n\nWhen (i, j) = (2020, 2021), (i \\times j) \\mbox{ mod } 2019 = 2.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n20\n\nWe have only one choice: (i, j) = (4, 5).", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 362, "cpu_time_ms": 236, "memory_kb": 38004}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s686050818", "group_id": "codeNet:p03018", "input_text": "@file:Suppress(\"DuplicatedCode\")\n\nimport java.io.IOException\nimport java.io.InputStream\nimport java.io.PrintWriter\nimport java.util.NoSuchElementException\n\nfun main(args: Array) {\n PrintWriter(System.out).use { out ->\n B.solve(B.FastScanner(), out)\n out.flush()\n }\n}\n\nprivate fun B.solve(sc: B.FastScanner, out: PrintWriter) {\n val array = CharArray(200000)\n val len = run {\n var ptr = 0\n var prev = 'X'\n sc.toCharIterator().forEach {\n when (it) {\n 'A' -> {\n array[ptr++] = 'A'\n }\n 'B' -> {\n if (prev == 'B') array[ptr++] = 'X'\n }\n 'C' -> {\n if (prev == 'B') {\n array[ptr++] = 'S'\n } else {\n array[ptr++] = 'X'\n }\n }\n }\n prev = it\n }\n ptr\n }\n\n var aCount = -1\n var ans = 0\n for (i in 0 until len) {\n val chr = array[i]\n if (aCount >= 0) {\n if (chr == 'X') {\n aCount = -1\n continue\n }\n\n if (chr == 'S') {\n ans += aCount\n } else {\n aCount++\n }\n } else {\n if (chr == 'X') continue\n else {\n aCount = if (chr == 'A') 1 else 0\n }\n }\n }\n\n println(ans)\n}\n\n@Suppress(\"MemberVisibilityCanBePrivate\")\nprivate object B {\n private const val zeroCode = '0'.toInt()\n private const val nineCode = '9'.toInt()\n\n class FastScanner {\n private val `in`: InputStream = System.`in`\n private val buffer = ByteArray(2048)\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n\n private fun readByte(): Byte = if (hasNextByte()) buffer[ptr++] else -1\n\n private fun readByteAsInt(): Int = if (hasNextByte()) buffer[ptr++].toInt() else -1\n\n operator fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++\n return hasNextByte()\n }\n\n operator fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n\n return buildString {\n var b = readByteAsInt()\n\n while (isPrintableChar(b)) {\n appendCodePoint(b)\n b = readByteAsInt()\n }\n }\n }\n\n fun toCharIterator(): CharIterator = object : CharIterator() {\n private var nextByte: Byte = readByte()\n\n override fun hasNext(): Boolean = isPrintableChar(nextByte)\n\n override fun nextChar(): Char {\n val res = nextByte\n nextByte = readByte()\n return res.toChar()\n }\n\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByteAsInt()\n\n if (b == '-'.toInt()) {\n minus = true\n b = readByteAsInt()\n }\n\n if (b !in zeroCode..nineCode) {\n throw NumberFormatException()\n }\n\n while (true) {\n if (b in zeroCode..nineCode) {\n n *= 10\n n += b - zeroCode.toLong()\n } else if (b == -1 || !isPrintableChar(b)) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n\n b = readByteAsInt()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl < Int.MIN_VALUE || nl > Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun nextDouble(): Double {\n return next().toDouble()\n }\n\n fun readIntArray(n: Int): IntArray {\n val arr = IntArray(n)\n\n for (i in 0 until n) {\n arr[i] = nextInt()\n }\n\n return arr\n }\n\n fun readBigInt(capacity: Int): IntArray {\n if (!hasNext()) throw NoSuchElementException()\n\n val arr = IntArray(capacity)\n var len = 0\n arr[0] = readByteAsInt() - zeroCode\n while (arr[len] in 0..9) {\n len++\n arr[len] = readByteAsInt() - zeroCode\n }\n\n return arr.sliceArray(0 until len)\n }\n\n companion object {\n private inline fun isPrintableChar(c: Int): Boolean {\n return c in 33..126\n }\n\n private inline fun isPrintableChar(c: Byte): Boolean {\n return c in 33..126\n }\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1589758592, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Kotlin/s686050818.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s686050818", "user_id": "u996672406"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "@file:Suppress(\"DuplicatedCode\")\n\nimport java.io.IOException\nimport java.io.InputStream\nimport java.io.PrintWriter\nimport java.util.NoSuchElementException\n\nfun main(args: Array) {\n PrintWriter(System.out).use { out ->\n B.solve(B.FastScanner(), out)\n out.flush()\n }\n}\n\nprivate fun B.solve(sc: B.FastScanner, out: PrintWriter) {\n val array = CharArray(200000)\n val len = run {\n var ptr = 0\n var prev = 'X'\n sc.toCharIterator().forEach {\n when (it) {\n 'A' -> {\n array[ptr++] = 'A'\n }\n 'B' -> {\n if (prev == 'B') array[ptr++] = 'X'\n }\n 'C' -> {\n if (prev == 'B') {\n array[ptr++] = 'S'\n } else {\n array[ptr++] = 'X'\n }\n }\n }\n prev = it\n }\n ptr\n }\n\n var aCount = -1\n var ans = 0\n for (i in 0 until len) {\n val chr = array[i]\n if (aCount >= 0) {\n if (chr == 'X') {\n aCount = -1\n continue\n }\n\n if (chr == 'S') {\n ans += aCount\n } else {\n aCount++\n }\n } else {\n if (chr == 'X') continue\n else {\n aCount = if (chr == 'A') 1 else 0\n }\n }\n }\n\n println(ans)\n}\n\n@Suppress(\"MemberVisibilityCanBePrivate\")\nprivate object B {\n private const val zeroCode = '0'.toInt()\n private const val nineCode = '9'.toInt()\n\n class FastScanner {\n private val `in`: InputStream = System.`in`\n private val buffer = ByteArray(2048)\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) {\n return true\n } else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) {\n return false\n }\n }\n return true\n }\n\n private fun readByte(): Byte = if (hasNextByte()) buffer[ptr++] else -1\n\n private fun readByteAsInt(): Int = if (hasNextByte()) buffer[ptr++].toInt() else -1\n\n operator fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++\n return hasNextByte()\n }\n\n operator fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n\n return buildString {\n var b = readByteAsInt()\n\n while (isPrintableChar(b)) {\n appendCodePoint(b)\n b = readByteAsInt()\n }\n }\n }\n\n fun toCharIterator(): CharIterator = object : CharIterator() {\n private var nextByte: Byte = readByte()\n\n override fun hasNext(): Boolean = isPrintableChar(nextByte)\n\n override fun nextChar(): Char {\n val res = nextByte\n nextByte = readByte()\n return res.toChar()\n }\n\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByteAsInt()\n\n if (b == '-'.toInt()) {\n minus = true\n b = readByteAsInt()\n }\n\n if (b !in zeroCode..nineCode) {\n throw NumberFormatException()\n }\n\n while (true) {\n if (b in zeroCode..nineCode) {\n n *= 10\n n += b - zeroCode.toLong()\n } else if (b == -1 || !isPrintableChar(b)) {\n return if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n\n b = readByteAsInt()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl < Int.MIN_VALUE || nl > Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n\n fun nextDouble(): Double {\n return next().toDouble()\n }\n\n fun readIntArray(n: Int): IntArray {\n val arr = IntArray(n)\n\n for (i in 0 until n) {\n arr[i] = nextInt()\n }\n\n return arr\n }\n\n fun readBigInt(capacity: Int): IntArray {\n if (!hasNext()) throw NoSuchElementException()\n\n val arr = IntArray(capacity)\n var len = 0\n arr[0] = readByteAsInt() - zeroCode\n while (arr[len] in 0..9) {\n len++\n arr[len] = readByteAsInt() - zeroCode\n }\n\n return arr.sliceArray(0 until len)\n }\n\n companion object {\n private inline fun isPrintableChar(c: Int): Boolean {\n return c in 33..126\n }\n\n private inline fun isPrintableChar(c: Byte): Boolean {\n return c in 33..126\n }\n }\n }\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5307, "cpu_time_ms": 215, "memory_kb": 31596}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s077717069", "group_id": "codeNet:p03018", "input_text": "fun main(args : Array) {\n val ss = readLine()!!\n\n var aCnt = 0\n var bFound = false\n var ans = 0L\n ss.forEach {\n if (it == 'A' && !bFound) {\n aCnt++\n return@forEach\n }\n\n if (it == 'B' && aCnt > 0 && !bFound) {\n bFound = true\n return@forEach\n }\n\n if (it == 'C' && bFound) {\n ans += aCnt\n bFound = false\n return@forEach\n }\n\n aCnt = 0\n bFound = false\n }\n\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1582979109, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Kotlin/s077717069.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s077717069", "user_id": "u262403099"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args : Array) {\n val ss = readLine()!!\n\n var aCnt = 0\n var bFound = false\n var ans = 0L\n ss.forEach {\n if (it == 'A' && !bFound) {\n aCnt++\n return@forEach\n }\n\n if (it == 'B' && aCnt > 0 && !bFound) {\n bFound = true\n return@forEach\n }\n\n if (it == 'C' && bFound) {\n ans += aCnt\n bFound = false\n return@forEach\n }\n\n aCnt = 0\n bFound = false\n }\n\n println(ans)\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 528, "cpu_time_ms": 248, "memory_kb": 32672}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s062354991", "group_id": "codeNet:p03018", "input_text": "fun main(args : Array) {\n val ss = readLine()!!\n\n var aCnt = 0\n var bFound = false\n var ans = 0\n ss.forEach {\n if (it == 'A') {\n aCnt++\n return@forEach\n }\n\n if (it == 'B' && aCnt > 0) {\n bFound = true\n return@forEach\n }\n\n if (it == 'C' && bFound) {\n ans += aCnt\n bFound = false\n return@forEach\n }\n\n aCnt = 0\n }\n\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1582977988, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Kotlin/s062354991.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s062354991", "user_id": "u262403099"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args : Array) {\n val ss = readLine()!!\n\n var aCnt = 0\n var bFound = false\n var ans = 0\n ss.forEach {\n if (it == 'A') {\n aCnt++\n return@forEach\n }\n\n if (it == 'B' && aCnt > 0) {\n bFound = true\n return@forEach\n }\n\n if (it == 'C' && bFound) {\n ans += aCnt\n bFound = false\n return@forEach\n }\n\n aCnt = 0\n }\n\n println(ans)\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 482, "cpu_time_ms": 250, "memory_kb": 34344}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s198871436", "group_id": "codeNet:p03018", "input_text": "fun main(args: Array) {\n agc034b()\n}\n\nfun agc034b() {\n val s = readLine()!!.replace(\"BC\", \"D\")\n\n var aCount = 0\n var answer = 0\n s.forEach {\n when (it) {\n 'A' -> aCount++\n 'D' -> answer += aCount\n else -> aCount = 0\n }\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1576563582, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Kotlin/s198871436.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s198871436", "user_id": "u139478771"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n agc034b()\n}\n\nfun agc034b() {\n val s = readLine()!!.replace(\"BC\", \"D\")\n\n var aCount = 0\n var answer = 0\n s.forEach {\n when (it) {\n 'A' -> aCount++\n 'D' -> answer += aCount\n else -> aCount = 0\n }\n }\n\n println(answer)\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 318, "cpu_time_ms": 489, "memory_kb": 44076}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s354757873", "group_id": "codeNet:p03018", "input_text": "fun main(args: Array) {\n agc034b()\n}\n\n// 愚直じゃないよね？？\nfun agc034b() {\n val s = readLine()!!.toCharArray()\n\n var before: CharArray\n val abc = \"ABC\"\n var answer = 0L\n while (true) {\n before = s.copyOf()\n for (i in 0..s.lastIndex - 2) {\n val slice = s.slice(i..i + 2).toCharArray()\n if (slice.toString() == abc) {\n s[i] = 'B'\n s[i + 1] = 'C'\n s[i + 2] = 'A'\n answer++\n }\n }\n if (s.toString() == before.toString()) break\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1576556642, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Kotlin/s354757873.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s354757873", "user_id": "u139478771"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n agc034b()\n}\n\n// 愚直じゃないよね？？\nfun agc034b() {\n val s = readLine()!!.toCharArray()\n\n var before: CharArray\n val abc = \"ABC\"\n var answer = 0L\n while (true) {\n before = s.copyOf()\n for (i in 0..s.lastIndex - 2) {\n val slice = s.slice(i..i + 2).toCharArray()\n if (slice.toString() == abc) {\n s[i] = 'B'\n s[i + 1] = 'C'\n s[i + 2] = 'A'\n answer++\n }\n }\n if (s.toString() == before.toString()) break\n }\n\n println(answer)\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 611, "cpu_time_ms": 2111, "memory_kb": 121524}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s301038095", "group_id": "codeNet:p03018", "input_text": "fun main(args: Array) {\n val s = readInputLine().replace(\"BC\", \"D\").toCharArray()\n \n var Acnt = 0L\n var ans = 0L\n\n for (i in 0 until s.size) {\n when (s[i]) {\n 'A' -> Acnt++\n 'D' -> ans += Acnt\n else -> Acnt = 0L\n }\n }\n\n println(ans)\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "language": "Kotlin", "metadata": {"date": 1572698036, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Kotlin/s301038095.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s301038095", "user_id": "u505558493"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readInputLine().replace(\"BC\", \"D\").toCharArray()\n \n var Acnt = 0L\n var ans = 0L\n\n for (i in 0 until s.size) {\n when (s[i]) {\n 'A' -> Acnt++\n 'D' -> ans += Acnt\n else -> Acnt = 0L\n }\n }\n\n println(ans)\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 368, "cpu_time_ms": 476, "memory_kb": 43748}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s568689435", "group_id": "codeNet:p03018", "input_text": "import java.util.*\n\nconst val MOD: Long = (1e9+7).toLong()\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun > Iterable.argmax(): Int? = withIndex().maxBy{it.value}?.index\nfun > Iterable.argmin(): Int? = withIndex().minBy{it.value}?.index\n\nfun main(args: Array) {\n val reader = System.`in`.bufferedReader()\n val s = reader.readLine()!!\n val n = s.length\n\n val a = Array(n, {0L})\n for (i in 1..n-2) {\n if (s.substring(i..i+1) == \"BC\") {\n var f = false\n for (d in i-1 downTo 0) {\n if (a[d] > 0) {\n a[i] += a[d]\n break\n }\n if (f) {\n break\n }\n if (s[d] == 'A') {\n a[i] += 1L\n } else if (s[d] == 'B') {\n break\n } else if (s[d] == 'C') {\n f = true\n }\n }\n }\n }\n\n println(a.sum())\n}\n", "language": "Kotlin", "metadata": {"date": 1559528583, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Kotlin/s568689435.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s568689435", "user_id": "u868099754"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\nconst val MOD: Long = (1e9+7).toLong()\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun > Iterable.argmax(): Int? = withIndex().maxBy{it.value}?.index\nfun > Iterable.argmin(): Int? = withIndex().minBy{it.value}?.index\n\nfun main(args: Array) {\n val reader = System.`in`.bufferedReader()\n val s = reader.readLine()!!\n val n = s.length\n\n val a = Array(n, {0L})\n for (i in 1..n-2) {\n if (s.substring(i..i+1) == \"BC\") {\n var f = false\n for (d in i-1 downTo 0) {\n if (a[d] > 0) {\n a[i] += a[d]\n break\n }\n if (f) {\n break\n }\n if (s[d] == 'A') {\n a[i] += 1L\n } else if (s[d] == 'B') {\n break\n } else if (s[d] == 'C') {\n f = true\n }\n }\n }\n }\n\n println(a.sum())\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1050, "cpu_time_ms": 339, "memory_kb": 45884}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s804239763", "group_id": "codeNet:p03018", "input_text": "fun main(args: Array) {\n val s = readLine()!!.toCharArray()\n var count = 0\n do {\n val replaced = replace(s)\n count += replaced\n } while (replaced > 0)\n println(count)\n}\n\nfun replace(charArray: CharArray): Int {\n for (i in 0 .. charArray.size - 3) {\n if (charArray[i] == 'A'\n && charArray[i + 1] == 'B'\n && charArray[i + 2] == 'C'\n ) {\n charArray[i] = 'B'\n charArray[i + 1] = 'C'\n charArray[i + 2] = 'A'\n return 1\n }\n }\n return 0\n}\n", "language": "Kotlin", "metadata": {"date": 1559525844, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Kotlin/s804239763.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s804239763", "user_id": "u523146937"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!.toCharArray()\n var count = 0\n do {\n val replaced = replace(s)\n count += replaced\n } while (replaced > 0)\n println(count)\n}\n\nfun replace(charArray: CharArray): Int {\n for (i in 0 .. charArray.size - 3) {\n if (charArray[i] == 'A'\n && charArray[i + 1] == 'B'\n && charArray[i + 2] == 'C'\n ) {\n charArray[i] = 'B'\n charArray[i + 1] = 'C'\n charArray[i + 2] = 'A'\n return 1\n }\n }\n return 0\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 564, "cpu_time_ms": 2111, "memory_kb": 34272}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s605709958", "group_id": "codeNet:p03018", "input_text": "fun main(args: Array) {\n val s = readLine()!!\n .replace(\"BC\",\"X\")\n .replace('B','Y')\n .replace('C','Y')\n .split(\"Y\")\n var result = s.map {\n var count = 0\n var acount=0\n it.forEach {c->\n if(c=='A')acount+=1\n else count+=acount\n }\n count\n }.sum()\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1559525649, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Kotlin/s605709958.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s605709958", "user_id": "u586526576"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!\n .replace(\"BC\",\"X\")\n .replace('B','Y')\n .replace('C','Y')\n .split(\"Y\")\n var result = s.map {\n var count = 0\n var acount=0\n it.forEach {c->\n if(c=='A')acount+=1\n else count+=acount\n }\n count\n }.sum()\n println(result)\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 368, "cpu_time_ms": 564, "memory_kb": 59908}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s445039450", "group_id": "codeNet:p03018", "input_text": "import java.util.*\nfun main(args: Array){\n\tval cin = Scanner(System.`in`)\n val s = cin.next()\n\n var on = false\n var on_a_count = 0\n var bc = false\n var ans: Long = 0\n for (i in 0..s.length-1) {\n if (bc) {\n if (s[i] == 'C') {\n ans += on_a_count\n } else {\n on = false\n }\n bc = false\n continue\n }\n if (!on) {\n if (s[i] == 'A') {\n on = true\n on_a_count = 1\n }\n } else {\n if (s[i] == 'A') {\n on_a_count += 1\n } else if (s[i] == 'B') {\n bc = true\n } else {\n on = false\n }\n }\n }\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1559525107, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03018.html", "problem_id": "p03018", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03018/input.txt", "sample_output_relpath": "derived/input_output/data/p03018/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03018/Kotlin/s445039450.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s445039450", "user_id": "u111421568"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\nfun main(args: Array){\n\tval cin = Scanner(System.`in`)\n val s = cin.next()\n\n var on = false\n var on_a_count = 0\n var bc = false\n var ans: Long = 0\n for (i in 0..s.length-1) {\n if (bc) {\n if (s[i] == 'C') {\n ans += on_a_count\n } else {\n on = false\n }\n bc = false\n continue\n }\n if (!on) {\n if (s[i] == 'A') {\n on = true\n on_a_count = 1\n }\n } else {\n if (s[i] == 'A') {\n on_a_count += 1\n } else if (s[i] == 'B') {\n bc = true\n } else {\n on = false\n }\n }\n }\n println(ans)\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "sample_input": "ABCABC\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03018", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string s consisting of A, B and C.\n\nSnuke wants to perform the following operation on s as many times as possible:\n\nChoose a contiguous substring of s that reads ABC and replace it with BCA.\n\nFind the maximum possible number of operations.\n\nConstraints\n\n1 \\leq |s| \\leq 200000\n\nEach character of s is A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nFind the maximum possible number of operations.\n\nSample Input 1\n\nABCABC\n\nSample Output 1\n\n3\n\nYou can perform the operations three times as follows: ABCABC → BCAABC → BCABCA → BCBCAA. This is the maximum result.\n\nSample Input 2\n\nC\n\nSample Output 2\n\n0\n\nSample Input 3\n\nABCACCBABCBCAABCB\n\nSample Output 3\n\n6", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 780, "cpu_time_ms": 288, "memory_kb": 34540}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s446744903", "group_id": "codeNet:p03053", "input_text": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\n\nprivate val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = { readLine()!!.toInt() }\nprivate val readLong: ()->Long = { readLine()!!.toLong() }\nprivate val readListInt: ()->List = { readLine()!!.split(' ').map(String::toInt) }\nprivate val readListLong: ()->List = { readLine()!!.split(' ').map(String::toLong) }\nprivate val errPrintln: (String)->Unit = { msg -> System.err.println(msg) }\n//private val MOD = 1e9.toLong()+7\n//private val INF = Int.MAX_VALUE/2\n//private val LINF = Long.MAX_VALUE/2\n\n\nclass GridBfs(val G: List, val Start:Char = '#',\n val ToPaint:Char = '.') {\n var H:Int = 0\n var W:Int = 0\n data class Pos(val x: Int, val y: Int)\n private val starts = ArrayList()\n init {\n H = G.size\n W = G[0].length\n G.forEachIndexed{i, row ->\n row.forEachIndexed{j, cell ->\n if (cell == Start) starts.add(Pos(i,j))\n }\n }\n }\n private val dx = intArrayOf(0,1,0,-1)\n private val dy = intArrayOf(1,0,-1,-0)\n private val INF = Int.MAX_VALUE/2\n fun fill(): Int {\n val que = LinkedList()\n val step = Array(H){IntArray(W){INF} }\n for (ps in starts) {\n que.addLast(ps)\n step[ps.x][ps.y] = 0\n }\n while (que.isNotEmpty()) {\n val (x, y) = que.removeFirst()\n for (i in dx.indices) {\n val nx = x + dx[i]; val ny = y + dy[i]\n if (nx<0 || H<=nx || ny<0 || W<=ny) {\n continue\n }\n if (step[nx][ny] > step[x][y] + 1) {\n step[nx][ny] = step[x][y] + 1\n que.addLast(Pos(nx, ny))\n }\n }\n }\n\n var res = -INF\n step.forEach { it.forEach { res = max(res, it) } }\n return res\n }\n}\n\n\nfun solveA(A: Array): Int {\n val bfs = GridBfs(A.toList())\n return bfs.fill()\n}\n\n\nfun main(args: Array) {\n val (H, W) = readListInt()\n val A = Array(H){\"\"}\n for (i in 0 until H) {\n A[i] = readString()\n }\n\n val ans = solveA(A)\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1589900735, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s446744903.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s446744903", "user_id": "u404244809"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\n\nprivate val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = { readLine()!!.toInt() }\nprivate val readLong: ()->Long = { readLine()!!.toLong() }\nprivate val readListInt: ()->List = { readLine()!!.split(' ').map(String::toInt) }\nprivate val readListLong: ()->List = { readLine()!!.split(' ').map(String::toLong) }\nprivate val errPrintln: (String)->Unit = { msg -> System.err.println(msg) }\n//private val MOD = 1e9.toLong()+7\n//private val INF = Int.MAX_VALUE/2\n//private val LINF = Long.MAX_VALUE/2\n\n\nclass GridBfs(val G: List, val Start:Char = '#',\n val ToPaint:Char = '.') {\n var H:Int = 0\n var W:Int = 0\n data class Pos(val x: Int, val y: Int)\n private val starts = ArrayList()\n init {\n H = G.size\n W = G[0].length\n G.forEachIndexed{i, row ->\n row.forEachIndexed{j, cell ->\n if (cell == Start) starts.add(Pos(i,j))\n }\n }\n }\n private val dx = intArrayOf(0,1,0,-1)\n private val dy = intArrayOf(1,0,-1,-0)\n private val INF = Int.MAX_VALUE/2\n fun fill(): Int {\n val que = LinkedList()\n val step = Array(H){IntArray(W){INF} }\n for (ps in starts) {\n que.addLast(ps)\n step[ps.x][ps.y] = 0\n }\n while (que.isNotEmpty()) {\n val (x, y) = que.removeFirst()\n for (i in dx.indices) {\n val nx = x + dx[i]; val ny = y + dy[i]\n if (nx<0 || H<=nx || ny<0 || W<=ny) {\n continue\n }\n if (step[nx][ny] > step[x][y] + 1) {\n step[nx][ny] = step[x][y] + 1\n que.addLast(Pos(nx, ny))\n }\n }\n }\n\n var res = -INF\n step.forEach { it.forEach { res = max(res, it) } }\n return res\n }\n}\n\n\nfun solveA(A: Array): Int {\n val bfs = GridBfs(A.toList())\n return bfs.fill()\n}\n\n\nfun main(args: Array) {\n val (H, W) = readListInt()\n val A = Array(H){\"\"}\n for (i in 0 until H) {\n A[i] = readString()\n }\n\n val ans = solveA(A)\n\n println(ans)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2230, "cpu_time_ms": 969, "memory_kb": 133600}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s318129890", "group_id": "codeNet:p03053", "input_text": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\n\nprivate val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = { readLine()!!.toInt() }\nprivate val readLong: ()->Long = { readLine()!!.toLong() }\nprivate val readListInt: ()->List = { readLine()!!.split(' ').map(String::toInt) }\nprivate val readListLong: ()->List = { readLine()!!.split(' ').map(String::toLong) }\nprivate val errPrintln: (String)->Unit = { msg -> System.err.println(msg) }\n\n\ndata class Position(var x: Int, var y: Int)\n\nfun solveA(G: Array): Int {\n val H = G.size\n val W = G[0].length\n val INF = Int.MAX_VALUE / 2\n val step = Array(H) { IntArray(W) }\n val starts = ArrayList()\n for (i in 0 until H) {\n for (j in 0 until W) {\n step[i][j] = INF\n if (G[i][j] == '#') {\n starts.add(Position(i, j))\n }\n }\n }\n val dx = intArrayOf(0, 1, 0, -1)\n val dy = intArrayOf(1, 0, -1, 0)\n val que = ArrayDeque()\n for (i in starts.indices) {\n que.addLast(starts[i])\n step[starts[i].x][starts[i].y] = 0\n }\n var res = 0\n while (!que.isEmpty()) {\n val pos = que.removeFirst()\n val x = pos.x\n val y = pos.y\n for (i in dx.indices) {\n val nx = x + dx[i]\n val ny = y + dy[i]\n if (nx < 0 || H <= nx || ny < 0 || W <= ny) {\n continue\n }\n if (step[nx][ny] > step[x][y] + 1) {\n step[nx][ny] = step[x][y] + 1\n que.addLast(Position(nx, ny))\n res = max(res, step[nx][ny])\n }\n }\n }\n return res\n}\n\n\nfun main(args: Array) {\n val (H, W) = readListInt()\n val A = Array(H){\"\"}\n for (i in 0 until H) {\n A[i] = readString()\n }\n\n val ans = solveA(A)\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1589900220, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s318129890.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s318129890", "user_id": "u404244809"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\n\nprivate val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = { readLine()!!.toInt() }\nprivate val readLong: ()->Long = { readLine()!!.toLong() }\nprivate val readListInt: ()->List = { readLine()!!.split(' ').map(String::toInt) }\nprivate val readListLong: ()->List = { readLine()!!.split(' ').map(String::toLong) }\nprivate val errPrintln: (String)->Unit = { msg -> System.err.println(msg) }\n\n\ndata class Position(var x: Int, var y: Int)\n\nfun solveA(G: Array): Int {\n val H = G.size\n val W = G[0].length\n val INF = Int.MAX_VALUE / 2\n val step = Array(H) { IntArray(W) }\n val starts = ArrayList()\n for (i in 0 until H) {\n for (j in 0 until W) {\n step[i][j] = INF\n if (G[i][j] == '#') {\n starts.add(Position(i, j))\n }\n }\n }\n val dx = intArrayOf(0, 1, 0, -1)\n val dy = intArrayOf(1, 0, -1, 0)\n val que = ArrayDeque()\n for (i in starts.indices) {\n que.addLast(starts[i])\n step[starts[i].x][starts[i].y] = 0\n }\n var res = 0\n while (!que.isEmpty()) {\n val pos = que.removeFirst()\n val x = pos.x\n val y = pos.y\n for (i in dx.indices) {\n val nx = x + dx[i]\n val ny = y + dy[i]\n if (nx < 0 || H <= nx || ny < 0 || W <= ny) {\n continue\n }\n if (step[nx][ny] > step[x][y] + 1) {\n step[nx][ny] = step[x][y] + 1\n que.addLast(Position(nx, ny))\n res = max(res, step[nx][ny])\n }\n }\n }\n return res\n}\n\n\nfun main(args: Array) {\n val (H, W) = readListInt()\n val A = Array(H){\"\"}\n for (i in 0 until H) {\n A[i] = readString()\n }\n\n val ans = solveA(A)\n\n println(ans)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1893, "cpu_time_ms": 706, "memory_kb": 91556}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s225267414", "group_id": "codeNet:p03053", "input_text": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\n\nprivate val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = { readLine()!!.toInt() }\nprivate val readLong: ()->Long = { readLine()!!.toLong() }\nprivate val readListInt: ()->List = { readLine()!!.split(' ').map(String::toInt) }\nprivate val readListLong: ()->List = { readLine()!!.split(' ').map(String::toLong) }\nprivate val errPrintln: (String)->Unit = { msg -> System.err.println(msg) }\n//private val MOD = 1e9.toLong()+7\n//private val INF = Int.MAX_VALUE/2\n//private val LINF = Long.MAX_VALUE/2\n\n\nclass GridBfs(val G: List, val Start:Char = '#',\n val ToPaint:Char = '.') {\n\n var H:Int = 0\n var W:Int = 0\n private val starts = ArrayList>()\n init {\n H = G.size\n W = G[0].length\n for (i in 0 until H) {\n for (j in 0 until W) {\n if (G[i][j] == Start) {\n starts.add(Pair(i,j))\n }\n }\n }\n }\n\n private val dx = intArrayOf(0,1,0,-1)\n private val dy = intArrayOf(1,0,-1,-0)\n private val INF = Int.MAX_VALUE/2\n\n fun fill(): Int {\n //val que = LinkedList>()\n val que = ArrayDeque>()\n val step = Array(H){Array(W){INF}}\n\n for (pr in starts) {\n que.addLast(pr)\n step[pr.first][pr.second] = 0\n }\n\n while (que.isNotEmpty()) {\n //val (x, y) = que.removeFirst()\n val (x, y) = que.poll()\n\n\n /*for (i in dx.indices) {\n val nx = x + dx[i]; val ny = y + dy[i]\n if (nx<0 || H<=nx || ny<0 || W<=ny) {\n continue\n }\n\n val st = step[x][y]\n if (step[nx][ny] > st + 1) {\n step[nx][ny] = st + 1\n que.addLast(Pair(nx, ny))\n painted++\n res = max(res, st+1)\n }\n }*/\n\n val st = step[x][y]\n\n var nx = x; var ny = y + 1\n if (ny st + 1) {\n step[nx][ny] = st + 1\n que.add(Pair(nx, ny))\n }\n\n nx = x + 1; ny = y\n if (nx st + 1) {\n step[nx][ny] = st + 1\n que.add(Pair(nx, ny))\n }\n\n nx = x; ny = y - 1\n if (0<=ny && step[nx][ny] > st + 1) {\n step[nx][ny] = st + 1\n que.add(Pair(nx, ny))\n }\n\n nx = x - 1; ny = y\n if (0<=nx && step[nx][ny] > st + 1) {\n step[nx][ny] = st + 1\n que.add(Pair(nx, ny))\n }\n }\n\n var res = 0\n for (i in 0 until H) {\n for (j in 0 until W) {\n res = max(res, step[i][j])\n }\n }\n\n return res\n }\n}\n\n\nfun main(args: Array) {\n val (H, W) = readListInt()\n val A = Array(H){\"\"}\n for (i in 0 until H) {\n A[i] = readString()\n }\n assert(A[0].length == W)\n\n val bfs = GridBfs(A.toList())\n val ans = bfs.fill()\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1589861914, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s225267414.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s225267414", "user_id": "u404244809"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\n\nprivate val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = { readLine()!!.toInt() }\nprivate val readLong: ()->Long = { readLine()!!.toLong() }\nprivate val readListInt: ()->List = { readLine()!!.split(' ').map(String::toInt) }\nprivate val readListLong: ()->List = { readLine()!!.split(' ').map(String::toLong) }\nprivate val errPrintln: (String)->Unit = { msg -> System.err.println(msg) }\n//private val MOD = 1e9.toLong()+7\n//private val INF = Int.MAX_VALUE/2\n//private val LINF = Long.MAX_VALUE/2\n\n\nclass GridBfs(val G: List, val Start:Char = '#',\n val ToPaint:Char = '.') {\n\n var H:Int = 0\n var W:Int = 0\n private val starts = ArrayList>()\n init {\n H = G.size\n W = G[0].length\n for (i in 0 until H) {\n for (j in 0 until W) {\n if (G[i][j] == Start) {\n starts.add(Pair(i,j))\n }\n }\n }\n }\n\n private val dx = intArrayOf(0,1,0,-1)\n private val dy = intArrayOf(1,0,-1,-0)\n private val INF = Int.MAX_VALUE/2\n\n fun fill(): Int {\n //val que = LinkedList>()\n val que = ArrayDeque>()\n val step = Array(H){Array(W){INF}}\n\n for (pr in starts) {\n que.addLast(pr)\n step[pr.first][pr.second] = 0\n }\n\n while (que.isNotEmpty()) {\n //val (x, y) = que.removeFirst()\n val (x, y) = que.poll()\n\n\n /*for (i in dx.indices) {\n val nx = x + dx[i]; val ny = y + dy[i]\n if (nx<0 || H<=nx || ny<0 || W<=ny) {\n continue\n }\n\n val st = step[x][y]\n if (step[nx][ny] > st + 1) {\n step[nx][ny] = st + 1\n que.addLast(Pair(nx, ny))\n painted++\n res = max(res, st+1)\n }\n }*/\n\n val st = step[x][y]\n\n var nx = x; var ny = y + 1\n if (ny st + 1) {\n step[nx][ny] = st + 1\n que.add(Pair(nx, ny))\n }\n\n nx = x + 1; ny = y\n if (nx st + 1) {\n step[nx][ny] = st + 1\n que.add(Pair(nx, ny))\n }\n\n nx = x; ny = y - 1\n if (0<=ny && step[nx][ny] > st + 1) {\n step[nx][ny] = st + 1\n que.add(Pair(nx, ny))\n }\n\n nx = x - 1; ny = y\n if (0<=nx && step[nx][ny] > st + 1) {\n step[nx][ny] = st + 1\n que.add(Pair(nx, ny))\n }\n }\n\n var res = 0\n for (i in 0 until H) {\n for (j in 0 until W) {\n res = max(res, step[i][j])\n }\n }\n\n return res\n }\n}\n\n\nfun main(args: Array) {\n val (H, W) = readListInt()\n val A = Array(H){\"\"}\n for (i in 0 until H) {\n A[i] = readString()\n }\n assert(A[0].length == W)\n\n val bfs = GridBfs(A.toList())\n val ans = bfs.fill()\n\n println(ans)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3210, "cpu_time_ms": 1063, "memory_kb": 147684}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s057241030", "group_id": "codeNet:p03053", "input_text": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\n\nprivate val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = { readLine()!!.toInt() }\nprivate val readLong: ()->Long = { readLine()!!.toLong() }\nprivate val readListInt: ()->List = { readLine()!!.split(' ').map(String::toInt) }\nprivate val readListLong: ()->List = { readLine()!!.split(' ').map(String::toLong) }\nprivate val errPrintln: (String)->Unit = { msg -> System.err.println(msg) }\n//private val MOD = 1e9.toLong()+7\n//private val INF = Int.MAX_VALUE/2\n//private val LINF = Long.MAX_VALUE/2\n\n\nclass GridBfs(val G: List, val Start:Char = '#',\n val ToPaint:Char = '.') {\n\n var H:Int = 0\n var W:Int = 0\n private val starts = ArrayList>()\n var painted:Int = 0\n init {\n H = G.size\n W = G[0].length\n for (i in 0 until H) {\n for (j in 0 until W) {\n if (G[i][j] == Start) {\n starts.add(Pair(i,j))\n painted++\n }\n }\n }\n }\n\n private val dx = intArrayOf(0,1,0,-1)\n private val dy = intArrayOf(1,0,-1,-0)\n private val INF = Int.MAX_VALUE/2\n\n fun fill(): Int {\n val que = LinkedList>()\n val step = Array(H){Array(W){INF}}\n for (pr in starts) {\n que.addFirst(pr)\n step[pr.first][pr.second] = 0\n }\n\n while (que.isNotEmpty()) {\n val (x, y) = que.removeLast()\n\n if (painted == H*W) break\n\n for (i in dx.indices) {\n val nx = x + dx[i]; val ny = y + dy[i]\n if (nx<0 || H<=nx || ny<0 || W<=ny) {\n continue\n }\n\n if (step[nx][ny] > step[x][y] + 1) {\n step[nx][ny] = step[x][y] + 1\n que.addFirst(Pair(nx, ny))\n painted++\n }\n }\n }\n\n var res = 0\n for (i in 0 until H) {\n for (j in 0 until W) {\n res = max(res, step[i][j])\n }\n }\n\n return res\n }\n}\n\n//fun solveA(A: Array): Int {\n//}\n\nfun main(args: Array) {\n val (H, W) = readListInt()\n val A = Array(H){\"\"}\n for (i in 0 until H) {\n A[i] = readString()\n }\n assert(A[0].length == W)\n\n val bfs = GridBfs(A.toList())\n val ans = bfs.fill()\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1589858539, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s057241030.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s057241030", "user_id": "u404244809"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\n\nprivate val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = { readLine()!!.toInt() }\nprivate val readLong: ()->Long = { readLine()!!.toLong() }\nprivate val readListInt: ()->List = { readLine()!!.split(' ').map(String::toInt) }\nprivate val readListLong: ()->List = { readLine()!!.split(' ').map(String::toLong) }\nprivate val errPrintln: (String)->Unit = { msg -> System.err.println(msg) }\n//private val MOD = 1e9.toLong()+7\n//private val INF = Int.MAX_VALUE/2\n//private val LINF = Long.MAX_VALUE/2\n\n\nclass GridBfs(val G: List, val Start:Char = '#',\n val ToPaint:Char = '.') {\n\n var H:Int = 0\n var W:Int = 0\n private val starts = ArrayList>()\n var painted:Int = 0\n init {\n H = G.size\n W = G[0].length\n for (i in 0 until H) {\n for (j in 0 until W) {\n if (G[i][j] == Start) {\n starts.add(Pair(i,j))\n painted++\n }\n }\n }\n }\n\n private val dx = intArrayOf(0,1,0,-1)\n private val dy = intArrayOf(1,0,-1,-0)\n private val INF = Int.MAX_VALUE/2\n\n fun fill(): Int {\n val que = LinkedList>()\n val step = Array(H){Array(W){INF}}\n for (pr in starts) {\n que.addFirst(pr)\n step[pr.first][pr.second] = 0\n }\n\n while (que.isNotEmpty()) {\n val (x, y) = que.removeLast()\n\n if (painted == H*W) break\n\n for (i in dx.indices) {\n val nx = x + dx[i]; val ny = y + dy[i]\n if (nx<0 || H<=nx || ny<0 || W<=ny) {\n continue\n }\n\n if (step[nx][ny] > step[x][y] + 1) {\n step[nx][ny] = step[x][y] + 1\n que.addFirst(Pair(nx, ny))\n painted++\n }\n }\n }\n\n var res = 0\n for (i in 0 until H) {\n for (j in 0 until W) {\n res = max(res, step[i][j])\n }\n }\n\n return res\n }\n}\n\n//fun solveA(A: Array): Int {\n//}\n\nfun main(args: Array) {\n val (H, W) = readListInt()\n val A = Array(H){\"\"}\n for (i in 0 until H) {\n A[i] = readString()\n }\n assert(A[0].length == W)\n\n val bfs = GridBfs(A.toList())\n val ans = bfs.fill()\n\n println(ans)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2465, "cpu_time_ms": 1071, "memory_kb": 149152}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s017680021", "group_id": "codeNet:p03053", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val (H, W) = readIntList()\n val map = Array(H) { readString() }\n\n val dist = BFS(map.mapSearch('#').map { it.roundList() }.flatten(), map, {false})\n println(dist.dist)\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\nfun powInt(a: Int, b: Int) = Math.pow(a.toDouble(), b.toDouble()).toInt()\n\n\ndata class WH(val W:Int, val H:Int)\n\nval DIR_4 = listOf(\n -1 to 0,\n 1 to 0,\n 0 to -1,\n 0 to 1\n)\n\nfun Pair.roundList(dir: List> = DIR_4) = dir.map { it.first+first to it.second+second }\n\nfun Array.mapSearch(ch: Char): List> {\n val res = mutableListOf>()\n for ((h, line) in this.withIndex())\n for ((w, c) in line.withIndex())\n if (ch == c) res.add(h to w)\n return res\n}\n\ndata class BFSResult(val dist:Int, val hitEnd:Boolean)\n\n\nfun BFS(\n startList: List>,\n map: Array,\n isEnd: (Pair) -> Boolean,\n wall:Char = '#',\n dir:List> = DIR_4\n):BFSResult {\n val set = mutableSetOf>()\n val que = ArrayDeque>()\n que.addAll(startList)\n var res = -1\n\n while (que.isNotEmpty()) {\n res++\n val tmpQue = ArrayDeque>()\n while (que.isNotEmpty()) {\n val hw = que.pop()\n val (h, w) = hw\n if (h !in map.indices || w !in map[0].indices) continue\n if (map[h][w] == wall) continue\n if (hw in set) continue\n if (isEnd(hw)) return BFSResult(res, true)\n\n set.add(hw)\n tmpQue.addAll(dir.map { it.first + h to it.second + w })\n }\n que.addAll(tmpQue)\n }\n\n return BFSResult(res,false)\n}\n", "language": "Kotlin", "metadata": {"date": 1585177225, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s017680021.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s017680021", "user_id": "u043557308"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val (H, W) = readIntList()\n val map = Array(H) { readString() }\n\n val dist = BFS(map.mapSearch('#').map { it.roundList() }.flatten(), map, {false})\n println(dist.dist)\n}\n\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\nfun powInt(a: Int, b: Int) = Math.pow(a.toDouble(), b.toDouble()).toInt()\n\n\ndata class WH(val W:Int, val H:Int)\n\nval DIR_4 = listOf(\n -1 to 0,\n 1 to 0,\n 0 to -1,\n 0 to 1\n)\n\nfun Pair.roundList(dir: List> = DIR_4) = dir.map { it.first+first to it.second+second }\n\nfun Array.mapSearch(ch: Char): List> {\n val res = mutableListOf>()\n for ((h, line) in this.withIndex())\n for ((w, c) in line.withIndex())\n if (ch == c) res.add(h to w)\n return res\n}\n\ndata class BFSResult(val dist:Int, val hitEnd:Boolean)\n\n\nfun BFS(\n startList: List>,\n map: Array,\n isEnd: (Pair) -> Boolean,\n wall:Char = '#',\n dir:List> = DIR_4\n):BFSResult {\n val set = mutableSetOf>()\n val que = ArrayDeque>()\n que.addAll(startList)\n var res = -1\n\n while (que.isNotEmpty()) {\n res++\n val tmpQue = ArrayDeque>()\n while (que.isNotEmpty()) {\n val hw = que.pop()\n val (h, w) = hw\n if (h !in map.indices || w !in map[0].indices) continue\n if (map[h][w] == wall) continue\n if (hw in set) continue\n if (isEnd(hw)) return BFSResult(res, true)\n\n set.add(hw)\n tmpQue.addAll(dir.map { it.first + h to it.second + w })\n }\n que.addAll(tmpQue)\n }\n\n return BFSResult(res,false)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1953, "cpu_time_ms": 1071, "memory_kb": 174780}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s350297185", "group_id": "codeNet:p03053", "input_text": "import java.util.*\n\nfun main(arr:Array) {\n val (h,w) = readLine()!!.split(\" \").map { it.toInt() }\n val map = (1..h).map { readLine()!! }\n val step = (1..h).map { (1..w).map { h*w+1 }.toMutableList() }\n val queue = LinkedList()\n for(i in map.indices) {\n for(j in map[i].indices) {\n if(map[i][j] == '#') {\n queue.push(Pos(i,j))\n step[i][j] = 0\n }\n }\n }\n while (queue.isNotEmpty()) {\n val cur = queue.pop()\n val nextStep = step[cur.r][cur.c] + 1\n for(i in (cur.r-1..cur.r + 1)) {\n if(i < 0) {\n continue\n }\n if(i >= h) {\n break\n }\n for(j in (cur.c-1..cur.c+1)) {\n if(j < 0) {\n continue\n }\n if(j >= w) {\n break\n }\n if(i == cur.r && j == cur.c) {\n continue\n }\n if(i != cur.r && j != cur.c) {\n continue\n }\n if(step[i][j] > nextStep) {\n step[i][j] = nextStep\n queue.push(Pos(i,j))\n }\n }\n }\n }\n val ans = step.map { it.max()?:0 }.max()!!\n println(ans)\n}\n\nclass Pos(val r:Int, val c:Int)\n", "language": "Kotlin", "metadata": {"date": 1582358658, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s350297185.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s350297185", "user_id": "u269969976"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(arr:Array) {\n val (h,w) = readLine()!!.split(\" \").map { it.toInt() }\n val map = (1..h).map { readLine()!! }\n val step = (1..h).map { (1..w).map { h*w+1 }.toMutableList() }\n val queue = LinkedList()\n for(i in map.indices) {\n for(j in map[i].indices) {\n if(map[i][j] == '#') {\n queue.push(Pos(i,j))\n step[i][j] = 0\n }\n }\n }\n while (queue.isNotEmpty()) {\n val cur = queue.pop()\n val nextStep = step[cur.r][cur.c] + 1\n for(i in (cur.r-1..cur.r + 1)) {\n if(i < 0) {\n continue\n }\n if(i >= h) {\n break\n }\n for(j in (cur.c-1..cur.c+1)) {\n if(j < 0) {\n continue\n }\n if(j >= w) {\n break\n }\n if(i == cur.r && j == cur.c) {\n continue\n }\n if(i != cur.r && j != cur.c) {\n continue\n }\n if(step[i][j] > nextStep) {\n step[i][j] = nextStep\n queue.push(Pos(i,j))\n }\n }\n }\n }\n val ans = step.map { it.max()?:0 }.max()!!\n println(ans)\n}\n\nclass Pos(val r:Int, val c:Int)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1376, "cpu_time_ms": 1067, "memory_kb": 127036}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s593682288", "group_id": "codeNet:p03053", "input_text": "import java.util.*\n\nfun main(args: Array) {\n agc033a()\n}\n\nprivate data class Coordinate(val y: Int, val x: Int)\n\nfun agc033a() {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n val isBlack = (1..h).map { readLine()!!.map { it == '#' }.toBooleanArray() }.toTypedArray()\n\n val blackIndices = mutableListOf()\n val distantList = Array(h) { IntArray(w) { 99999 } }\n\n for (y in 0 until h) {\n for (x in 0 until w) {\n if (isBlack[y][x]) {\n blackIndices.add(Coordinate(y, x))\n distantList[y][x] = 0\n }\n }\n }\n\n val queue = ArrayDeque(blackIndices)\n val direction = listOf(-1 to 0, 1 to 0, 0 to -1, 0 to 1)\n var answer = 0\n\n while (queue.isNotEmpty()) {\n val (y, x) = queue.poll()\n\n val dist = distantList[y][x]\n answer = Math.max(answer, dist)\n\n direction.forEach {\n val nextY = y + it.first\n val nextX = x + it.second\n if (nextY in 0 until h && nextX in 0 until w && !isBlack[nextY][nextX]) {\n isBlack[nextY][nextX] = true\n queue.add(Coordinate(nextY, nextX))\n distantList[nextY][nextX] = Math.min(distantList[nextY][nextX], dist + 1)\n }\n }\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1577511236, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s593682288.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s593682288", "user_id": "u139478771"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n agc033a()\n}\n\nprivate data class Coordinate(val y: Int, val x: Int)\n\nfun agc033a() {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n val isBlack = (1..h).map { readLine()!!.map { it == '#' }.toBooleanArray() }.toTypedArray()\n\n val blackIndices = mutableListOf()\n val distantList = Array(h) { IntArray(w) { 99999 } }\n\n for (y in 0 until h) {\n for (x in 0 until w) {\n if (isBlack[y][x]) {\n blackIndices.add(Coordinate(y, x))\n distantList[y][x] = 0\n }\n }\n }\n\n val queue = ArrayDeque(blackIndices)\n val direction = listOf(-1 to 0, 1 to 0, 0 to -1, 0 to 1)\n var answer = 0\n\n while (queue.isNotEmpty()) {\n val (y, x) = queue.poll()\n\n val dist = distantList[y][x]\n answer = Math.max(answer, dist)\n\n direction.forEach {\n val nextY = y + it.first\n val nextX = x + it.second\n if (nextY in 0 until h && nextX in 0 until w && !isBlack[nextY][nextX]) {\n isBlack[nextY][nextX] = true\n queue.add(Coordinate(nextY, nextX))\n distantList[nextY][nextX] = Math.min(distantList[nextY][nextX], dist + 1)\n }\n }\n }\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1314, "cpu_time_ms": 779, "memory_kb": 112188}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s683897369", "group_id": "codeNet:p03053", "input_text": "import java.util.*\n\nfun main(args: Array) {\n agc033a()\n}\n\nprivate data class Coordinate(val y: Int, val x: Int)\n\nfun agc033a() {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n val isBlack = (1..h).map { readLine()!!.map { it == '#' }.toBooleanArray() }.toTypedArray()\n\n val blackIndices = mutableListOf()\n val distantList = Array(h) { IntArray(w) { 99999 } }\n\n for (y in 0 until h) {\n for (x in 0 until w) {\n if (isBlack[y][x]) {\n blackIndices.add(Coordinate(y, x))\n distantList[y][x] = 0\n }\n }\n }\n\n val queue = ArrayDeque(blackIndices)\n val direction = listOf(-1 to 0, 1 to 0, 0 to -1, 0 to 1)\n var answer = 0\n\n while (queue.isNotEmpty()) {\n val (y, x) = queue.poll()\n\n val dist = distantList[y][x]\n answer = Math.max(answer, dist)\n\n direction.forEach {\n val nextY = y + it.first\n val nextX = x + it.second\n if (nextY in 0 until h && nextX in 0 until w && !isBlack[nextY][nextX]) {\n isBlack[y][x] = true\n queue.add(Coordinate(nextY, nextX))\n distantList[nextY][nextX] = Math.min(distantList[nextY][nextX], dist + 1)\n }\n }\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1577511189, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s683897369.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s683897369", "user_id": "u139478771"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n agc033a()\n}\n\nprivate data class Coordinate(val y: Int, val x: Int)\n\nfun agc033a() {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n val isBlack = (1..h).map { readLine()!!.map { it == '#' }.toBooleanArray() }.toTypedArray()\n\n val blackIndices = mutableListOf()\n val distantList = Array(h) { IntArray(w) { 99999 } }\n\n for (y in 0 until h) {\n for (x in 0 until w) {\n if (isBlack[y][x]) {\n blackIndices.add(Coordinate(y, x))\n distantList[y][x] = 0\n }\n }\n }\n\n val queue = ArrayDeque(blackIndices)\n val direction = listOf(-1 to 0, 1 to 0, 0 to -1, 0 to 1)\n var answer = 0\n\n while (queue.isNotEmpty()) {\n val (y, x) = queue.poll()\n\n val dist = distantList[y][x]\n answer = Math.max(answer, dist)\n\n direction.forEach {\n val nextY = y + it.first\n val nextX = x + it.second\n if (nextY in 0 until h && nextX in 0 until w && !isBlack[nextY][nextX]) {\n isBlack[y][x] = true\n queue.add(Coordinate(nextY, nextX))\n distantList[nextY][nextX] = Math.min(distantList[nextY][nextX], dist + 1)\n }\n }\n }\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1306, "cpu_time_ms": 1071, "memory_kb": 196172}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s500110251", "group_id": "codeNet:p03053", "input_text": "import java.util.*\n\nfun main(args: Array) {\n agc033a()\n}\n\nprivate data class Coordinate(val y: Int, val x: Int)\n\nfun agc033a() {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n val isBlack = (1..h).map { readLine()!!.map { it == '#' }.toBooleanArray() }.toTypedArray()\n\n val blackIndices = mutableListOf()\n\n for (y in 0 until h) {\n for (x in 0 until w) {\n if (isBlack[y][x]) blackIndices.add(Coordinate(y, x))\n }\n }\n\n val queue = ArrayDeque(blackIndices)\n val distantList = Array(h) { IntArray(w) { 0 } }\n\n val direction = listOf(-1 to 0, 1 to 0, 0 to -1, 0 to 1)\n\n while (queue.isNotEmpty()) {\n val (y, x) = queue.poll()\n isBlack[y][x] = true\n\n val dist = distantList[y][x]\n\n direction.forEach {\n val nextY = y + it.first\n val nextX = x + it.second\n if (nextY in 0 until h && nextX in 0 until w && !isBlack[nextY][nextX]) {\n queue.add(Coordinate(nextY, nextX))\n distantList[nextY][nextX] = dist + 1\n }\n }\n }\n\n val answer = distantList.map { it.max()!! }.max()!!\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1577509769, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s500110251.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s500110251", "user_id": "u139478771"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n agc033a()\n}\n\nprivate data class Coordinate(val y: Int, val x: Int)\n\nfun agc033a() {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n val isBlack = (1..h).map { readLine()!!.map { it == '#' }.toBooleanArray() }.toTypedArray()\n\n val blackIndices = mutableListOf()\n\n for (y in 0 until h) {\n for (x in 0 until w) {\n if (isBlack[y][x]) blackIndices.add(Coordinate(y, x))\n }\n }\n\n val queue = ArrayDeque(blackIndices)\n val distantList = Array(h) { IntArray(w) { 0 } }\n\n val direction = listOf(-1 to 0, 1 to 0, 0 to -1, 0 to 1)\n\n while (queue.isNotEmpty()) {\n val (y, x) = queue.poll()\n isBlack[y][x] = true\n\n val dist = distantList[y][x]\n\n direction.forEach {\n val nextY = y + it.first\n val nextX = x + it.second\n if (nextY in 0 until h && nextX in 0 until w && !isBlack[nextY][nextX]) {\n queue.add(Coordinate(nextY, nextX))\n distantList[nextY][nextX] = dist + 1\n }\n }\n }\n\n val answer = distantList.map { it.max()!! }.max()!!\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1186, "cpu_time_ms": 1067, "memory_kb": 195080}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s017642210", "group_id": "codeNet:p03053", "input_text": "import java.util.*\n\nfun main(args: Array) {\n agc033a()\n}\n\nprivate data class Coordinate(val y: Int, val x: Int)\n\nfun agc033a() {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n val isBlack = (1..h).map { readLine()!!.map { it == '#' }.toBooleanArray() }.toTypedArray()\n\n val blackIndex = mutableListOf()\n \n for (y in 0 until h){\n for (x in 0 until w){\n if (isBlack[y][x]) blackIndex.add(Coordinate(y,x))\n }\n }\n\n val queue = ArrayDeque(listOf(blackIndex))\n val visited = Array(h) { BooleanArray(w) }\n var answer = 0\n\n while (queue.isNotEmpty()) {\n val poll = queue.poll()\n if (poll.isEmpty()) continue\n\n val list = mutableListOf()\n\n poll.forEach {\n val (y, x) = it\n visited[y][x] = true\n\n if ((y + 1 in 0 until h && x in 0 until w) && !visited[y + 1][x]) {\n list.add(Coordinate(y + 1, x))\n }\n if ((y - 1 in 0 until h && x in 0 until w) && !visited[y - 1][x]) {\n list.add(Coordinate(y - 1, x))\n }\n if ((y in 0 until h && x + 1 in 0 until w) && !visited[y][x + 1]) {\n list.add(Coordinate(y, x + 1))\n }\n if ((y in 0 until h && x - 1 in 0 until w) && !visited[y][x - 1]) {\n list.add(Coordinate(y, x - 1))\n }\n }\n\n if (list.isEmpty()) continue\n\n queue.add(list)\n\n answer++\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1577506746, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s017642210.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s017642210", "user_id": "u139478771"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n agc033a()\n}\n\nprivate data class Coordinate(val y: Int, val x: Int)\n\nfun agc033a() {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n val isBlack = (1..h).map { readLine()!!.map { it == '#' }.toBooleanArray() }.toTypedArray()\n\n val blackIndex = mutableListOf()\n \n for (y in 0 until h){\n for (x in 0 until w){\n if (isBlack[y][x]) blackIndex.add(Coordinate(y,x))\n }\n }\n\n val queue = ArrayDeque(listOf(blackIndex))\n val visited = Array(h) { BooleanArray(w) }\n var answer = 0\n\n while (queue.isNotEmpty()) {\n val poll = queue.poll()\n if (poll.isEmpty()) continue\n\n val list = mutableListOf()\n\n poll.forEach {\n val (y, x) = it\n visited[y][x] = true\n\n if ((y + 1 in 0 until h && x in 0 until w) && !visited[y + 1][x]) {\n list.add(Coordinate(y + 1, x))\n }\n if ((y - 1 in 0 until h && x in 0 until w) && !visited[y - 1][x]) {\n list.add(Coordinate(y - 1, x))\n }\n if ((y in 0 until h && x + 1 in 0 until w) && !visited[y][x + 1]) {\n list.add(Coordinate(y, x + 1))\n }\n if ((y in 0 until h && x - 1 in 0 until w) && !visited[y][x - 1]) {\n list.add(Coordinate(y, x - 1))\n }\n }\n\n if (list.isEmpty()) continue\n\n queue.add(list)\n\n answer++\n }\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1521, "cpu_time_ms": 1071, "memory_kb": 186316}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s713013415", "group_id": "codeNet:p03053", "input_text": "import java.util.*\n\nfun main(args: Array) {\n agc033a()\n}\n\nprivate data class Coordinate(val y: Int, val x: Int)\n\nfun agc033a() {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n val isBlack = (1..h).map { readLine()!!.map { it == '#' }.toBooleanArray() }.toTypedArray()\n\n val blackIndex = isBlack.mapIndexed { indexY, booleans ->\n booleans.withIndex().filter { it.value }.map { Coordinate(indexY, it.index) }\n }.flatten()\n\n val queue = ArrayDeque(listOf(blackIndex))\n val visited = Array(h) { BooleanArray(w) }\n var answer = 0\n\n while (queue.isNotEmpty()) {\n val poll = queue.poll()\n if (poll.isEmpty()) continue\n\n val list = mutableListOf()\n\n poll.forEach {\n val (y, x) = it\n visited[y][x] = true\n\n if ((y + 1 in 0 until h && x in 0 until w) && !visited[y + 1][x]) {\n list.add(Coordinate(y + 1, x))\n }\n if ((y - 1 in 0 until h && x in 0 until w) && !visited[y - 1][x]) {\n list.add(Coordinate(y - 1, x))\n }\n if ((y in 0 until h && x + 1 in 0 until w) && !visited[y][x + 1]) {\n list.add(Coordinate(y, x + 1))\n }\n if ((y in 0 until h && x - 1 in 0 until w) && !visited[y][x - 1]) {\n list.add(Coordinate(y, x - 1))\n }\n }\n\n if (list.isEmpty()) continue\n\n queue.add(list)\n\n answer++\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1577506464, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s713013415.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s713013415", "user_id": "u139478771"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n agc033a()\n}\n\nprivate data class Coordinate(val y: Int, val x: Int)\n\nfun agc033a() {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n val isBlack = (1..h).map { readLine()!!.map { it == '#' }.toBooleanArray() }.toTypedArray()\n\n val blackIndex = isBlack.mapIndexed { indexY, booleans ->\n booleans.withIndex().filter { it.value }.map { Coordinate(indexY, it.index) }\n }.flatten()\n\n val queue = ArrayDeque(listOf(blackIndex))\n val visited = Array(h) { BooleanArray(w) }\n var answer = 0\n\n while (queue.isNotEmpty()) {\n val poll = queue.poll()\n if (poll.isEmpty()) continue\n\n val list = mutableListOf()\n\n poll.forEach {\n val (y, x) = it\n visited[y][x] = true\n\n if ((y + 1 in 0 until h && x in 0 until w) && !visited[y + 1][x]) {\n list.add(Coordinate(y + 1, x))\n }\n if ((y - 1 in 0 until h && x in 0 until w) && !visited[y - 1][x]) {\n list.add(Coordinate(y - 1, x))\n }\n if ((y in 0 until h && x + 1 in 0 until w) && !visited[y][x + 1]) {\n list.add(Coordinate(y, x + 1))\n }\n if ((y in 0 until h && x - 1 in 0 until w) && !visited[y][x - 1]) {\n list.add(Coordinate(y, x - 1))\n }\n }\n\n if (list.isEmpty()) continue\n\n queue.add(list)\n\n answer++\n }\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1496, "cpu_time_ms": 1071, "memory_kb": 195312}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s974059793", "group_id": "codeNet:p03053", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val (MAX_Y, MAX_X) = readLine()!!.split(\" \").map(String::toInt)\n val array = Array(MAX_Y) {\n readLine()!!.toCharArray()\n }\n\n val INF = Integer.MAX_VALUE\n\n val dx = intArrayOf(1, 0, -1, 0)\n val dy = intArrayOf(0, 1, 0, -1)\n\n\n var max = 0\n fun bfs(): Int {\n val queue: Queue> = ArrayDeque()\n\n val d = Array(MAX_Y) {\n IntArray(MAX_X) { INF }\n }\n\n for (x in 0 until MAX_Y) {\n for (y in 0 until MAX_X) {\n if (array[y][x] == '#') {\n queue.add(x to y)\n d[y][x] = 0\n }\n }\n }\n\n while (queue.isNotEmpty()) {\n val (x, y) = queue.poll()\n\n for (i in 0..3) {\n val nx = x + dx[i]\n val ny = y + dy[i]\n\n if (nx in 0 until MAX_X && ny in 0 until MAX_Y && d[ny][nx] == INF) {\n queue.add(nx to ny)\n d[ny][nx] = d[y][x] + 1\n// array[ny][nx] = '#'\n max = Math.max(max, d[ny][nx])\n }\n }\n\n// println(\"------------------\")\n// array.joinToString(System.lineSeparator()) { it.joinToString(\"\") }.let(::println)\n// println(\"------------------\")\n\n }\n return max\n }\n\n println(bfs())\n}\n\n", "language": "Kotlin", "metadata": {"date": 1576556875, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s974059793.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s974059793", "user_id": "u085288971"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val (MAX_Y, MAX_X) = readLine()!!.split(\" \").map(String::toInt)\n val array = Array(MAX_Y) {\n readLine()!!.toCharArray()\n }\n\n val INF = Integer.MAX_VALUE\n\n val dx = intArrayOf(1, 0, -1, 0)\n val dy = intArrayOf(0, 1, 0, -1)\n\n\n var max = 0\n fun bfs(): Int {\n val queue: Queue> = ArrayDeque()\n\n val d = Array(MAX_Y) {\n IntArray(MAX_X) { INF }\n }\n\n for (x in 0 until MAX_Y) {\n for (y in 0 until MAX_X) {\n if (array[y][x] == '#') {\n queue.add(x to y)\n d[y][x] = 0\n }\n }\n }\n\n while (queue.isNotEmpty()) {\n val (x, y) = queue.poll()\n\n for (i in 0..3) {\n val nx = x + dx[i]\n val ny = y + dy[i]\n\n if (nx in 0 until MAX_X && ny in 0 until MAX_Y && d[ny][nx] == INF) {\n queue.add(nx to ny)\n d[ny][nx] = d[y][x] + 1\n// array[ny][nx] = '#'\n max = Math.max(max, d[ny][nx])\n }\n }\n\n// println(\"------------------\")\n// array.joinToString(System.lineSeparator()) { it.joinToString(\"\") }.let(::println)\n// println(\"------------------\")\n\n }\n return max\n }\n\n println(bfs())\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1419, "cpu_time_ms": 1058, "memory_kb": 139180}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s279067046", "group_id": "codeNet:p03053", "input_text": "class Point(val x: Int, val y: Int)\n\nfun main(args: Array) {\n val (h, w) = readLine()!!.split(\" \").map { Integer.parseInt(it) }\n val count: MutableList> = mutableListOf()\n repeat(h) {\n count.add(readLine()!!.toList().map { if (it == '#') 0 else -1 } as MutableList)\n }\n val queue: MutableList = mutableListOf()\n\n for (i in 0..h-1) {\n for (j in 0..w-1) {\n if (count[i][j] == 0) {\n queue.add(Point(i, j))\n }\n }\n }\n\n while (queue.size != 0) {\n val src = queue.removeAt(0)\n val dst = mutableListOf(\n Point(src.x - 1, src.y),\n Point(src.x + 1, src.y),\n Point(src.x, src.y - 1),\n Point(src.x, src.y + 1)\n ).filter {\n (0..h-1).contains(it.x) && (0..w-1).contains(it.y) && count[it.x][it.y] < 0\n }\n dst.forEach {\n count[it.x][it.y] = count[src.x][src.y] + 1\n }\n queue.addAll(dst)\n }\n println(count.flatten().max())\n}", "language": "Kotlin", "metadata": {"date": 1562976614, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s279067046.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s279067046", "user_id": "u655122274"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "class Point(val x: Int, val y: Int)\n\nfun main(args: Array) {\n val (h, w) = readLine()!!.split(\" \").map { Integer.parseInt(it) }\n val count: MutableList> = mutableListOf()\n repeat(h) {\n count.add(readLine()!!.toList().map { if (it == '#') 0 else -1 } as MutableList)\n }\n val queue: MutableList = mutableListOf()\n\n for (i in 0..h-1) {\n for (j in 0..w-1) {\n if (count[i][j] == 0) {\n queue.add(Point(i, j))\n }\n }\n }\n\n while (queue.size != 0) {\n val src = queue.removeAt(0)\n val dst = mutableListOf(\n Point(src.x - 1, src.y),\n Point(src.x + 1, src.y),\n Point(src.x, src.y - 1),\n Point(src.x, src.y + 1)\n ).filter {\n (0..h-1).contains(it.x) && (0..w-1).contains(it.y) && count[it.x][it.y] < 0\n }\n dst.forEach {\n count[it.x][it.y] = count[src.x][src.y] + 1\n }\n queue.addAll(dst)\n }\n println(count.flatten().max())\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1048, "cpu_time_ms": 1071, "memory_kb": 134292}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s592846254", "group_id": "codeNet:p03053", "input_text": "import java.util.*\nfun main(args : Array) {\n val (H, W) = readLine()!!.split(\" \").map { it.toInt() }\n\n val points = mutableListOf()\n (0..(H-1)).forEach { h ->\n readLine()!!.forEachIndexed { w, c ->\n if (c == '#') {\n val doubleH = h.toDouble()\n val doubleW = w.toDouble()\n points.add(KDStub(doubleH, doubleW, doubleArrayOf(doubleH, doubleW), 2))\n } else {\n }\n }\n }\n\n val kdTree = KDTree(points)\n\n // O(HWlog(NW))\n var maxDistance = 0\n (0..(H-1)).forEach {h ->\n (0..(W-1)).forEach { w ->\n val doubleH = h.toDouble()\n val doubleW = w.toDouble()\n val point = KDStub(doubleH, doubleW, doubleArrayOf(doubleH, doubleW), 2)\n val closestPoint = kdTree.getNearestNeighbors(1, point)!![0]\n val distance = (Math.abs(closestPoint.coordinates[0] - h) + Math.abs(closestPoint.coordinates[1] - w)).toInt()\n if (distance > maxDistance) {\n maxDistance = distance\n }\n }\n }\n\n println(maxDistance)\n}\n\nfun abs(num: Int) : Int {\n if (num < 0) {\n return num * -1\n }\n return num\n}\n\n\n\n/**\n * Abstraction used to run algorithms such as nearest neighbor\n * and radial search on a collection of nodes organized into a KDTree.\n *\n * @author emc3\n *\n * @param \n */\nclass KDTree {\n\n var _root: KDNode? = null\n /**\n * This was the old constructor.\n * Used recursiveBuild() instead of recursiveBuildFaster()\n */\n /*\n\tpublic KDTree(Collection collection) {\n\t\tthis(collection.iterator().next().getNumDimensions()); //call default constructor with dimension of first object in list.\n\n\t\t_root = this.recursiveBuild(collection, 0); //build a new KDTree from the collection.\n\t}\n\t*/\n\n\n /**\n * @return the number of dimensions held\n * by the nodes of this tree.\n */\n var numDimensions = 0\n set //number of dimensions\n var _size: Long = 0\n val bounds: MutableList\n\n\n var _neighborList: NeighborList? = null\n\n /**\n * This method is only used for testing.\n * @return the KDimensionable object stored at the root node.\n */\n val rootObject: KDType?\n get() = if (_root != null) _root!!.kdObject else null\n\n /**\n * Default constructor.

\n * Initializes the root node to null, and sets the\n * number of dimensions this KD tree will hold to the\n * specified integer.\n *\n * @param k -\tThe number of dimensions that\n * this KDTree will hold.\n */\n constructor(k: Int) {\n _root = null\n _size = 0\n if (k > 0)\n numDimensions = k\n else\n System.err.println(\"ERROR: KDTree constructor: Dimension must be at least 1\")\n bounds = ArrayList(numDimensions)\n }\n\n /**\n * Alternate constructor.

\n * Calls the default constructor, which initializes the root node to null.\n * Also, the number of dimensions of the FIRST object in the collection\n * will be used to set the KDTree's number of dimension. Therefore this\n * constructor assumes that the dimension is the same for each\n * KDimensionable object in the list.\n *\n * @param collection -\tA collection of KDimensionable objects that will\n * be used to create the tree.\n */\n constructor(collection: Collection) : this(collection.iterator().next().numDimensions) {\n val superList = ArrayList>(numDimensions)\n for (i in 0 until numDimensions) {\n val l = ArrayList(collection)\n val comparator = KDimensionComparator(i) //compare nodes on axis i\n Collections.sort(l, comparator) //sort the list using comparator : ascending by axis i\n val min = l[0].coordinates[i]\n val max = l[l.size - 1].coordinates[i]\n bounds.add(MinMaxPair(min, max))\n superList.add(l)\n }\n _root = this.recursiveBuildFaster(superList, 0) //build a new KDTree from the collection.\n }//call default constructor with dimension of first object in list.\n\n fun getMax(axis: Int): Double {\n return bounds[axis].max\n }\n\n fun getMin(axis: Int): Double {\n return bounds[axis].min\n }\n\n\n /**\n * This method takes a collection of objects that implement\n * KDimensionable and recursively builds a balanced KD Tree\n * from them.\n *\n * If the KDTree's _k field (number of dimensions) has not been set,\n * Or if the depth (for whatever hellish reason) is negative,\n * Or if the list is empty,\n * an error message will print to STDERROR.\n *\n *\n * @param list - The list of KDimensionable objects\n * @param depth - The depth at which to add the nodes\n */\n fun recursiveBuild(collection: Collection, depth: Int): KDNode? {\n val list: List\n if (collection is List<*>)\n list = collection as List //collection is already a List : cast it\n else\n list = ArrayList(collection) //build list from the collection\n val size = list.size\n\n if (numDimensions < 1) {\n System.err.println(\"ERROR: KDTree.recursiveBuild(): Number of Dimensions has not been defined.\")\n return null\n }\n if (depth < 0) {\n System.err.println(\"ERROR: KDTree.recursiveBuild(): Cannot build tree from a negative depth!\")\n return null\n }\n if (size == 0) {\n System.err.println(\"ERROR: KDTree.recursiveBuild(): Cannot build tree from an empty list.\")\n return null\n }\n\n val axis = depth % numDimensions //the 'axis' is the dimension that the nodes should be compared by.\n //it is determined by the current depth\n\n val comparator = KDimensionComparator(axis) //new comparator for each depth's axis\n Collections.sort(list, comparator) //sort the list : ascending by axis\n\n //split list by median\n val median: KDType\n val mid = size / 2 //floor of size/2\n median = list[mid] //get median object\n\n //create node, split list around median and recur\n //if there is only one node left in the list, it's our median,\n //so we're done with building the tree and we can return the\n //last node which we just created from the median.\n val node = KDNode(median)\n if (depth == 0)\n _root = node\n\n if (size > 2) {\n node.putLeft(this.recursiveBuild(list.subList(0, mid), depth + 1)!!) //Recur on sublist of everything before midpoint\n node.putRight(this.recursiveBuild(list.subList(mid + 1, size), depth + 1)!!) //recur on sublist of everything after midpoint\n } else if (size == 2) { //mid must be 1\n if (list[0].compareAxis(list[1], axis) >= 0)\n node.putRight(this.recursiveBuild(list.subList(0, 1), depth + 1)!!) //the node before mid\n else\n node.putLeft(this.recursiveBuild(list.subList(0, 1), depth + 1)!!) //node before mid\n }\n _size++\n return node\n }\n\n\n /**\n * This method takes a collection of objects that implement\n * KDimensionable and recursively builds a balanced KD Tree\n * from them.\n *\n * If the KDTree's _k field (number of dimensions) has not been set,\n * Or if the depth (for whatever hellish reason) is negative,\n * Or if the list is empty,\n * an error message will print to STDERROR.\n *\n *\n * @param list - The list of KDimensionable objects\n * @param depth - The depth at which to add the nodes\n */\n fun recursiveBuildFaster(superList: ArrayList>, depth: Int): KDNode? {\n val size = superList[0].size\n\n if (numDimensions < 1) {\n System.err.println(\"ERROR: KDTree.recursiveBuildFaster(): Number of Dimensions has not been defined.\")\n return null\n }\n if (depth < 0) {\n System.err.println(\"ERROR: KDTree.recursiveBuildFaster(): Cannot build tree from a negative depth!\")\n return null\n }\n if (size == 0) {\n System.err.println(\"ERROR: KDTree.recursiveBuildfaster(): Cannot build tree from an empty list.\")\n return null\n }\n\n val axis = depth % numDimensions //the 'axis' is the dimension that the nodes should be compared by.\n //it is determined by the current depth\n\n //split list by median\n val median: KDType\n val mid = size / 2 //floor of size/2\n median = superList[axis][mid] //get median object from desired axis-sorted list in superList\n\n //create node, split list around median and recur\n //if there is only one node left in the list, it's our median,\n //so we're done with building the tree and we can return the\n //last node which we just created from the median.\n val node = KDNode(median)\n if (depth == 0) _root = node //set node to root if it's the first one\n\n //create new sets of branches, split around the median object.\n var branches: Branches? = Branches(superList, mid, axis)\n val less = branches!!.less //all object less than or equal to (on current axis)\n val more = branches.more //all objects greater than (on current axis)\n\n if (!less[0].isEmpty())\n node.putLeft(this.recursiveBuildFaster(less, depth + 1)!!)\n if (!more[0].isEmpty())\n node.putRight(this.recursiveBuildFaster(more, depth + 1)!!)\n //XXX to save memory.\n branches = null\n\n _size++\n return node\n }\n\n /**\n * Searches this tree for at most n nearest neighbors\n * to the given point, and returns a list of nearest-neighbor\n * KDimensionable objects in a list,\n * sorted nearest to farthest\n *\n * @param n - the number of neighbors to return in the list\n * @param testPoint - the test point from which neighbors are compared/found\n * @return a list of (at most) n KDimensional objects, in ascending order\n * by distance to the test point.\n */\n fun getNearestNeighbors(n: Int, testPoint: KDimensionable): List? {\n if (_root == null) {\n System.err.println(\"ERROR: KDTree.getNearestNeighbors(): Tree has not been constructed.\")\n return null\n }\n if (n < 0) {\n System.err.println(\"ERROR: KDTree.getNearestNeighbors(): Cannot search negative number of neighbors.\")\n return null\n } else if (n == 0) {\n return ArrayList(0)\n }\n\n _neighborList = NeighborList(n, testPoint)\n this.recursiveNeighborSearch(_root, 0)\n\n val l = _neighborList!!.asList() //sorts the list for you\n _neighborList!!.clear() //dont need it anymore; clear it out to be safe.\n return l //returns a sorted list\n }\n\n /**\n * Recursive nearest neighbor search.

\n * Searches for nearest neighbors according to the supplied neighbor list,\n * inserting objects it finds along the way. The NeighborList class\n * takes care of deciding whether or not the object should actually be added\n * to the neighbor list.\n *\n * @param currNode - a node holding a candidate for nearest neighbor,\n * whose subtrees this algorithm will search.\n * @param depth - the current depth of this search in the tree. root = depth 0.\n * @param neighbors - the list of neighbors to pass around, stores the test point.\n * @return\n * A list of nearest neighbors, sorted in ascending order by distance to\n * the test point and bound to a specific quantity.\n */\n fun recursiveNeighborSearch(currNode: KDNode?, depth: Int) {\n if (currNode == null) return\n val p = _neighborList!!.testPoint\n val curr = currNode.kdObject\n if (!curr.equals(p)) {\n _neighborList!!.insert(curr) //curr will not be inserted if List is at max and curr is worse than the worst\n }\n\n //recursively search the subtree which contains the test point.\n var wentLeft = false\n val axis = depth % numDimensions\n if (p.compareAxis(curr, axis) <= 0) {\n this.recursiveNeighborSearch(currNode.left, depth + 1)\n wentLeft = true\n } else {\n this.recursiveNeighborSearch(currNode.right, depth + 1)\n }\n\n //search other subtree if not enough neighbors or distance to test point on axis is less than worst\n //distance of neighborList (axes could be equal)\n val axisDiff = Math.abs(curr.coordinates[axis] - p.coordinates[axis])\n val worstDist = _neighborList!!.worstDist\n if (!_neighborList!!.isFull || axisDiff < worstDist) {\n //search the subtree we haven't yet searched using the (wentLeft flag)\n if (wentLeft)\n this.recursiveNeighborSearch(currNode.right, depth + 1)\n else\n this.recursiveNeighborSearch(currNode.left, depth + 1)\n }\n }\n\n\n /**\n * Returns all KDimensionable objects in this tree in a sorted list.\n * The list is sorted in ascending order by distance from the testPoint.\n *\n * @param radiusSquared - the length of the radius to search.\n * @param testPoint - the point from which to define the radius.\n * @return\n * a list of KDimensionable objects in ascending order by distance to the testpoint.\n */\n fun getObjectsWithinRadius(radiusSquared: Double, testPoint: KDimensionable): List? {\n if (_root == null) {\n System.err.println(\"ERROR: KDTree.getObjectsWithinRadius(): Tree has not been constructed.\")\n return null\n }\n if (radiusSquared <= 0) {\n System.err.println(\"ERROR: KDTree.getObjectsWithinRadius(): Cannot search a non-positive radius.\")\n return null\n }\n\n val points = ArrayList()\n points.addAll(this.recursiveRadiusSearch(_root, 0, radiusSquared, testPoint))\n Collections.sort(points, DistanceToPointComparator(testPoint)) //sort according to distance to the test point\n return points\n }\n\n /**\n * Recursive radius search.

\n * Searches the tree starting with currNode and descending\n * into the left and/or right subtrees as necessary,\n * maintaining a list of KDimensionables within the radius.\n *\n * @param currNode - the current node that the recursive search is looking at.\n * @param depth - the depth of the current node. root depth = 0.\n * @param radius - the length of the radius to search\n * @param testPoint - the point from which the radius is defined.\n * @return\n * A collection of KDimensionable object that are contained in\n * currNode's subtrees (in no particular order).\n */\n fun recursiveRadiusSearch(currNode: KDNode?, depth: Int, radius: Double, testPoint: KDimensionable): Collection {\n val points = ArrayList()\n if (currNode == null)\n return points\n\n val curr = currNode.kdObject\n val currDist = curr.distanceTo(testPoint)\n if (currDist < radius) {\n //if curr is within radius, add it and search subtrees.\n if (!curr.equals(testPoint)) {\n points.add(curr)\n }\n points.addAll(this.recursiveRadiusSearch(currNode.left, depth + 1, radius, testPoint))\n points.addAll(this.recursiveRadiusSearch(currNode.right, depth + 1, radius, testPoint))\n } else {\n //curr is not within radius.\n val axis = depth % numDimensions\n val axisDiff = Math.abs(curr.coordinates[axis] - testPoint.coordinates[axis])\n if (axisDiff < radius) { //if axis Differential is less than radius, search both subtrees for candidates\n points.addAll(this.recursiveRadiusSearch(currNode.left, depth + 1, radius, testPoint))\n points.addAll(this.recursiveRadiusSearch(currNode.right, depth + 1, radius, testPoint))\n } else {\n //axis Differential is larger than radius. Move towards test point in search.\n if (curr.coordinates[axis] <= testPoint.coordinates[axis]) {\n //axis of curr is less than or equal to test point : go right\n points.addAll(this.recursiveRadiusSearch(currNode.right, depth + 1, radius, testPoint))\n } else {\n //axis of curr is greater than test point, go left.\n points.addAll(this.recursiveRadiusSearch(currNode.left, depth + 1, radius, testPoint))\n }\n }\n }\n\n return points //return candidates.\n }\n\n /**\n * Tests whether or not this tree contains a specific KDType object.\n * This method is only used for testing.\n *\n * @param kd the KDimensional object to find.\n * @return\n * True if the KDimensionable object is in the tree, false otherwise.\n */\n operator fun contains(kd: KDType): Boolean {\n if (_root == null || numDimensions < 1) {\n System.err.println(\"ERROR: KDTree.contains(): Tree is not defined.\")\n return false\n }\n var curr = _root\n var axis: Int\n var depth = 0\n while (curr != null) {\n axis = depth % numDimensions\n val o = curr.kdObject\n val result = kd.compareAxis(o, axis)\n if (result > 0) {\n curr = curr.right\n } else if (result < 0) {\n curr = curr.left\n } else {\n if (kd.equals(o))\n return true\n else\n curr = curr.left\n }\n depth++\n\n }\n return false\n }\n\n\n /**\n * Private method only used for subtree testing.\n * Returns the Node at which the specified KDimensionable object an be found,\n * that is, if the object is found in the tree.\n * @param kd\n * @return\n */\n fun find(kd: KDType): KDNode? {\n if (_root == null || numDimensions < 1) {\n System.err.println(\"ERROR: KDTree.find(): Tree is not defined.\")\n return null\n }\n var curr = _root\n var axis: Int\n val depth = 0\n while (curr != null) {\n axis = depth % numDimensions\n val o = curr.kdObject\n val result = kd.compareAxis(o, axis)\n if (result > 0) {\n curr = curr.right\n } else if (result < 0) {\n curr = curr.left\n } else {\n if (kd.equals(o))\n return curr\n else\n curr = curr.right\n }\n }\n return null //object not found\n\n }\n\n fun size(): Long {\n return _size\n }\n\n\n /**\n * A helper class that splits the 'list of lists'\n * into lists of lesser and greater. Used to build the tree so\n * that the list of nodes only has to be sorted 3 times,\n * (in the beginning- in the constructor).\n *\n * @author emc3 / skortchm\n */\n inner class Branches\n //lesser & greater based on the object at the median index.\n\n internal constructor(superList: ArrayList>, medianIndex: Int, axis: Int) {\n\n val less: ArrayList>\n val more: ArrayList> //each instance of Branches will be split into\n\n init {\n val medianVal = superList[axis][medianIndex] //get median object\n\n //The length of sublist: the number of KDTypes.\n val listSize = superList[0].size\n\n //Initializing less and more superLists.\n less = ArrayList(numDimensions)\n more = ArrayList(numDimensions)\n\n for (i in 0 until numDimensions) {\n //The sublists will be approximately half of the size of the initial, which is ~ the same as the median index.\n val tempLessList = ArrayList(medianIndex)\n //Less list will always have fewer elements, because it also has to handle =\n val tempMoreList = ArrayList(if (medianIndex % 2 == 0) medianIndex else medianIndex + 1)\n\n //We iterate through each sorted list, distributing elements to\n //less and more based on comparison to the splitting pane. make sure to not add the median value to to either list.\n //loop through all elements in list\n for (j in 0 until listSize) {\n val temp = superList[i][j] //get the object in the list\n val cmp = temp.compareAxis(medianVal, axis) //compare object to median object\n\n if (cmp > 0)\n tempMoreList.add(temp)\n else if (cmp < 0)\n tempLessList.add(temp)\n else if (cmp == 0 && !temp.equals(medianVal))\n tempLessList.add(temp) //in case of same axis but not same object, add object to less list.\n }\n less.add(tempLessList)\n more.add(tempMoreList)\n }\n }\n }\n\n\n /**\n * This inner class represents a KDTree node.\n * It can hold anything that implements KDimensionable,\n * which is an Interface supplied with this package.\n * @author emc3\n */\n inner class KDNode\n /**\n * Constructor for a KDNode.

\n * Initializes left & right children to null\n * to signify 'no children'.\n * @param o -\tAn object which implements KDimensionable, to be stored as\n * the value for this node.\n */\n constructor(\n /**\n * Returns the object stored at this node.

\n * The object can be anything that implements KDimensionable.\n *\n * @return The object stored at this node.\n */\n val kdObject: KDType //the object which implements KDimensionable\n ) {\n /**\n * @return the left child of this node if one exists.\n * If no left child exists, this method will return null.\n */\n public var left: KDNode? = null\n /**\n * @return the right child of this node if one exists.\n * If no left child exists, this method will return null.\n */\n public var right: KDNode? = null //the left and right children of this node\n\n\n init {\n left = null\n right = null\n }\n\n\n /**\n * Give this node a left child.\n *\n * @param node -\tthe node to set as this node's left child.\n */\n fun putLeft(node: KDNode) {\n left = node\n }\n\n\n /**\n * Give this node a right child.\n *\n * @param node -\tthe node to set as this node's right child.\n */\n fun putRight(node: KDNode) {\n right = node\n }\n }\n\n inner class MinMaxPair internal constructor(internal var min: Double, internal var max: Double)\n\n\n /**\n * This inner class represents a\n * Bounded-priority queue which holds KDimensionable\n * objects. The objects are sorted by their distance\n * to a fixed test point, supplied on construction of\n * the list (the distance of the object to the test\n * point is its priority in the queue).\n *\n * @author emc3\n */\n inner class NeighborList\n /**\n * Default constructor

\n * Creates a new Nearest-Neighbor, which ranks nodes\n * in ascending order by distance to the test point.\n *\n *\n * The test point is specified by the KDimensionable object.\n * The list is bound to n members.\n *\n * @param n - The number of neighbors that this list holds. The list will never outgrow n.\n * @param point - The test point; neighbors will be compared by their distance to this point.\n */\n constructor( val _n: Int //the number of neighbors to keep in the list.\n ,\n /**\n * @return\n * The test point which is used to sort the list by\n * objects' distances.\n */\n val testPoint: KDimensionable //the fixed point to compare all neighbors to\n ) : Comparator {\n var _neighbors: ArrayList? = null //the list of neighbors\n var _worst: KDType? = null //the object with the worst distance to the test point\n /**\n * @return\n * the 'worst' KDimensionable object in the list.

\n * i.e. the coordinates with the greatest distance to\n * the test point.\n */\n var worstDist: Double = 0.toDouble()\n\n /**\n * returns true if this List is at capacity n\n * @return true if List at capacity, false otherwise\n */\n val isFull: Boolean\n get() = if (_neighbors!!.size == _n) true else false\n\n init {\n _neighbors = ArrayList(_n)\n _worst = null\n worstDist = java.lang.Double.POSITIVE_INFINITY\n }\n\n /**\n * Inserts a KDimensionable object to the nearest neighbor list,\n * and sorts the list by distance to the test point.\n *\n *\n * If this list is at capacity (size = n),\n * the incoming KDimensional object is compared to the 'worst' object in the list,\n * i.e. the item in the list which is farthest from the test point.\n * If the incoming object is better than the worst, the incoming object is\n * added to the list and the list is re-sorted.

\n * If the incoming object is worse than the worst, it is thrown out.\n *\n * @param kd - the incoming object to insert into the list, provided that it\n * is better than current worst item in the list.\n */\n fun insert(kd: KDType) {\n val dist = kd.distanceTo(testPoint)\n if (_neighbors!!.size < _n) { //if the list is not at capacity, add the neighbor.\n if (dist > worstDist) { //if it's the new worst neighbor, grab it\n _worst = kd\n worstDist = dist\n }\n _neighbors!!.add(kd) //add the new nieghbor to the list.\n } else if (dist < worstDist) { //if the list is at capacity, remove worst, add new, determine new worst.\n _neighbors!!.add(kd) //add new neighbor\n Collections.sort(_neighbors!!, this) // sort the list by distance to test point\n _neighbors!!.removeAt(_neighbors!!.size - 1) //never going to remove kd because we already determined its closer than the worst.\n _worst = _neighbors!![_neighbors!!.size - 1] //new worst using new size\n worstDist = _worst!!.distanceTo(testPoint)\n }\n }\n\n\n /**\n * @return\n * The list of nearest neighbors.\n * Size of list is bound by n, the integer\n * which was specified to this list on construction.\n */\n fun asList(): List {\n Collections.sort(_neighbors!!, this)\n return _neighbors as ArrayList\n }\n\n /**\n * @return the number of neighbors currently in the list\n */\n fun size(): Int {\n return _neighbors!!.size\n }\n\n fun clear() {\n _neighbors = null\n _worst = null\n worstDist = java.lang.Double.POSITIVE_INFINITY\n }\n\n /**\n * Compares KDimensionable objects based on their distance to the input point.\n * This will order the list so that objects closer to the input point\n * will come first in the list and objects that are farther away will\n * be at the end of the list.\n *\n * @return -1 if the first object is closer to the input point\n * 0 if the objects are the same distance to the input point\n * 1 if the first object is farther away form the input point.\n */\n override fun compare(o1: KDType, o2: KDType): Int {\n val d1 = o1.distanceTo(testPoint)\n val d2 = o2.distanceTo(testPoint)\n if (d1 < d2) {\n return -1\n } else if (d1 > d2) {\n return 1\n }\n return 0\n }\n\n }\n\n /**\n * This inner class represents a comparator used to sort\n * KDimensionable objects in a list according to a given test point.\n *\n *\n * This class is employed by the radius search, in order to\n * return a list of KDimensionable objects within a radius\n * to a given point, p, where the list is sorted by the objects'\n * distance to that point, in ascending order.\n *\n * @author emc3\n */\n inner class DistanceToPointComparator\n /**\n * Default constructor. Initializes the Test point\n * to use for this comparator.\n *\n * @param p the test point to use for this comparator.\n */\n constructor( val _p: KDimensionable //the test point\n ) : Comparator {\n\n\n /**\n * Compares 2 points based on their distance to the test point, _p,\n * specified in the constructor.\n *\n * @return\n * -1 if the first object is closer to the test point than the second

\n * 0 if the two objects are equal distance from the test point

\n * 1 if the first object is farther from the test point than the second object.\n */\n override fun compare(o1: KDType, o2: KDType): Int {\n val d1 = o1.distanceTo(_p)\n val d2 = o2.distanceTo(_p)\n\n if (d1 < d2)\n return -1\n else if (d1 > d2)\n return 1\n return 0\n }\n\n }\n}\n\ninterface KDimensionable {\n\n\n /**\n * @return an array of the coordinates of a point\n * in a k-dimensional space.

\n * For example, if the point is specified by 3-Dimensions,\n * the array will be of size 3, and ordered as {x, y, z}.\n */\n var coordinates: DoubleArray\n\n\n /**\n * @return\n * the number of dimensions that this\n * KDimensional object represents.

\n * e.g. for 2D, this method should return 2.\n * for 3D, this method should return 3, and so on.\n */\n val numDimensions: Int\n\n\n /**\n * Compares two KDimensionable objects based on a specific axis.\n * This method facilitates the comparing done when building\n * the KDTree.\n * @param kd -\tthe KDimensionable object to compare with\n * @param axis-\tthe axis to compare on\n * @return\n *\n * * \t1 if this object has a larger coordinate compared to the parameter object\n * on the specified axis.\n * * 0 if the coordinates are equal on the specified axis\n * * -1 if this object's coordinate is lesser than the specified object's coordinate\n *\n */\n fun compareAxis(kd: KDimensionable, axis: Int): Int\n\n\n /**\n * Calculates the distance between this object and the parameter object.\n * You should check to make sure the two objects have the same number of\n * dimensions, or normalize the missing dimensions to 0.\n *\n * @param kd - a KDimensional object to measure the distance to\n * @return the distance between this object and the specified KDimensionable object\n */\n fun distanceTo(kd: KDimensionable): Double\n\n}\n\n\n/**\n *\n */\n\n\n/**\n * KDimensionComparator

\n * This class represents the comparator used to sort the list of\n * coordinates that the KDTree uses to build itself. Since the KDTree\n * must be balanced to optimize its runtime, it must always choose\n * the median based on which dimension is used at the given level.\n * This class allows the KDTree to call Collections.sort on the list of\n * incoming KDimensionable objects, as to easily grab the median from\n * the list.\n *\n * @author emc3\n */\nclass KDimensionComparator\n/**\n * Default constructor. Requires that the caller\n * specifies an axis which the KDimensionable objects\n * will be compared by. For example, to compare by\n * x-values, axis would be the number 0.\n *\n * @param axis -\tthe coordinate to compare the KDimensionable\n * objects by.\n */\n(axis: Int) : Comparator {\n\n var _axis: Int = 0 //the dimension to compare\n\n init {\n if (axis >= 0)\n _axis = axis\n else\n System.err.println(\"ERROR: KDimensionComparator: axis for compare must be non-negative.\")\n }\n\n\n /**\n * Compares the two given objects based on the\n * axis specified to this object during construction.\n */\n override fun compare(o1: KDimensionable, o2: KDimensionable): Int {\n return o1.compareAxis(o2, _axis)\n }\n\n}\n\nclass KDStub(x: Double, y: Double, override var coordinates: DoubleArray, override val numDimensions: Int) : KDimensionable {\n init {\n coordinates = DoubleArray(2)\n coordinates[0] = x\n coordinates[1] = y\n }\n\n override fun compareAxis(kd: KDimensionable, axis: Int): Int {\n if (axis > 1 || axis < 0) {\n throw IllegalArgumentException(String.format(\"Axis %d out of range: must be 1 or 0\", axis))\n }\n val mine = coordinates[axis]\n val other = kd.coordinates[axis]\n return java.lang.Double.compare(mine, other)\n }\n\n /**\n * Note this distance is SQUARED\n */\n override fun distanceTo(kd: KDimensionable): Double {\n var dist = 0.0\n if (this.numDimensions != kd.numDimensions) {\n throw IllegalArgumentException(\"Wrong dimensionality of objects\")\n }\n for (i in 0 until numDimensions) {\n dist += Math.pow(coordinates[i] - kd.coordinates[i], 2.0)\n }\n return dist\n }\n\n companion object {\n val serialVersionUID = 1L\n }\n\n}", "language": "Kotlin", "metadata": {"date": 1558239685, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s592846254.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s592846254", "user_id": "u861095163"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\nfun main(args : Array) {\n val (H, W) = readLine()!!.split(\" \").map { it.toInt() }\n\n val points = mutableListOf()\n (0..(H-1)).forEach { h ->\n readLine()!!.forEachIndexed { w, c ->\n if (c == '#') {\n val doubleH = h.toDouble()\n val doubleW = w.toDouble()\n points.add(KDStub(doubleH, doubleW, doubleArrayOf(doubleH, doubleW), 2))\n } else {\n }\n }\n }\n\n val kdTree = KDTree(points)\n\n // O(HWlog(NW))\n var maxDistance = 0\n (0..(H-1)).forEach {h ->\n (0..(W-1)).forEach { w ->\n val doubleH = h.toDouble()\n val doubleW = w.toDouble()\n val point = KDStub(doubleH, doubleW, doubleArrayOf(doubleH, doubleW), 2)\n val closestPoint = kdTree.getNearestNeighbors(1, point)!![0]\n val distance = (Math.abs(closestPoint.coordinates[0] - h) + Math.abs(closestPoint.coordinates[1] - w)).toInt()\n if (distance > maxDistance) {\n maxDistance = distance\n }\n }\n }\n\n println(maxDistance)\n}\n\nfun abs(num: Int) : Int {\n if (num < 0) {\n return num * -1\n }\n return num\n}\n\n\n\n/**\n * Abstraction used to run algorithms such as nearest neighbor\n * and radial search on a collection of nodes organized into a KDTree.\n *\n * @author emc3\n *\n * @param \n */\nclass KDTree {\n\n var _root: KDNode? = null\n /**\n * This was the old constructor.\n * Used recursiveBuild() instead of recursiveBuildFaster()\n */\n /*\n\tpublic KDTree(Collection collection) {\n\t\tthis(collection.iterator().next().getNumDimensions()); //call default constructor with dimension of first object in list.\n\n\t\t_root = this.recursiveBuild(collection, 0); //build a new KDTree from the collection.\n\t}\n\t*/\n\n\n /**\n * @return the number of dimensions held\n * by the nodes of this tree.\n */\n var numDimensions = 0\n set //number of dimensions\n var _size: Long = 0\n val bounds: MutableList\n\n\n var _neighborList: NeighborList? = null\n\n /**\n * This method is only used for testing.\n * @return the KDimensionable object stored at the root node.\n */\n val rootObject: KDType?\n get() = if (_root != null) _root!!.kdObject else null\n\n /**\n * Default constructor.

\n * Initializes the root node to null, and sets the\n * number of dimensions this KD tree will hold to the\n * specified integer.\n *\n * @param k -\tThe number of dimensions that\n * this KDTree will hold.\n */\n constructor(k: Int) {\n _root = null\n _size = 0\n if (k > 0)\n numDimensions = k\n else\n System.err.println(\"ERROR: KDTree constructor: Dimension must be at least 1\")\n bounds = ArrayList(numDimensions)\n }\n\n /**\n * Alternate constructor.

\n * Calls the default constructor, which initializes the root node to null.\n * Also, the number of dimensions of the FIRST object in the collection\n * will be used to set the KDTree's number of dimension. Therefore this\n * constructor assumes that the dimension is the same for each\n * KDimensionable object in the list.\n *\n * @param collection -\tA collection of KDimensionable objects that will\n * be used to create the tree.\n */\n constructor(collection: Collection) : this(collection.iterator().next().numDimensions) {\n val superList = ArrayList>(numDimensions)\n for (i in 0 until numDimensions) {\n val l = ArrayList(collection)\n val comparator = KDimensionComparator(i) //compare nodes on axis i\n Collections.sort(l, comparator) //sort the list using comparator : ascending by axis i\n val min = l[0].coordinates[i]\n val max = l[l.size - 1].coordinates[i]\n bounds.add(MinMaxPair(min, max))\n superList.add(l)\n }\n _root = this.recursiveBuildFaster(superList, 0) //build a new KDTree from the collection.\n }//call default constructor with dimension of first object in list.\n\n fun getMax(axis: Int): Double {\n return bounds[axis].max\n }\n\n fun getMin(axis: Int): Double {\n return bounds[axis].min\n }\n\n\n /**\n * This method takes a collection of objects that implement\n * KDimensionable and recursively builds a balanced KD Tree\n * from them.\n *\n * If the KDTree's _k field (number of dimensions) has not been set,\n * Or if the depth (for whatever hellish reason) is negative,\n * Or if the list is empty,\n * an error message will print to STDERROR.\n *\n *\n * @param list - The list of KDimensionable objects\n * @param depth - The depth at which to add the nodes\n */\n fun recursiveBuild(collection: Collection, depth: Int): KDNode? {\n val list: List\n if (collection is List<*>)\n list = collection as List //collection is already a List : cast it\n else\n list = ArrayList(collection) //build list from the collection\n val size = list.size\n\n if (numDimensions < 1) {\n System.err.println(\"ERROR: KDTree.recursiveBuild(): Number of Dimensions has not been defined.\")\n return null\n }\n if (depth < 0) {\n System.err.println(\"ERROR: KDTree.recursiveBuild(): Cannot build tree from a negative depth!\")\n return null\n }\n if (size == 0) {\n System.err.println(\"ERROR: KDTree.recursiveBuild(): Cannot build tree from an empty list.\")\n return null\n }\n\n val axis = depth % numDimensions //the 'axis' is the dimension that the nodes should be compared by.\n //it is determined by the current depth\n\n val comparator = KDimensionComparator(axis) //new comparator for each depth's axis\n Collections.sort(list, comparator) //sort the list : ascending by axis\n\n //split list by median\n val median: KDType\n val mid = size / 2 //floor of size/2\n median = list[mid] //get median object\n\n //create node, split list around median and recur\n //if there is only one node left in the list, it's our median,\n //so we're done with building the tree and we can return the\n //last node which we just created from the median.\n val node = KDNode(median)\n if (depth == 0)\n _root = node\n\n if (size > 2) {\n node.putLeft(this.recursiveBuild(list.subList(0, mid), depth + 1)!!) //Recur on sublist of everything before midpoint\n node.putRight(this.recursiveBuild(list.subList(mid + 1, size), depth + 1)!!) //recur on sublist of everything after midpoint\n } else if (size == 2) { //mid must be 1\n if (list[0].compareAxis(list[1], axis) >= 0)\n node.putRight(this.recursiveBuild(list.subList(0, 1), depth + 1)!!) //the node before mid\n else\n node.putLeft(this.recursiveBuild(list.subList(0, 1), depth + 1)!!) //node before mid\n }\n _size++\n return node\n }\n\n\n /**\n * This method takes a collection of objects that implement\n * KDimensionable and recursively builds a balanced KD Tree\n * from them.\n *\n * If the KDTree's _k field (number of dimensions) has not been set,\n * Or if the depth (for whatever hellish reason) is negative,\n * Or if the list is empty,\n * an error message will print to STDERROR.\n *\n *\n * @param list - The list of KDimensionable objects\n * @param depth - The depth at which to add the nodes\n */\n fun recursiveBuildFaster(superList: ArrayList>, depth: Int): KDNode? {\n val size = superList[0].size\n\n if (numDimensions < 1) {\n System.err.println(\"ERROR: KDTree.recursiveBuildFaster(): Number of Dimensions has not been defined.\")\n return null\n }\n if (depth < 0) {\n System.err.println(\"ERROR: KDTree.recursiveBuildFaster(): Cannot build tree from a negative depth!\")\n return null\n }\n if (size == 0) {\n System.err.println(\"ERROR: KDTree.recursiveBuildfaster(): Cannot build tree from an empty list.\")\n return null\n }\n\n val axis = depth % numDimensions //the 'axis' is the dimension that the nodes should be compared by.\n //it is determined by the current depth\n\n //split list by median\n val median: KDType\n val mid = size / 2 //floor of size/2\n median = superList[axis][mid] //get median object from desired axis-sorted list in superList\n\n //create node, split list around median and recur\n //if there is only one node left in the list, it's our median,\n //so we're done with building the tree and we can return the\n //last node which we just created from the median.\n val node = KDNode(median)\n if (depth == 0) _root = node //set node to root if it's the first one\n\n //create new sets of branches, split around the median object.\n var branches: Branches? = Branches(superList, mid, axis)\n val less = branches!!.less //all object less than or equal to (on current axis)\n val more = branches.more //all objects greater than (on current axis)\n\n if (!less[0].isEmpty())\n node.putLeft(this.recursiveBuildFaster(less, depth + 1)!!)\n if (!more[0].isEmpty())\n node.putRight(this.recursiveBuildFaster(more, depth + 1)!!)\n //XXX to save memory.\n branches = null\n\n _size++\n return node\n }\n\n /**\n * Searches this tree for at most n nearest neighbors\n * to the given point, and returns a list of nearest-neighbor\n * KDimensionable objects in a list,\n * sorted nearest to farthest\n *\n * @param n - the number of neighbors to return in the list\n * @param testPoint - the test point from which neighbors are compared/found\n * @return a list of (at most) n KDimensional objects, in ascending order\n * by distance to the test point.\n */\n fun getNearestNeighbors(n: Int, testPoint: KDimensionable): List? {\n if (_root == null) {\n System.err.println(\"ERROR: KDTree.getNearestNeighbors(): Tree has not been constructed.\")\n return null\n }\n if (n < 0) {\n System.err.println(\"ERROR: KDTree.getNearestNeighbors(): Cannot search negative number of neighbors.\")\n return null\n } else if (n == 0) {\n return ArrayList(0)\n }\n\n _neighborList = NeighborList(n, testPoint)\n this.recursiveNeighborSearch(_root, 0)\n\n val l = _neighborList!!.asList() //sorts the list for you\n _neighborList!!.clear() //dont need it anymore; clear it out to be safe.\n return l //returns a sorted list\n }\n\n /**\n * Recursive nearest neighbor search.

\n * Searches for nearest neighbors according to the supplied neighbor list,\n * inserting objects it finds along the way. The NeighborList class\n * takes care of deciding whether or not the object should actually be added\n * to the neighbor list.\n *\n * @param currNode - a node holding a candidate for nearest neighbor,\n * whose subtrees this algorithm will search.\n * @param depth - the current depth of this search in the tree. root = depth 0.\n * @param neighbors - the list of neighbors to pass around, stores the test point.\n * @return\n * A list of nearest neighbors, sorted in ascending order by distance to\n * the test point and bound to a specific quantity.\n */\n fun recursiveNeighborSearch(currNode: KDNode?, depth: Int) {\n if (currNode == null) return\n val p = _neighborList!!.testPoint\n val curr = currNode.kdObject\n if (!curr.equals(p)) {\n _neighborList!!.insert(curr) //curr will not be inserted if List is at max and curr is worse than the worst\n }\n\n //recursively search the subtree which contains the test point.\n var wentLeft = false\n val axis = depth % numDimensions\n if (p.compareAxis(curr, axis) <= 0) {\n this.recursiveNeighborSearch(currNode.left, depth + 1)\n wentLeft = true\n } else {\n this.recursiveNeighborSearch(currNode.right, depth + 1)\n }\n\n //search other subtree if not enough neighbors or distance to test point on axis is less than worst\n //distance of neighborList (axes could be equal)\n val axisDiff = Math.abs(curr.coordinates[axis] - p.coordinates[axis])\n val worstDist = _neighborList!!.worstDist\n if (!_neighborList!!.isFull || axisDiff < worstDist) {\n //search the subtree we haven't yet searched using the (wentLeft flag)\n if (wentLeft)\n this.recursiveNeighborSearch(currNode.right, depth + 1)\n else\n this.recursiveNeighborSearch(currNode.left, depth + 1)\n }\n }\n\n\n /**\n * Returns all KDimensionable objects in this tree in a sorted list.\n * The list is sorted in ascending order by distance from the testPoint.\n *\n * @param radiusSquared - the length of the radius to search.\n * @param testPoint - the point from which to define the radius.\n * @return\n * a list of KDimensionable objects in ascending order by distance to the testpoint.\n */\n fun getObjectsWithinRadius(radiusSquared: Double, testPoint: KDimensionable): List? {\n if (_root == null) {\n System.err.println(\"ERROR: KDTree.getObjectsWithinRadius(): Tree has not been constructed.\")\n return null\n }\n if (radiusSquared <= 0) {\n System.err.println(\"ERROR: KDTree.getObjectsWithinRadius(): Cannot search a non-positive radius.\")\n return null\n }\n\n val points = ArrayList()\n points.addAll(this.recursiveRadiusSearch(_root, 0, radiusSquared, testPoint))\n Collections.sort(points, DistanceToPointComparator(testPoint)) //sort according to distance to the test point\n return points\n }\n\n /**\n * Recursive radius search.

\n * Searches the tree starting with currNode and descending\n * into the left and/or right subtrees as necessary,\n * maintaining a list of KDimensionables within the radius.\n *\n * @param currNode - the current node that the recursive search is looking at.\n * @param depth - the depth of the current node. root depth = 0.\n * @param radius - the length of the radius to search\n * @param testPoint - the point from which the radius is defined.\n * @return\n * A collection of KDimensionable object that are contained in\n * currNode's subtrees (in no particular order).\n */\n fun recursiveRadiusSearch(currNode: KDNode?, depth: Int, radius: Double, testPoint: KDimensionable): Collection {\n val points = ArrayList()\n if (currNode == null)\n return points\n\n val curr = currNode.kdObject\n val currDist = curr.distanceTo(testPoint)\n if (currDist < radius) {\n //if curr is within radius, add it and search subtrees.\n if (!curr.equals(testPoint)) {\n points.add(curr)\n }\n points.addAll(this.recursiveRadiusSearch(currNode.left, depth + 1, radius, testPoint))\n points.addAll(this.recursiveRadiusSearch(currNode.right, depth + 1, radius, testPoint))\n } else {\n //curr is not within radius.\n val axis = depth % numDimensions\n val axisDiff = Math.abs(curr.coordinates[axis] - testPoint.coordinates[axis])\n if (axisDiff < radius) { //if axis Differential is less than radius, search both subtrees for candidates\n points.addAll(this.recursiveRadiusSearch(currNode.left, depth + 1, radius, testPoint))\n points.addAll(this.recursiveRadiusSearch(currNode.right, depth + 1, radius, testPoint))\n } else {\n //axis Differential is larger than radius. Move towards test point in search.\n if (curr.coordinates[axis] <= testPoint.coordinates[axis]) {\n //axis of curr is less than or equal to test point : go right\n points.addAll(this.recursiveRadiusSearch(currNode.right, depth + 1, radius, testPoint))\n } else {\n //axis of curr is greater than test point, go left.\n points.addAll(this.recursiveRadiusSearch(currNode.left, depth + 1, radius, testPoint))\n }\n }\n }\n\n return points //return candidates.\n }\n\n /**\n * Tests whether or not this tree contains a specific KDType object.\n * This method is only used for testing.\n *\n * @param kd the KDimensional object to find.\n * @return\n * True if the KDimensionable object is in the tree, false otherwise.\n */\n operator fun contains(kd: KDType): Boolean {\n if (_root == null || numDimensions < 1) {\n System.err.println(\"ERROR: KDTree.contains(): Tree is not defined.\")\n return false\n }\n var curr = _root\n var axis: Int\n var depth = 0\n while (curr != null) {\n axis = depth % numDimensions\n val o = curr.kdObject\n val result = kd.compareAxis(o, axis)\n if (result > 0) {\n curr = curr.right\n } else if (result < 0) {\n curr = curr.left\n } else {\n if (kd.equals(o))\n return true\n else\n curr = curr.left\n }\n depth++\n\n }\n return false\n }\n\n\n /**\n * Private method only used for subtree testing.\n * Returns the Node at which the specified KDimensionable object an be found,\n * that is, if the object is found in the tree.\n * @param kd\n * @return\n */\n fun find(kd: KDType): KDNode? {\n if (_root == null || numDimensions < 1) {\n System.err.println(\"ERROR: KDTree.find(): Tree is not defined.\")\n return null\n }\n var curr = _root\n var axis: Int\n val depth = 0\n while (curr != null) {\n axis = depth % numDimensions\n val o = curr.kdObject\n val result = kd.compareAxis(o, axis)\n if (result > 0) {\n curr = curr.right\n } else if (result < 0) {\n curr = curr.left\n } else {\n if (kd.equals(o))\n return curr\n else\n curr = curr.right\n }\n }\n return null //object not found\n\n }\n\n fun size(): Long {\n return _size\n }\n\n\n /**\n * A helper class that splits the 'list of lists'\n * into lists of lesser and greater. Used to build the tree so\n * that the list of nodes only has to be sorted 3 times,\n * (in the beginning- in the constructor).\n *\n * @author emc3 / skortchm\n */\n inner class Branches\n //lesser & greater based on the object at the median index.\n\n internal constructor(superList: ArrayList>, medianIndex: Int, axis: Int) {\n\n val less: ArrayList>\n val more: ArrayList> //each instance of Branches will be split into\n\n init {\n val medianVal = superList[axis][medianIndex] //get median object\n\n //The length of sublist: the number of KDTypes.\n val listSize = superList[0].size\n\n //Initializing less and more superLists.\n less = ArrayList(numDimensions)\n more = ArrayList(numDimensions)\n\n for (i in 0 until numDimensions) {\n //The sublists will be approximately half of the size of the initial, which is ~ the same as the median index.\n val tempLessList = ArrayList(medianIndex)\n //Less list will always have fewer elements, because it also has to handle =\n val tempMoreList = ArrayList(if (medianIndex % 2 == 0) medianIndex else medianIndex + 1)\n\n //We iterate through each sorted list, distributing elements to\n //less and more based on comparison to the splitting pane. make sure to not add the median value to to either list.\n //loop through all elements in list\n for (j in 0 until listSize) {\n val temp = superList[i][j] //get the object in the list\n val cmp = temp.compareAxis(medianVal, axis) //compare object to median object\n\n if (cmp > 0)\n tempMoreList.add(temp)\n else if (cmp < 0)\n tempLessList.add(temp)\n else if (cmp == 0 && !temp.equals(medianVal))\n tempLessList.add(temp) //in case of same axis but not same object, add object to less list.\n }\n less.add(tempLessList)\n more.add(tempMoreList)\n }\n }\n }\n\n\n /**\n * This inner class represents a KDTree node.\n * It can hold anything that implements KDimensionable,\n * which is an Interface supplied with this package.\n * @author emc3\n */\n inner class KDNode\n /**\n * Constructor for a KDNode.

\n * Initializes left & right children to null\n * to signify 'no children'.\n * @param o -\tAn object which implements KDimensionable, to be stored as\n * the value for this node.\n */\n constructor(\n /**\n * Returns the object stored at this node.

\n * The object can be anything that implements KDimensionable.\n *\n * @return The object stored at this node.\n */\n val kdObject: KDType //the object which implements KDimensionable\n ) {\n /**\n * @return the left child of this node if one exists.\n * If no left child exists, this method will return null.\n */\n public var left: KDNode? = null\n /**\n * @return the right child of this node if one exists.\n * If no left child exists, this method will return null.\n */\n public var right: KDNode? = null //the left and right children of this node\n\n\n init {\n left = null\n right = null\n }\n\n\n /**\n * Give this node a left child.\n *\n * @param node -\tthe node to set as this node's left child.\n */\n fun putLeft(node: KDNode) {\n left = node\n }\n\n\n /**\n * Give this node a right child.\n *\n * @param node -\tthe node to set as this node's right child.\n */\n fun putRight(node: KDNode) {\n right = node\n }\n }\n\n inner class MinMaxPair internal constructor(internal var min: Double, internal var max: Double)\n\n\n /**\n * This inner class represents a\n * Bounded-priority queue which holds KDimensionable\n * objects. The objects are sorted by their distance\n * to a fixed test point, supplied on construction of\n * the list (the distance of the object to the test\n * point is its priority in the queue).\n *\n * @author emc3\n */\n inner class NeighborList\n /**\n * Default constructor

\n * Creates a new Nearest-Neighbor, which ranks nodes\n * in ascending order by distance to the test point.\n *\n *\n * The test point is specified by the KDimensionable object.\n * The list is bound to n members.\n *\n * @param n - The number of neighbors that this list holds. The list will never outgrow n.\n * @param point - The test point; neighbors will be compared by their distance to this point.\n */\n constructor( val _n: Int //the number of neighbors to keep in the list.\n ,\n /**\n * @return\n * The test point which is used to sort the list by\n * objects' distances.\n */\n val testPoint: KDimensionable //the fixed point to compare all neighbors to\n ) : Comparator {\n var _neighbors: ArrayList? = null //the list of neighbors\n var _worst: KDType? = null //the object with the worst distance to the test point\n /**\n * @return\n * the 'worst' KDimensionable object in the list.

\n * i.e. the coordinates with the greatest distance to\n * the test point.\n */\n var worstDist: Double = 0.toDouble()\n\n /**\n * returns true if this List is at capacity n\n * @return true if List at capacity, false otherwise\n */\n val isFull: Boolean\n get() = if (_neighbors!!.size == _n) true else false\n\n init {\n _neighbors = ArrayList(_n)\n _worst = null\n worstDist = java.lang.Double.POSITIVE_INFINITY\n }\n\n /**\n * Inserts a KDimensionable object to the nearest neighbor list,\n * and sorts the list by distance to the test point.\n *\n *\n * If this list is at capacity (size = n),\n * the incoming KDimensional object is compared to the 'worst' object in the list,\n * i.e. the item in the list which is farthest from the test point.\n * If the incoming object is better than the worst, the incoming object is\n * added to the list and the list is re-sorted.

\n * If the incoming object is worse than the worst, it is thrown out.\n *\n * @param kd - the incoming object to insert into the list, provided that it\n * is better than current worst item in the list.\n */\n fun insert(kd: KDType) {\n val dist = kd.distanceTo(testPoint)\n if (_neighbors!!.size < _n) { //if the list is not at capacity, add the neighbor.\n if (dist > worstDist) { //if it's the new worst neighbor, grab it\n _worst = kd\n worstDist = dist\n }\n _neighbors!!.add(kd) //add the new nieghbor to the list.\n } else if (dist < worstDist) { //if the list is at capacity, remove worst, add new, determine new worst.\n _neighbors!!.add(kd) //add new neighbor\n Collections.sort(_neighbors!!, this) // sort the list by distance to test point\n _neighbors!!.removeAt(_neighbors!!.size - 1) //never going to remove kd because we already determined its closer than the worst.\n _worst = _neighbors!![_neighbors!!.size - 1] //new worst using new size\n worstDist = _worst!!.distanceTo(testPoint)\n }\n }\n\n\n /**\n * @return\n * The list of nearest neighbors.\n * Size of list is bound by n, the integer\n * which was specified to this list on construction.\n */\n fun asList(): List {\n Collections.sort(_neighbors!!, this)\n return _neighbors as ArrayList\n }\n\n /**\n * @return the number of neighbors currently in the list\n */\n fun size(): Int {\n return _neighbors!!.size\n }\n\n fun clear() {\n _neighbors = null\n _worst = null\n worstDist = java.lang.Double.POSITIVE_INFINITY\n }\n\n /**\n * Compares KDimensionable objects based on their distance to the input point.\n * This will order the list so that objects closer to the input point\n * will come first in the list and objects that are farther away will\n * be at the end of the list.\n *\n * @return -1 if the first object is closer to the input point\n * 0 if the objects are the same distance to the input point\n * 1 if the first object is farther away form the input point.\n */\n override fun compare(o1: KDType, o2: KDType): Int {\n val d1 = o1.distanceTo(testPoint)\n val d2 = o2.distanceTo(testPoint)\n if (d1 < d2) {\n return -1\n } else if (d1 > d2) {\n return 1\n }\n return 0\n }\n\n }\n\n /**\n * This inner class represents a comparator used to sort\n * KDimensionable objects in a list according to a given test point.\n *\n *\n * This class is employed by the radius search, in order to\n * return a list of KDimensionable objects within a radius\n * to a given point, p, where the list is sorted by the objects'\n * distance to that point, in ascending order.\n *\n * @author emc3\n */\n inner class DistanceToPointComparator\n /**\n * Default constructor. Initializes the Test point\n * to use for this comparator.\n *\n * @param p the test point to use for this comparator.\n */\n constructor( val _p: KDimensionable //the test point\n ) : Comparator {\n\n\n /**\n * Compares 2 points based on their distance to the test point, _p,\n * specified in the constructor.\n *\n * @return\n * -1 if the first object is closer to the test point than the second

\n * 0 if the two objects are equal distance from the test point

\n * 1 if the first object is farther from the test point than the second object.\n */\n override fun compare(o1: KDType, o2: KDType): Int {\n val d1 = o1.distanceTo(_p)\n val d2 = o2.distanceTo(_p)\n\n if (d1 < d2)\n return -1\n else if (d1 > d2)\n return 1\n return 0\n }\n\n }\n}\n\ninterface KDimensionable {\n\n\n /**\n * @return an array of the coordinates of a point\n * in a k-dimensional space.

\n * For example, if the point is specified by 3-Dimensions,\n * the array will be of size 3, and ordered as {x, y, z}.\n */\n var coordinates: DoubleArray\n\n\n /**\n * @return\n * the number of dimensions that this\n * KDimensional object represents.

\n * e.g. for 2D, this method should return 2.\n * for 3D, this method should return 3, and so on.\n */\n val numDimensions: Int\n\n\n /**\n * Compares two KDimensionable objects based on a specific axis.\n * This method facilitates the comparing done when building\n * the KDTree.\n * @param kd -\tthe KDimensionable object to compare with\n * @param axis-\tthe axis to compare on\n * @return\n *\n * * \t1 if this object has a larger coordinate compared to the parameter object\n * on the specified axis.\n * * 0 if the coordinates are equal on the specified axis\n * * -1 if this object's coordinate is lesser than the specified object's coordinate\n *\n */\n fun compareAxis(kd: KDimensionable, axis: Int): Int\n\n\n /**\n * Calculates the distance between this object and the parameter object.\n * You should check to make sure the two objects have the same number of\n * dimensions, or normalize the missing dimensions to 0.\n *\n * @param kd - a KDimensional object to measure the distance to\n * @return the distance between this object and the specified KDimensionable object\n */\n fun distanceTo(kd: KDimensionable): Double\n\n}\n\n\n/**\n *\n */\n\n\n/**\n * KDimensionComparator

\n * This class represents the comparator used to sort the list of\n * coordinates that the KDTree uses to build itself. Since the KDTree\n * must be balanced to optimize its runtime, it must always choose\n * the median based on which dimension is used at the given level.\n * This class allows the KDTree to call Collections.sort on the list of\n * incoming KDimensionable objects, as to easily grab the median from\n * the list.\n *\n * @author emc3\n */\nclass KDimensionComparator\n/**\n * Default constructor. Requires that the caller\n * specifies an axis which the KDimensionable objects\n * will be compared by. For example, to compare by\n * x-values, axis would be the number 0.\n *\n * @param axis -\tthe coordinate to compare the KDimensionable\n * objects by.\n */\n(axis: Int) : Comparator {\n\n var _axis: Int = 0 //the dimension to compare\n\n init {\n if (axis >= 0)\n _axis = axis\n else\n System.err.println(\"ERROR: KDimensionComparator: axis for compare must be non-negative.\")\n }\n\n\n /**\n * Compares the two given objects based on the\n * axis specified to this object during construction.\n */\n override fun compare(o1: KDimensionable, o2: KDimensionable): Int {\n return o1.compareAxis(o2, _axis)\n }\n\n}\n\nclass KDStub(x: Double, y: Double, override var coordinates: DoubleArray, override val numDimensions: Int) : KDimensionable {\n init {\n coordinates = DoubleArray(2)\n coordinates[0] = x\n coordinates[1] = y\n }\n\n override fun compareAxis(kd: KDimensionable, axis: Int): Int {\n if (axis > 1 || axis < 0) {\n throw IllegalArgumentException(String.format(\"Axis %d out of range: must be 1 or 0\", axis))\n }\n val mine = coordinates[axis]\n val other = kd.coordinates[axis]\n return java.lang.Double.compare(mine, other)\n }\n\n /**\n * Note this distance is SQUARED\n */\n override fun distanceTo(kd: KDimensionable): Double {\n var dist = 0.0\n if (this.numDimensions != kd.numDimensions) {\n throw IllegalArgumentException(\"Wrong dimensionality of objects\")\n }\n for (i in 0 until numDimensions) {\n dist += Math.pow(coordinates[i] - kd.coordinates[i], 2.0)\n }\n return dist\n }\n\n companion object {\n val serialVersionUID = 1L\n }\n\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 34074, "cpu_time_ms": 1063, "memory_kb": 146880}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s480270714", "group_id": "codeNet:p03053", "input_text": "package agc033\n\nimport java.util.*\n\nfun read(): Triple> {\n val sc = Scanner(System.`in`)\n val h = sc.nextInt()\n val w = sc.nextInt()\n val a = Array(h) { sc.next() }\n return Triple(w, h, a)\n}\n\nfun read2(): Triple> {\n val (h, w) = readLine()!!.split(\" \").map(String::toInt)\n val a = Array(h){readLine()!!}\n return Triple (w, h, a)\n}\n\n\nfun solve(w: Int, h: Int, a: Array): Int {\n\n\n data class Point(val x: Int, val y: Int)\n\n fun isWithin(p: Point): Boolean {\n return (p.x in 0 until w) && (p.y in 0 until h)\n }\n\n val open: Queue = ArrayDeque()\n val infty = w + h\n val dist = Array(h) { Array(w) { infty } }\n val visited = Array(h) { Array(w) { false } }\n for (y in 0 until h) {\n for (x in 0 until w) {\n if (a[y][x] == '#') {\n dist[y][x] = 0\n visited[y][x] = true\n open.add(Point(x, y))\n }\n }\n }\n\n var maxDist = 0\n fun update(current: Point, next: Point) {\n if (isWithin(next) && !visited[next.y][next.x]) {\n open.add(next)\n visited[next.y][next.x] = true\n dist[next.y][next.x] = dist[current.y][current.x] + 1\n maxDist = Math.max(maxDist, dist[next.y][next.x])\n }\n }\n while (open.isNotEmpty()) {\n val current = open.remove()\n update(current, Point(current.x + 1, current.y))\n update(current, Point(current.x - 1, current.y))\n update(current, Point(current.x, current.y + 1))\n update(current, Point(current.x, current.y - 1))\n }\n return maxDist\n}\n\nfun main(args: Array) {\n val (w, h, a) = read2()\n println(solve(w, h, a))\n}\n", "language": "Kotlin", "metadata": {"date": 1557960517, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s480270714.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s480270714", "user_id": "u494788559"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "package agc033\n\nimport java.util.*\n\nfun read(): Triple> {\n val sc = Scanner(System.`in`)\n val h = sc.nextInt()\n val w = sc.nextInt()\n val a = Array(h) { sc.next() }\n return Triple(w, h, a)\n}\n\nfun read2(): Triple> {\n val (h, w) = readLine()!!.split(\" \").map(String::toInt)\n val a = Array(h){readLine()!!}\n return Triple (w, h, a)\n}\n\n\nfun solve(w: Int, h: Int, a: Array): Int {\n\n\n data class Point(val x: Int, val y: Int)\n\n fun isWithin(p: Point): Boolean {\n return (p.x in 0 until w) && (p.y in 0 until h)\n }\n\n val open: Queue = ArrayDeque()\n val infty = w + h\n val dist = Array(h) { Array(w) { infty } }\n val visited = Array(h) { Array(w) { false } }\n for (y in 0 until h) {\n for (x in 0 until w) {\n if (a[y][x] == '#') {\n dist[y][x] = 0\n visited[y][x] = true\n open.add(Point(x, y))\n }\n }\n }\n\n var maxDist = 0\n fun update(current: Point, next: Point) {\n if (isWithin(next) && !visited[next.y][next.x]) {\n open.add(next)\n visited[next.y][next.x] = true\n dist[next.y][next.x] = dist[current.y][current.x] + 1\n maxDist = Math.max(maxDist, dist[next.y][next.x])\n }\n }\n while (open.isNotEmpty()) {\n val current = open.remove()\n update(current, Point(current.x + 1, current.y))\n update(current, Point(current.x - 1, current.y))\n update(current, Point(current.x, current.y + 1))\n update(current, Point(current.x, current.y - 1))\n }\n return maxDist\n}\n\nfun main(args: Array) {\n val (w, h, a) = read2()\n println(solve(w, h, a))\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1755, "cpu_time_ms": 162, "memory_kb": 31392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s742280788", "group_id": "codeNet:p03053", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val (h, w) = readLine()!!.split(\" \").map { it.toInt() }\n val a = (0 until h).map { readLine()!!.toMutableList() }\n val q = LinkedList>().apply {\n a.forEachIndexed { i, ai -> ai.forEachIndexed { j, c -> if (c == '#') add(Triple(i, j, 0)) } }\n }\n var cnt=0\n while (q.isNotEmpty()) {\n val (i, j, n) = q.first()\n q.removeAt(0)\n if (i-1 in 0 until h && a[i-1][j] == '.') {\n a[i-1][j] = '#'\n q += Triple(i-1, j, n+1)\n }\n if (i+1 in 0 until h && a[i+1][j] == '.') {\n a[i+1][j] = '#'\n q += Triple(i+1, j, n+1)\n }\n if (j-1 in 0 until w && a[i][j-1] == '.') {\n a[i][j-1] = '#'\n q += Triple(i, j-1, n+1)\n }\n if (j+1 in 0 until w && a[i][j+1] == '.') {\n a[i][j+1] = '#'\n q += Triple(i, j+1, n+1)\n }\n if (cnt < n) cnt = n\n }\n println(cnt)\n}", "language": "Kotlin", "metadata": {"date": 1557603605, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s742280788.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s742280788", "user_id": "u465699806"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val (h, w) = readLine()!!.split(\" \").map { it.toInt() }\n val a = (0 until h).map { readLine()!!.toMutableList() }\n val q = LinkedList>().apply {\n a.forEachIndexed { i, ai -> ai.forEachIndexed { j, c -> if (c == '#') add(Triple(i, j, 0)) } }\n }\n var cnt=0\n while (q.isNotEmpty()) {\n val (i, j, n) = q.first()\n q.removeAt(0)\n if (i-1 in 0 until h && a[i-1][j] == '.') {\n a[i-1][j] = '#'\n q += Triple(i-1, j, n+1)\n }\n if (i+1 in 0 until h && a[i+1][j] == '.') {\n a[i+1][j] = '#'\n q += Triple(i+1, j, n+1)\n }\n if (j-1 in 0 until w && a[i][j-1] == '.') {\n a[i][j-1] = '#'\n q += Triple(i, j-1, n+1)\n }\n if (j+1 in 0 until w && a[i][j+1] == '.') {\n a[i][j+1] = '#'\n q += Triple(i, j+1, n+1)\n }\n if (cnt < n) cnt = n\n }\n println(cnt)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 998, "cpu_time_ms": 1071, "memory_kb": 119004}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s323967433", "group_id": "codeNet:p03053", "input_text": "fun main(args: Array) {\n val (h, w) = readLine()!!.split(\" \").map(String::toInt)\n var bSet = mutableSetOf>()\n val map = Array(h) { IntArray(w + 1) { 0 } }\n (1..h).forEach { hi ->\n readLine()!!.forEachIndexed { wi, c ->\n if (c == '#') {\n map[hi][wi + 1] = 1\n bSet.add(Pair(hi, wi + 1))\n }\n }\n }\n\n val dir = mutableListOf(Pair(1, 0), Pair(0, 1), Pair(-1, 0), Pair(0, -1))//上下左右\n var times = 0 // 操作実行回数\n var wNum = h * w - bSet.size\n while (wNum > 0) {//白マスがなくなるまで\n times++\n val tSet = mutableSetOf>()\n for (b in bSet) {\n for (d in dir) {\n val th = b.first + d.first\n val tw = b.second + d.second\n if (th in 1..h && tw in 1..w && map[th][tw] == 0) {\n tSet.add(Pair(th, tw))\n map[th][tw] = 1\n wNum--\n }\n }\n }\n bSet = tSet\n }\n println(times)\n}", "language": "Kotlin", "metadata": {"date": 1557255519, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s323967433.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s323967433", "user_id": "u099066216"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (h, w) = readLine()!!.split(\" \").map(String::toInt)\n var bSet = mutableSetOf>()\n val map = Array(h) { IntArray(w + 1) { 0 } }\n (1..h).forEach { hi ->\n readLine()!!.forEachIndexed { wi, c ->\n if (c == '#') {\n map[hi][wi + 1] = 1\n bSet.add(Pair(hi, wi + 1))\n }\n }\n }\n\n val dir = mutableListOf(Pair(1, 0), Pair(0, 1), Pair(-1, 0), Pair(0, -1))//上下左右\n var times = 0 // 操作実行回数\n var wNum = h * w - bSet.size\n while (wNum > 0) {//白マスがなくなるまで\n times++\n val tSet = mutableSetOf>()\n for (b in bSet) {\n for (d in dir) {\n val th = b.first + d.first\n val tw = b.second + d.second\n if (th in 1..h && tw in 1..w && map[th][tw] == 0) {\n tSet.add(Pair(th, tw))\n map[th][tw] = 1\n wNum--\n }\n }\n }\n bSet = tSet\n }\n println(times)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1090, "cpu_time_ms": 1071, "memory_kb": 134204}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s572591601", "group_id": "codeNet:p03053", "input_text": "//TLE?\nfun main(args: Array) {\n val (h, w) = readLine()!!.split(\" \").map(String::toInt)\n val total = h * w\n val whiteList = mutableListOf>()\n val blackList = mutableListOf>()\n (1..h).forEach { hi ->\n readLine()!!.toCharArray().forEachIndexed { wi, c ->\n if (c == '.') {\n whiteList.add(Pair(hi, wi + 1))\n } else if (c == '#') {\n blackList.add(Pair(hi, wi + 1))\n }\n }\n }\n\n var max = 0\n for (white in whiteList) {\n var min = Integer.MAX_VALUE\n for (black in blackList) {\n val dist = calcDist(white, black)\n min = Math.min(dist, min)\n }\n max = Math.max(max, min)\n }\n println(max)\n}\n\nfun calcDist(one: Pair, two: Pair) = Math.abs(one.first - two.first) + Math.abs(one.second - two.second)\n", "language": "Kotlin", "metadata": {"date": 1557245608, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s572591601.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s572591601", "user_id": "u099066216"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "//TLE?\nfun main(args: Array) {\n val (h, w) = readLine()!!.split(\" \").map(String::toInt)\n val total = h * w\n val whiteList = mutableListOf>()\n val blackList = mutableListOf>()\n (1..h).forEach { hi ->\n readLine()!!.toCharArray().forEachIndexed { wi, c ->\n if (c == '.') {\n whiteList.add(Pair(hi, wi + 1))\n } else if (c == '#') {\n blackList.add(Pair(hi, wi + 1))\n }\n }\n }\n\n var max = 0\n for (white in whiteList) {\n var min = Integer.MAX_VALUE\n for (black in blackList) {\n val dist = calcDist(white, black)\n min = Math.min(dist, min)\n }\n max = Math.max(max, min)\n }\n println(max)\n}\n\nfun calcDist(one: Pair, two: Pair) = Math.abs(one.first - two.first) + Math.abs(one.second - two.second)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 899, "cpu_time_ms": 1063, "memory_kb": 115328}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s630713635", "group_id": "codeNet:p03053", "input_text": "import java.util.*\n\n\nfun main(args: Array) {\n\n DarkerandDarker.init()\n DarkerandDarker.execute()\n}\n\n\nclass DarkerandDarker {\n\n companion object {\n\n private val scanner = Scanner(System.`in`)\n\n private var H = 0\n private var W = 0\n\n private lateinit var table: Array>\n\n fun init() {\n// val inputs = readLine()!!.split(\" \")\n H = scanner.nextInt()\n W = scanner.nextInt()\n\n table = Array(H) {\n scanner.next().map {\n it == '#'\n }.toTypedArray()\n }\n }\n\n fun execute() {\n var roundNum = 0\n\n var blackCells = mutableListOf>()\n\n // 初期は総なめ\n for (h in 0 until H) {\n for (w in 0 until W) {\n if (table[h][w]) {\n blackCells.add(Pair(h, w))\n }\n }\n }\n\n var blackCellNum = blackCells.size\n\n while (true) {\n\n if (blackCellNum == H * W) {\n println(roundNum)\n break\n }\n\n val nextBlackCells = mutableListOf>()\n\n for (cell in blackCells) {\n\n val h = cell.first\n val w = cell.second\n\n\n if (h + 1 != H && !table[h + 1][w]) {\n table[h + 1][w] = true\n nextBlackCells.add(Pair(h + 1, w))\n }\n if (w + 1 != W && !table[h][w + 1]) {\n table[h][w + 1] = true\n nextBlackCells.add(Pair(h, w + 1))\n }\n if (h - 1 != -1 && !table[h - 1][w]) {\n table[h - 1][w] = true\n nextBlackCells.add(Pair(h - 1, w))\n }\n if (w - 1 != -1 && !table[h][w - 1]) {\n table[h][w - 1] = true\n nextBlackCells.add(Pair(h, w - 1))\n\n }\n }\n\n // 黒いマスの数\n blackCellNum += nextBlackCells.size\n blackCells = nextBlackCells\n\n roundNum++\n }\n }\n\n }\n}", "language": "Kotlin", "metadata": {"date": 1557114156, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s630713635.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s630713635", "user_id": "u631198699"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\n\nfun main(args: Array) {\n\n DarkerandDarker.init()\n DarkerandDarker.execute()\n}\n\n\nclass DarkerandDarker {\n\n companion object {\n\n private val scanner = Scanner(System.`in`)\n\n private var H = 0\n private var W = 0\n\n private lateinit var table: Array>\n\n fun init() {\n// val inputs = readLine()!!.split(\" \")\n H = scanner.nextInt()\n W = scanner.nextInt()\n\n table = Array(H) {\n scanner.next().map {\n it == '#'\n }.toTypedArray()\n }\n }\n\n fun execute() {\n var roundNum = 0\n\n var blackCells = mutableListOf>()\n\n // 初期は総なめ\n for (h in 0 until H) {\n for (w in 0 until W) {\n if (table[h][w]) {\n blackCells.add(Pair(h, w))\n }\n }\n }\n\n var blackCellNum = blackCells.size\n\n while (true) {\n\n if (blackCellNum == H * W) {\n println(roundNum)\n break\n }\n\n val nextBlackCells = mutableListOf>()\n\n for (cell in blackCells) {\n\n val h = cell.first\n val w = cell.second\n\n\n if (h + 1 != H && !table[h + 1][w]) {\n table[h + 1][w] = true\n nextBlackCells.add(Pair(h + 1, w))\n }\n if (w + 1 != W && !table[h][w + 1]) {\n table[h][w + 1] = true\n nextBlackCells.add(Pair(h, w + 1))\n }\n if (h - 1 != -1 && !table[h - 1][w]) {\n table[h - 1][w] = true\n nextBlackCells.add(Pair(h - 1, w))\n }\n if (w - 1 != -1 && !table[h][w - 1]) {\n table[h][w - 1] = true\n nextBlackCells.add(Pair(h, w - 1))\n\n }\n }\n\n // 黒いマスの数\n blackCellNum += nextBlackCells.size\n blackCells = nextBlackCells\n\n roundNum++\n }\n }\n\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2353, "cpu_time_ms": 1063, "memory_kb": 105732}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s504011201", "group_id": "codeNet:p03053", "input_text": "\nimport java.util.*\n\nfun main(args: Array) {\n\n DarkerandDarker.init()\n DarkerandDarker.execute()\n}\n\n\nclass DarkerandDarker {\n\n companion object {\n\n private val scanner = Scanner(System.`in`)\n\n private var H = 0\n private var W = 0\n\n private lateinit var table: Array>\n\n fun init() {\n// val inputs = readLine()!!.split(\" \")\n H = scanner.nextInt()\n W = scanner.nextInt()\n\n table = Array(H) {\n scanner.next().map {\n it == '#'\n }.toTypedArray()\n }\n }\n\n fun execute() {\n var roundNum = 0\n\n var blackCells = mutableSetOf>()\n\n // 初期は総なめ\n for (w in 0 until W) {\n for (h in 0 until H) {\n if (table[w][h]) {\n blackCells.add(Pair(h, w))\n }\n }\n }\n\n var blackCellNum = blackCells.size\n\n while (true) {\n\n if (blackCellNum == H * W) {\n println(roundNum)\n break\n }\n\n val nextBlackCells = mutableSetOf>()\n\n for (cell in blackCells) {\n\n val w = cell.first\n val h = cell.second\n\n if (h + 1 != H && !table[h + 1][w]) {\n table[h + 1][w] = true\n nextBlackCells.add(Pair(h + 1, w))\n }\n if (w + 1 != W && !table[h][w + 1]) {\n table[h][w + 1] = true\n nextBlackCells.add(Pair(h, w + 1))\n }\n if (h - 1 != -1 && !table[h - 1][w]) {\n table[h - 1][w] = true\n nextBlackCells.add(Pair(h - 1, w))\n }\n if (w - 1 != -1 && !table[h][w - 1]) {\n table[h][w - 1] = true\n nextBlackCells.add(Pair(h, w - 1))\n\n }\n }\n\n // 黒いマスの数\n blackCellNum += nextBlackCells.size\n blackCells = nextBlackCells\n\n roundNum++\n }\n }\n\n }\n}", "language": "Kotlin", "metadata": {"date": 1557112803, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s504011201.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s504011201", "user_id": "u631198699"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\nimport java.util.*\n\nfun main(args: Array) {\n\n DarkerandDarker.init()\n DarkerandDarker.execute()\n}\n\n\nclass DarkerandDarker {\n\n companion object {\n\n private val scanner = Scanner(System.`in`)\n\n private var H = 0\n private var W = 0\n\n private lateinit var table: Array>\n\n fun init() {\n// val inputs = readLine()!!.split(\" \")\n H = scanner.nextInt()\n W = scanner.nextInt()\n\n table = Array(H) {\n scanner.next().map {\n it == '#'\n }.toTypedArray()\n }\n }\n\n fun execute() {\n var roundNum = 0\n\n var blackCells = mutableSetOf>()\n\n // 初期は総なめ\n for (w in 0 until W) {\n for (h in 0 until H) {\n if (table[w][h]) {\n blackCells.add(Pair(h, w))\n }\n }\n }\n\n var blackCellNum = blackCells.size\n\n while (true) {\n\n if (blackCellNum == H * W) {\n println(roundNum)\n break\n }\n\n val nextBlackCells = mutableSetOf>()\n\n for (cell in blackCells) {\n\n val w = cell.first\n val h = cell.second\n\n if (h + 1 != H && !table[h + 1][w]) {\n table[h + 1][w] = true\n nextBlackCells.add(Pair(h + 1, w))\n }\n if (w + 1 != W && !table[h][w + 1]) {\n table[h][w + 1] = true\n nextBlackCells.add(Pair(h, w + 1))\n }\n if (h - 1 != -1 && !table[h - 1][w]) {\n table[h - 1][w] = true\n nextBlackCells.add(Pair(h - 1, w))\n }\n if (w - 1 != -1 && !table[h][w - 1]) {\n table[h][w - 1] = true\n nextBlackCells.add(Pair(h, w - 1))\n\n }\n }\n\n // 黒いマスの数\n blackCellNum += nextBlackCells.size\n blackCells = nextBlackCells\n\n roundNum++\n }\n }\n\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2350, "cpu_time_ms": 1059, "memory_kb": 103916}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s500303425", "group_id": "codeNet:p03053", "input_text": "class Position(val h: Int, val w: Int)\n\nfun main(args : Array) {\n val (H, W) = readLine()!!.split(\" \").map { it.toInt() }\n val blacks = mutableListOf()\n val whites = mutableListOf()\n (0..(H-1)).forEach { h ->\n readLine()!!.forEachIndexed { w, c ->\n if (c == '#') {\n blacks.add(Position(h, w))\n } else {\n whites.add(Position(h, w))\n }\n }\n }\n\n val targets = if (blacks.size < whites.size) {\n blacks\n } else {\n whites\n }\n\n // O(HWlog(NW))\n var maxDistance = 0\n (0..(H-1)).forEach {h ->\n (0..(W-1)).forEach { w ->\n val closest = targets.map { abs(it.h - h) + abs(it.w - w) }.min()!!\n val distance = closest\n if (distance > maxDistance) {\n maxDistance = distance\n }\n }\n }\n\n println(maxDistance)\n}\n\nfun abs(num: Int) : Int {\n if (num < 0) {\n return num * -1\n }\n return num\n}", "language": "Kotlin", "metadata": {"date": 1557026398, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s500303425.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s500303425", "user_id": "u893533760"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "class Position(val h: Int, val w: Int)\n\nfun main(args : Array) {\n val (H, W) = readLine()!!.split(\" \").map { it.toInt() }\n val blacks = mutableListOf()\n val whites = mutableListOf()\n (0..(H-1)).forEach { h ->\n readLine()!!.forEachIndexed { w, c ->\n if (c == '#') {\n blacks.add(Position(h, w))\n } else {\n whites.add(Position(h, w))\n }\n }\n }\n\n val targets = if (blacks.size < whites.size) {\n blacks\n } else {\n whites\n }\n\n // O(HWlog(NW))\n var maxDistance = 0\n (0..(H-1)).forEach {h ->\n (0..(W-1)).forEach { w ->\n val closest = targets.map { abs(it.h - h) + abs(it.w - w) }.min()!!\n val distance = closest\n if (distance > maxDistance) {\n maxDistance = distance\n }\n }\n }\n\n println(maxDistance)\n}\n\nfun abs(num: Int) : Int {\n if (num < 0) {\n return num * -1\n }\n return num\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1015, "cpu_time_ms": 1063, "memory_kb": 149840}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s889090158", "group_id": "codeNet:p03053", "input_text": "import java.io.PrintWriter\n\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val (h, w) = listOfInt()\n var a = emptyList().toMutableList()\n for (i in 0 until h){\n a.add(next())\n }\n\n var origin = emptyList>().toMutableList()\n\n var max = 0\n\n for (i in 0 until h){\n for (j in 0 until w){\n if (a[i][j] == '#'){\n if ((i != 0 && a[i-1][j] == '.') || (j != 0 && a[i][j-1] == '.') ||\n (i != h-1 && a[i+1][j] == '.' || (j != w-1 && a[i][j+1] == '.')))\n origin.add(listOf(i,j))\n }\n }\n }\n\n var temp = 0\n for (i in 0 until h){\n for (j in 0 until w){\n if (a[i][j] == '.'){\n temp = h+w\n origin.forEach {\n var x = it[0]-i\n var y = it[1]-j\n\n if (x < 0) x *= -1\n if (y < 0) y *= -1\n var distance = x+y\n if (temp > distance) temp = distance\n }\n if (max < temp) max = temp\n }\n }\n }\n\n println(max)\n}\n\n// 入力取得\nfun next() = readLine()!!\nfun listOfString() = next().split(\" \")\nfun listOfInt() =listOfString().map { it.toInt() }", "language": "Kotlin", "metadata": {"date": 1557026334, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s889090158.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s889090158", "user_id": "u781727408"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.PrintWriter\n\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val (h, w) = listOfInt()\n var a = emptyList().toMutableList()\n for (i in 0 until h){\n a.add(next())\n }\n\n var origin = emptyList>().toMutableList()\n\n var max = 0\n\n for (i in 0 until h){\n for (j in 0 until w){\n if (a[i][j] == '#'){\n if ((i != 0 && a[i-1][j] == '.') || (j != 0 && a[i][j-1] == '.') ||\n (i != h-1 && a[i+1][j] == '.' || (j != w-1 && a[i][j+1] == '.')))\n origin.add(listOf(i,j))\n }\n }\n }\n\n var temp = 0\n for (i in 0 until h){\n for (j in 0 until w){\n if (a[i][j] == '.'){\n temp = h+w\n origin.forEach {\n var x = it[0]-i\n var y = it[1]-j\n\n if (x < 0) x *= -1\n if (y < 0) y *= -1\n var distance = x+y\n if (temp > distance) temp = distance\n }\n if (max < temp) max = temp\n }\n }\n }\n\n println(max)\n}\n\n// 入力取得\nfun next() = readLine()!!\nfun listOfString() = next().split(\" \")\nfun listOfInt() =listOfString().map { it.toInt() }", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1333, "cpu_time_ms": 1063, "memory_kb": 84244}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s118882602", "group_id": "codeNet:p03053", "input_text": "class Position(val h: Int, val w: Int)\n\nfun main(args : Array) {\n val (H, W) = readLine()!!.split(\" \").map { it.toInt() }\n val blacks = mutableListOf()\n val whites = mutableListOf()\n (0..(H-1)).forEach { h ->\n readLine()!!.forEachIndexed { w, c ->\n if (c == '#') {\n blacks.add(Position(h, w))\n } else {\n whites.add(Position(h, w))\n }\n }\n }\n\n val targets = if (blacks.size >= whites.size) {\n blacks\n } else {\n whites\n }\n\n // O(HWlog(NW))\n var maxDistance = 0\n (0..(H-1)).forEach {h ->\n (0..(W-1)).forEach { w ->\n val closest = targets.map { abs(it.h - h) + abs(it.w - w) }.min()!!\n val distance = closest\n if (distance > maxDistance) {\n maxDistance = distance\n }\n }\n }\n\n println(maxDistance)\n}\n\nfun abs(num: Int) : Int {\n if (num < 0) {\n return num * -1\n }\n return num\n}", "language": "Kotlin", "metadata": {"date": 1557026301, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s118882602.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s118882602", "user_id": "u893533760"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "class Position(val h: Int, val w: Int)\n\nfun main(args : Array) {\n val (H, W) = readLine()!!.split(\" \").map { it.toInt() }\n val blacks = mutableListOf()\n val whites = mutableListOf()\n (0..(H-1)).forEach { h ->\n readLine()!!.forEachIndexed { w, c ->\n if (c == '#') {\n blacks.add(Position(h, w))\n } else {\n whites.add(Position(h, w))\n }\n }\n }\n\n val targets = if (blacks.size >= whites.size) {\n blacks\n } else {\n whites\n }\n\n // O(HWlog(NW))\n var maxDistance = 0\n (0..(H-1)).forEach {h ->\n (0..(W-1)).forEach { w ->\n val closest = targets.map { abs(it.h - h) + abs(it.w - w) }.min()!!\n val distance = closest\n if (distance > maxDistance) {\n maxDistance = distance\n }\n }\n }\n\n println(maxDistance)\n}\n\nfun abs(num: Int) : Int {\n if (num < 0) {\n return num * -1\n }\n return num\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1016, "cpu_time_ms": 1075, "memory_kb": 155300}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s183900823", "group_id": "codeNet:p03053", "input_text": "fun main(args: Array){\n\n val input = readLine()!!.split(\" \")\n val H = input[0].toInt()\n val W = input[1].toInt()\n\n val hlist: MutableList> = mutableListOf()\n val array = mutableListOf()\n\n for(i in 0..H-1){\n var wlist: MutableList = mutableListOf()\n var inp = readLine()!!\n hlist.add(wlist)\n for(j in 0..W-1) {\n wlist.add(inp[j])\n if(hlist[i][j] == '#'){\n array.add(i)\n array.add(j)\n }\n }\n }\n\n //var t = 0\n //while(t < array.size-1) {\n // println(\"${array[t]},${array[t + 1]}\")\n // t = t + 2\n //}\n\n var max = 0\n\n val mid = W/2\n\n for(i in 0..H-1) {\n for(j in 0..mid-1) {\n var mindistance = 100000000\n if(hlist[i][j] == '.'){\n //println(\".[$i][$j]\")\n var t=0\n while(t < array.size-1){\n var distance = Math.abs(i - array[t]) + Math.abs(j - array[t+1])\n //println(\"t: ${(t+1)/2}, ditance: $distance\")\n if(mindistance > distance) {\n mindistance = distance\n //println(\"mindistance: $mindistance\")\n if(mindistance <= max){\n break\n\n }\n }\n t = t+2\n }\n if (max < mindistance){\n max = mindistance\n }\n\n }\n //println(\"------------------------------\")\n }\n for(j in W-1 downTo mid) {\n var mindistance = 100000000\n if(hlist[i][j] == '.'){\n //println(\".[$i][$j]\")\n var t=0\n while(t < array.size-1){\n var distance = Math.abs(i - array[t]) + Math.abs(j - array[t+1])\n //println(\"t: ${(t+1)/2}, ditance: $distance\")\n if(mindistance > distance) {\n mindistance = distance\n //println(\"mindistance: $mindistance\")\n if(mindistance <= max){\n break\n\n }\n }\n t = t+2\n }\n if (max < mindistance){\n max = mindistance\n }\n\n }\n //println(\"------------------------------\")\n }\n }\n\n //for(i in 0..H-1) {\n // for(j in 0..W-1) {\n // print(hlist[i][j])\n // }\n // println()\n //}\n\n println(max)\n}", "language": "Kotlin", "metadata": {"date": 1557025806, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s183900823.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s183900823", "user_id": "u151176417"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array){\n\n val input = readLine()!!.split(\" \")\n val H = input[0].toInt()\n val W = input[1].toInt()\n\n val hlist: MutableList> = mutableListOf()\n val array = mutableListOf()\n\n for(i in 0..H-1){\n var wlist: MutableList = mutableListOf()\n var inp = readLine()!!\n hlist.add(wlist)\n for(j in 0..W-1) {\n wlist.add(inp[j])\n if(hlist[i][j] == '#'){\n array.add(i)\n array.add(j)\n }\n }\n }\n\n //var t = 0\n //while(t < array.size-1) {\n // println(\"${array[t]},${array[t + 1]}\")\n // t = t + 2\n //}\n\n var max = 0\n\n val mid = W/2\n\n for(i in 0..H-1) {\n for(j in 0..mid-1) {\n var mindistance = 100000000\n if(hlist[i][j] == '.'){\n //println(\".[$i][$j]\")\n var t=0\n while(t < array.size-1){\n var distance = Math.abs(i - array[t]) + Math.abs(j - array[t+1])\n //println(\"t: ${(t+1)/2}, ditance: $distance\")\n if(mindistance > distance) {\n mindistance = distance\n //println(\"mindistance: $mindistance\")\n if(mindistance <= max){\n break\n\n }\n }\n t = t+2\n }\n if (max < mindistance){\n max = mindistance\n }\n\n }\n //println(\"------------------------------\")\n }\n for(j in W-1 downTo mid) {\n var mindistance = 100000000\n if(hlist[i][j] == '.'){\n //println(\".[$i][$j]\")\n var t=0\n while(t < array.size-1){\n var distance = Math.abs(i - array[t]) + Math.abs(j - array[t+1])\n //println(\"t: ${(t+1)/2}, ditance: $distance\")\n if(mindistance > distance) {\n mindistance = distance\n //println(\"mindistance: $mindistance\")\n if(mindistance <= max){\n break\n\n }\n }\n t = t+2\n }\n if (max < mindistance){\n max = mindistance\n }\n\n }\n //println(\"------------------------------\")\n }\n }\n\n //for(i in 0..H-1) {\n // for(j in 0..W-1) {\n // print(hlist[i][j])\n // }\n // println()\n //}\n\n println(max)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2640, "cpu_time_ms": 1063, "memory_kb": 115084}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s182700343", "group_id": "codeNet:p03053", "input_text": "import java.io.PrintWriter\n\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val (h, w) = listOfInt()\n var a = emptyList().toMutableList()\n for (i in 0 until h){\n a.add(next())\n }\n\n var flag = true\n var count = 0\n var next_count = 0\n var turn_count = 0\n while (flag) {\n turn_count++\n var change = emptyList>().toMutableList()\n for (i in 0 until h){\n for (j in 0 until w){\n if (a[i][j] == '.'){\n if ((i != 0 && a[i-1][j] == '#') || (i != h-1 && a[i+1][j] == '#') || (j!=0 && a[i][j-1] == '#') || (j != w-1 && a[i][j+1] == '#')){\n change.add(listOf(i, j))\n }else{\n count++\n }\n }\n }\n }\n change.forEach {\n val row = it[0]\n val column = it[1]\n\n a[row] = a[row].substring(0, column) + '#' + a[row].substring(column+1)\n }\n if (count == 0) flag = false\n count = 0\n }\n\n println(turn_count)\n}\n\n// 入力取得\nfun next() = readLine()!!\nfun listOfString() = next().split(\" \")\nfun listOfInt() =listOfString().map { it.toInt() }", "language": "Kotlin", "metadata": {"date": 1557023110, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03053.html", "problem_id": "p03053", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03053/input.txt", "sample_output_relpath": "derived/input_output/data/p03053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03053/Kotlin/s182700343.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s182700343", "user_id": "u781727408"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.PrintWriter\n\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val (h, w) = listOfInt()\n var a = emptyList().toMutableList()\n for (i in 0 until h){\n a.add(next())\n }\n\n var flag = true\n var count = 0\n var next_count = 0\n var turn_count = 0\n while (flag) {\n turn_count++\n var change = emptyList>().toMutableList()\n for (i in 0 until h){\n for (j in 0 until w){\n if (a[i][j] == '.'){\n if ((i != 0 && a[i-1][j] == '#') || (i != h-1 && a[i+1][j] == '#') || (j!=0 && a[i][j-1] == '#') || (j != w-1 && a[i][j+1] == '#')){\n change.add(listOf(i, j))\n }else{\n count++\n }\n }\n }\n }\n change.forEach {\n val row = it[0]\n val column = it[1]\n\n a[row] = a[row].substring(0, column) + '#' + a[row].substring(column+1)\n }\n if (count == 0) flag = false\n count = 0\n }\n\n println(turn_count)\n}\n\n// 入力取得\nfun next() = readLine()!!\nfun listOfString() = next().split(\" \")\nfun listOfInt() =listOfString().map { it.toInt() }", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "sample_input": "3 3\n...\n.#.\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03053", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a grid of squares with H horizontal rows and W vertical columns, where each square is painted white or black.\nHW characters from A_{11} to A_{HW} represent the colors of the squares.\nA_{ij} is # if the square at the i-th row from the top and the j-th column from the left is black, and A_{ij} is . if that square is white.\n\nWe will repeatedly perform the following operation until all the squares are black:\n\nEvery white square that shares a side with a black square, becomes black.\n\nFind the number of operations that will be performed.\nThe initial grid has at least one black square.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\nA_{ij} is # or ..\n\nThe given grid has at least one black square.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11}A_{12}...A_{1W}\n:\nA_{H1}A_{H2}...A_{HW}\n\nOutput\n\nPrint the number of operations that will be performed.\n\nSample Input 1\n\n3 3\n...\n.#.\n...\n\nSample Output 1\n\n2\n\nAfter one operation, all but the corners of the grid will be black. After one more operation, all the squares will be black.\n\nSample Input 2\n\n6 6\n..#..#\n......\n#..#..\n......\n.#....\n....#.\n\nSample Output 2\n\n3", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1278, "cpu_time_ms": 1063, "memory_kb": 151668}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s717405398", "group_id": "codeNet:p03061", "input_text": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\n////////////////////////////////////////////////////////////////////////\n\n////////////////////////////////////////////////////////////////////////\n\nobject Problem {\n fun gcd(a: Int, b: Int): Int = if (b == 0) a else gcd(b, a % b)\n fun gcd(numbers: Iterable): Int = numbers.reduce { acc, n -> gcd(acc, n) }\n fun gcd(a: Long, b: Long): Long = if (b == 0L) a else gcd(b, a % b)\n fun gcd(numbers: Iterable): Long = numbers.reduce { acc, n -> gcd(acc, n) }\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val A = LongArray(N) { sc.next().toLong() }\n val L = LongArray(N)\n val R = LongArray(N)\n L[0] = A[0]\n R[N - 1] = A[N - 1]\n for (i in 1 until N) {\n L[i] = gcd(L[i - 1], A[i])\n R[N - 1 - i] = gcd(R[N - 1 - i + 1], A[N - 1 - i])\n }\n// println(\"L=\" + L.joinToString(\" \"))\n// println(\"R=\" + R.joinToString(\" \"))\n\n val can = mutableListOf(L[N - 2], R[1])\n for (i in 0..N - 3) {\n val a = gcd(L[i], R[i + 2])\n can += a\n }\n pw.println(can.max()!!)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1589074921, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s717405398.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s717405398", "user_id": "u297767059"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\n////////////////////////////////////////////////////////////////////////\n\n////////////////////////////////////////////////////////////////////////\n\nobject Problem {\n fun gcd(a: Int, b: Int): Int = if (b == 0) a else gcd(b, a % b)\n fun gcd(numbers: Iterable): Int = numbers.reduce { acc, n -> gcd(acc, n) }\n fun gcd(a: Long, b: Long): Long = if (b == 0L) a else gcd(b, a % b)\n fun gcd(numbers: Iterable): Long = numbers.reduce { acc, n -> gcd(acc, n) }\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val A = LongArray(N) { sc.next().toLong() }\n val L = LongArray(N)\n val R = LongArray(N)\n L[0] = A[0]\n R[N - 1] = A[N - 1]\n for (i in 1 until N) {\n L[i] = gcd(L[i - 1], A[i])\n R[N - 1 - i] = gcd(R[N - 1 - i + 1], A[N - 1 - i])\n }\n// println(\"L=\" + L.joinToString(\" \"))\n// println(\"R=\" + R.joinToString(\" \"))\n\n val can = mutableListOf(L[N - 2], R[1])\n for (i in 0..N - 3) {\n val a = gcd(L[i], R[i + 2])\n can += a\n }\n pw.println(can.max()!!)\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1840, "cpu_time_ms": 405, "memory_kb": 45832}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s175637956", "group_id": "codeNet:p03061", "input_text": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\n////////////////////////////////////////////////////////////////////////\n\n////////////////////////////////////////////////////////////////////////\n\nobject Problem {\n fun gcd(a: Int, b: Int): Int = if (b == 0) a else gcd(b, a % b)\n fun gcd(numbers: Iterable): Int = numbers.reduce { acc, n -> gcd(acc, n) }\n fun gcd(a: Long, b: Long): Long = if (b == 0L) a else gcd(b, a % b)\n fun gcd(numbers: Iterable): Long = numbers.reduce { acc, n -> gcd(acc, n) }\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val A = LongArray(N) { sc.next().toLong() }\n val L = LongArray(N)\n val R = LongArray(N)\n L[0] = A[0]\n R[N - 1] = A[N - 1]\n for (i in 1 until N) {\n L[i] = gcd(L[i - 1], A[i])\n R[N - 1 - i] = gcd(R[N - 1 - i + 1], A[N - 1 - i])\n }\n// println(\"L=\" + L.joinToString(\" \"))\n// println(\"R=\" + R.joinToString(\" \"))\n\n val can = mutableListOf(L[N - 2], R[1])\n for (i in 0..N - 3) {\n val a = gcd(L[i], R[N - i - 1])\n can += a\n }\n println(can.max()!!)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1589074330, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s175637956.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s175637956", "user_id": "u297767059"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\n////////////////////////////////////////////////////////////////////////\n\n////////////////////////////////////////////////////////////////////////\n\nobject Problem {\n fun gcd(a: Int, b: Int): Int = if (b == 0) a else gcd(b, a % b)\n fun gcd(numbers: Iterable): Int = numbers.reduce { acc, n -> gcd(acc, n) }\n fun gcd(a: Long, b: Long): Long = if (b == 0L) a else gcd(b, a % b)\n fun gcd(numbers: Iterable): Long = numbers.reduce { acc, n -> gcd(acc, n) }\n\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val A = LongArray(N) { sc.next().toLong() }\n val L = LongArray(N)\n val R = LongArray(N)\n L[0] = A[0]\n R[N - 1] = A[N - 1]\n for (i in 1 until N) {\n L[i] = gcd(L[i - 1], A[i])\n R[N - 1 - i] = gcd(R[N - 1 - i + 1], A[N - 1 - i])\n }\n// println(\"L=\" + L.joinToString(\" \"))\n// println(\"R=\" + R.joinToString(\" \"))\n\n val can = mutableListOf(L[N - 2], R[1])\n for (i in 0..N - 3) {\n val a = gcd(L[i], R[N - i - 1])\n can += a\n }\n println(can.max()!!)\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1847, "cpu_time_ms": 375, "memory_kb": 45952}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s731023301", "group_id": "codeNet:p03061", "input_text": "fun main(args: Array) = println(run {\n tailrec fun gcd(a: Int, b: Int): Int = if (b == 0) a else gcd(b, a % b)\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n\n val l = IntArray(n)\n val r = IntArray(n)\n l[0] = a.first()\n r[n-1] = a.last()\n for (i in 1..l.lastIndex) {\n val j = r.lastIndex-i\n l[i] = gcd(l[i-1], a[i])\n r[j] = gcd(r[j+1], a[j])\n }\n \n ((1..n-2).map { i ->\n gcd(l[i-1], r[i+1])\n }+l[n-2]+r[1]).max()!!\n\n})\n\n", "language": "Kotlin", "metadata": {"date": 1588540624, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s731023301.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s731023301", "user_id": "u563556491"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) = println(run {\n tailrec fun gcd(a: Int, b: Int): Int = if (b == 0) a else gcd(b, a % b)\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n\n val l = IntArray(n)\n val r = IntArray(n)\n l[0] = a.first()\n r[n-1] = a.last()\n for (i in 1..l.lastIndex) {\n val j = r.lastIndex-i\n l[i] = gcd(l[i-1], a[i])\n r[j] = gcd(r[j+1], a[j])\n }\n \n ((1..n-2).map { i ->\n gcd(l[i-1], r[i+1])\n }+l[n-2]+r[1]).max()!!\n\n})\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 526, "cpu_time_ms": 537, "memory_kb": 59344}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s908551064", "group_id": "codeNet:p03061", "input_text": "import java.io.*\nimport java.lang.*\nimport java.util.*\n\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 2147483647\nconst val LINF = 9223372036854775807L\n\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\n\nfun solve() {\n val n = nextInt()\n val a = nextIntAry(n)\n val s1 = a.cumsum(gcdIntFunc)\n val s2 = a.reversedArray().cumsum(gcdIntFunc).reversedArray()\n var ans = 1\n for (i in 0 until n - 1) ans = max(ans, gcd(s1[i], s2[i + 1]))\n println(ans)\n}\n\n\nfun println(v: String) {\n pw.println(v)\n}\n\nfun print(v: String) {\n pw.print(v)\n}\n\nfun next() = sc.next()\nfun nextInt() = sc.nextInt()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Int): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\n\nfun nextIntAry(n: Int): IntArray {\n val ary = intAry(n)\n for (i in 0 until n) ary[i] = nextInt()\n return ary\n}\n\nfun nextLongAry(n: Int): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\n\nfun nextDoubleAry(n: Int): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\nfun ary(n: Int, init: String = \"\") = Array(n) { init }\nfun intAry(n: Int, init: Int = 0) = IntArray(n) { init }\nfun longAry(n: Int, init: Long = 0L) = LongArray(n) { init }\nfun doubleAry(n: Int, init: Double = 0.0) = DoubleArray(n) { init }\nfun ary2(n: Int, m: Int, init: String = \"\") = Array(n) { Array(m) { init } }\nfun intAry2(n: Int, m: Int, init: Int = 0) = Array(n) { IntArray(m) { init } }\nfun longAry2(n: Int, m: Int, init: Long = 0) = Array(n) { LongArray(m) { init } }\nfun doubleAry2(n: Int, m: Int, init: Double = 0.0) = Array(n) { DoubleArray(m) { init } }\nfun ary3(n: Int, m: Int, k: Int, init: String = \"\") = Array(n) { Array(m) { Array(k) { init } } }\nfun intAry3(n: Int, m: Int, k: Int, init: Int = 0) = Array(n) { Array(m) { IntArray(k) { init } } }\nfun longAry3(n: Int, m: Int, k: Int, init: Long = 0L) = Array(n) { Array(m) { LongArray(k) { init } } }\nfun doubleAry3(n: Int, m: Int, k: Int, init: Double = 0.0) = Array(n) { Array(m) { DoubleArray(k) { init } } }\nfun list() = mutableListOf()\nfun intList() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun intSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\nval addIntFunc = {a: Int, b: Int -> a + b}\nval addLongFunc = {a: Long, b: Long -> a + b}\nval mulIntFunc = {a: Int, b: Int -> a * b}\nval mulLongFunc = {a: Long, b: Long -> a * b}\nval minIntFunc = {a: Int, b: Int -> min(a, b)}\nval minLongFunc = {a: Long, b: Long -> min(a, b)}\nval gcdIntFunc = {a: Int, b: Int -> gcd(a, b)}\nval gcdLongFunc = {a: Long, b: Long -> gcd(a, b)}\nval xorIntFunc = {a: Int, b: Int -> a xor b}\nval xorLongFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Int, b: Int, op: (Int, Int) -> Int) = op(a, b)\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\nfun Int.a() = this.toLong()\nfun Long.a() = this.toInt()\nfun IntArray.lowerBound(n: Int): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\n\nfun LongArray.lowerBound(n: Long): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\n\nfun DoubleArray.lowerBound(n: Double): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\n\nfun MutableList.intLowerBound(n: Int): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\n\nfun MutableList.longLowerBound(n: Long): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\n\nfun MutableList.doubleLowerBound(n: Double): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\n\nfun IntArray.cumsum(op: (Int, Int) -> Int): IntArray {\n val s = intAry(this.size + 1)\n for (i in this.indices) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\n\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1)\n for (i in this.indices) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\n\nfun MutableMap.counting(n: Int) {\n repeat(n) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\nfun MutableMap.intCounting(n: Int) {\n repeat(n) {\n val a = nextInt()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\nfun MutableMap.longCounting(n: Int) {\n repeat(n) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n\nfun abs(n: Int): Int = Math.abs(n)\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Int) = if (values.isEmpty()) -INF else values.max()!!\nfun max(vararg values: Long) = if (values.isEmpty()) -LINF else values.max()!!\nfun min(vararg values: Int) = if (values.isEmpty()) INF else values.min()!!\nfun min(vararg values: Long) = if (values.isEmpty()) LINF else values.min()!!\ntailrec fun gcd(a: Int, b: Int): Int = if (a % b == 0) b else gcd(b, (a % b))\ntailrec fun gcd(a: Long, b: Long): Long = if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Int, b: Int): Int = a / gcd(a, b) * b\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\n\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Int) {\n private val fac = LongArray(max)\n private val finv = LongArray(max)\n private val inv = LongArray(max)\n private val p = MOD.a()\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Int, r: Int): Long = if (n < r || (n < 0 || r < 0)) 0 else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Int, private var searched: Int = 0, private var nextIndex: Int = 0) {\n private val size = fact(n)\n private val permList = Array(size) { IntArray(n) { 0 } }\n\n private tailrec fun fact(n: Int, ans: Int = 1): Int {\n return if (n == 0) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, IntArray(n) { 0 }, Array(n) { false })\n }\n\n private fun create(num: Int, list: IntArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): IntArray = permList[nextIndex++]\n}\n\n\ndata class Node(val id: Int, var past: Int = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Int, val to: Int, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Int, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Int): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size, -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Int): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size, LINF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\nclass UnionFind(size: Int) {\n private val par = IntArray(size) { it }\n private val size = IntArray(size) { 1 }\n fun root(x: Int): Int {\n return if (par[x] == x) {\n x\n } else {\n par[x] = root(par[x])\n par[x]\n }\n }\n\n fun same(x: Int, y: Int): Boolean = root(x) == root(y)\n fun unite(x: Int, y: Int) {\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n }\n size[a] += size[b]\n par[b] = a\n }\n\n fun size(x: Int): Int = size[root(x)]\n}\n\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n if (buflen <= 0) false\n true\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n}", "language": "Kotlin", "metadata": {"date": 1586715931, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s908551064.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s908551064", "user_id": "u581625805"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.*\nimport java.lang.*\nimport java.util.*\n\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 2147483647\nconst val LINF = 9223372036854775807L\n\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\n\nfun solve() {\n val n = nextInt()\n val a = nextIntAry(n)\n val s1 = a.cumsum(gcdIntFunc)\n val s2 = a.reversedArray().cumsum(gcdIntFunc).reversedArray()\n var ans = 1\n for (i in 0 until n - 1) ans = max(ans, gcd(s1[i], s2[i + 1]))\n println(ans)\n}\n\n\nfun println(v: String) {\n pw.println(v)\n}\n\nfun print(v: String) {\n pw.print(v)\n}\n\nfun next() = sc.next()\nfun nextInt() = sc.nextInt()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Int): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\n\nfun nextIntAry(n: Int): IntArray {\n val ary = intAry(n)\n for (i in 0 until n) ary[i] = nextInt()\n return ary\n}\n\nfun nextLongAry(n: Int): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\n\nfun nextDoubleAry(n: Int): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\nfun ary(n: Int, init: String = \"\") = Array(n) { init }\nfun intAry(n: Int, init: Int = 0) = IntArray(n) { init }\nfun longAry(n: Int, init: Long = 0L) = LongArray(n) { init }\nfun doubleAry(n: Int, init: Double = 0.0) = DoubleArray(n) { init }\nfun ary2(n: Int, m: Int, init: String = \"\") = Array(n) { Array(m) { init } }\nfun intAry2(n: Int, m: Int, init: Int = 0) = Array(n) { IntArray(m) { init } }\nfun longAry2(n: Int, m: Int, init: Long = 0) = Array(n) { LongArray(m) { init } }\nfun doubleAry2(n: Int, m: Int, init: Double = 0.0) = Array(n) { DoubleArray(m) { init } }\nfun ary3(n: Int, m: Int, k: Int, init: String = \"\") = Array(n) { Array(m) { Array(k) { init } } }\nfun intAry3(n: Int, m: Int, k: Int, init: Int = 0) = Array(n) { Array(m) { IntArray(k) { init } } }\nfun longAry3(n: Int, m: Int, k: Int, init: Long = 0L) = Array(n) { Array(m) { LongArray(k) { init } } }\nfun doubleAry3(n: Int, m: Int, k: Int, init: Double = 0.0) = Array(n) { Array(m) { DoubleArray(k) { init } } }\nfun list() = mutableListOf()\nfun intList() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun intSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\nval addIntFunc = {a: Int, b: Int -> a + b}\nval addLongFunc = {a: Long, b: Long -> a + b}\nval mulIntFunc = {a: Int, b: Int -> a * b}\nval mulLongFunc = {a: Long, b: Long -> a * b}\nval minIntFunc = {a: Int, b: Int -> min(a, b)}\nval minLongFunc = {a: Long, b: Long -> min(a, b)}\nval gcdIntFunc = {a: Int, b: Int -> gcd(a, b)}\nval gcdLongFunc = {a: Long, b: Long -> gcd(a, b)}\nval xorIntFunc = {a: Int, b: Int -> a xor b}\nval xorLongFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Int, b: Int, op: (Int, Int) -> Int) = op(a, b)\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\nfun Int.a() = this.toLong()\nfun Long.a() = this.toInt()\nfun IntArray.lowerBound(n: Int): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\n\nfun LongArray.lowerBound(n: Long): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\n\nfun DoubleArray.lowerBound(n: Double): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\n\nfun MutableList.intLowerBound(n: Int): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\n\nfun MutableList.longLowerBound(n: Long): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\n\nfun MutableList.doubleLowerBound(n: Double): Int {\n var ok = this.size\n var ng = -1\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\n\nfun IntArray.cumsum(op: (Int, Int) -> Int): IntArray {\n val s = intAry(this.size + 1)\n for (i in this.indices) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\n\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1)\n for (i in this.indices) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\n\nfun MutableMap.counting(n: Int) {\n repeat(n) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\nfun MutableMap.intCounting(n: Int) {\n repeat(n) {\n val a = nextInt()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\nfun MutableMap.longCounting(n: Int) {\n repeat(n) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n\nfun abs(n: Int): Int = Math.abs(n)\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Int) = if (values.isEmpty()) -INF else values.max()!!\nfun max(vararg values: Long) = if (values.isEmpty()) -LINF else values.max()!!\nfun min(vararg values: Int) = if (values.isEmpty()) INF else values.min()!!\nfun min(vararg values: Long) = if (values.isEmpty()) LINF else values.min()!!\ntailrec fun gcd(a: Int, b: Int): Int = if (a % b == 0) b else gcd(b, (a % b))\ntailrec fun gcd(a: Long, b: Long): Long = if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Int, b: Int): Int = a / gcd(a, b) * b\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\n\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Int) {\n private val fac = LongArray(max)\n private val finv = LongArray(max)\n private val inv = LongArray(max)\n private val p = MOD.a()\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Int, r: Int): Long = if (n < r || (n < 0 || r < 0)) 0 else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Int, private var searched: Int = 0, private var nextIndex: Int = 0) {\n private val size = fact(n)\n private val permList = Array(size) { IntArray(n) { 0 } }\n\n private tailrec fun fact(n: Int, ans: Int = 1): Int {\n return if (n == 0) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, IntArray(n) { 0 }, Array(n) { false })\n }\n\n private fun create(num: Int, list: IntArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): IntArray = permList[nextIndex++]\n}\n\n\ndata class Node(val id: Int, var past: Int = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Int, val to: Int, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Int, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Int): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size, -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Int): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size, LINF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\nclass UnionFind(size: Int) {\n private val par = IntArray(size) { it }\n private val size = IntArray(size) { 1 }\n fun root(x: Int): Int {\n return if (par[x] == x) {\n x\n } else {\n par[x] = root(par[x])\n par[x]\n }\n }\n\n fun same(x: Int, y: Int): Boolean = root(x) == root(y)\n fun unite(x: Int, y: Int) {\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n }\n size[a] += size[b]\n par[b] = a\n }\n\n fun size(x: Int): Int = size[root(x)]\n}\n\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n if (buflen <= 0) false\n true\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextInt(): Int {\n val nl = nextLong()\n if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n return nl.toInt()\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 12436, "cpu_time_ms": 336, "memory_kb": 38424}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s418081619", "group_id": "codeNet:p03061", "input_text": "fun main(args: Array) {\n abc125c()\n}\n\nprivate tailrec fun gcd(a: Long, b: Long): Long {\n return if (b == 0L) a else gcd(b, a % b)\n}\n\nfun abc125c() {\n val n = readLine()!!.toInt()\n val aList = readLine()!!.split(' ').map { it.toLong() }\n\n val cumulativeGcdFromLeft = LongArray(n + 1)\n for (i in 0 until n) cumulativeGcdFromLeft[i + 1] = gcd(cumulativeGcdFromLeft[i], aList[i])\n\n val cumulativeGcdFromRight = LongArray(n + 1)\n for (i in n - 1 downTo 0) cumulativeGcdFromRight[i] = gcd(cumulativeGcdFromRight[i + 1], aList[i])\n\n val answer = (0 until n).map { gcd(cumulativeGcdFromLeft[it], cumulativeGcdFromRight[it + 1]) }.max()!!\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1577967790, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s418081619.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s418081619", "user_id": "u139478771"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n abc125c()\n}\n\nprivate tailrec fun gcd(a: Long, b: Long): Long {\n return if (b == 0L) a else gcd(b, a % b)\n}\n\nfun abc125c() {\n val n = readLine()!!.toInt()\n val aList = readLine()!!.split(' ').map { it.toLong() }\n\n val cumulativeGcdFromLeft = LongArray(n + 1)\n for (i in 0 until n) cumulativeGcdFromLeft[i + 1] = gcd(cumulativeGcdFromLeft[i], aList[i])\n\n val cumulativeGcdFromRight = LongArray(n + 1)\n for (i in n - 1 downTo 0) cumulativeGcdFromRight[i] = gcd(cumulativeGcdFromRight[i + 1], aList[i])\n\n val answer = (0 until n).map { gcd(cumulativeGcdFromLeft[it], cumulativeGcdFromRight[it + 1]) }.max()!!\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 688, "cpu_time_ms": 527, "memory_kb": 59712}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s758340385", "group_id": "codeNet:p03061", "input_text": "fun main(args: Array) {\n abc125c()\n}\n\nprivate tailrec fun gcd(a: Long, b: Long): Long {\n return if (b == 0L) a else gcd(b, a % b)\n}\n\nfun abc125c() {\n val n = readLine()!!.toInt()\n val aList = readLine()!!.split(' ').map { it.toLong() }\n\n val cumulativeGcdFromLeft = LongArray(n + 1)\n for (i in 0 until n) cumulativeGcdFromLeft[i + 1] = gcd(cumulativeGcdFromLeft[i], aList[i])\n\n val cumulativeGcdFromRight = LongArray(n + 1)\n for (i in n - 1 downTo 0) cumulativeGcdFromRight[i] = gcd(cumulativeGcdFromRight[i + 1], aList[i])\n\n val answer = (0 until n - 1).map { gcd(cumulativeGcdFromLeft[it], cumulativeGcdFromRight[it + 1]) }.max()!!\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1577967128, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s758340385.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s758340385", "user_id": "u139478771"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n abc125c()\n}\n\nprivate tailrec fun gcd(a: Long, b: Long): Long {\n return if (b == 0L) a else gcd(b, a % b)\n}\n\nfun abc125c() {\n val n = readLine()!!.toInt()\n val aList = readLine()!!.split(' ').map { it.toLong() }\n\n val cumulativeGcdFromLeft = LongArray(n + 1)\n for (i in 0 until n) cumulativeGcdFromLeft[i + 1] = gcd(cumulativeGcdFromLeft[i], aList[i])\n\n val cumulativeGcdFromRight = LongArray(n + 1)\n for (i in n - 1 downTo 0) cumulativeGcdFromRight[i] = gcd(cumulativeGcdFromRight[i + 1], aList[i])\n\n val answer = (0 until n - 1).map { gcd(cumulativeGcdFromLeft[it], cumulativeGcdFromRight[it + 1]) }.max()!!\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 692, "cpu_time_ms": 517, "memory_kb": 59916}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s682178995", "group_id": "codeNet:p03061", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toLong()\n val aList = readLine()!!.split(\" \").map { it.toLong() }\n\n var maxGcd = gcd(aList[0], aList[1])\n aList.forEach { it ->\n val aListExeptIt = aList.toMutableList()\n aListExeptIt.remove(it)\n\n var gcd = if (aListExeptIt.size > 1) gcd(aListExeptIt[0], aListExeptIt[1]) else aListExeptIt[0]\n aListExeptIt.forEach { gcd = gcd(gcd, it) }\n if (gcd > maxGcd) maxGcd = gcd\n }\n println(maxGcd)\n}\n\nfun gcd(a: Long, b: Long): Long {\n var temp: Long\n var aTemp = a\n var bTemp = b\n while (aTemp % bTemp != 0.toLong()) {\n temp = bTemp % aTemp\n bTemp = aTemp\n aTemp = temp\n }\n return bTemp\n}\n", "language": "Kotlin", "metadata": {"date": 1565920631, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s682178995.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s682178995", "user_id": "u139478771"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toLong()\n val aList = readLine()!!.split(\" \").map { it.toLong() }\n\n var maxGcd = gcd(aList[0], aList[1])\n aList.forEach { it ->\n val aListExeptIt = aList.toMutableList()\n aListExeptIt.remove(it)\n\n var gcd = if (aListExeptIt.size > 1) gcd(aListExeptIt[0], aListExeptIt[1]) else aListExeptIt[0]\n aListExeptIt.forEach { gcd = gcd(gcd, it) }\n if (gcd > maxGcd) maxGcd = gcd\n }\n println(maxGcd)\n}\n\nfun gcd(a: Long, b: Long): Long {\n var temp: Long\n var aTemp = a\n var bTemp = b\n while (aTemp % bTemp != 0.toLong()) {\n temp = bTemp % aTemp\n bTemp = aTemp\n aTemp = temp\n }\n return bTemp\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 728, "cpu_time_ms": 2111, "memory_kb": 121500}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s256397053", "group_id": "codeNet:p03061", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val xs = readLine()!!.split(' ').map { it.toInt() }\n\n val f = { i: Int -> xs.filter { it % i == 0 }.count() >= n - 1 }\n\n val ans = xs.take(2).map { a ->\n generateSequence(1) { it + 1 }\n .takeWhile { it * it <= a }\n .filter { a % it == 0 }\n .map {\n var r = 0\n if (f(it)) r = Math.max(r, it)\n if (f(a / it)) r = Math.max(r, a / it)\n r\n }.max()?: 0\n }.max()\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1556459828, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s256397053.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s256397053", "user_id": "u863309603"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val xs = readLine()!!.split(' ').map { it.toInt() }\n\n val f = { i: Int -> xs.filter { it % i == 0 }.count() >= n - 1 }\n\n val ans = xs.take(2).map { a ->\n generateSequence(1) { it + 1 }\n .takeWhile { it * it <= a }\n .filter { a % it == 0 }\n .map {\n var r = 0\n if (f(it)) r = Math.max(r, it)\n if (f(a / it)) r = Math.max(r, a / it)\n r\n }.max()?: 0\n }.max()\n\n println(ans)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 596, "cpu_time_ms": 773, "memory_kb": 116844}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s034980798", "group_id": "codeNet:p03061", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val n = Integer.parseInt(readLine() ?: \"0\")\n val alist = readLine()?.split(\" \") ?: listOf()\n val a = alist.map{Integer.parseInt(it)}.distinct()\n when(a.size) {\n 0 -> {\n println(\"0\")\n }\n 1 -> {\n println(a[0])\n }\n 2 -> {\n if(alist[0] > alist[1]) {\n println(alist[0])\n } else {\n println(alist[1])\n }\n }\n else -> {\n var ans = 0\n for(i in 1..n-1) {\n val l = a.take(i)\n val r = a.takeLast(a.size - i - 1)\n val lgcd = solve(l)\n val rgcd = solve(r)\n var m = when {\n lgcd == 0 -> rgcd\n rgcd == 0 -> lgcd\n else -> {\n solve(listOf(lgcd, rgcd))\n }\n }\n if(ans < m) ans = m\n }\n println(ans)\n }\n }\n}\n\nfun solve(numList: List): Int {\n var newList = numList.distinct().sorted().filter { it != 0 } as MutableList\n var r: Int = 0\n if(newList.size == 0) return 0\n if(newList.size == 1) return newList[0]\n while (newList.count() > 1) {\n r = newList[0]\n newList = newList.takeLast(newList.count() - 1).map {it % newList[0]} as MutableList\n newList.add(r)\n newList = newList.distinct().sorted().filter { it != 0 } as MutableList\n }\n return r\n}", "language": "Kotlin", "metadata": {"date": 1556431088, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s034980798.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s034980798", "user_id": "u354835503"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val n = Integer.parseInt(readLine() ?: \"0\")\n val alist = readLine()?.split(\" \") ?: listOf()\n val a = alist.map{Integer.parseInt(it)}.distinct()\n when(a.size) {\n 0 -> {\n println(\"0\")\n }\n 1 -> {\n println(a[0])\n }\n 2 -> {\n if(alist[0] > alist[1]) {\n println(alist[0])\n } else {\n println(alist[1])\n }\n }\n else -> {\n var ans = 0\n for(i in 1..n-1) {\n val l = a.take(i)\n val r = a.takeLast(a.size - i - 1)\n val lgcd = solve(l)\n val rgcd = solve(r)\n var m = when {\n lgcd == 0 -> rgcd\n rgcd == 0 -> lgcd\n else -> {\n solve(listOf(lgcd, rgcd))\n }\n }\n if(ans < m) ans = m\n }\n println(ans)\n }\n }\n}\n\nfun solve(numList: List): Int {\n var newList = numList.distinct().sorted().filter { it != 0 } as MutableList\n var r: Int = 0\n if(newList.size == 0) return 0\n if(newList.size == 1) return newList[0]\n while (newList.count() > 1) {\n r = newList[0]\n newList = newList.takeLast(newList.count() - 1).map {it % newList[0]} as MutableList\n newList.add(r)\n newList = newList.distinct().sorted().filter { it != 0 } as MutableList\n }\n return r\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1358, "cpu_time_ms": 708, "memory_kb": 60040}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s698894652", "group_id": "codeNet:p03061", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val xs = readLine()!!.split(' ').map { it.toInt() }\n\n val l = IntArray(n)\n val r = IntArray(n)\n\n for (i in (0 until n)) {\n l[i] = if (i == 0) {\n gcd(xs[0], 0)\n } else {\n gcd(xs[i], l[i - 1])\n }\n }\n\n for (i in (n - 1 downTo 0)) {\n r[i] = if (i == n - 1) {\n gcd(xs[i], 0)\n } else {\n gcd(xs[i], r[i + 1])\n }\n }\n\n var ans = 0\n\n for (i in (0 until n)) {\n val d = when (i) {\n 0 -> r[i + 1]\n n - 1 -> l[i - 1]\n else -> gcd(l[i - 1], r[i + 1])\n }\n ans = Math.max(ans, d)\n }\n\n println(ans)\n}\n\nprivate fun gcd(a: Int, b: Int): Int {\n if (b == 0) return a\n return gcd(b, a % b)\n}\n", "language": "Kotlin", "metadata": {"date": 1556429132, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s698894652.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s698894652", "user_id": "u863309603"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val xs = readLine()!!.split(' ').map { it.toInt() }\n\n val l = IntArray(n)\n val r = IntArray(n)\n\n for (i in (0 until n)) {\n l[i] = if (i == 0) {\n gcd(xs[0], 0)\n } else {\n gcd(xs[i], l[i - 1])\n }\n }\n\n for (i in (n - 1 downTo 0)) {\n r[i] = if (i == n - 1) {\n gcd(xs[i], 0)\n } else {\n gcd(xs[i], r[i + 1])\n }\n }\n\n var ans = 0\n\n for (i in (0 until n)) {\n val d = when (i) {\n 0 -> r[i + 1]\n n - 1 -> l[i - 1]\n else -> gcd(l[i - 1], r[i + 1])\n }\n ans = Math.max(ans, d)\n }\n\n println(ans)\n}\n\nprivate fun gcd(a: Int, b: Int): Int {\n if (b == 0) return a\n return gcd(b, a % b)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 814, "cpu_time_ms": 480, "memory_kb": 61732}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s280873105", "group_id": "codeNet:p03061", "input_text": "\nfun main(args: Array) {\n var (count) = readLine()!!.split(\" \").map { it.toInt() }\n val values = readLine()!!.split(\" \").map { it.toInt() }\n\n var mx = 0\n\n for (musi in 0 until count) {\n if (values[musi] < mx) continue\n\n val tmp = values\n .filterIndexed { index, i -> index != musi }\n .reduceRight { i, acc -> gcd(i, acc) }\n\n if (tmp > mx) mx = tmp\n }\n\n print(mx)\n}\n\nprivate fun gcd(a: Int, b: Int): Int {\n if (b == 0) return a\n\n return gcd(b, a % b)\n}\n", "language": "Kotlin", "metadata": {"date": 1556420431, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s280873105.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s280873105", "user_id": "u249910602"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\nfun main(args: Array) {\n var (count) = readLine()!!.split(\" \").map { it.toInt() }\n val values = readLine()!!.split(\" \").map { it.toInt() }\n\n var mx = 0\n\n for (musi in 0 until count) {\n if (values[musi] < mx) continue\n\n val tmp = values\n .filterIndexed { index, i -> index != musi }\n .reduceRight { i, acc -> gcd(i, acc) }\n\n if (tmp > mx) mx = tmp\n }\n\n print(mx)\n}\n\nprivate fun gcd(a: Int, b: Int): Int {\n if (b == 0) return a\n\n return gcd(b, a % b)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 527, "cpu_time_ms": 2112, "memory_kb": 136028}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s763465121", "group_id": "codeNet:p03061", "input_text": "fun gcd(n: Collection): Int {\n var w = n\n while (w.size != 1) {\n val min = w.min()!!\n w = w.map { if (it == min) it else it % min }\n .filter { it != 0 }\n .distinct()\n }\n return w.first()\n}\n\nfun gcd(a: Int, b: Int): Int {\n var x = a\n var y = b\n while (true) {\n if (y < x) {\n val z = x\n x = y\n y = z\n }\n if (x == 0) break\n y %= x\n }\n return y\n}\n\nfun main(args: Array) {\n readLine()\n var a = readLine()!!.split(' ').map(String::toInt)\n while (true) {\n if (a.size == 2) {\n println(a.max())\n break\n } else if (a.size == 3) {\n val s = gcd(a[0], a[1])\n val t = gcd(a[1], a[2])\n val u = gcd(a[2], a[0])\n println(Math.max(Math.max(s, t), u))\n break\n }\n val p = a.size shr 1\n val x = a.subList(0, p)\n val y = a.subList(p, a.size)\n val xx = gcd(x)\n val yy = gcd(y)\n a = if (xx < yy) x.plusElement(yy) else y.plusElement(xx)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1556419858, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s763465121.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s763465121", "user_id": "u051841332"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun gcd(n: Collection): Int {\n var w = n\n while (w.size != 1) {\n val min = w.min()!!\n w = w.map { if (it == min) it else it % min }\n .filter { it != 0 }\n .distinct()\n }\n return w.first()\n}\n\nfun gcd(a: Int, b: Int): Int {\n var x = a\n var y = b\n while (true) {\n if (y < x) {\n val z = x\n x = y\n y = z\n }\n if (x == 0) break\n y %= x\n }\n return y\n}\n\nfun main(args: Array) {\n readLine()\n var a = readLine()!!.split(' ').map(String::toInt)\n while (true) {\n if (a.size == 2) {\n println(a.max())\n break\n } else if (a.size == 3) {\n val s = gcd(a[0], a[1])\n val t = gcd(a[1], a[2])\n val u = gcd(a[2], a[0])\n println(Math.max(Math.max(s, t), u))\n break\n }\n val p = a.size shr 1\n val x = a.subList(0, p)\n val y = a.subList(p, a.size)\n val xx = gcd(x)\n val yy = gcd(y)\n a = if (xx < yy) x.plusElement(yy) else y.plusElement(xx)\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1107, "cpu_time_ms": 633, "memory_kb": 57708}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s208765788", "group_id": "codeNet:p03061", "input_text": "val gcdMem:MutableMap, Int> = mutableMapOf()\n\nfun main(args: Array) {\n val n = Integer.parseInt(readInputLine())\n val vas = readInputLine().split(\" \").map { it -> Integer.parseInt(it) }\n \n var gcds: MutableList = mutableListOf()\n\n // すべての隣接する2数のgcdを求める\n for (i in 0..(n-1)) {\n if (i != n - 1) {\n gcds.add(gcdFirst(vas[i], vas[i + 1]))\n } else {\n gcds.add(gcdFirst(vas[i], vas[0]))\n }\n }\n \n // 求めたすべてのgcd配列の隣接するgcdをすべて求める。\n // 要素が3以下となった際に最も大きい値が求める値。\n while (gcds.size > 3) {\n val tmp = gcds.toList()\n val size = tmp.size\n gcds.clear()\n \n for (i in 0..(size - 1)) {\n if (i != size - 1) {\n gcds.add(gcdFirst(tmp[i], tmp[i + 1]))\n } else {\n gcds.add(gcdFirst(tmp[i], tmp[0]))\n }\n }\n }\n\n println(gcds.sortedDescending()[0])\n}\n \nfun readInputLine(): String {\n return readLine()!!\n}\n\n// gcdのトップ呼び出し関数\nfun gcdFirst(a: Int, b: Int): Int {\n if (a >= b) {\n return gcdMem.getOrElse(Pair(a, b)) {\n val res = gcd(a, b)\n gcdMem[Pair(a, b)] = res\n \n res\n }\n } else {\n return gcdMem.getOrElse(Pair(b, a)) {\n val res = gcd(b, a)\n gcdMem[Pair(b, a)] = res\n \n res\n }\n }\n}\n\n// gcdの実計算関数\ntailrec fun gcd(a: Int, b: Int): Int {\n // a >= b とする。\n if(b == 0) {\n return a\n }\n return gcd(b, a % b)\n}\n", "language": "Kotlin", "metadata": {"date": 1556418964, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s208765788.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s208765788", "user_id": "u505558493"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "val gcdMem:MutableMap, Int> = mutableMapOf()\n\nfun main(args: Array) {\n val n = Integer.parseInt(readInputLine())\n val vas = readInputLine().split(\" \").map { it -> Integer.parseInt(it) }\n \n var gcds: MutableList = mutableListOf()\n\n // すべての隣接する2数のgcdを求める\n for (i in 0..(n-1)) {\n if (i != n - 1) {\n gcds.add(gcdFirst(vas[i], vas[i + 1]))\n } else {\n gcds.add(gcdFirst(vas[i], vas[0]))\n }\n }\n \n // 求めたすべてのgcd配列の隣接するgcdをすべて求める。\n // 要素が3以下となった際に最も大きい値が求める値。\n while (gcds.size > 3) {\n val tmp = gcds.toList()\n val size = tmp.size\n gcds.clear()\n \n for (i in 0..(size - 1)) {\n if (i != size - 1) {\n gcds.add(gcdFirst(tmp[i], tmp[i + 1]))\n } else {\n gcds.add(gcdFirst(tmp[i], tmp[0]))\n }\n }\n }\n\n println(gcds.sortedDescending()[0])\n}\n \nfun readInputLine(): String {\n return readLine()!!\n}\n\n// gcdのトップ呼び出し関数\nfun gcdFirst(a: Int, b: Int): Int {\n if (a >= b) {\n return gcdMem.getOrElse(Pair(a, b)) {\n val res = gcd(a, b)\n gcdMem[Pair(a, b)] = res\n \n res\n }\n } else {\n return gcdMem.getOrElse(Pair(b, a)) {\n val res = gcd(b, a)\n gcdMem[Pair(b, a)] = res\n \n res\n }\n }\n}\n\n// gcdの実計算関数\ntailrec fun gcd(a: Int, b: Int): Int {\n // a >= b とする。\n if(b == 0) {\n return a\n }\n return gcd(b, a % b)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1694, "cpu_time_ms": 2112, "memory_kb": 149000}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s349566410", "group_id": "codeNet:p03061", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val minn = a.min()!!\n var cnt: Int\n if (n == 2) {\n println(a.max()!!)\n return\n }\n for (i in minn downTo 1) {\n cnt = 0\n for (j in 0 until n) {\n if (a[j] % i != 0) {\n cnt++\n if (cnt >= 2) break\n }\n }\n if (cnt <= 1) {\n println(i)\n return\n }\n }\n println(1)\n}\n", "language": "Kotlin", "metadata": {"date": 1556417189, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s349566410.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s349566410", "user_id": "u122997134"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val minn = a.min()!!\n var cnt: Int\n if (n == 2) {\n println(a.max()!!)\n return\n }\n for (i in minn downTo 1) {\n cnt = 0\n for (j in 0 until n) {\n if (a[j] % i != 0) {\n cnt++\n if (cnt >= 2) break\n }\n }\n if (cnt <= 1) {\n println(i)\n return\n }\n }\n println(1)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 520, "cpu_time_ms": 1610, "memory_kb": 57436}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s794496777", "group_id": "codeNet:p03061", "input_text": "import java.util.*\nimport java.math.*\nfun main(args: Array) {\n\n val N = readLine()!!.toInt()\n //val N = readLine()!!.split(\"\").map{it.toInt()}\n val A = readLine()!!.split(\" \").map{it.toLong()}\n //val S = readLine()!!\n\n if (N == 2) {\n println(Math.max(A[0],A[1]))\n return\n }\n\n fun gcd(a:Long,b:Long) :Long{\n if(b == 0L)\n return a\n return gcd(b, a%b)\n }\n\n var ans = longArrayOf(0,0)\n ans[0] = gcd(gcd(A[0],A[1]),A[2])\n ans[1] = longArrayOf(gcd(A[0],A[1]),gcd(A[0],A[2]),gcd(A[1],A[2])).max()!!\n for (i in 3 until N) {\n ans[1] = Math.max(gcd(ans[1],A[i]),ans[0])\n ans[0] = gcd(ans[0],A[i])\n }\n\n\n println(ans.max());\n}\n", "language": "Kotlin", "metadata": {"date": 1556416403, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s794496777.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s794496777", "user_id": "u043557308"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\nimport java.math.*\nfun main(args: Array) {\n\n val N = readLine()!!.toInt()\n //val N = readLine()!!.split(\"\").map{it.toInt()}\n val A = readLine()!!.split(\" \").map{it.toLong()}\n //val S = readLine()!!\n\n if (N == 2) {\n println(Math.max(A[0],A[1]))\n return\n }\n\n fun gcd(a:Long,b:Long) :Long{\n if(b == 0L)\n return a\n return gcd(b, a%b)\n }\n\n var ans = longArrayOf(0,0)\n ans[0] = gcd(gcd(A[0],A[1]),A[2])\n ans[1] = longArrayOf(gcd(A[0],A[1]),gcd(A[0],A[2]),gcd(A[1],A[2])).max()!!\n for (i in 3 until N) {\n ans[1] = Math.max(gcd(ans[1],A[i]),ans[0])\n ans[0] = gcd(ans[0],A[i])\n }\n\n\n println(ans.max());\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 718, "cpu_time_ms": 506, "memory_kb": 57712}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s099571993", "group_id": "codeNet:p03061", "input_text": "fun main(args : Array) {\n val N = readLine()!!.toInt()\n val A = readLine()!!.split(\" \").map { it.toLong() }.toMutableList()\n\n A.sort()\n var replaced = false\n var former = A[0]\n\n val ans = A.reduce { acc, a ->\n var result = gcd(acc, a)\n if (result == 1L && !replaced) {\n result = listOf(gcd(acc, former), gcd(acc, a)).max()!!\n replaced = true\n }\n former = a\n\n result\n }\n\n if (replaced) {\n println(ans)\n } else {\n A [1] = A[0]\n val another = A.reduce { acc, a -> gcd(acc, a)}\n println(another)\n }\n}\n\nfun gcd(a: Long, b: Long): Long {\n return if (b == 0L) a else gcd(b, a % b)\n}", "language": "Kotlin", "metadata": {"date": 1556416356, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s099571993.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s099571993", "user_id": "u861095163"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args : Array) {\n val N = readLine()!!.toInt()\n val A = readLine()!!.split(\" \").map { it.toLong() }.toMutableList()\n\n A.sort()\n var replaced = false\n var former = A[0]\n\n val ans = A.reduce { acc, a ->\n var result = gcd(acc, a)\n if (result == 1L && !replaced) {\n result = listOf(gcd(acc, former), gcd(acc, a)).max()!!\n replaced = true\n }\n former = a\n\n result\n }\n\n if (replaced) {\n println(ans)\n } else {\n A [1] = A[0]\n val another = A.reduce { acc, a -> gcd(acc, a)}\n println(another)\n }\n}\n\nfun gcd(a: Long, b: Long): Long {\n return if (b == 0L) a else gcd(b, a % b)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 701, "cpu_time_ms": 702, "memory_kb": 74244}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s241810032", "group_id": "codeNet:p03061", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val x = mutableListOf()\n val y = mutableListOf()\n for (i in 0 until n step 2) {\n if (i != n - 1) y.add(gcd(a[i], a[i + 1]))\n else y.add(a[i])\n }\n var nn = y.size\n val set = mutableSetOf()\n for (i in 0 until n) {\n x.addAll(y)\n x.add(a[i])\n x.removeAt(i / 2)\n set.add(order(x, nn))\n x.clear()\n }\n println(set.max())\n}\n\nfun order(x: List, n: Int): Int {\n if (n == 1) return x[0]\n val y = mutableListOf()\n for (i in 0 until n step 2) {\n if (i != n - 1) y.add(gcd(x[i], x[i + 1]))\n else y.add(x[i])\n }\n return order(y, y.size)\n}\n\nfun gcd(x: Int, y: Int): Int {\n if (x < y) return gcd(y, x)\n if (y == 0) return x\n return gcd(y, x % y)\n}\n", "language": "Kotlin", "metadata": {"date": 1556416101, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s241810032.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s241810032", "user_id": "u122997134"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val x = mutableListOf()\n val y = mutableListOf()\n for (i in 0 until n step 2) {\n if (i != n - 1) y.add(gcd(a[i], a[i + 1]))\n else y.add(a[i])\n }\n var nn = y.size\n val set = mutableSetOf()\n for (i in 0 until n) {\n x.addAll(y)\n x.add(a[i])\n x.removeAt(i / 2)\n set.add(order(x, nn))\n x.clear()\n }\n println(set.max())\n}\n\nfun order(x: List, n: Int): Int {\n if (n == 1) return x[0]\n val y = mutableListOf()\n for (i in 0 until n step 2) {\n if (i != n - 1) y.add(gcd(x[i], x[i + 1]))\n else y.add(x[i])\n }\n return order(y, y.size)\n}\n\nfun gcd(x: Int, y: Int): Int {\n if (x < y) return gcd(y, x)\n if (y == 0) return x\n return gcd(y, x % y)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 891, "cpu_time_ms": 2111, "memory_kb": 133300}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s188650369", "group_id": "codeNet:p03061", "input_text": "\nfun main(args: Array) {\n var (count) = readLine()!!.split(\" \").map { it.toInt() }\n val values = readLine()!!.split(\" \").map { it.toInt() }\n\n var mx = 0\n\n for (musi in 0 until count) {\n val musiValues = values.filterIndexed { index, i -> index != musi }\n\n var tmp = musiValues[0]\n\n for (tgt in 1 until musiValues.size) {\n tmp = gcd(tmp, musiValues[tgt])\n }\n if (tmp > mx) mx = tmp\n }\n\n print(mx)\n}\n\nfun gcd(a: Int, b: Int): Int {\n if (b == 0) return a\n\n return gcd(b, a % b)\n}\n", "language": "Kotlin", "metadata": {"date": 1556415616, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s188650369.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s188650369", "user_id": "u249910602"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\nfun main(args: Array) {\n var (count) = readLine()!!.split(\" \").map { it.toInt() }\n val values = readLine()!!.split(\" \").map { it.toInt() }\n\n var mx = 0\n\n for (musi in 0 until count) {\n val musiValues = values.filterIndexed { index, i -> index != musi }\n\n var tmp = musiValues[0]\n\n for (tgt in 1 until musiValues.size) {\n tmp = gcd(tmp, musiValues[tgt])\n }\n if (tmp > mx) mx = tmp\n }\n\n print(mx)\n}\n\nfun gcd(a: Int, b: Int): Int {\n if (b == 0) return a\n\n return gcd(b, a % b)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 555, "cpu_time_ms": 2111, "memory_kb": 139688}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s930009741", "group_id": "codeNet:p03061", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val s = Scanner(System.`in`)\n val n = s.nextInt()\n val a = LongArray(n) { s.nextLong() }.sorted()\n if (a.toSet().size == 1) return println(a.first())\n\n val c = LongArray(100000)\n\n var i = 2\n while (i * i < 1000000000L) {\n a.forEach { if (it % i == 0L) c[i]++ }\n i++\n }\n\n val ret = c.indexOfLast { it == n - 1L }.toLong()\n\n println(ret)\n}", "language": "Kotlin", "metadata": {"date": 1556415101, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s930009741.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s930009741", "user_id": "u153537680"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val s = Scanner(System.`in`)\n val n = s.nextInt()\n val a = LongArray(n) { s.nextLong() }.sorted()\n if (a.toSet().size == 1) return println(a.first())\n\n val c = LongArray(100000)\n\n var i = 2\n while (i * i < 1000000000L) {\n a.forEach { if (it % i == 0L) c[i]++ }\n i++\n }\n\n val ret = c.indexOfLast { it == n - 1L }.toLong()\n\n println(ret)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 434, "cpu_time_ms": 2111, "memory_kb": 55872}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s647242059", "group_id": "codeNet:p03061", "input_text": "fun main(args: Array) {\n var a = 0\n val n = readLine()!!.toInt()\n val l = readLine()!!.split(\" \").map { it.toInt() }\n for(i in 1 .. l.max()!!){\n if(l.filter{ it % i != 0}.count() <= 1){\n a = i\n }\n }\n println(a)\n}\n", "language": "Kotlin", "metadata": {"date": 1556414523, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03061.html", "problem_id": "p03061", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03061/input.txt", "sample_output_relpath": "derived/input_output/data/p03061/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03061/Kotlin/s647242059.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s647242059", "user_id": "u227189389"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n var a = 0\n val n = readLine()!!.toInt()\n val l = readLine()!!.split(\" \").map { it.toInt() }\n for(i in 1 .. l.max()!!){\n if(l.filter{ it % i != 0}.count() <= 1){\n a = i\n }\n }\n println(a)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "sample_input": "3\n7 6 8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03061", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on the blackboard.\n\nYou will choose one of them and replace it with an integer of your choice between 1 and 10^9 (inclusive), possibly the same as the integer originally written.\n\nFind the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nOutput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible greatest common divisor of the N integers on the blackboard after your move.\n\nSample Input 1\n\n3\n7 6 8\n\nSample Output 1\n\n2\n\nIf we replace 7 with 4, the greatest common divisor of the three integers on the blackboard will be 2, which is the maximum possible value.\n\nSample Input 2\n\n3\n12 15 18\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2\n1000000000 1000000000\n\nSample Output 3\n\n1000000000\n\nWe can replace an integer with itself.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 264, "cpu_time_ms": 2111, "memory_kb": 122952}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s905456279", "group_id": "codeNet:p03105", "input_text": "fun main (args : Array) {\n\tval (a, b, c) = readLine()!!.split(\" \").map(String::toInt)\n\tval A : Int = a.toInt()\n\tval B : Int = b.toInt()\n\tval C : Int = c.toInt()\n\tvar count : Int = 0\n\tfor (i in 1..C) {\n\t\tif ((A * i) <= B) {\n\t\t\tcount++\n\t\t}\n\t}\n\tprintln(\"${count}\")\n}", "language": "Kotlin", "metadata": {"date": 1559639413, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Kotlin/s905456279.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s905456279", "user_id": "u651257341"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main (args : Array) {\n\tval (a, b, c) = readLine()!!.split(\" \").map(String::toInt)\n\tval A : Int = a.toInt()\n\tval B : Int = b.toInt()\n\tval C : Int = c.toInt()\n\tvar count : Int = 0\n\tfor (i in 1..C) {\n\t\tif ((A * i) <= B) {\n\t\t\tcount++\n\t\t}\n\t}\n\tprintln(\"${count}\")\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 271, "cpu_time_ms": 239, "memory_kb": 36012}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s540648174", "group_id": "codeNet:p03105", "input_text": "fun main(args: Array) {\n var (a,b,c) = readLine()!!.split(\" \").map(String::toInt)\n println((b/a).toInt())\n \n}\n", "language": "Kotlin", "metadata": {"date": 1551643407, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03105.html", "problem_id": "p03105", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03105/input.txt", "sample_output_relpath": "derived/input_output/data/p03105/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03105/Kotlin/s540648174.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s540648174", "user_id": "u399261731"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "fun main(args: Array) {\n var (a,b,c) = readLine()!!.split(\" \").map(String::toInt)\n println((b/a).toInt())\n \n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "sample_input": "2 11 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03105", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi likes the sound when he buys a drink from a vending machine.\n\nThat sound can be heard by spending A yen (the currency of Japan) each time.\n\nTakahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.\n\nHow many times will he hear the sound?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times Takahashi will hear his favorite sound.\n\nSample Input 1\n\n2 11 4\n\nSample Output 1\n\n4\n\nSince he has not less than 8 yen, he will hear the sound four times and be satisfied.\n\nSample Input 2\n\n3 9 5\n\nSample Output 2\n\n3\n\nHe may not be able to be satisfied.\n\nSample Input 3\n\n100 1 10\n\nSample Output 3\n\n0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 127, "cpu_time_ms": 240, "memory_kb": 38124}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s051160209", "group_id": "codeNet:p03160", "input_text": "import kotlin.math.abs\nimport kotlin.math.min\n\nfun main() {\n val n = readLine()!!.toInt()\n val h = readLine()!!.split(\" \").map { it.toInt() }\n\n val dp = IntArray(n + 1) { 0 }\n dp[2] = abs(h[1] - h[0])\n\n for (i in 3..n) {\n dp[i] = min(dp[i - 1] + abs(h[i - 1] - h[i - 2]), dp[i - 2] + abs(h[i - 1] - h[i - 3]))\n }\n println(dp[n])\n}", "language": "Kotlin", "metadata": {"date": 1600631602, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s051160209.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s051160209", "user_id": "u697467902"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "import kotlin.math.abs\nimport kotlin.math.min\n\nfun main() {\n val n = readLine()!!.toInt()\n val h = readLine()!!.split(\" \").map { it.toInt() }\n\n val dp = IntArray(n + 1) { 0 }\n dp[2] = abs(h[1] - h[0])\n\n for (i in 3..n) {\n dp[i] = min(dp[i - 1] + abs(h[i - 1] - h[i - 2]), dp[i - 2] + abs(h[i - 1] - h[i - 3]))\n }\n println(dp[n])\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 358, "cpu_time_ms": 301, "memory_kb": 49976}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s813595561", "group_id": "codeNet:p03160", "input_text": "import kotlin.math.abs\n\nfun main() {\n val n = readLine()!!.toInt()\n val h = readLine()!!.split(\" \").map { it.toInt() }.toTypedArray()\n\n val dp = Array(n) { -1 }\n\n print(dfs(0, dp, h, n))\n}\n\nfun dfs(pos:Int, dp:Array, h:Array, n:Int): Int {\n if (pos >= n) {\n return 9999999\n }\n\n if (pos == n - 1) {\n return 0\n }\n\n if (dp[pos] != -1) {\n return dp[pos]\n }\n\n val step1 = dfs(pos + 1, dp, h, n) + abs(h[pos + 1].minus(h[pos]))\n\n val step2 = if (pos + 2 == n) {\n dfs(pos + 2, dp, h, n)\n } else {\n dfs(pos + 2, dp, h, n) + abs(h[pos + 2] - h[pos])\n }\n/*\n println(dp.toList())\n println(pos)\n println(\"step1:$step1\")\n println(\"step2:$step2\")\n\n */\n\n val min = step1.coerceAtMost(step2)\n dp[pos] = min\n\n return min\n}", "language": "Kotlin", "metadata": {"date": 1599859074, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s813595561.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s813595561", "user_id": "u542748657"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "import kotlin.math.abs\n\nfun main() {\n val n = readLine()!!.toInt()\n val h = readLine()!!.split(\" \").map { it.toInt() }.toTypedArray()\n\n val dp = Array(n) { -1 }\n\n print(dfs(0, dp, h, n))\n}\n\nfun dfs(pos:Int, dp:Array, h:Array, n:Int): Int {\n if (pos >= n) {\n return 9999999\n }\n\n if (pos == n - 1) {\n return 0\n }\n\n if (dp[pos] != -1) {\n return dp[pos]\n }\n\n val step1 = dfs(pos + 1, dp, h, n) + abs(h[pos + 1].minus(h[pos]))\n\n val step2 = if (pos + 2 == n) {\n dfs(pos + 2, dp, h, n)\n } else {\n dfs(pos + 2, dp, h, n) + abs(h[pos + 2] - h[pos])\n }\n/*\n println(dp.toList())\n println(pos)\n println(\"step1:$step1\")\n println(\"step2:$step2\")\n\n */\n\n val min = step1.coerceAtMost(step2)\n dp[pos] = min\n\n return min\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 813, "cpu_time_ms": 342, "memory_kb": 52088}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s277922046", "group_id": "codeNet:p03160", "input_text": "import kotlin.math.abs\nimport kotlin.math.min\n\nimport java.util.*\n\nprivate val WHITESPACE = \"\\\\s+\".toRegex()\n\nprivate fun readLn() = readLine()!!\nprivate fun readList() = readLn().split(WHITESPACE)\n\n// helps split strings into multiple tokens\nprivate var tokenizer = StringTokenizer(\"\")\nprivate fun read(): String {\n while (tokenizer.hasMoreTokens().not()) tokenizer = StringTokenizer(readLn(), \" \")\n return tokenizer.nextToken()\n}\n\nprivate fun readInt() = read().toInt()\nprivate fun readLong() = read().toLong()\nprivate fun readDouble() = read().toDouble()\n\nprivate fun readIntList() = readList().map { it.toInt() }\nprivate fun readLongList() = readList().map { it.toLong() }\nprivate fun readDoubleList() = readList().map { it.toDouble() }\n\nprivate fun readIntArray(n: Int = 0) =\n if (n == 0) readList().run { IntArray(size) { get(it).toInt() } } else IntArray(n) { readInt() }\n\nval cache = IntArray(1000000) { -1 }\n\nfun main() {\n val n = readInt()\n val h = readIntArray()\n\n cache[0] = 0\n cache[1] = abs(h[0] - h[1])\n\n println(cost(n, h))\n}\n\nprivate fun cost(n:Int, h: IntArray): Int {\n if (n == 1) return 0\n if (n == 2) return abs(h[0] - h[1])\n\n if (cache[n-1] < 0) {\n val delta1 = abs(h[n-1] - h[n-2])\n val delta2 = abs(h[n-1] - h[n-3])\n val c = min(cost(n-1, h) + delta1, cost(n-2, h) + delta2)\n cache[n-1] = c\n return c\n }\n return cache[n-1]\n}", "language": "Kotlin", "metadata": {"date": 1598292000, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s277922046.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s277922046", "user_id": "u632768540"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "import kotlin.math.abs\nimport kotlin.math.min\n\nimport java.util.*\n\nprivate val WHITESPACE = \"\\\\s+\".toRegex()\n\nprivate fun readLn() = readLine()!!\nprivate fun readList() = readLn().split(WHITESPACE)\n\n// helps split strings into multiple tokens\nprivate var tokenizer = StringTokenizer(\"\")\nprivate fun read(): String {\n while (tokenizer.hasMoreTokens().not()) tokenizer = StringTokenizer(readLn(), \" \")\n return tokenizer.nextToken()\n}\n\nprivate fun readInt() = read().toInt()\nprivate fun readLong() = read().toLong()\nprivate fun readDouble() = read().toDouble()\n\nprivate fun readIntList() = readList().map { it.toInt() }\nprivate fun readLongList() = readList().map { it.toLong() }\nprivate fun readDoubleList() = readList().map { it.toDouble() }\n\nprivate fun readIntArray(n: Int = 0) =\n if (n == 0) readList().run { IntArray(size) { get(it).toInt() } } else IntArray(n) { readInt() }\n\nval cache = IntArray(1000000) { -1 }\n\nfun main() {\n val n = readInt()\n val h = readIntArray()\n\n cache[0] = 0\n cache[1] = abs(h[0] - h[1])\n\n println(cost(n, h))\n}\n\nprivate fun cost(n:Int, h: IntArray): Int {\n if (n == 1) return 0\n if (n == 2) return abs(h[0] - h[1])\n\n if (cache[n-1] < 0) {\n val delta1 = abs(h[n-1] - h[n-2])\n val delta2 = abs(h[n-1] - h[n-3])\n val c = min(cost(n-1, h) + delta1, cost(n-2, h) + delta2)\n cache[n-1] = c\n return c\n }\n return cache[n-1]\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1422, "cpu_time_ms": 353, "memory_kb": 52776}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s565372601", "group_id": "codeNet:p03160", "input_text": "import kotlin.math.*\n\nfun main() {\n val N = Integer.parseInt(readLine()!!) - 1\n val h = readLine()!!.split(\" \").map(Integer::parseInt)\n\n fun solver (n: Int = 0): Int {\n if (n == N) {\n return 0\n }\n val c1 = abs(h[n] - h[n + 1]) + solver(n + 1)\n val c2 = if (n + 2 <= N) {\n abs(h[n] - h[n + 2]) + solver(n + 2)\n } else {\n return c1\n }\n return min(c1, c2)\n }\n\n println(solver())\n}\n", "language": "Kotlin", "metadata": {"date": 1595157732, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s565372601.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s565372601", "user_id": "u811097925"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "import kotlin.math.*\n\nfun main() {\n val N = Integer.parseInt(readLine()!!) - 1\n val h = readLine()!!.split(\" \").map(Integer::parseInt)\n\n fun solver (n: Int = 0): Int {\n if (n == N) {\n return 0\n }\n val c1 = abs(h[n] - h[n + 1]) + solver(n + 1)\n val c2 = if (n + 2 <= N) {\n abs(h[n] - h[n + 2]) + solver(n + 2)\n } else {\n return c1\n }\n return min(c1, c2)\n }\n\n println(solver())\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 419, "cpu_time_ms": 337, "memory_kb": 51304}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s958469082", "group_id": "codeNet:p03160", "input_text": "import kotlin.math.abs\nimport kotlin.math.min\n\nfun main() {\n val n = readLine()!!.toInt()\n val h = readLine()!!.split(' ').map { it.toInt() }\n val dp = IntArray(n+1){1000000001}\n dp[0] = 0\n dp[1] = abs(h[0]-h[1])\n\n for(i in 2 until n){\n dp[i] = min(dp[i], min(dp[i-1] + abs(h[i]-h[i-1]), dp[i-2]+ abs(h[i]-h[i-2])))\n }\n println(dp[n-1])\n}", "language": "Kotlin", "metadata": {"date": 1593093591, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s958469082.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s958469082", "user_id": "u323881321"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "import kotlin.math.abs\nimport kotlin.math.min\n\nfun main() {\n val n = readLine()!!.toInt()\n val h = readLine()!!.split(' ').map { it.toInt() }\n val dp = IntArray(n+1){1000000001}\n dp[0] = 0\n dp[1] = abs(h[0]-h[1])\n\n for(i in 2 until n){\n dp[i] = min(dp[i], min(dp[i-1] + abs(h[i]-h[i-1]), dp[i-2]+ abs(h[i]-h[i-2])))\n }\n println(dp[n-1])\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 349, "cpu_time_ms": 309, "memory_kb": 50008}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s103556093", "group_id": "codeNet:p03160", "input_text": "import java.io.PrintWriter\nimport java.lang.Math.*\nimport java.util.*\n\nval pw = PrintWriter(System.out)\nval sc = Scanner(System.`in`)\n\nval inf = 1000000000\n\nfun main(args: Array) {\n val n = nextInt()\n val h = nextListOfInt()\n val dp = Array(n+1){inf}\n dp[0] = 0\n for(i in 1 until n){\n dp[i] = min(dp[i], dp[i-1] + abs(h[i] - h[i-1]))\n if(i > 1) dp[i] = min(dp[i], dp[i-2] + abs(h[i] - h[i-2]))\n }\n println(dp[n-1])\n}\n\nfun abc000a() {\n}\n\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextListOfString() = next().split(\" \")\nfun nextListOfInt() = nextListOfString().map { it.toInt() }\nfun nextListOfLong() = nextListOfString().map { it.toLong() }\nfun nextListOfDouble() = nextListOfString().map { it.toDouble() }", "language": "Kotlin", "metadata": {"date": 1590926670, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s103556093.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s103556093", "user_id": "u240901574"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.lang.Math.*\nimport java.util.*\n\nval pw = PrintWriter(System.out)\nval sc = Scanner(System.`in`)\n\nval inf = 1000000000\n\nfun main(args: Array) {\n val n = nextInt()\n val h = nextListOfInt()\n val dp = Array(n+1){inf}\n dp[0] = 0\n for(i in 1 until n){\n dp[i] = min(dp[i], dp[i-1] + abs(h[i] - h[i-1]))\n if(i > 1) dp[i] = min(dp[i], dp[i-2] + abs(h[i] - h[i-2]))\n }\n println(dp[n-1])\n}\n\nfun abc000a() {\n}\n\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextListOfString() = next().split(\" \")\nfun nextListOfInt() = nextListOfString().map { it.toInt() }\nfun nextListOfLong() = nextListOfString().map { it.toLong() }\nfun nextListOfDouble() = nextListOfString().map { it.toDouble() }", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 838, "cpu_time_ms": 522, "memory_kb": 49972}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s536699924", "group_id": "codeNet:p03160", "input_text": "import java.lang.Math.*\n\nfun main(args: Array) {\n val N = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map{it.toInt()}\n var prev = 0\n var prev2 = 1000000000\n var now = 0\n for(i in 1 until N) {\n now = min(prev + abs(a[i] - a[i-1]), if(i > 1)prev2 + abs(a[i] - a[i-2]) else prev2)\n prev2 = prev\n prev = now\n }\n println(now)\n}\n", "language": "Kotlin", "metadata": {"date": 1586441353, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s536699924.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s536699924", "user_id": "u616477808"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "import java.lang.Math.*\n\nfun main(args: Array) {\n val N = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map{it.toInt()}\n var prev = 0\n var prev2 = 1000000000\n var now = 0\n for(i in 1 until N) {\n now = min(prev + abs(a[i] - a[i-1]), if(i > 1)prev2 + abs(a[i] - a[i-2]) else prev2)\n prev2 = prev\n prev = now\n }\n println(now)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 386, "cpu_time_ms": 493, "memory_kb": 50692}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s184458765", "group_id": "codeNet:p03160", "input_text": "fun main(args: Array) {\n val n = readInteger()\n val hs = readLongList()\n val dp = Array(n) { 10000000000 }\n dp[0] = 0\n for (i in 0 until (n - 1)) {\n dp[i + 1] = Math.min(dp[i + 1], dp[i] + Math.abs(hs[i + 1] - hs[i]))\n if (i < n - 2) {\n dp[i + 2] = Math.min(dp[i + 2], dp[i] + Math.abs(hs[i + 2] - hs[i]))\n }\n }\n println(dp[n - 1])\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "language": "Kotlin", "metadata": {"date": 1584700140, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s184458765.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s184458765", "user_id": "u784448849"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readInteger()\n val hs = readLongList()\n val dp = Array(n) { 10000000000 }\n dp[0] = 0\n for (i in 0 until (n - 1)) {\n dp[i + 1] = Math.min(dp[i + 1], dp[i] + Math.abs(hs[i + 1] - hs[i]))\n if (i < n - 2) {\n dp[i + 2] = Math.min(dp[i + 2], dp[i] + Math.abs(hs[i + 2] - hs[i]))\n }\n }\n println(dp[n - 1])\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 641, "cpu_time_ms": 521, "memory_kb": 55568}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s635739760", "group_id": "codeNet:p03160", "input_text": "package Atcoder\n\nimport java.util.*\n\n// https://atcoder.jp/contests/dp/tasks/dp_a\nfun main(args: Array) {\n\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val heights = IntArray(n)\n for(i in 0 until n){\n heights[i] = sc.nextInt()\n }\n\n val dp = IntArray(n)\n dp[1] = Math.abs(heights[0] - heights[1])\n for(i in 2 until n) {\n dp[i] = Math.min(dp[i-1] + Math.abs(heights[i] - heights[i-1]), dp[i-2] + Math.abs(heights[i] - heights[i-2]))\n }\n\n println(dp[n-1])\n\n\n}\n\n", "language": "Kotlin", "metadata": {"date": 1582403497, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s635739760.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s635739760", "user_id": "u049930986"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "package Atcoder\n\nimport java.util.*\n\n// https://atcoder.jp/contests/dp/tasks/dp_a\nfun main(args: Array) {\n\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val heights = IntArray(n)\n for(i in 0 until n){\n heights[i] = sc.nextInt()\n }\n\n val dp = IntArray(n)\n dp[1] = Math.abs(heights[0] - heights[1])\n for(i in 2 until n) {\n dp[i] = Math.min(dp[i-1] + Math.abs(heights[i] - heights[i-1]), dp[i-2] + Math.abs(heights[i] - heights[i-2]))\n }\n\n println(dp[n-1])\n\n\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 519, "cpu_time_ms": 159, "memory_kb": 31140}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s723534473", "group_id": "codeNet:p03160", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val h = readLine()!!.split(' ').map { it.toInt() }\n val dp = IntArray(n) { Int.MAX_VALUE }\n dp[0] = 0\n dp[1] = Math.abs(h[1] - h[0])\n for (i in 2 until n) {\n dp[i] = Math.min(dp[i - 2] + Math.abs(h[i - 2] - h[i]), dp[i - 1] + Math.abs(h[i - 1] - h[i]))\n }\n println(dp[n - 1])\n}\n", "language": "Kotlin", "metadata": {"date": 1581479537, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s723534473.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s723534473", "user_id": "u863309603"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val h = readLine()!!.split(' ').map { it.toInt() }\n val dp = IntArray(n) { Int.MAX_VALUE }\n dp[0] = 0\n dp[1] = Math.abs(h[1] - h[0])\n for (i in 2 until n) {\n dp[i] = Math.min(dp[i - 2] + Math.abs(h[i - 2] - h[i]), dp[i - 1] + Math.abs(h[i - 1] - h[i]))\n }\n println(dp[n - 1])\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 372, "cpu_time_ms": 476, "memory_kb": 50620}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s848450755", "group_id": "codeNet:p03160", "input_text": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val hn = readLine()!!.split(\" \").map(String::toInt)\n\n val dp = IntArray(N) { Integer.MAX_VALUE }\n dp[0] = 0\n dp[1] = Math.abs(hn[0] - hn[1])\n for (i in 2 until N) {\n dp[i] = Math.min(Math.abs(hn[i] - hn[i - 1]) + dp[i - 1], Math.abs(hn[i] - hn[i - 2]) + dp[i - 2])\n }\n// println(dp.joinToString(\",\"))\n println(dp.last())\n\n}\n", "language": "Kotlin", "metadata": {"date": 1578521882, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s848450755.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848450755", "user_id": "u085288971"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val hn = readLine()!!.split(\" \").map(String::toInt)\n\n val dp = IntArray(N) { Integer.MAX_VALUE }\n dp[0] = 0\n dp[1] = Math.abs(hn[0] - hn[1])\n for (i in 2 until N) {\n dp[i] = Math.min(Math.abs(hn[i] - hn[i - 1]) + dp[i - 1], Math.abs(hn[i] - hn[i - 2]) + dp[i - 2])\n }\n// println(dp.joinToString(\",\"))\n println(dp.last())\n\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 421, "cpu_time_ms": 502, "memory_kb": 48900}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s991709218", "group_id": "codeNet:p03160", "input_text": "private var N: Int = 0\nprivate var h: List = emptyList()\nprivate var INF = Long.MAX_VALUE\nprivate val memo = mutableMapOf()\n\nfun main(args: Array) {\n N = readLine()!!.toInt()\n h = readLine()!!.split(\" \").map(String::toInt)\n\n println(jump(N - 1))\n\n}\n\nprivate fun jump(i: Int): Long {\n\n if (memo.containsKey(i)) {\n return memo[i]!!\n }\n\n if (i == 0) {\n return 0\n }\n\n var res = INF\n\n // 足場 i-1 から来た場合\n res = Math.min(res, jump(i - 1) + Math.abs(h[i] - h[i - 1]))\n\n // 足場 i-2 から来た場合\n if (i > 1) {\n res = Math.min(res, jump(i - 2) + Math.abs(h[i] - h[i - 2]))\n }\n\n memo[i] = res\n return res\n}\n", "language": "Kotlin", "metadata": {"date": 1565892106, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s991709218.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s991709218", "user_id": "u085288971"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "private var N: Int = 0\nprivate var h: List = emptyList()\nprivate var INF = Long.MAX_VALUE\nprivate val memo = mutableMapOf()\n\nfun main(args: Array) {\n N = readLine()!!.toInt()\n h = readLine()!!.split(\" \").map(String::toInt)\n\n println(jump(N - 1))\n\n}\n\nprivate fun jump(i: Int): Long {\n\n if (memo.containsKey(i)) {\n return memo[i]!!\n }\n\n if (i == 0) {\n return 0\n }\n\n var res = INF\n\n // 足場 i-1 から来た場合\n res = Math.min(res, jump(i - 1) + Math.abs(h[i] - h[i - 1]))\n\n // 足場 i-2 から来た場合\n if (i > 1) {\n res = Math.min(res, jump(i - 2) + Math.abs(h[i] - h[i - 2]))\n }\n\n memo[i] = res\n return res\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 709, "cpu_time_ms": 1538, "memory_kb": 85256}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s815846675", "group_id": "codeNet:p03160", "input_text": "private var N: Int = 0\nprivate var h: List = emptyList()\nprivate var INF = 10000000\nprivate val memo = mutableMapOf()\n\nfun main(args: Array) {\n N = readLine()!!.toInt()\n h = readLine()!!.split(\" \").map(String::toInt)\n\n println(jump(N - 1))\n\n}\n\nprivate fun jump(i: Int): Int {\n\n if (memo.containsKey(i)) {\n return memo[i]!!\n }\n\n if (i == 0) {\n return 0\n }\n var res = INF\n // 足場 i-1 から来た場合\n res = Math.min(res, jump(i - 1) + Math.abs(h[i] - h[i - 1]))\n if (i > 1) {\n // 足場 i-2 から来た場合\n res = Math.min(res, jump(i - 2) + Math.abs(h[i] - h[i - 2]))\n }\n\n memo[i] = res\n return res\n}\n", "language": "Kotlin", "metadata": {"date": 1565887639, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s815846675.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s815846675", "user_id": "u085288971"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "private var N: Int = 0\nprivate var h: List = emptyList()\nprivate var INF = 10000000\nprivate val memo = mutableMapOf()\n\nfun main(args: Array) {\n N = readLine()!!.toInt()\n h = readLine()!!.split(\" \").map(String::toInt)\n\n println(jump(N - 1))\n\n}\n\nprivate fun jump(i: Int): Int {\n\n if (memo.containsKey(i)) {\n return memo[i]!!\n }\n\n if (i == 0) {\n return 0\n }\n var res = INF\n // 足場 i-1 から来た場合\n res = Math.min(res, jump(i - 1) + Math.abs(h[i] - h[i - 1]))\n if (i > 1) {\n // 足場 i-2 から来た場合\n res = Math.min(res, jump(i - 2) + Math.abs(h[i] - h[i - 2]))\n }\n\n memo[i] = res\n return res\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 702, "cpu_time_ms": 975, "memory_kb": 86164}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s500066936", "group_id": "codeNet:p03160", "input_text": "private fun readInts() = readLine()!!.split(\" \").map(String::toInt)\n\nfun main(args: Array) {\n val (N) = readInts()\n val h = readInts()\n\n val costs = Array(N) { 0 }\n costs[0] = 0\n costs[1] = Math.abs(h[1] - h[0])\n\n (2 until N).forEach { index ->\n val cost = Math.abs(h[index] - h[index - 1])\n costs[index] = cost + setOf(costs[index - 1], costs[index - 2]).min()!!\n }\n\n println(costs[N - 1]) // 0-indexed\n}", "language": "Kotlin", "metadata": {"date": 1563017084, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s500066936.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s500066936", "user_id": "u963316883"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "private fun readInts() = readLine()!!.split(\" \").map(String::toInt)\n\nfun main(args: Array) {\n val (N) = readInts()\n val h = readInts()\n\n val costs = Array(N) { 0 }\n costs[0] = 0\n costs[1] = Math.abs(h[1] - h[0])\n\n (2 until N).forEach { index ->\n val cost = Math.abs(h[index] - h[index - 1])\n costs[index] = cost + setOf(costs[index - 1], costs[index - 2]).min()!!\n }\n\n println(costs[N - 1]) // 0-indexed\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 455, "cpu_time_ms": 699, "memory_kb": 60540}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s759688262", "group_id": "codeNet:p03160", "input_text": "fun main(args: Array) {\n val N = readLine()?.toInt() ?: 0\n val steps\n = readLine()!!.split(\" \").map(String::toInt)\n var costs = listOf(0).toMutableList()\n for ((i, v) in steps.withIndex()) {\n if (i < 1) {\n continue\n }\n val oneStepCost = Math.abs(steps[i-1] - v)\n val twoStepCost =\n if (i < 2) Int.MAX_VALUE else Math.abs(steps[i-2] - v)\n\n val bestMove =\n if (oneStepCost < twoStepCost)\n oneStepCost + costs[i-1]\n else\n twoStepCost + costs[i-2]\n costs.add(bestMove)\n }\n println(costs.last())\n}", "language": "Kotlin", "metadata": {"date": 1559511276, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s759688262.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s759688262", "user_id": "u529787332"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()?.toInt() ?: 0\n val steps\n = readLine()!!.split(\" \").map(String::toInt)\n var costs = listOf(0).toMutableList()\n for ((i, v) in steps.withIndex()) {\n if (i < 1) {\n continue\n }\n val oneStepCost = Math.abs(steps[i-1] - v)\n val twoStepCost =\n if (i < 2) Int.MAX_VALUE else Math.abs(steps[i-2] - v)\n\n val bestMove =\n if (oneStepCost < twoStepCost)\n oneStepCost + costs[i-1]\n else\n twoStepCost + costs[i-2]\n costs.add(bestMove)\n }\n println(costs.last())\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 645, "cpu_time_ms": 515, "memory_kb": 50000}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s165783030", "group_id": "codeNet:p03160", "input_text": "fun main(args: Array) {\n val N = readLine()?.toInt() ?: 0\n val steps\n = readLine()!!.split(\" \").map(String::toInt)\n var costs = listOf(0).toMutableList()\n for ((i, v) in steps.withIndex()) {\n if (i < 1) {\n continue\n }\n val oneStepCost = Math.abs(steps[i-1] - v)\n val twoStepCost =\n if (i < 2) Int.MAX_VALUE else Math.abs(steps[i-2] - v)\n\n val bestMove =\n if (oneStepCost < twoStepCost)\n oneStepCost + costs[i-1]\n else\n twoStepCost + costs[i-2]\n costs.add(bestMove)\n }\n println(costs.last())\n}", "language": "Kotlin", "metadata": {"date": 1559510290, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s165783030.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s165783030", "user_id": "u529787332"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()?.toInt() ?: 0\n val steps\n = readLine()!!.split(\" \").map(String::toInt)\n var costs = listOf(0).toMutableList()\n for ((i, v) in steps.withIndex()) {\n if (i < 1) {\n continue\n }\n val oneStepCost = Math.abs(steps[i-1] - v)\n val twoStepCost =\n if (i < 2) Int.MAX_VALUE else Math.abs(steps[i-2] - v)\n\n val bestMove =\n if (oneStepCost < twoStepCost)\n oneStepCost + costs[i-1]\n else\n twoStepCost + costs[i-2]\n costs.add(bestMove)\n }\n println(costs.last())\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 645, "cpu_time_ms": 516, "memory_kb": 50036}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s089311458", "group_id": "codeNet:p03160", "input_text": "import java.lang.Math.abs\nimport java.lang.Math.min\n\nfun main(args: Array) {\n val n = readLine()!!.toInt()\n val hs = readLine()!!.split(\" \").map(String::toInt)\n\n val inf = 10000000000;\n\n var dp = Array(n) { inf }\n dp[0] = 0\n\n for (index in 0 until n) {\n for (i in index + 1..index + 2) {\n if (i < n)\n dp[i] = min(dp[i], dp[index] + abs(hs[i] - hs[index]));\n }\n }\n\n println(dp.last())\n}", "language": "Kotlin", "metadata": {"date": 1546901928, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03160.html", "problem_id": "p03160", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03160/input.txt", "sample_output_relpath": "derived/input_output/data/p03160/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03160/Kotlin/s089311458.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s089311458", "user_id": "u207917850"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "import java.lang.Math.abs\nimport java.lang.Math.min\n\nfun main(args: Array) {\n val n = readLine()!!.toInt()\n val hs = readLine()!!.split(\" \").map(String::toInt)\n\n val inf = 10000000000;\n\n var dp = Array(n) { inf }\n dp[0] = 0\n\n for (index in 0 until n) {\n for (i in index + 1..index + 2) {\n if (i < n)\n dp[i] = min(dp[i], dp[index] + abs(hs[i] - hs[index]));\n }\n }\n\n println(dp.last())\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "sample_input": "4\n10 30 40 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03160", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to Stone i + 1 or Stone i + 2. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n4\n10 30 40 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 4, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n2\n10 10\n\nSample Output 2\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 3\n\n6\n30 10 60 10 60 50\n\nSample Output 3\n\n40\n\nIf we follow the path 1 → 3 → 5 → 6, the total cost incurred would be |30 - 60| + |60 - 60| + |60 - 50| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 457, "cpu_time_ms": 546, "memory_kb": 54016}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s871473491", "group_id": "codeNet:p03161", "input_text": "import kotlin.math.*\n\nprivate fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() //single long\nprivate fun readDouble() = readLn().toDouble() //single double\n\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map { it.toInt() } // list of ints\nprivate fun readLongs() = readStrings().map{it.toLong()} // list of longs\nprivate fun readDoubles() = readStrings().map { it.toDouble() } // list of doubles\n\nfun main(){\n val (n, k) = readInts()\n val height = readInts()\n\n val dp = IntArray(n){Int.MAX_VALUE}\n dp[0] = 0\n dp[1] = abs(height[1] - height[0])\n\n for(i in 2 until n){\n if(i - k < 0){\n for(j in 0 until i){\n dp[i] = min(dp[i], abs(height[i] - height[j])+ dp[j])\n }\n }else{\n for(j in i-k until i){\n dp[i] = min(dp[i], abs(height[i] - height[j]) + dp[j])\n }\n }\n }\n\n println(dp[n-1])\n}", "language": "Kotlin", "metadata": {"date": 1600610557, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Kotlin/s871473491.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s871473491", "user_id": "u059982665"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "import kotlin.math.*\n\nprivate fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() //single long\nprivate fun readDouble() = readLn().toDouble() //single double\n\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map { it.toInt() } // list of ints\nprivate fun readLongs() = readStrings().map{it.toLong()} // list of longs\nprivate fun readDoubles() = readStrings().map { it.toDouble() } // list of doubles\n\nfun main(){\n val (n, k) = readInts()\n val height = readInts()\n\n val dp = IntArray(n){Int.MAX_VALUE}\n dp[0] = 0\n dp[1] = abs(height[1] - height[0])\n\n for(i in 2 until n){\n if(i - k < 0){\n for(j in 0 until i){\n dp[i] = min(dp[i], abs(height[i] - height[j])+ dp[j])\n }\n }else{\n for(j in i-k until i){\n dp[i] = min(dp[i], abs(height[i] - height[j]) + dp[j])\n }\n }\n }\n\n println(dp[n-1])\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1050, "cpu_time_ms": 389, "memory_kb": 51224}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s685408539", "group_id": "codeNet:p03161", "input_text": "import kotlin.math.*\nimport kotlin.system.exitProcess\n\nprivate fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() //single long\nprivate fun readDouble() = readLn().toDouble() //single double\n\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map { it.toInt() } // list of ints\nprivate fun readLongs() = readStrings().map{it.toLong()} // list of longs\nprivate fun readDoubles() = readStrings().map { it.toDouble() } // list of doubles\n\nfun main(){\n val (n, k) = readInts()\n val h = readLongs()\n\n val inf = Long.MAX_VALUE\n val dp = LongArray(n){inf}\n\n dp[0] = 0\n\n dp[0] = 0 //初期位置にいる時はコスト0\n\n //２つ目の足場は特例\n dp[1] = abs(h[0] - h[1])\n if(n == 2){\n println(dp[1])\n exitProcess(0)\n }\n\n for(i in 2 until n){\n if(i-k <= 0){\n //0~(i-1)までループ\n for(j in 0..i-1){\n dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]))\n }\n }else{\n //k回ループ\n for(j in 1..k){\n dp[i] = min(dp[i], dp[i-j] + abs(h[i-j] - h[i]))\n }\n }\n\n }\n\n println(dp[n-1])\n}", "language": "Kotlin", "metadata": {"date": 1598476485, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Kotlin/s685408539.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s685408539", "user_id": "u481892956"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "import kotlin.math.*\nimport kotlin.system.exitProcess\n\nprivate fun readLn() = readLine()!! // string line\nprivate fun readInt() = readLn().toInt() // single int\nprivate fun readLong() = readLn().toLong() //single long\nprivate fun readDouble() = readLn().toDouble() //single double\n\nprivate fun readStrings() = readLn().split(\" \") // list of strings\nprivate fun readInts() = readStrings().map { it.toInt() } // list of ints\nprivate fun readLongs() = readStrings().map{it.toLong()} // list of longs\nprivate fun readDoubles() = readStrings().map { it.toDouble() } // list of doubles\n\nfun main(){\n val (n, k) = readInts()\n val h = readLongs()\n\n val inf = Long.MAX_VALUE\n val dp = LongArray(n){inf}\n\n dp[0] = 0\n\n dp[0] = 0 //初期位置にいる時はコスト0\n\n //２つ目の足場は特例\n dp[1] = abs(h[0] - h[1])\n if(n == 2){\n println(dp[1])\n exitProcess(0)\n }\n\n for(i in 2 until n){\n if(i-k <= 0){\n //0~(i-1)までループ\n for(j in 0..i-1){\n dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]))\n }\n }else{\n //k回ループ\n for(j in 1..k){\n dp[i] = min(dp[i], dp[i-j] + abs(h[i-j] - h[i]))\n }\n }\n\n }\n\n println(dp[n-1])\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1288, "cpu_time_ms": 385, "memory_kb": 52344}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s704557072", "group_id": "codeNet:p03161", "input_text": "import java.lang.Math.*\n\nfun main(args: Array) {\n val (N, K) = arrayOf(7, 3)//readLine()!!.split(\" \").map {it.toInt()}\n val a = arrayOf(3,7,6,9,11,2,7)//readLine()!!.split(\" \").map{it.toInt()}\n val dp = Array(N){1000000000}\n dp[0] = 0\n for(i in 1 until N) {\n for(j in i - 1 downTo max(0, i - K)) {\n dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]))\n }\n }\n println(dp[N-1])\n}", "language": "Kotlin", "metadata": {"date": 1586442666, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Kotlin/s704557072.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s704557072", "user_id": "u616477808"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "import java.lang.Math.*\n\nfun main(args: Array) {\n val (N, K) = arrayOf(7, 3)//readLine()!!.split(\" \").map {it.toInt()}\n val a = arrayOf(3,7,6,9,11,2,7)//readLine()!!.split(\" \").map{it.toInt()}\n val dp = Array(N){1000000000}\n dp[0] = 0\n for(i in 1 until N) {\n for(j in i - 1 downTo max(0, i - K)) {\n dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]))\n }\n }\n println(dp[N-1])\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 423, "cpu_time_ms": 164, "memory_kb": 31392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s485046615", "group_id": "codeNet:p03161", "input_text": "import java.lang.Math.*\nimport java.util.*\n\nfun main(args: Array) {\n val scn = Scanner(System.`in`)\n val N = scn.nextInt()\n val K = scn.nextInt()\n\n var h = arrayOfNulls(N + 1)\n for (i in 1..N) {\n h[i] = scn.nextInt()\n }\n h[0] = 0\n\n var dp = arrayOfNulls(N + 1)\n for (i in 1..N) {\n dp[i] = Int.MAX_VALUE\n }\n dp[0] = 0\n dp[1] = 0\n\n for (i in 2..N) {\n for (k in 1..K) {\n if (k < i) dp[i] = min(dp[i]!!, abs(h[i]!! - h[i - k]!!) + dp[i - k]!!)\n }\n }\n\n println(dp[N])\n}", "language": "Kotlin", "metadata": {"date": 1580304354, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Kotlin/s485046615.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s485046615", "user_id": "u598554142"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "import java.lang.Math.*\nimport java.util.*\n\nfun main(args: Array) {\n val scn = Scanner(System.`in`)\n val N = scn.nextInt()\n val K = scn.nextInt()\n\n var h = arrayOfNulls(N + 1)\n for (i in 1..N) {\n h[i] = scn.nextInt()\n }\n h[0] = 0\n\n var dp = arrayOfNulls(N + 1)\n for (i in 1..N) {\n dp[i] = Int.MAX_VALUE\n }\n dp[0] = 0\n dp[1] = 0\n\n for (i in 2..N) {\n for (k in 1..K) {\n if (k < i) dp[i] = min(dp[i]!!, abs(h[i]!! - h[i - k]!!) + dp[i - k]!!)\n }\n }\n\n println(dp[N])\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 566, "cpu_time_ms": 595, "memory_kb": 111164}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s121360067", "group_id": "codeNet:p03161", "input_text": "fun main(args: Array) {\n edpb()\n}\n\nfun edpb() {\n val (n, k) = readLine()!!.split(\" \").map { it.toInt() }\n val heights = readLine()!!.split(\" \").map { it.toInt() }\n\n val inf = Long.MAX_VALUE / 100\n val dp = LongArray(101010) { inf }\n dp[0] = 0\n\n for (i in heights.indices) {\n for (j in 1..k) {\n if (i + j > heights.lastIndex) break\n dp[i + j] = Math.min(dp[i + j], dp[i] + Math.abs(heights[i] - heights[i + j]))\n }\n }\n\n val answer = dp[n - 1]\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1580163046, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03161.html", "problem_id": "p03161", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03161/input.txt", "sample_output_relpath": "derived/input_output/data/p03161/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03161/Kotlin/s121360067.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s121360067", "user_id": "u139478771"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "fun main(args: Array) {\n edpb()\n}\n\nfun edpb() {\n val (n, k) = readLine()!!.split(\" \").map { it.toInt() }\n val heights = readLine()!!.split(\" \").map { it.toInt() }\n\n val inf = Long.MAX_VALUE / 100\n val dp = LongArray(101010) { inf }\n dp[0] = 0\n\n for (i in heights.indices) {\n for (j in 1..k) {\n if (i + j > heights.lastIndex) break\n dp[i + j] = Math.min(dp[i + j], dp[i] + Math.abs(heights[i] - heights[i + j]))\n }\n }\n\n val answer = dp[n - 1]\n\n println(answer)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "sample_input": "5 3\n10 30 40 50 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03161", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N stones, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), the height of Stone i is h_i.\n\nThere is a frog who is initially on Stone 1.\nHe will repeat the following action some number of times to reach Stone N:\n\nIf the frog is currently on Stone i, jump to one of the following: Stone i + 1, i + 2, \\ldots, i + K. Here, a cost of |h_i - h_j| is incurred, where j is the stone to land on.\n\nFind the minimum possible total cost incurred before the frog reaches Stone N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 100\n\n1 \\leq h_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the minimum possible total cost incurred.\n\nSample Input 1\n\n5 3\n10 30 40 50 20\n\nSample Output 1\n\n30\n\nIf we follow the path 1 → 2 → 5, the total cost incurred would be |10 - 30| + |30 - 20| = 30.\n\nSample Input 2\n\n3 1\n10 20 10\n\nSample Output 2\n\n20\n\nIf we follow the path 1 → 2 → 3, the total cost incurred would be |10 - 20| + |20 - 10| = 20.\n\nSample Input 3\n\n2 100\n10 10\n\nSample Output 3\n\n0\n\nIf we follow the path 1 → 2, the total cost incurred would be |10 - 10| = 0.\n\nSample Input 4\n\n10 4\n40 10 20 70 80 10 20 70 80 60\n\nSample Output 4\n\n40\n\nIf we follow the path 1 → 4 → 8 → 10, the total cost incurred would be |40 - 70| + |70 - 70| + |70 - 60| = 40.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 536, "cpu_time_ms": 553, "memory_kb": 52000}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s289824279", "group_id": "codeNet:p03163", "input_text": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\n////////////////////////////////////////////////////////////////////////\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val W = sc.next().toInt()\n val w = IntArray(N)\n val v = IntArray(N)\n repeat(N) {\n w[it] = sc.next().toInt()\n v[it] = sc.next().toInt()\n }\n\n val dp = Array(N + 1) { LongArray(W + 1) }\n for (i in 1..N) {\n for (j in 1..W) {\n dp[i][j] = arrayOf(dp[i][j], dp[i - 1][j]).max()!!\n if (j - w[i - 1] >= 0) {\n dp[i][j] = arrayOf(dp[i][j], dp[i - 1][j - w[i - 1]] + v[i - 1]).max()!!\n }\n }\n }\n pw.println(dp[N][W])\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1588632558, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Kotlin/s289824279.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s289824279", "user_id": "u297767059"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\n////////////////////////////////////////////////////////////////////////\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val W = sc.next().toInt()\n val w = IntArray(N)\n val v = IntArray(N)\n repeat(N) {\n w[it] = sc.next().toInt()\n v[it] = sc.next().toInt()\n }\n\n val dp = Array(N + 1) { LongArray(W + 1) }\n for (i in 1..N) {\n for (j in 1..W) {\n dp[i][j] = arrayOf(dp[i][j], dp[i - 1][j]).max()!!\n if (j - w[i - 1] >= 0) {\n dp[i][j] = arrayOf(dp[i][j], dp[i - 1][j - w[i - 1]] + v[i - 1]).max()!!\n }\n }\n }\n pw.println(dp[N][W])\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1456, "cpu_time_ms": 580, "memory_kb": 198932}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s733331093", "group_id": "codeNet:p03163", "input_text": "fun main(args: Array) {\n val (N, W) = readIntegerList()\n val dp = Array(N + 1) { LongArray(W + 1) { 0L } }\n for (i in 0 until N) {\n val (w, v) = readIntegerList()\n for (j in 0..W) {\n if (0 <= j - w) {\n dp[i + 1][j] = Math.max(dp[i][j], dp[i][j - w] + v)\n } else {\n dp[i + 1][j] = dp[i][j]\n }\n }\n }\n println(dp[N].max())\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "language": "Kotlin", "metadata": {"date": 1584704115, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Kotlin/s733331093.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s733331093", "user_id": "u784448849"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, W) = readIntegerList()\n val dp = Array(N + 1) { LongArray(W + 1) { 0L } }\n for (i in 0 until N) {\n val (w, v) = readIntegerList()\n for (j in 0..W) {\n if (0 <= j - w) {\n dp[i + 1][j] = Math.max(dp[i][j], dp[i][j - w] + v)\n } else {\n dp[i + 1][j] = dp[i][j]\n }\n }\n }\n println(dp[N].max())\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 675, "cpu_time_ms": 456, "memory_kb": 156280}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s232793220", "group_id": "codeNet:p03163", "input_text": "fun main(args: Array) {\n val (N, W) = readLine()!!.split(\" \"). map { it.toInt() }\n val dp = LongArray(W+1)\n val w = IntArray(N+1)\n val v = IntArray(N+1)\n for ( i in 0 until N) {\n val a = readLine()!!.split(\" \"). map { it.toInt() }\n w[i] = a[0]\n v[i] = a[1]\n }\n for (i in 0 until N) {\n for (j in W downTo w[i]) {\n dp[j] = Math.max(dp[j], dp[j - w[i]] + v[i])\n }\n }\n println(dp.max())\n}", "language": "Kotlin", "metadata": {"date": 1581619044, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Kotlin/s232793220.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s232793220", "user_id": "u796228844"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, W) = readLine()!!.split(\" \"). map { it.toInt() }\n val dp = LongArray(W+1)\n val w = IntArray(N+1)\n val v = IntArray(N+1)\n for ( i in 0 until N) {\n val a = readLine()!!.split(\" \"). map { it.toInt() }\n w[i] = a[0]\n v[i] = a[1]\n }\n for (i in 0 until N) {\n for (j in W downTo w[i]) {\n dp[j] = Math.max(dp[j], dp[j - w[i]] + v[i])\n }\n }\n println(dp.max())\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 465, "cpu_time_ms": 286, "memory_kb": 40408}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s029277616", "group_id": "codeNet:p03163", "input_text": "fun readAtOnce(): List = readLine()!!.split(\" \")\nfun readInts(): List = readAtOnce().map(String::toInt)\nfun readLongs(): List = readAtOnce().map(String::toLong)\n\n@Suppress(\"FunctionName\")\nfun Array2D(xSize: Int,\n ySize: Int,\n initializer: () -> Int = { 0 }): Array> = Array(ySize) { Array(xSize) { initializer() } }\n\nfun Int.repeat(predicate: (Int) -> Unit) = repeat(this, predicate)\n\nval dp = Array2D(100, 100000) { -1 } // heap\n\nfun main(args: Array) {\n val (N, W) = readInts()\n val w = Array(N) { 0 }\n val v = Array(N) { 0 }\n N.repeat {\n val (_w, _v) = readInts()\n w[it] = _w\n v[it] = _v\n }\n\n fun knapsack(order: Int, weight: Int): Int {\n if (dp[order][weight] != -1) return dp[order][weight]\n\n val x = when {\n order == N -> 0\n weight < w[order] -> knapsack(order + 1, weight)\n else -> Math.max(knapsack(order + 1, weight), knapsack(order + 1, weight - w[order]) + v[order])\n }\n\n dp[weight][order] = x\n return x\n }\n\n println(knapsack(0, W))\n}", "language": "Kotlin", "metadata": {"date": 1581454888, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Kotlin/s029277616.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s029277616", "user_id": "u963316883"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "fun readAtOnce(): List = readLine()!!.split(\" \")\nfun readInts(): List = readAtOnce().map(String::toInt)\nfun readLongs(): List = readAtOnce().map(String::toLong)\n\n@Suppress(\"FunctionName\")\nfun Array2D(xSize: Int,\n ySize: Int,\n initializer: () -> Int = { 0 }): Array> = Array(ySize) { Array(xSize) { initializer() } }\n\nfun Int.repeat(predicate: (Int) -> Unit) = repeat(this, predicate)\n\nval dp = Array2D(100, 100000) { -1 } // heap\n\nfun main(args: Array) {\n val (N, W) = readInts()\n val w = Array(N) { 0 }\n val v = Array(N) { 0 }\n N.repeat {\n val (_w, _v) = readInts()\n w[it] = _w\n v[it] = _v\n }\n\n fun knapsack(order: Int, weight: Int): Int {\n if (dp[order][weight] != -1) return dp[order][weight]\n\n val x = when {\n order == N -> 0\n weight < w[order] -> knapsack(order + 1, weight)\n else -> Math.max(knapsack(order + 1, weight), knapsack(order + 1, weight - w[order]) + v[order])\n }\n\n dp[weight][order] = x\n return x\n }\n\n println(knapsack(0, W))\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1122, "cpu_time_ms": 470, "memory_kb": 93148}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s969794279", "group_id": "codeNet:p03163", "input_text": "fun main(args: Array) {\n\n val (N, W) = readLine()!!.split(\" \").map(String::toInt)\n val WV = Array(N) { readLine()!!.split(\" \").map(String::toInt) }\n val w = WV.map { it[0] }\n val v = WV.map { it[1] }\n\n val memo = Array(N + 1) { arrayOfNulls(W + 1) }\n fun resolve(index: Int, weight: Int): Long {\n if (memo[index][weight] != null) {\n return memo[index][weight]!!\n }\n val result = when {\n index == N -> {\n 0\n }\n weight < w[index] -> {\n resolve(index + 1, weight)\n }\n else -> {\n Math.max(\n resolve(index + 1, weight - w[index]) + v[index],\n resolve(index + 1, weight)\n )\n }\n }\n memo[index][weight] = result\n return result\n }\n\n resolve(0, W).let(::println)\n}\n", "language": "Kotlin", "metadata": {"date": 1578569696, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Kotlin/s969794279.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s969794279", "user_id": "u085288971"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "fun main(args: Array) {\n\n val (N, W) = readLine()!!.split(\" \").map(String::toInt)\n val WV = Array(N) { readLine()!!.split(\" \").map(String::toInt) }\n val w = WV.map { it[0] }\n val v = WV.map { it[1] }\n\n val memo = Array(N + 1) { arrayOfNulls(W + 1) }\n fun resolve(index: Int, weight: Int): Long {\n if (memo[index][weight] != null) {\n return memo[index][weight]!!\n }\n val result = when {\n index == N -> {\n 0\n }\n weight < w[index] -> {\n resolve(index + 1, weight)\n }\n else -> {\n Math.max(\n resolve(index + 1, weight - w[index]) + v[index],\n resolve(index + 1, weight)\n )\n }\n }\n memo[index][weight] = result\n return result\n }\n\n resolve(0, W).let(::println)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 910, "cpu_time_ms": 2119, "memory_kb": 305836}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s733965917", "group_id": "codeNet:p03163", "input_text": "fun main(args: Array) {\n\n val (N, W) = readLine()!!.split(\" \").map(String::toInt)\n val WV = Array(N) { readLine()!!.split(\" \").map(String::toInt) }\n val w = WV.map { it[0] }\n val v = WV.map { it[1] }\n\n val memo = Array(N + 1) { LongArray(W + 1) }\n fun resolve(index: Int, weight: Int): Long {\n val result = when {\n index == N -> {\n 0\n }\n weight < w[index] -> {\n resolve(index + 1, weight)\n }\n else -> {\n Math.max(\n resolve(index + 1, weight - w[index]) + v[index],\n resolve(index + 1, weight)\n )\n }\n }\n memo[index][weight] = result\n return result\n }\n\n resolve(0, W).let(::println)\n}\n", "language": "Kotlin", "metadata": {"date": 1578569575, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Kotlin/s733965917.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s733965917", "user_id": "u085288971"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "fun main(args: Array) {\n\n val (N, W) = readLine()!!.split(\" \").map(String::toInt)\n val WV = Array(N) { readLine()!!.split(\" \").map(String::toInt) }\n val w = WV.map { it[0] }\n val v = WV.map { it[1] }\n\n val memo = Array(N + 1) { LongArray(W + 1) }\n fun resolve(index: Int, weight: Int): Long {\n val result = when {\n index == N -> {\n 0\n }\n weight < w[index] -> {\n resolve(index + 1, weight)\n }\n else -> {\n Math.max(\n resolve(index + 1, weight - w[index]) + v[index],\n resolve(index + 1, weight)\n )\n }\n }\n memo[index][weight] = result\n return result\n }\n\n resolve(0, W).let(::println)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 807, "cpu_time_ms": 2111, "memory_kb": 123324}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s954789093", "group_id": "codeNet:p03163", "input_text": "fun main(args: Array) {\n val (N, W) = readLine()!!.split(\" \").map(String::toInt)\n val napsack = Array>(N, {Array(2, {0})})\n for (n in 0 until N) {\n napsack[n] = readLine()!!.split(\" \").map(String::toInt).toTypedArray()\n }\n val dp = Array>(N + 10, {Array(W + 10, {0L})})\n for (n in 0 until N) {\n for (w in 0 .. W) {\n val weight = napsack[n][0]\n val value = napsack[n][1]\n // n番目の商品を選ぶ場合 (weightが最大値を越えない場合)\n if (w - weight >= 0) {\n if (dp[n + 1][w] < dp[n][w - weight] + value) {\n dp[n + 1][w] = dp[n][w - weight] + value\n }\n }\n\n if (dp[n + 1][w] < dp[n][w]) {\n dp[n + 1][w] = dp[n][w]\n }\n }\n }\n println(dp[N][W])\n}", "language": "Kotlin", "metadata": {"date": 1566728530, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Kotlin/s954789093.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s954789093", "user_id": "u529787332"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, W) = readLine()!!.split(\" \").map(String::toInt)\n val napsack = Array>(N, {Array(2, {0})})\n for (n in 0 until N) {\n napsack[n] = readLine()!!.split(\" \").map(String::toInt).toTypedArray()\n }\n val dp = Array>(N + 10, {Array(W + 10, {0L})})\n for (n in 0 until N) {\n for (w in 0 .. W) {\n val weight = napsack[n][0]\n val value = napsack[n][1]\n // n番目の商品を選ぶ場合 (weightが最大値を越えない場合)\n if (w - weight >= 0) {\n if (dp[n + 1][w] < dp[n][w - weight] + value) {\n dp[n + 1][w] = dp[n][w - weight] + value\n }\n }\n\n if (dp[n + 1][w] < dp[n][w]) {\n dp[n + 1][w] = dp[n][w]\n }\n }\n }\n println(dp[N][W])\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 884, "cpu_time_ms": 2115, "memory_kb": 268392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s619089041", "group_id": "codeNet:p03163", "input_text": "fun main(args: Array) {\n val (N, W) = readLine()!!.split(\" \").map(String::toInt)\n val napsack: MutableList> = mutableListOf()\n for (n in 0 until N) {\n napsack.add(readLine()!!.split(\" \").map(String::toInt))\n }\n val dp = Array>(N + 10, {Array(W + 10, {0L})})\n for (n in 0 until N) {\n for (w in 0 .. W) {\n val weight = napsack.get(n)[0]\n val value = napsack.get(n)[1]\n // n番目の商品を選ぶ場合 (weightが最大値を越えない場合)\n if (w - weight >= 0) {\n if (dp[n + 1][w] < dp[n][w - weight] + value) {\n dp[n + 1][w] = dp[n][w - weight] + value\n }\n }\n\n if (dp[n + 1][w] < dp[n][w]) {\n dp[n + 1][w] = dp[n][w]\n }\n }\n }\n println(dp[N][W])\n}", "language": "Kotlin", "metadata": {"date": 1566728058, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Kotlin/s619089041.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s619089041", "user_id": "u529787332"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, W) = readLine()!!.split(\" \").map(String::toInt)\n val napsack: MutableList> = mutableListOf()\n for (n in 0 until N) {\n napsack.add(readLine()!!.split(\" \").map(String::toInt))\n }\n val dp = Array>(N + 10, {Array(W + 10, {0L})})\n for (n in 0 until N) {\n for (w in 0 .. W) {\n val weight = napsack.get(n)[0]\n val value = napsack.get(n)[1]\n // n番目の商品を選ぶ場合 (weightが最大値を越えない場合)\n if (w - weight >= 0) {\n if (dp[n + 1][w] < dp[n][w - weight] + value) {\n dp[n + 1][w] = dp[n][w - weight] + value\n }\n }\n\n if (dp[n + 1][w] < dp[n][w]) {\n dp[n + 1][w] = dp[n][w]\n }\n }\n }\n println(dp[N][W])\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 874, "cpu_time_ms": 2119, "memory_kb": 271044}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s370060585", "group_id": "codeNet:p03163", "input_text": "fun main(args: Array) {\n\n val (N, W) = readLine()!!.split(\" \").map { it.toInt() }\n\n val dp = Array(N+1) { Array(W+1) { 0L } }\n\n for (i in 1..N) {\n val (w, v) = readLine()!!.split(\" \").map { it.toInt() }\n for (j in 1..W) {\n\n // itemを選ぶとき\n if (j - w >= 0) {\n dp[i][j] = Math.max(dp[i-1][j], dp[i-1][j - w] + v)\n continue\n }\n // itemを選ばないとき\n dp[i][j] = dp[i-1][j]\n }\n }\n\n println(dp[N][W])\n}", "language": "Kotlin", "metadata": {"date": 1564597946, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Kotlin/s370060585.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s370060585", "user_id": "u108272327"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "fun main(args: Array) {\n\n val (N, W) = readLine()!!.split(\" \").map { it.toInt() }\n\n val dp = Array(N+1) { Array(W+1) { 0L } }\n\n for (i in 1..N) {\n val (w, v) = readLine()!!.split(\" \").map { it.toInt() }\n for (j in 1..W) {\n\n // itemを選ぶとき\n if (j - w >= 0) {\n dp[i][j] = Math.max(dp[i-1][j], dp[i-1][j - w] + v)\n continue\n }\n // itemを選ばないとき\n dp[i][j] = dp[i-1][j]\n }\n }\n\n println(dp[N][W])\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 541, "cpu_time_ms": 2119, "memory_kb": 273792}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s622339559", "group_id": "codeNet:p03163", "input_text": "fun main(args: Array) {\n val (n, w) = readLine()!!.split(' ').map(String::toInt)\n val wList = mutableListOf()\n val vList = mutableListOf()\n (1..n).forEach {\n val (w, v) = readLine()!!.split(' ').map(String::toLong)\n wList.add(w.toInt())\n vList.add(v)\n }\n\n val dp = mutableMapOf>()//w,n,v\n dp[0L] = Pair(0L, 0L)\n for (ni in 0 until n) {\n val tempDp = mutableMapOf>()//w,n,v\n for (temp in dp) {\n if (temp.key + wList[ni] <= w) {\n if (dp[temp.key]!!.second < temp.value.second + vList[ni]) {\n tempDp[temp.key + wList[ni]] = Pair(temp.value.first + 1, temp.value.second + vList[ni])\n }\n }\n }\n dp.putAll(tempDp)\n }\n println(dp.maxBy { it.value.second }!!.value.second)\n}", "language": "Kotlin", "metadata": {"date": 1547738290, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Kotlin/s622339559.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s622339559", "user_id": "u099066216"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, w) = readLine()!!.split(' ').map(String::toInt)\n val wList = mutableListOf()\n val vList = mutableListOf()\n (1..n).forEach {\n val (w, v) = readLine()!!.split(' ').map(String::toLong)\n wList.add(w.toInt())\n vList.add(v)\n }\n\n val dp = mutableMapOf>()//w,n,v\n dp[0L] = Pair(0L, 0L)\n for (ni in 0 until n) {\n val tempDp = mutableMapOf>()//w,n,v\n for (temp in dp) {\n if (temp.key + wList[ni] <= w) {\n if (dp[temp.key]!!.second < temp.value.second + vList[ni]) {\n tempDp[temp.key + wList[ni]] = Pair(temp.value.first + 1, temp.value.second + vList[ni])\n }\n }\n }\n dp.putAll(tempDp)\n }\n println(dp.maxBy { it.value.second }!!.value.second)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 880, "cpu_time_ms": 2114, "memory_kb": 159104}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s593950754", "group_id": "codeNet:p03163", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map { it.toInt() }\n\n val dp = Array(m + 1) { 0L }\n\n for (i in 0 until n) {\n\n val (s1, s2) = readLine()!!.split(' ')\n val w = s1.toInt()\n val v = s2.toLong()\n\n for (tw in m downTo 0) {\n if (tw - w >= 0) {\n dp[tw] = Math.max(dp[tw], dp[tw - w] + v)\n }\n }\n }\n\n println(dp[m])\n}\n", "language": "Kotlin", "metadata": {"date": 1547668371, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Kotlin/s593950754.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s593950754", "user_id": "u863309603"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map { it.toInt() }\n\n val dp = Array(m + 1) { 0L }\n\n for (i in 0 until n) {\n\n val (s1, s2) = readLine()!!.split(' ')\n val w = s1.toInt()\n val v = s2.toLong()\n\n for (tw in m downTo 0) {\n if (tw - w >= 0) {\n dp[tw] = Math.max(dp[tw], dp[tw - w] + v)\n }\n }\n }\n\n println(dp[m])\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 432, "cpu_time_ms": 411, "memory_kb": 123152}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s053640529", "group_id": "codeNet:p03163", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map { it.toInt() }\n\n val dp = Array(n + 1) { Array(m + 1) { 0L } }\n\n (0 until n).forEach { i ->\n\n val (s1, s2) = readLine()!!.split(' ')\n val w = s1.toInt()\n val v = s2.toLong()\n\n (0..m).forEach { tw ->\n\n if (tw - w >= 0) {\n dp[i + 1][tw] = Math.max(dp[i + 1][tw], dp[i][tw - w] + v)\n }\n\n dp[i + 1][tw] = Math.max(dp[i + 1][tw], dp[i][tw])\n }\n }\n\n println(dp[n][m])\n}\n", "language": "Kotlin", "metadata": {"date": 1547595660, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03163.html", "problem_id": "p03163", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03163/input.txt", "sample_output_relpath": "derived/input_output/data/p03163/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03163/Kotlin/s053640529.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s053640529", "user_id": "u863309603"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(' ').map { it.toInt() }\n\n val dp = Array(n + 1) { Array(m + 1) { 0L } }\n\n (0 until n).forEach { i ->\n\n val (s1, s2) = readLine()!!.split(' ')\n val w = s1.toInt()\n val v = s2.toLong()\n\n (0..m).forEach { tw ->\n\n if (tw - w >= 0) {\n dp[i + 1][tw] = Math.max(dp[i + 1][tw], dp[i][tw - w] + v)\n }\n\n dp[i + 1][tw] = Math.max(dp[i + 1][tw], dp[i][tw])\n }\n }\n\n println(dp[n][m])\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03163", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^5\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n5 5\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 2\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 536, "cpu_time_ms": 2119, "memory_kb": 269180}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s679896021", "group_id": "codeNet:p03165", "input_text": "//package Qf\nimport java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\nprivate val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = {readLine()!!.toInt()}\nprivate val readLong: ()->Long = {readLine()!!.toLong()}\nprivate val readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nprivate val readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nprivate val errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nprivate val MOD = 1e9.toLong()+7\nprivate val INF = Int.MAX_VALUE/2\nprivate val LINF = Long.MAX_VALUE/2\n\n\nfun solveF(S: String, T: String): String {\n val N = S.length\n val M = T.length\n val dp = Array(N+1){IntArray(M+1){0}}\n\n for(i in 0 until N) {\n for (j in 0 until M) {\n if (T[j] == S[i]) {\n dp[i+1][j+1] = dp[i][j+1] + 1\n } else {\n if (dp[i][j+1] >= dp[i+1][j]) {\n dp[i+1][j+1] = dp[i][j+1]\n } else {\n dp[i+1][j+1] = dp[i+1][j]\n }\n }\n }\n }\n\n var i = N\n var j = M\n var res = \"\"\n while (0) {\n val S = readString()\n val T = readString()\n\n val ans = solveF(S, T)\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1590055990, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Kotlin/s679896021.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s679896021", "user_id": "u404244809"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "//package Qf\nimport java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\nprivate val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = {readLine()!!.toInt()}\nprivate val readLong: ()->Long = {readLine()!!.toLong()}\nprivate val readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nprivate val readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nprivate val errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nprivate val MOD = 1e9.toLong()+7\nprivate val INF = Int.MAX_VALUE/2\nprivate val LINF = Long.MAX_VALUE/2\n\n\nfun solveF(S: String, T: String): String {\n val N = S.length\n val M = T.length\n val dp = Array(N+1){IntArray(M+1){0}}\n\n for(i in 0 until N) {\n for (j in 0 until M) {\n if (T[j] == S[i]) {\n dp[i+1][j+1] = dp[i][j+1] + 1\n } else {\n if (dp[i][j+1] >= dp[i+1][j]) {\n dp[i+1][j+1] = dp[i][j+1]\n } else {\n dp[i+1][j+1] = dp[i+1][j]\n }\n }\n }\n }\n\n var i = N\n var j = M\n var res = \"\"\n while (0) {\n val S = readString()\n val T = readString()\n\n val ans = solveF(S, T)\n\n println(ans)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1571, "cpu_time_ms": 394, "memory_kb": 96316}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s758169307", "group_id": "codeNet:p03165", "input_text": "//package Qf\nimport java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\nprivate val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = {readLine()!!.toInt()}\nprivate val readLong: ()->Long = {readLine()!!.toLong()}\nprivate val readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nprivate val readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nprivate val errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nprivate val MOD = 1e9.toLong()+7\nprivate val INF = Int.MAX_VALUE/2\nprivate val LINF = Long.MAX_VALUE/2\n\n\nfun solveF(S: String, T: String): String {\n val N = S.length\n val M = T.length\n val dp = Array(N+1){Array(M+1){\"\"}}\n\n for(i in 0 until N) {\n for (j in 0 until M) {\n if (T[j] == S[i]) {\n dp[i+1][j+1] = dp[i][j+1] + T[j]\n } else {\n if (dp[i][j+1].length >= dp[i+1][j].length) {\n dp[i+1][j+1] = dp[i][j+1]\n } else {\n dp[i+1][j+1] = dp[i+1][j]\n }\n }\n }\n }\n\n return dp[N][M]\n}\n\n\nfun main(args: Array) {\n val S = readString()\n val T = readString()\n\n val ans = solveF(S, T)\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1590054900, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Kotlin/s758169307.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s758169307", "user_id": "u404244809"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "//package Qf\nimport java.util.*\nimport java.math.*\nimport java.lang.Math.*\n\nprivate val readString: ()->String = {readLine()!!}\nprivate val readInt: ()->Int = {readLine()!!.toInt()}\nprivate val readLong: ()->Long = {readLine()!!.toLong()}\nprivate val readIntArray: ()->IntArray = {readLine()!!.split(' ').map{it.toInt()}.toIntArray()}\nprivate val readLongArray: ()->LongArray = {readLine()!!.split(' ').map{it.toLong()}.toLongArray()}\nprivate val errPrintln: (String)->Unit = {msg -> System.err.println(msg)}\nprivate val MOD = 1e9.toLong()+7\nprivate val INF = Int.MAX_VALUE/2\nprivate val LINF = Long.MAX_VALUE/2\n\n\nfun solveF(S: String, T: String): String {\n val N = S.length\n val M = T.length\n val dp = Array(N+1){Array(M+1){\"\"}}\n\n for(i in 0 until N) {\n for (j in 0 until M) {\n if (T[j] == S[i]) {\n dp[i+1][j+1] = dp[i][j+1] + T[j]\n } else {\n if (dp[i][j+1].length >= dp[i+1][j].length) {\n dp[i+1][j+1] = dp[i][j+1]\n } else {\n dp[i+1][j+1] = dp[i+1][j]\n }\n }\n }\n }\n\n return dp[N][M]\n}\n\n\nfun main(args: Array) {\n val S = readString()\n val T = readString()\n\n val ans = solveF(S, T)\n\n println(ans)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1289, "cpu_time_ms": 2119, "memory_kb": 304016}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s773959557", "group_id": "codeNet:p03165", "input_text": "fun main(args: Array) {\n edpf()\n}\n\nprivate enum class From { LEFT, LEFT_ABOVE, ABOVE, UNDEFINED }\n\nfun edpf() {\n val s = readLine()!!\n val t = readLine()!!\n\n // sをiまで、tをjまで選んだときのLCSテーブル\n val dp = Array(s.length + 1) { Array(t.length + 1) { 0 } }\n // dpテーブルでどの方向から遷移してきたか (縦軸s、横軸tとする)\n val from = Array(s.length + 1) {\n Array(t.length + 1) {\n From.UNDEFINED\n }\n }\n\n // LCSの遷移を記録\n for (i in 1..s.length) {\n for (j in 1..t.length) {\n dp[i][j] = if (s[i - 1] == t[j - 1]) {\n from[i][j] = From.LEFT_ABOVE\n dp[i - 1][j - 1] + 1\n } else {\n if (dp[i - 1][j] > dp[i][j - 1]) {\n from[i][j] = From.ABOVE\n dp[i - 1][j]\n } else {\n from[i][j] = From.LEFT\n dp[i][j - 1]\n }\n }\n }\n }\n\n val answer = StringBuffer()\n\n // LCSの復元\n var si = s.length\n var ti = t.length\n while (si > 0 && ti > 0) {\n when (from[si][ti]) {\n From.LEFT_ABOVE -> {\n answer.append(s[si - 1])\n si--\n ti--\n }\n From.ABOVE -> si--\n From.LEFT -> ti--\n else -> Unit\n }\n }\n\n println(answer.reverse())\n}\n", "language": "Kotlin", "metadata": {"date": 1568551317, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Kotlin/s773959557.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s773959557", "user_id": "u139478771"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "fun main(args: Array) {\n edpf()\n}\n\nprivate enum class From { LEFT, LEFT_ABOVE, ABOVE, UNDEFINED }\n\nfun edpf() {\n val s = readLine()!!\n val t = readLine()!!\n\n // sをiまで、tをjまで選んだときのLCSテーブル\n val dp = Array(s.length + 1) { Array(t.length + 1) { 0 } }\n // dpテーブルでどの方向から遷移してきたか (縦軸s、横軸tとする)\n val from = Array(s.length + 1) {\n Array(t.length + 1) {\n From.UNDEFINED\n }\n }\n\n // LCSの遷移を記録\n for (i in 1..s.length) {\n for (j in 1..t.length) {\n dp[i][j] = if (s[i - 1] == t[j - 1]) {\n from[i][j] = From.LEFT_ABOVE\n dp[i - 1][j - 1] + 1\n } else {\n if (dp[i - 1][j] > dp[i][j - 1]) {\n from[i][j] = From.ABOVE\n dp[i - 1][j]\n } else {\n from[i][j] = From.LEFT\n dp[i][j - 1]\n }\n }\n }\n }\n\n val answer = StringBuffer()\n\n // LCSの復元\n var si = s.length\n var ti = t.length\n while (si > 0 && ti > 0) {\n when (from[si][ti]) {\n From.LEFT_ABOVE -> {\n answer.append(s[si - 1])\n si--\n ti--\n }\n From.ABOVE -> si--\n From.LEFT -> ti--\n else -> Unit\n }\n }\n\n println(answer.reverse())\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1453, "cpu_time_ms": 2115, "memory_kb": 274256}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s476120973", "group_id": "codeNet:p03165", "input_text": "import java.io.*\nimport java.util.*\n\n\nfun solve(s: String, t: String){\n val cache = Array(3000){ Array(3000){ null } }\n fun lcs(i: Int, j: Int): String{\n if(i < 0 || j < 0) return \"\"\n if(cache[i][j] != null) return cache[i][j]!!\n if(s[i] == t[j]){\n val ret = lcs(i-1, j-1) + s[i]\n cache[i][j] = ret\n return ret\n }\n val cand1 = lcs(i-1, j)\n val cand2 = lcs(i, j-1)\n return if(cand1.length >= cand2.length) cand1 else cand2\n }\n for (i in 0 until s.length){\n for (j in 0 until t.length){\n lcs(i, j)\n }\n }\n println(lcs(s.length-1, t.length-1))\n}\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val s = sc.next()\n val t = sc.next()\n solve(s, t)\n}\n", "language": "Kotlin", "metadata": {"date": 1566903014, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Kotlin/s476120973.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s476120973", "user_id": "u329232967"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "import java.io.*\nimport java.util.*\n\n\nfun solve(s: String, t: String){\n val cache = Array(3000){ Array(3000){ null } }\n fun lcs(i: Int, j: Int): String{\n if(i < 0 || j < 0) return \"\"\n if(cache[i][j] != null) return cache[i][j]!!\n if(s[i] == t[j]){\n val ret = lcs(i-1, j-1) + s[i]\n cache[i][j] = ret\n return ret\n }\n val cand1 = lcs(i-1, j)\n val cand2 = lcs(i, j-1)\n return if(cand1.length >= cand2.length) cand1 else cand2\n }\n for (i in 0 until s.length){\n for (j in 0 until t.length){\n lcs(i, j)\n }\n }\n println(lcs(s.length-1, t.length-1))\n}\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val s = sc.next()\n val t = sc.next()\n solve(s, t)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1274, "cpu_time_ms": 2115, "memory_kb": 306952}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s908925905", "group_id": "codeNet:p03165", "input_text": "fun main(args: Array) {\n val s = readLine()!!.toCharArray()\n val t = readLine()!!.toCharArray()\n val dp = Array(s.size + 1) { LongArray(t.size + 1) { 0L } }\n for (i in 0 until s.size) {\n for (j in 0 until t.size) {\n if (s[i] == t[j])\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j] + 1)\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j + 1])\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i + 1][j])\n }\n }\n var answer = \"\"\n var i = s.size - 1\n var j = t.size - 1\n while (i >= 0 && j >= 0) {\n\n if (dp[i][j] == dp[i - 1][j]) {\n i--\n } else if (dp[i][j] == dp[i][j - 1]) {\n j--\n continue\n } else {\n answer = s[i] + answer\n i--\n j--\n }\n }\n println(answer)\n}", "language": "Kotlin", "metadata": {"date": 1548086136, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Kotlin/s908925905.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s908925905", "user_id": "u099066216"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!.toCharArray()\n val t = readLine()!!.toCharArray()\n val dp = Array(s.size + 1) { LongArray(t.size + 1) { 0L } }\n for (i in 0 until s.size) {\n for (j in 0 until t.size) {\n if (s[i] == t[j])\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j] + 1)\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j + 1])\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i + 1][j])\n }\n }\n var answer = \"\"\n var i = s.size - 1\n var j = t.size - 1\n while (i >= 0 && j >= 0) {\n\n if (dp[i][j] == dp[i - 1][j]) {\n i--\n } else if (dp[i][j] == dp[i][j - 1]) {\n j--\n continue\n } else {\n answer = s[i] + answer\n i--\n j--\n }\n }\n println(answer)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 867, "cpu_time_ms": 428, "memory_kb": 142600}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s357358758", "group_id": "codeNet:p03165", "input_text": "fun main(args: Array) {\n val s = readLine()!!\n val t = readLine()!!\n\n val dp = Array(s.length + 1) { Array(t.length + 1) { 0 } }\n\n var i = 0\n var j = 0\n\n while (i < s.length) {\n while (j < t.length) {\n if (s[i] == t[j]) dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j] + 1)\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i + 1][j])\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j + 1])\n j++\n }\n i++\n j = 0\n }\n\n var res = \"\"\n i = s.length\n j = t.length\n while (i > 0 && j > 0) {\n\n if (dp[i][j] == dp[i - 1][j]) {\n i--\n continue\n }\n\n if (dp[i][j] == dp[i][j - 1]) {\n j--\n continue\n }\n\n res = s[i - 1] + res\n i--\n j--\n }\n\n println(res)\n}\n", "language": "Kotlin", "metadata": {"date": 1547918154, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Kotlin/s357358758.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s357358758", "user_id": "u863309603"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!\n val t = readLine()!!\n\n val dp = Array(s.length + 1) { Array(t.length + 1) { 0 } }\n\n var i = 0\n var j = 0\n\n while (i < s.length) {\n while (j < t.length) {\n if (s[i] == t[j]) dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j] + 1)\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i + 1][j])\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j + 1])\n j++\n }\n i++\n j = 0\n }\n\n var res = \"\"\n i = s.length\n j = t.length\n while (i > 0 && j > 0) {\n\n if (dp[i][j] == dp[i - 1][j]) {\n i--\n continue\n }\n\n if (dp[i][j] == dp[i][j - 1]) {\n j--\n continue\n }\n\n res = s[i - 1] + res\n i--\n j--\n }\n\n println(res)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 863, "cpu_time_ms": 2119, "memory_kb": 240888}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s133027217", "group_id": "codeNet:p03165", "input_text": "fun main(args: Array) {\n val s = readLine()!!\n val t = readLine()!!\n\n val dp = Array(s.length + 1) { Array(t.length + 1) { 0 } }\n\n var i = 0\n var j = 0\n\n while (i < s.length) {\n while (j < t.length) {\n if (s[i] == t[j]) dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j] + 1)\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i + 1][j])\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j + 1])\n j++\n }\n i++\n j = 0\n }\n\n dp.forEach { x ->\n x.forEach { y ->\n print(\"$y\\t\")\n }\n println()\n }\n\n var res = \"\"\n i = s.length\n j = t.length\n while (i > 0 && j > 0) {\n\n if (dp[i][j] == dp[i - 1][j]) {\n i--\n continue\n }\n\n if (dp[i][j] == dp[i][j - 1]) {\n j--\n continue\n }\n\n res = s[i - 1] + res\n i--\n j--\n }\n\n println(res)\n}\n", "language": "Kotlin", "metadata": {"date": 1547918053, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Kotlin/s133027217.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s133027217", "user_id": "u863309603"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!\n val t = readLine()!!\n\n val dp = Array(s.length + 1) { Array(t.length + 1) { 0 } }\n\n var i = 0\n var j = 0\n\n while (i < s.length) {\n while (j < t.length) {\n if (s[i] == t[j]) dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j] + 1)\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i + 1][j])\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j + 1])\n j++\n }\n i++\n j = 0\n }\n\n dp.forEach { x ->\n x.forEach { y ->\n print(\"$y\\t\")\n }\n println()\n }\n\n var res = \"\"\n i = s.length\n j = t.length\n while (i > 0 && j > 0) {\n\n if (dp[i][j] == dp[i - 1][j]) {\n i--\n continue\n }\n\n if (dp[i][j] == dp[i][j - 1]) {\n j--\n continue\n }\n\n res = s[i - 1] + res\n i--\n j--\n }\n\n println(res)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 971, "cpu_time_ms": 2119, "memory_kb": 241152}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s730482856", "group_id": "codeNet:p03165", "input_text": "fun main(args: Array) {\n val s = readLine()!!\n val t = readLine()!!\n\n val dp = Array(s.length + 1) { Array(t.length + 1) { 0 } }\n\n for (i in 0 until s.length) {\n for (j in 0 until t.length) {\n if (s[i] == t[j]) dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j] + 1)\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i + 1][j])\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j + 1])\n }\n }\n\n var res = \"\"\n var i = s.length\n var j = t.length\n while (i > 0 && j > 0) {\n\n if (dp[i][j] == dp[i - 1][j]) {\n i--\n continue\n }\n\n if (dp[i][j] == dp[i][j - 1]) {\n j--\n continue\n }\n\n res = s[i - 1] + res\n i--\n j--\n }\n\n println(res)\n}\n", "language": "Kotlin", "metadata": {"date": 1547916480, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03165.html", "problem_id": "p03165", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03165/input.txt", "sample_output_relpath": "derived/input_output/data/p03165/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03165/Kotlin/s730482856.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s730482856", "user_id": "u863309603"}, "prompt_components": {"gold_output": "axb\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!\n val t = readLine()!!\n\n val dp = Array(s.length + 1) { Array(t.length + 1) { 0 } }\n\n for (i in 0 until s.length) {\n for (j in 0 until t.length) {\n if (s[i] == t[j]) dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j] + 1)\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i + 1][j])\n dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1], dp[i][j + 1])\n }\n }\n\n var res = \"\"\n var i = s.length\n var j = t.length\n while (i > 0 && j > 0) {\n\n if (dp[i][j] == dp[i - 1][j]) {\n i--\n continue\n }\n\n if (dp[i][j] == dp[i][j - 1]) {\n j--\n continue\n }\n\n res = s[i - 1] + res\n i--\n j--\n }\n\n println(res)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "sample_input": "axyb\nabyxb\n"}, "reference_outputs": ["axb\n"], "source_document_id": "p03165", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given strings s and t.\nFind one longest string that is a subsequence of both s and t.\n\nNotes\n\nA subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.\n\nConstraints\n\ns and t are strings consisting of lowercase English letters.\n\n1 \\leq |s|, |t| \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nPrint one longest string that is a subsequence of both s and t.\nIf there are multiple such strings, any of them will be accepted.\n\nSample Input 1\n\naxyb\nabyxb\n\nSample Output 1\n\naxb\n\nThe answer is axb or ayb; either will be accepted.\n\nSample Input 2\n\naa\nxayaz\n\nSample Output 2\n\naa\n\nSample Input 3\n\na\nz\n\nSample Output 3\n\nThe answer is (an empty string).\n\nSample Input 4\n\nabracadabra\navadakedavra\n\nSample Output 4\n\naaadara", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 814, "cpu_time_ms": 2115, "memory_kb": 237012}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s907514378", "group_id": "codeNet:p03206", "input_text": "fun main(args: Array) {\n val day = readLine()?.toInt()\n //?.（セーフコール演算子）\n //readLineメソッドの戻り値はnull許容型（String?）である\n\n when {\n day == 22 -> println(\"Christmas Eve Eve Eve\")\n day == 23 -> println(\"Christmas Eve Eve\")\n day == 24 -> println(\"Christmas Eve\")\n day == 25 -> println(\"Christmas\")\n }\n\n}", "language": "Kotlin", "metadata": {"date": 1601043456, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Kotlin/s907514378.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s907514378", "user_id": "u574685848"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "fun main(args: Array) {\n val day = readLine()?.toInt()\n //?.（セーフコール演算子）\n //readLineメソッドの戻り値はnull許容型（String?）である\n\n when {\n day == 22 -> println(\"Christmas Eve Eve Eve\")\n day == 23 -> println(\"Christmas Eve Eve\")\n day == 24 -> println(\"Christmas Eve\")\n day == 25 -> println(\"Christmas\")\n }\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 397, "cpu_time_ms": 95, "memory_kb": 34328}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s909146949", "group_id": "codeNet:p03206", "input_text": "import java.util.*\nfun main(args: Array){\n val scanner = Scanner(System.`in`)\n var num = scanner.nextInt()\n println(\"Christmas\")\n while(num < 0){\n println(\" Eve\")\n num++\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1587441718, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Kotlin/s909146949.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s909146949", "user_id": "u270825463"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "import java.util.*\nfun main(args: Array){\n val scanner = Scanner(System.`in`)\n var num = scanner.nextInt()\n println(\"Christmas\")\n while(num < 0){\n println(\" Eve\")\n num++\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 212, "cpu_time_ms": 175, "memory_kb": 29348}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s830788912", "group_id": "codeNet:p03206", "input_text": "fun main(args: Array) {\n val D = readLine()!!.toInt()\n if(D == 25){\n println(\"Christmas\")\n } else if(D == 24){\n println(\"Christmas Eve\")\n } else if(D == 23){\n println(\"Christmas Eve Eve\")\n } else if(D == 22){\n println(\"Christmas Eve Eve Eve\")\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1581567680, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Kotlin/s830788912.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s830788912", "user_id": "u979282295"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "fun main(args: Array) {\n val D = readLine()!!.toInt()\n if(D == 25){\n println(\"Christmas\")\n } else if(D == 24){\n println(\"Christmas Eve\")\n } else if(D == 23){\n println(\"Christmas Eve Eve\")\n } else if(D == 22){\n println(\"Christmas Eve Eve Eve\")\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 302, "cpu_time_ms": 202, "memory_kb": 31304}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s872600116", "group_id": "codeNet:p03206", "input_text": "fun main(args: Array) {\n abc115a()\n}\n\nfun abc115a() {\n val d = readLine()!!.toInt()\n\n val answer = \"Christmas\" + (1..(25 - d)).map { \" Eve\" }.joinToString(separator = \"\")\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1567977425, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Kotlin/s872600116.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s872600116", "user_id": "u139478771"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "fun main(args: Array) {\n abc115a()\n}\n\nfun abc115a() {\n val d = readLine()!!.toInt()\n\n val answer = \"Christmas\" + (1..(25 - d)).map { \" Eve\" }.joinToString(separator = \"\")\n\n println(answer)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 211, "cpu_time_ms": 207, "memory_kb": 31876}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s694312136", "group_id": "codeNet:p03206", "input_text": "import java.io.*\nimport java.util.*\n\nval pw = PrintWriter(System.out)\nfun solve(D: Long){\n when(D){\n 25L -> {println(\"Christmas\")}\n 24L -> {println(\"Christmas Eve\")}\n 23L -> {println(\"Christmas Eve Eve\")}\n 22L -> {println(\"Christmas Eve Eve Eve\")}\n else -> {println(\"null\")}\n }\n return\n}\n\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val D = sc.next().toLong()\n solve(D)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1563292032, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Kotlin/s694312136.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s694312136", "user_id": "u329232967"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "import java.io.*\nimport java.util.*\n\nval pw = PrintWriter(System.out)\nfun solve(D: Long){\n when(D){\n 25L -> {println(\"Christmas\")}\n 24L -> {println(\"Christmas Eve\")}\n 23L -> {println(\"Christmas Eve Eve\")}\n 22L -> {println(\"Christmas Eve Eve Eve\")}\n else -> {println(\"null\")}\n }\n return\n}\n\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val D = sc.next().toLong()\n solve(D)\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 916, "cpu_time_ms": 192, "memory_kb": 31260}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s497368112", "group_id": "codeNet:p03206", "input_text": "import java.util.*;\n\nfun main(args: Array){\n val sc = Scanner(System.`in`)\n var day = sc.nextInt()\n if(day == 25){\n println(\"Christmas\")\n }\n else if(day == 24){\n println(\"Christmas Eve\")\n }\n else if(day == 23){\n println(\"Christmas Eve Eve\")\n }\n else{\n println(\"Christmas Eve Eve Eve\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1557988596, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Kotlin/s497368112.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s497368112", "user_id": "u648912196"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "import java.util.*;\n\nfun main(args: Array){\n val sc = Scanner(System.`in`)\n var day = sc.nextInt()\n if(day == 25){\n println(\"Christmas\")\n }\n else if(day == 24){\n println(\"Christmas Eve\")\n }\n else if(day == 23){\n println(\"Christmas Eve Eve\")\n }\n else{\n println(\"Christmas Eve Eve Eve\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 319, "cpu_time_ms": 173, "memory_kb": 29348}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s210193402", "group_id": "codeNet:p03206", "input_text": "import java.util.*\nfun main(args: Array) {\n\n val D = readLine()!!.split(\" \").map{it.toInt()}[0]\n println(\n when (D) {\n 22-> \"Christmas Eve Eve Eve\"\n 23-> \"Christmas Eve Eve\"\n 24-> \"Christmas Eve\"\n 25-> \"Christmas\"\n else-> \"err\"\n }\n )\n}\n", "language": "Kotlin", "metadata": {"date": 1555188724, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Kotlin/s210193402.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s210193402", "user_id": "u043557308"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "import java.util.*\nfun main(args: Array) {\n\n val D = readLine()!!.split(\" \").map{it.toInt()}[0]\n println(\n when (D) {\n 22-> \"Christmas Eve Eve Eve\"\n 23-> \"Christmas Eve Eve\"\n 24-> \"Christmas Eve\"\n 25-> \"Christmas\"\n else-> \"err\"\n }\n )\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 294, "cpu_time_ms": 239, "memory_kb": 36092}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s743371156", "group_id": "codeNet:p03206", "input_text": "import java.util.Scanner\n\nfun main(args: Array) {\n val D = readLine()!!.toInt();\n \n if(D==25){\n\t\tprintln(\"Christmas\");\n }else if(D==24){\n println(\"Christmas Eve\");\n }else if(D==23){\n println(\"Christmas Eve Eve\");\n }else if(D==22){\n println(\"Christmas Eve Eve Eve\");\n }\n}", "language": "Kotlin", "metadata": {"date": 1554518160, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Kotlin/s743371156.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s743371156", "user_id": "u397065106"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "import java.util.Scanner\n\nfun main(args: Array) {\n val D = readLine()!!.toInt();\n \n if(D==25){\n\t\tprintln(\"Christmas\");\n }else if(D==24){\n println(\"Christmas Eve\");\n }else if(D==23){\n println(\"Christmas Eve Eve\");\n }else if(D==22){\n println(\"Christmas Eve Eve Eve\");\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 324, "cpu_time_ms": 202, "memory_kb": 31864}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s554596738", "group_id": "codeNet:p03206", "input_text": "fun main(args: Array) {\n println((1..25 - readLine()!!.toInt()).map { \" Eve\" }.fold(\"Christmas\") { a, b -> a + b })\n}", "language": "Kotlin", "metadata": {"date": 1548449674, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Kotlin/s554596738.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s554596738", "user_id": "u384476909"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "fun main(args: Array) {\n println((1..25 - readLine()!!.toInt()).map { \" Eve\" }.fold(\"Christmas\") { a, b -> a + b })\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 222, "memory_kb": 31892}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s603330647", "group_id": "codeNet:p03206", "input_text": "fun main(args: Array) {\n val d = readLine()!!.toInt()\n var message = \"Christmas\"\n var i = 25 - d\n while (i != 0) {\n message += \" Eve\"\n i--\n }\n println(message)\n}\n", "language": "Kotlin", "metadata": {"date": 1545032733, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03206.html", "problem_id": "p03206", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03206/input.txt", "sample_output_relpath": "derived/input_output/data/p03206/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03206/Kotlin/s603330647.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s603330647", "user_id": "u051841332"}, "prompt_components": {"gold_output": "Christmas\n", "input_to_evaluate": "fun main(args: Array) {\n val d = readLine()!!.toInt()\n var message = \"Christmas\"\n var i = 25 - d\n while (i != 0) {\n message += \" Eve\"\n i--\n }\n println(message)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "sample_input": "25\n"}, "reference_outputs": ["Christmas\n"], "source_document_id": "p03206", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn some other world, today is December D-th.\n\nWrite a program that prints Christmas if D = 25, Christmas Eve if D = 24, Christmas Eve Eve if D = 23 and Christmas Eve Eve Eve if D = 22.\n\nConstraints\n\n22 \\leq D \\leq 25\n\nD is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD\n\nOutput\n\nPrint the specified string (case-sensitive).\n\nSample Input 1\n\n25\n\nSample Output 1\n\nChristmas\n\nSample Input 2\n\n22\n\nSample Output 2\n\nChristmas Eve Eve Eve\n\nBe sure to print spaces between the words.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 211, "memory_kb": 31688}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s036222427", "group_id": "codeNet:p03240", "input_text": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n\n val x = LongArray(N) { 0L }\n val y = LongArray(N) { 0L }\n val h = LongArray(N) { 0L }\n\n for (i in 0 until N) {\n val (X, Y, H) = readLine()!!.split(\" \").map { it.toLong() }\n x[i] = X\n y[i] = Y\n h[i] = H\n }\n\n fun check(cx: Long, cy: Long, H: Long): Boolean {\n if (h.max()!! > H) return false\n\n for (i in x.indices) {\n val dh = H - h[i]\n if (dh != Math.abs(x[i] - cx) + Math.abs(y[i] - cy) && h[i] != 0L) {\n return false\n }\n }\n\n return true\n }\n\n for (a in 0..100) {\n for (b in 0..100) {\n val dx = Math.abs(a - x[0])\n val dy = Math.abs(b - y[0])\n\n val ch = h[0] + dx + dy\n\n if (check(a.toLong(), b.toLong(), ch)) {\n println(\"$a $b $ch\")\n\n return\n }\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1578104699, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s036222427.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s036222427", "user_id": "u183530284"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n\n val x = LongArray(N) { 0L }\n val y = LongArray(N) { 0L }\n val h = LongArray(N) { 0L }\n\n for (i in 0 until N) {\n val (X, Y, H) = readLine()!!.split(\" \").map { it.toLong() }\n x[i] = X\n y[i] = Y\n h[i] = H\n }\n\n fun check(cx: Long, cy: Long, H: Long): Boolean {\n if (h.max()!! > H) return false\n\n for (i in x.indices) {\n val dh = H - h[i]\n if (dh != Math.abs(x[i] - cx) + Math.abs(y[i] - cy) && h[i] != 0L) {\n return false\n }\n }\n\n return true\n }\n\n for (a in 0..100) {\n for (b in 0..100) {\n val dx = Math.abs(a - x[0])\n val dy = Math.abs(b - y[0])\n\n val ch = h[0] + dx + dy\n\n if (check(a.toLong(), b.toLong(), ch)) {\n println(\"$a $b $ch\")\n\n return\n }\n }\n }\n}\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 950, "cpu_time_ms": 272, "memory_kb": 37904}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s046762711", "group_id": "codeNet:p03240", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val ps = (0 until n).map {\n val (x, y, h) = readLine()!!.split(' ').map { it.toInt() }\n Triple(x, y, h)\n }\n\n val p = ps.first { it.third > 0 }\n\n for (cx in 0..100) {\n for (cy in 0..100) {\n val ch = p.third + Math.abs(p.first - cx) + Math.abs(p.second - cy)\n if (ps.all { it.third == Math.max(ch - Math.abs(it.first - cx) - Math.abs(it.second - cy), 0) }) {\n println(\"$cx $cy $ch\")\n return\n }\n }\n }\n\n}\n", "language": "Kotlin", "metadata": {"date": 1568447094, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s046762711.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s046762711", "user_id": "u863309603"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val ps = (0 until n).map {\n val (x, y, h) = readLine()!!.split(' ').map { it.toInt() }\n Triple(x, y, h)\n }\n\n val p = ps.first { it.third > 0 }\n\n for (cx in 0..100) {\n for (cy in 0..100) {\n val ch = p.third + Math.abs(p.first - cx) + Math.abs(p.second - cy)\n if (ps.all { it.third == Math.max(ch - Math.abs(it.first - cx) - Math.abs(it.second - cy), 0) }) {\n println(\"$cx $cy $ch\")\n return\n }\n }\n }\n\n}\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 573, "cpu_time_ms": 267, "memory_kb": 38212}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s023990337", "group_id": "codeNet:p03240", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\ndata class Point(val x: Int, val y: Int, val h: Int)\n\nfun main(args: Array) {\n val n = readInt() \n val points = (0 until n).map {\n val (x, y, h) = readListOfInt()\n Point(x, y, h)\n }.sortedBy { -it.h }\n\n for(cx in 0..100) {\n for(cy in 0..100) {\n val pt = points[0]\n val ch = pt.h + Math.abs( pt.x - cx ) + Math.abs( pt.y - cy )\n if(points.all { p -> p.h == Math.max( ch - Math.abs(p.x - cx) - Math.abs(p.y - cy), 0) }) {\n println(\"$cx $cy $ch\")\n pw.flush()\n return\n }\n }\n }\n\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n }\n }\n return v.map { it.toList() }.toList()\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n if(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n a / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun isDecimal(v: Double): Boolean = ((v - Math.floor(v)) != 0.0)\n\n// Data Structures\nclass Stack(private var st: MutableList = mutableListOf()) {\n fun isEmpty() = st.isEmpty()\n fun top(): T = st.last()\n fun push(e: T) { st.add(e) }\n fun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n fun isEmpty() = que.isEmpty()\n fun top(): T = que.first()\n fun push(e: T) { que.add(e) }\n fun pop() { que = que.drop(1).toMutableList() }\n}\n", "language": "Kotlin", "metadata": {"date": 1566274775, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s023990337.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s023990337", "user_id": "u026686258"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\ndata class Point(val x: Int, val y: Int, val h: Int)\n\nfun main(args: Array) {\n val n = readInt() \n val points = (0 until n).map {\n val (x, y, h) = readListOfInt()\n Point(x, y, h)\n }.sortedBy { -it.h }\n\n for(cx in 0..100) {\n for(cy in 0..100) {\n val pt = points[0]\n val ch = pt.h + Math.abs( pt.x - cx ) + Math.abs( pt.y - cy )\n if(points.all { p -> p.h == Math.max( ch - Math.abs(p.x - cx) - Math.abs(p.y - cy), 0) }) {\n println(\"$cx $cy $ch\")\n pw.flush()\n return\n }\n }\n }\n\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n }\n }\n return v.map { it.toList() }.toList()\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n if(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n a / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun isDecimal(v: Double): Boolean = ((v - Math.floor(v)) != 0.0)\n\n// Data Structures\nclass Stack(private var st: MutableList = mutableListOf()) {\n fun isEmpty() = st.isEmpty()\n fun top(): T = st.last()\n fun push(e: T) { st.add(e) }\n fun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n fun isEmpty() = que.isEmpty()\n fun top(): T = que.first()\n fun push(e: T) { que.add(e) }\n fun pop() { que = que.drop(1).toMutableList() }\n}\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3205, "cpu_time_ms": 274, "memory_kb": 38104}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s269618465", "group_id": "codeNet:p03240", "input_text": "import java.io.*\nimport java.util.*\n\nfun solve(N: Int, x: IntArray, y: IntArray, h: IntArray) {\n // z = max(0, H - |x-cx| - |y-cy|)\n if (100 in h) {\n val idx = h.indexOf(100)!!\n println(\"${x[idx]} ${y[idx]} 100\")\n return\n }\n for (cx in 0..100) {\n for (cy in 0..100) {\n val dists = (0 until N)\n .filter{ h[it] != 0 }\n .map { h[it] + Math.abs(x[it] - cx) + Math.abs(y[it] - cy) }\n .distinct()\n if (dists.size == 1) {\n val H = dists[0]\n if ((0 until N)\n .filter{ h[it] == 0 }\n .map{ h[it] + Math.abs(x[it] - cx) + Math.abs(y[it] - cy) }.all{ it>=H }){\n println(\"$cx $cy $H\")\n return\n }\n }\n }\n }\n return\n}\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val N = sc.next().toInt()\n val x = IntArray(N)\n val y = IntArray(N)\n val h = IntArray(N)\n for (i in 0 until N) {\n x[i] = sc.next().toInt()\n y[i] = sc.next().toInt()\n h[i] = sc.next().toInt()\n }\n solve(N, x, y, h)\n}\n", "language": "Kotlin", "metadata": {"date": 1565031192, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s269618465.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s269618465", "user_id": "u329232967"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "import java.io.*\nimport java.util.*\n\nfun solve(N: Int, x: IntArray, y: IntArray, h: IntArray) {\n // z = max(0, H - |x-cx| - |y-cy|)\n if (100 in h) {\n val idx = h.indexOf(100)!!\n println(\"${x[idx]} ${y[idx]} 100\")\n return\n }\n for (cx in 0..100) {\n for (cy in 0..100) {\n val dists = (0 until N)\n .filter{ h[it] != 0 }\n .map { h[it] + Math.abs(x[it] - cx) + Math.abs(y[it] - cy) }\n .distinct()\n if (dists.size == 1) {\n val H = dists[0]\n if ((0 until N)\n .filter{ h[it] == 0 }\n .map{ h[it] + Math.abs(x[it] - cx) + Math.abs(y[it] - cy) }.all{ it>=H }){\n println(\"$cx $cy $H\")\n return\n }\n }\n }\n }\n return\n}\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val N = sc.next().toInt()\n val x = IntArray(N)\n val y = IntArray(N)\n val h = IntArray(N)\n for (i in 0 until N) {\n x[i] = sc.next().toInt()\n y[i] = sc.next().toInt()\n h[i] = sc.next().toInt()\n }\n solve(N, x, y, h)\n}\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1648, "cpu_time_ms": 447, "memory_kb": 52064}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s749616244", "group_id": "codeNet:p03240", "input_text": "fun main(args: Array) {\n\n val n = readLine()!!.toInt()\n\n val info = (1..n).map { readLine()!!.split(\" \").map { it.toInt() }.toTypedArray() }\n\n for (cx in 0..100) {\n for (cy in 0..100) {\n\n val (x, y, h) = info.first { it[2] >= 1 }\n val H = Math.abs(x - cx) + Math.abs(y - cy) + h\n val isans = info.all { it[2] == Math.max(H-Math.abs(it[0] - cx) - Math.abs(it[1] - cy), 0)}\n\n if(isans){\n println(\"$cx $cy $H\")\n break\n }\n }\n }\n}", "language": "Kotlin", "metadata": {"date": 1564854450, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s749616244.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s749616244", "user_id": "u108272327"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "fun main(args: Array) {\n\n val n = readLine()!!.toInt()\n\n val info = (1..n).map { readLine()!!.split(\" \").map { it.toInt() }.toTypedArray() }\n\n for (cx in 0..100) {\n for (cy in 0..100) {\n\n val (x, y, h) = info.first { it[2] >= 1 }\n val H = Math.abs(x - cx) + Math.abs(y - cy) + h\n val isans = info.all { it[2] == Math.max(H-Math.abs(it[0] - cx) - Math.abs(it[1] - cy), 0)}\n\n if(isans){\n println(\"$cx $cy $H\")\n break\n }\n }\n }\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 544, "cpu_time_ms": 295, "memory_kb": 37968}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s303495102", "group_id": "codeNet:p03240", "input_text": "fun main(args: Array) {\n\n val n = readLine()!!.toInt()\n\n val info = (1..n).map { readLine()!!.split(\" \").map { it.toInt() }.toTypedArray() }\n\n var ansh = 0\n var anscx = 0\n var anscy = 0\n\n for (cx in 0..100) {\n for (cy in 0..100) {\n\n for (i in 0 until n) {\n val x = info[i][0]\n val y = info[i][1]\n val h = info[i][2]\n\n val H = Math.max(Math.abs(x-cx) + Math.abs(y-cy) + h, 0)\n if(H >= 1){\n anscx = cx\n anscy = cy\n ansh = H\n break\n }\n }\n }\n }\n println(\"$anscx $anscy $ansh\")\n}", "language": "Kotlin", "metadata": {"date": 1564853444, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s303495102.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s303495102", "user_id": "u108272327"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "fun main(args: Array) {\n\n val n = readLine()!!.toInt()\n\n val info = (1..n).map { readLine()!!.split(\" \").map { it.toInt() }.toTypedArray() }\n\n var ansh = 0\n var anscx = 0\n var anscy = 0\n\n for (cx in 0..100) {\n for (cy in 0..100) {\n\n for (i in 0 until n) {\n val x = info[i][0]\n val y = info[i][1]\n val h = info[i][2]\n\n val H = Math.max(Math.abs(x-cx) + Math.abs(y-cy) + h, 0)\n if(H >= 1){\n anscx = cx\n anscy = cy\n ansh = H\n break\n }\n }\n }\n }\n println(\"$anscx $anscy $ansh\")\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 708, "cpu_time_ms": 266, "memory_kb": 37744}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s663554465", "group_id": "codeNet:p03240", "input_text": "fun main(args: Array) {\n\n val n = readLine()!!.toInt()\n\n val info = (1..n).map { readLine()!!.split(\" \").map { it.toInt() }.toTypedArray() }\n\n var ansh = 0\n var anscx = 0\n var anscy = 0\n\n for (cx in 0..100) {\n for (cy in 0..100) {\n\n val array = Array(n) { 0 }\n for (i in 0 until n) {\n val x = info[i][0]\n val y = info[i][1]\n val h = info[i][2]\n\n val H = Math.abs(x-cx) + Math.abs(y-cy) + h\n array[i] = H\n }\n if(array.distinct().size == 1){\n anscx = cx\n anscy = cy\n ansh = array.first()\n break\n }\n }\n }\n println(\"$anscx $anscy $ansh\")\n}", "language": "Kotlin", "metadata": {"date": 1564852879, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s663554465.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s663554465", "user_id": "u108272327"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "fun main(args: Array) {\n\n val n = readLine()!!.toInt()\n\n val info = (1..n).map { readLine()!!.split(\" \").map { it.toInt() }.toTypedArray() }\n\n var ansh = 0\n var anscx = 0\n var anscy = 0\n\n for (cx in 0..100) {\n for (cy in 0..100) {\n\n val array = Array(n) { 0 }\n for (i in 0 until n) {\n val x = info[i][0]\n val y = info[i][1]\n val h = info[i][2]\n\n val H = Math.abs(x-cx) + Math.abs(y-cy) + h\n array[i] = H\n }\n if(array.distinct().size == 1){\n anscx = cx\n anscy = cy\n ansh = array.first()\n break\n }\n }\n }\n println(\"$anscx $anscy $ansh\")\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 771, "cpu_time_ms": 462, "memory_kb": 50776}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s101409449", "group_id": "codeNet:p03240", "input_text": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val xyh = mutableListOf>()\n (1..N).forEach {\n val (x, y, h) = readLine()!!.split(\" \").map { it.toInt() }\n xyh.add(Triple(x, y, h))\n }\n\n (0..100).forEach { cx ->\n (0..100).forEach { cy ->\n fun actualHeight(x: Int, y: Int, h: Int): Int {\n return Math.abs(x - cx) + Math.abs(y - cy) + h\n }\n\n val estimates = mutableListOf()\n val boundaries = mutableListOf()\n (0..(N - 1)).forEach {\n val (x, y, h) = xyh[it]\n if (h != 0) {\n estimates.add(actualHeight(x, y, h))\n } else {\n boundaries.add(actualHeight(x, y, 0))\n }\n }\n val h = estimates[0]\n var unique = true\n estimates.forEach {\n unique = unique && it == h\n }\n var valid = true\n boundaries.forEach {\n if (h > it) {\n valid = false\n }\n }\n if (unique && h >= 1 && valid) {\n print(cx)\n print(' ')\n print(cy)\n print(' ')\n print(h)\n println(\"\")\n return\n }\n }\n }\n println(\"Something is wrong\")\n}\n", "language": "Kotlin", "metadata": {"date": 1563079709, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s101409449.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s101409449", "user_id": "u861095163"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val xyh = mutableListOf>()\n (1..N).forEach {\n val (x, y, h) = readLine()!!.split(\" \").map { it.toInt() }\n xyh.add(Triple(x, y, h))\n }\n\n (0..100).forEach { cx ->\n (0..100).forEach { cy ->\n fun actualHeight(x: Int, y: Int, h: Int): Int {\n return Math.abs(x - cx) + Math.abs(y - cy) + h\n }\n\n val estimates = mutableListOf()\n val boundaries = mutableListOf()\n (0..(N - 1)).forEach {\n val (x, y, h) = xyh[it]\n if (h != 0) {\n estimates.add(actualHeight(x, y, h))\n } else {\n boundaries.add(actualHeight(x, y, 0))\n }\n }\n val h = estimates[0]\n var unique = true\n estimates.forEach {\n unique = unique && it == h\n }\n var valid = true\n boundaries.forEach {\n if (h > it) {\n valid = false\n }\n }\n if (unique && h >= 1 && valid) {\n print(cx)\n print(' ')\n print(cy)\n print(' ')\n print(h)\n println(\"\")\n return\n }\n }\n }\n println(\"Something is wrong\")\n}\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1425, "cpu_time_ms": 579, "memory_kb": 52052}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s697315424", "group_id": "codeNet:p03240", "input_text": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val xyh = mutableListOf>()\n (1..N).forEach {\n val (x, y, h) = readLine()!!.split(\" \").map { it.toInt() }\n xyh.add(Triple(x, y, h))\n }\n\n (0..100).forEach { cx ->\n (0..100).forEach {cy ->\n fun actualHeight(x: Int, y: Int, h: Int) : Int {\n return Math.abs(x - cx) + Math.abs(y - cy) + h\n }\n val estimates = (0..(N-1)).map {\n val (x, y, h) = xyh[it]\n actualHeight(x, y, h)\n }\n\n val h = estimates[0]\n var unique = true\n estimates.forEach {\n unique = unique && it == h\n }\n if (unique) {\n print(cx)\n print(' ')\n print(cy)\n print(' ')\n print(h)\n println(\"\")\n return\n }\n }\n }\n println(\"Something is wrong\")\n}", "language": "Kotlin", "metadata": {"date": 1563078757, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s697315424.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s697315424", "user_id": "u861095163"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val xyh = mutableListOf>()\n (1..N).forEach {\n val (x, y, h) = readLine()!!.split(\" \").map { it.toInt() }\n xyh.add(Triple(x, y, h))\n }\n\n (0..100).forEach { cx ->\n (0..100).forEach {cy ->\n fun actualHeight(x: Int, y: Int, h: Int) : Int {\n return Math.abs(x - cx) + Math.abs(y - cy) + h\n }\n val estimates = (0..(N-1)).map {\n val (x, y, h) = xyh[it]\n actualHeight(x, y, h)\n }\n\n val h = estimates[0]\n var unique = true\n estimates.forEach {\n unique = unique && it == h\n }\n if (unique) {\n print(cx)\n print(' ')\n print(cy)\n print(' ')\n print(h)\n println(\"\")\n return\n }\n }\n }\n println(\"Something is wrong\")\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1008, "cpu_time_ms": 413, "memory_kb": 44092}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s500746586", "group_id": "codeNet:p03240", "input_text": "import java.util.*\n\nfun main(args:Array) {\n val mod = 1000000007L\n var N = readLine()!!.toInt()\n\n val X = mutableListOf>()\n val Y = mutableListOf>()\n\n val C = Array(N){ val (x,y,h) = readLine()!!.split(\" \").map(String::toInt);Triple(x,y,h) }\n\n for (x in 0..100){\n loop@for (y in 0..100) {\n var h = C[0].third + Math.abs(x - C[0].first) + Math.abs(y - C[0].second)\n for (c in C.drop(1)) {\n if (h != c.third + Math.abs(x - c.first) + Math.abs(y - c.second))\n continue@loop\n }\n println(\"$x $y $h\")\n }\n }\n}", "language": "Kotlin", "metadata": {"date": 1562606533, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s500746586.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s500746586", "user_id": "u043557308"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "import java.util.*\n\nfun main(args:Array) {\n val mod = 1000000007L\n var N = readLine()!!.toInt()\n\n val X = mutableListOf>()\n val Y = mutableListOf>()\n\n val C = Array(N){ val (x,y,h) = readLine()!!.split(\" \").map(String::toInt);Triple(x,y,h) }\n\n for (x in 0..100){\n loop@for (y in 0..100) {\n var h = C[0].third + Math.abs(x - C[0].first) + Math.abs(y - C[0].second)\n for (c in C.drop(1)) {\n if (h != c.third + Math.abs(x - c.first) + Math.abs(y - c.second))\n continue@loop\n }\n println(\"$x $y $h\")\n }\n }\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 651, "cpu_time_ms": 293, "memory_kb": 38664}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s733440718", "group_id": "codeNet:p03240", "input_text": "fun c112(args: Array) {\n val xyhList = args.drop(1).map { city -> city.split(\" \").map { it.toInt() } }\n\n fun abs(a: Int, b: Int): Int = if (a - b >= 0) a - b else b - a\n\n (0..100).forEach { cx ->\n (0..100).forEach { cy ->\n val ch = xyhList.first()[2] + abs(xyhList.first()[0], cx) + abs(xyhList.first()[1], cy)\n if (xyhList.all {\n ch == it[2] + abs(it[0], cx) + abs(it[1], cy)\n || (it[2] == 0 && abs(it[0], cx) + abs(it[1], cy) >= ch)\n }) {\n println(\"$cx $cy $ch\")\n }\n }\n }\n\n}\n\nfun main(args: Array) {\n c112(readLineList())\n}\n\nfun readLineList(): Array {\n val lineList = mutableListOf()\n while (true) {\n val line = readLine()\n if (line.isNullOrBlank()) {\n break\n } else {\n lineList.add(line!!)\n }\n }\n return lineList.toTypedArray()\n}", "language": "Kotlin", "metadata": {"date": 1541464245, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s733440718.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s733440718", "user_id": "u227166381"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "fun c112(args: Array) {\n val xyhList = args.drop(1).map { city -> city.split(\" \").map { it.toInt() } }\n\n fun abs(a: Int, b: Int): Int = if (a - b >= 0) a - b else b - a\n\n (0..100).forEach { cx ->\n (0..100).forEach { cy ->\n val ch = xyhList.first()[2] + abs(xyhList.first()[0], cx) + abs(xyhList.first()[1], cy)\n if (xyhList.all {\n ch == it[2] + abs(it[0], cx) + abs(it[1], cy)\n || (it[2] == 0 && abs(it[0], cx) + abs(it[1], cy) >= ch)\n }) {\n println(\"$cx $cy $ch\")\n }\n }\n }\n\n}\n\nfun main(args: Array) {\n c112(readLineList())\n}\n\nfun readLineList(): Array {\n val lineList = mutableListOf()\n while (true) {\n val line = readLine()\n if (line.isNullOrBlank()) {\n break\n } else {\n lineList.add(line!!)\n }\n }\n return lineList.toTypedArray()\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 977, "cpu_time_ms": 292, "memory_kb": 36368}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s861747152", "group_id": "codeNet:p03240", "input_text": "fun c112(args: Array) {\n val xyhList = args.drop(1).map { city -> city.split(\" \").map { it.toInt() } }\n\n fun abs(a: Int, b: Int): Int = if (a - b >= 0) a - b else b - a\n\n (0..100).forEach { cx ->\n (0..100).forEach { cy ->\n val ch = xyhList.first()[2] + abs(xyhList.first()[0], cx) + abs(xyhList.first()[1], cy)\n if (xyhList.all {\n ch == it[2] + abs(it[0], cx) + abs(it[1], cy)\n || (it[2] == 0 && abs(it[0], cx) + abs(it[1], cy) > ch)\n }) {\n println(\"$cx $cy $ch\")\n }\n }\n }\n\n}\n\nfun main(args: Array) {\n c112(readLineList())\n}\n\nfun readLineList(): Array {\n val lineList = mutableListOf()\n while (true) {\n val line = readLine()\n if (line.isNullOrBlank()) {\n break\n } else {\n lineList.add(line!!)\n }\n }\n return lineList.toTypedArray()\n}", "language": "Kotlin", "metadata": {"date": 1541463781, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s861747152.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s861747152", "user_id": "u227166381"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "fun c112(args: Array) {\n val xyhList = args.drop(1).map { city -> city.split(\" \").map { it.toInt() } }\n\n fun abs(a: Int, b: Int): Int = if (a - b >= 0) a - b else b - a\n\n (0..100).forEach { cx ->\n (0..100).forEach { cy ->\n val ch = xyhList.first()[2] + abs(xyhList.first()[0], cx) + abs(xyhList.first()[1], cy)\n if (xyhList.all {\n ch == it[2] + abs(it[0], cx) + abs(it[1], cy)\n || (it[2] == 0 && abs(it[0], cx) + abs(it[1], cy) > ch)\n }) {\n println(\"$cx $cy $ch\")\n }\n }\n }\n\n}\n\nfun main(args: Array) {\n c112(readLineList())\n}\n\nfun readLineList(): Array {\n val lineList = mutableListOf()\n while (true) {\n val line = readLine()\n if (line.isNullOrBlank()) {\n break\n } else {\n lineList.add(line!!)\n }\n }\n return lineList.toTypedArray()\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 976, "cpu_time_ms": 298, "memory_kb": 38180}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s132093356", "group_id": "codeNet:p03240", "input_text": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val xyhs = (1..N).map{ readLine()!!.split(\" \").map{ it.toInt() } }\n for(x in 0..100)y@for(y in 0..100){\n val p=xyhs.first{ it[2]!=0 }\n val h = p[2] + Math.abs(x-p[0]) + Math.abs(y-p[1])\n if(xyhs.all{ it[2] + Math.abs(x-it[0]) + Math.abs(y-it[1]) == h\n || it[2]==0 && Math.abs(x-it[0]) + Math.abs(y-it[1]) >=h}) {\n println(\"$x $y $h\")\n return\n }\n }\n}", "language": "Kotlin", "metadata": {"date": 1540400356, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s132093356.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s132093356", "user_id": "u914096045"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val xyhs = (1..N).map{ readLine()!!.split(\" \").map{ it.toInt() } }\n for(x in 0..100)y@for(y in 0..100){\n val p=xyhs.first{ it[2]!=0 }\n val h = p[2] + Math.abs(x-p[0]) + Math.abs(y-p[1])\n if(xyhs.all{ it[2] + Math.abs(x-it[0]) + Math.abs(y-it[1]) == h\n || it[2]==0 && Math.abs(x-it[0]) + Math.abs(y-it[1]) >=h}) {\n println(\"$x $y $h\")\n return\n }\n }\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 489, "cpu_time_ms": 316, "memory_kb": 38068}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s234421427", "group_id": "codeNet:p03240", "input_text": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val xyhs = (1..N).map{ readLine()!!.split(\" \").map{ it.toInt() } }\n for(x in 0..100)y@for(y in 0..100){\n val h = xyhs[0][2] + Math.abs(x-xyhs[0][0]) + Math.abs(y-xyhs[0][1])\n for(xyh in xyhs){\n if( xyh[2] + Math.abs(x-xyh[0]) + Math.abs(y-xyh[1]) != h){\n continue@y;\n }\n }\n println(\"$x $y $h\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1540398598, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s234421427.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s234421427", "user_id": "u914096045"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val xyhs = (1..N).map{ readLine()!!.split(\" \").map{ it.toInt() } }\n for(x in 0..100)y@for(y in 0..100){\n val h = xyhs[0][2] + Math.abs(x-xyhs[0][0]) + Math.abs(y-xyhs[0][1])\n for(xyh in xyhs){\n if( xyh[2] + Math.abs(x-xyh[0]) + Math.abs(y-xyh[1]) != h){\n continue@y;\n }\n }\n println(\"$x $y $h\")\n }\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 438, "cpu_time_ms": 277, "memory_kb": 36204}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s639357174", "group_id": "codeNet:p03240", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toLong()\n val data = mutableMapOf, MutableList>()\n var count = 0\n for (i in 1..n) {\n val (x, y, h) = readLine()!!.split(' ').map(String::toLong)\n if (h != 0L) {\n count++\n for (xi in 0..100) {\n for (yi in 0..100) {\n if (data[Pair(xi.toLong(), yi.toLong())] == null) {\n val list = mutableListOf()\n list.add(h + Math.abs(xi - x) + Math.abs(yi - y))\n data[Pair(xi.toLong(), yi.toLong())] = list\n } else {\n data[Pair(xi.toLong(), yi.toLong())]!!.add(h + Math.abs(xi - x) + Math.abs(yi - y))\n }\n }\n }\n }\n }\n val filterValues = data.filterValues { it.groupBy { it }.maxBy { it.value.size }!!.value.size == count }\n for (v in filterValues) {\n println(\"${v.key.first} ${v.key.second} ${v.value[0]}\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1538881527, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03240.html", "problem_id": "p03240", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03240/input.txt", "sample_output_relpath": "derived/input_output/data/p03240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03240/Kotlin/s639357174.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s639357174", "user_id": "u099066216"}, "prompt_components": {"gold_output": "2 2 6\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toLong()\n val data = mutableMapOf, MutableList>()\n var count = 0\n for (i in 1..n) {\n val (x, y, h) = readLine()!!.split(' ').map(String::toLong)\n if (h != 0L) {\n count++\n for (xi in 0..100) {\n for (yi in 0..100) {\n if (data[Pair(xi.toLong(), yi.toLong())] == null) {\n val list = mutableListOf()\n list.add(h + Math.abs(xi - x) + Math.abs(yi - y))\n data[Pair(xi.toLong(), yi.toLong())] = list\n } else {\n data[Pair(xi.toLong(), yi.toLong())]!!.add(h + Math.abs(xi - x) + Math.abs(yi - y))\n }\n }\n }\n }\n }\n val filterValues = data.filterValues { it.groupBy { it }.maxBy { it.value.size }!!.value.size == count }\n for (v in filterValues) {\n println(\"${v.key.first} ${v.key.second} ${v.value[0]}\")\n }\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "sample_input": "4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n"}, "reference_outputs": ["2 2 6\n"], "source_document_id": "p03240", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn the Ancient Kingdom of Snuke, there was a pyramid to strengthen the authority of Takahashi, the president of AtCoder Inc.\n\nThe pyramid had center coordinates (C_X, C_Y) and height H. The altitude of coordinates (X, Y) is max(H - |X - C_X| - |Y - C_Y|, 0).\n\nAoki, an explorer, conducted a survey to identify the center coordinates and height of this pyramid. As a result, he obtained the following information:\n\nC_X, C_Y was integers between 0 and 100 (inclusive), and H was an integer not less than 1.\n\nAdditionally, he obtained N pieces of information. The i-th of them is: \"the altitude of point (x_i, y_i) is h_i.\"\n\nThis was enough to identify the center coordinates and the height of the pyramid. Find these values with the clues above.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\nx_i and y_i are integers between 0 and 100 (inclusive).\n\nh_i is an integer between 0 and 10^9 (inclusive).\n\nThe N coordinates (x_1, y_1), (x_2, y_2), (x_3, y_3), ..., (x_N, y_N) are all different.\n\nThe center coordinates and the height of the pyramid can be uniquely identified.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 h_1\nx_2 y_2 h_2\nx_3 y_3 h_3\n:\nx_N y_N h_N\n\nOutput\n\nPrint values C_X, C_Y and H representing the center coordinates and the height of the pyramid in one line, with spaces in between.\n\nSample Input 1\n\n4\n2 3 5\n2 1 5\n1 2 5\n3 2 5\n\nSample Output 1\n\n2 2 6\n\nIn this case, the center coordinates and the height can be identified as (2, 2) and 6.\n\nSample Input 2\n\n2\n0 0 100\n1 1 98\n\nSample Output 2\n\n0 0 100\n\nIn this case, the center coordinates and the height can be identified as (0, 0) and 100.\n\nNote that C_X and C_Y are known to be integers between 0 and 100.\n\nSample Input 3\n\n3\n99 1 191\n100 1 192\n99 0 192\n\nSample Output 3\n\n100 0 193\n\nIn this case, the center coordinates and the height can be identified as (100, 0) and 193.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1042, "cpu_time_ms": 1269, "memory_kb": 127372}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s774452193", "group_id": "codeNet:p03250", "input_text": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\nfun main() {\n val A = nextIntList()\n println(A.max()!! * 9 + A.sum())\n}", "language": "Kotlin", "metadata": {"date": 1591073353, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Kotlin/s774452193.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s774452193", "user_id": "u860789370"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\nfun main() {\n val A = nextIntList()\n println(A.max()!! * 9 + A.sum())\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 599, "cpu_time_ms": 241, "memory_kb": 37780}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s760220928", "group_id": "codeNet:p03250", "input_text": "fun main(args: Array) {\n val (A, B, C) = readLine()!!.split(\" \").map(String::toInt)\n val _list = listOf(A,B,C).sorted()\n println(_list[2] * 10 + _list[1] + _list[0])\n}", "language": "Kotlin", "metadata": {"date": 1585971439, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Kotlin/s760220928.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s760220928", "user_id": "u181807786"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "fun main(args: Array) {\n val (A, B, C) = readLine()!!.split(\" \").map(String::toInt)\n val _list = listOf(A,B,C).sorted()\n println(_list[2] * 10 + _list[1] + _list[0])\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 184, "cpu_time_ms": 241, "memory_kb": 37948}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s527130107", "group_id": "codeNet:p03250", "input_text": "fun main(args: Array) {\n val input: List = readLine()!!.split(\" \").map{it.toInt()}\n val a: Int = input[0]\n val b: Int = input[1]\n val c: Int = input[2]\n val answer:Int\n answer = if (a > b){\n if (a > c){\n a * 10 + b + c\n } else{\n c * 10 + b + a\n }\n }else if (b > c){\n b * 10 + a + c\n }else{\n c * 10 + a + b\n }\n print(answer)\n return\n}\n", "language": "Kotlin", "metadata": {"date": 1579113806, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Kotlin/s527130107.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s527130107", "user_id": "u138781768"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "fun main(args: Array) {\n val input: List = readLine()!!.split(\" \").map{it.toInt()}\n val a: Int = input[0]\n val b: Int = input[1]\n val c: Int = input[2]\n val answer:Int\n answer = if (a > b){\n if (a > c){\n a * 10 + b + c\n } else{\n c * 10 + b + a\n }\n }else if (b > c){\n b * 10 + a + c\n }else{\n c * 10 + a + b\n }\n print(answer)\n return\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 437, "cpu_time_ms": 236, "memory_kb": 37764}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s145066066", "group_id": "codeNet:p03250", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val abc = readListOfInt() \n val perm = permutations(abc)\n var ans = perm[0].let { it[0] * 10 + it[1] + it[2] }\n for(i in 0 until perm.size) {\n val (a, b, c) = perm[i]\n val tmp = a * 10 + b + c\n if(ans < tmp) {\n ans = tmp\n }\n }\n println(ans)\n\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n }\n }\n return v.map { it.toList() }.toList()\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n if(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n a / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun isDecimal(v: Double): Boolean = ((v - Math.floor(v)) != 0.0)\n\n// Data Structures\nclass Stack(private var st: MutableList = mutableListOf()) {\n fun isEmpty() = st.isEmpty()\n fun top(): T = st.last()\n fun push(e: T) { st.add(e) }\n fun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n fun isEmpty() = que.isEmpty()\n fun top(): T = que.first()\n fun push(e: T) { que.add(e) }\n fun pop() { que = que.drop(1).toMutableList() }\n}\n", "language": "Kotlin", "metadata": {"date": 1565634784, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Kotlin/s145066066.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s145066066", "user_id": "u026686258"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val abc = readListOfInt() \n val perm = permutations(abc)\n var ans = perm[0].let { it[0] * 10 + it[1] + it[2] }\n for(i in 0 until perm.size) {\n val (a, b, c) = perm[i]\n val tmp = a * 10 + b + c\n if(ans < tmp) {\n ans = tmp\n }\n }\n println(ans)\n\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n }\n }\n return v.map { it.toList() }.toList()\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n if(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n a / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun isDecimal(v: Double): Boolean = ((v - Math.floor(v)) != 0.0)\n\n// Data Structures\nclass Stack(private var st: MutableList = mutableListOf()) {\n fun isEmpty() = st.isEmpty()\n fun top(): T = st.last()\n fun push(e: T) { st.add(e) }\n fun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n fun isEmpty() = que.isEmpty()\n fun top(): T = que.first()\n fun push(e: T) { que.add(e) }\n fun pop() { que = que.drop(1).toMutableList() }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2887, "cpu_time_ms": 244, "memory_kb": 35836}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s231632303", "group_id": "codeNet:p03250", "input_text": "fun main(args: Array){\n val input = readLine()!!.split(' ')\n .map { it.toInt() }\n .toTypedArray()\n val result = D0923A(input).judge()\n println(result)\n}\n\nclass D0923A(\n val numbers: Array\n){\n fun judge(): Int{\n val max = numbers.max()!!\n return numbers.sum() + (max * 10) - max\n }\n}", "language": "Kotlin", "metadata": {"date": 1556802737, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Kotlin/s231632303.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s231632303", "user_id": "u100049305"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "fun main(args: Array){\n val input = readLine()!!.split(' ')\n .map { it.toInt() }\n .toTypedArray()\n val result = D0923A(input).judge()\n println(result)\n}\n\nclass D0923A(\n val numbers: Array\n){\n fun judge(): Int{\n val max = numbers.max()!!\n return numbers.sum() + (max * 10) - max\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 379, "cpu_time_ms": 236, "memory_kb": 36400}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s778664627", "group_id": "codeNet:p03250", "input_text": "fun main(args: Array) {\n val x = readLine()!!.split(\" \").map{it.toInt()}\n println(x.sum()+9*x.max()!!)\n}", "language": "Kotlin", "metadata": {"date": 1540437192, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03250.html", "problem_id": "p03250", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03250/input.txt", "sample_output_relpath": "derived/input_output/data/p03250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03250/Kotlin/s778664627.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s778664627", "user_id": "u914096045"}, "prompt_components": {"gold_output": "53\n", "input_to_evaluate": "fun main(args: Array) {\n val x = readLine()!!.split(\" \").map{it.toInt()}\n println(x.sum()+9*x.max()!!)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "sample_input": "1 5 2\n"}, "reference_outputs": ["53\n"], "source_document_id": "p03250", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have decided to give an allowance to your child depending on the outcome of the game that he will play now.\n\nThe game is played as follows:\n\nThere are three \"integer panels\", each with a digit between 1 and 9 (inclusive) printed on it, and one \"operator panel\" with a + printed on it.\n\nThe player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)\n\nThen, the amount of the allowance will be equal to the resulting value of the formula.\n\nGiven the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, C \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum possible amount of the allowance.\n\nSample Input 1\n\n1 5 2\n\nSample Output 1\n\n53\n\nThe amount of the allowance will be 53 when the panels are arranged as 52+1, and this is the maximum possible amount.\n\nSample Input 2\n\n9 9 9\n\nSample Output 2\n\n108\n\nSample Input 3\n\n6 6 7\n\nSample Output 3\n\n82", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 118, "cpu_time_ms": 232, "memory_kb": 37796}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s414512101", "group_id": "codeNet:p03251", "input_text": "fun main(arr: Array) {\n println(if(mustWar()) \"War\" else \"No War\")\n}\n\nfun mustWar():Boolean {\n val (n,m,x,y) = readLine()!!.split(\" \").map { it.toInt() }\n val xCities = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n val yCities = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n if(x >= y) {\n return true\n }\n if(xCities.last() >= yCities.first()) {\n return true\n }\n if(xCities.last() >= y) {\n return true\n }\n if(x >= yCities.first()) {\n return true\n }\n return false\n}\n", "language": "Kotlin", "metadata": {"date": 1600015122, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Kotlin/s414512101.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s414512101", "user_id": "u269969976"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "fun main(arr: Array) {\n println(if(mustWar()) \"War\" else \"No War\")\n}\n\nfun mustWar():Boolean {\n val (n,m,x,y) = readLine()!!.split(\" \").map { it.toInt() }\n val xCities = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n val yCities = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n if(x >= y) {\n return true\n }\n if(xCities.last() >= yCities.first()) {\n return true\n }\n if(xCities.last() >= y) {\n return true\n }\n if(x >= yCities.first()) {\n return true\n }\n return false\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 553, "cpu_time_ms": 134, "memory_kb": 40444}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s908706742", "group_id": "codeNet:p03251", "input_text": "fun main(args: Array) = println(run {\n val (n,m,x,y) = readLine()!!.split(\" \").map { it.toInt() }\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val b = readLine()!!.split(\" \").map { it.toInt() }\n\n if (Math.max(x, a.max()!!) < Math.min(y, b.min()!!)) \"No War\" else \"War\"\n})\n", "language": "Kotlin", "metadata": {"date": 1588630439, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Kotlin/s908706742.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s908706742", "user_id": "u563556491"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "fun main(args: Array) = println(run {\n val (n,m,x,y) = readLine()!!.split(\" \").map { it.toInt() }\n val a = readLine()!!.split(\" \").map { it.toInt() }\n val b = readLine()!!.split(\" \").map { it.toInt() }\n\n if (Math.max(x, a.max()!!) < Math.min(y, b.min()!!)) \"No War\" else \"War\"\n})\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 300, "cpu_time_ms": 238, "memory_kb": 36132}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s382594349", "group_id": "codeNet:p03251", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val N = sc.nextInt()\n val M = sc.nextInt()\n val X = sc.nextInt()\n val Y = sc.nextInt()\n val x = (1..N).map { sc.nextInt() }.plus(X)\n val y = (1..M).map { sc.nextInt() }.plus(Y)\n println(if (x.max()!! < y.min()!!) \"No War\" else \"War\")\n}", "language": "Kotlin", "metadata": {"date": 1584198799, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Kotlin/s382594349.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s382594349", "user_id": "u733811860"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val N = sc.nextInt()\n val M = sc.nextInt()\n val X = sc.nextInt()\n val Y = sc.nextInt()\n val x = (1..N).map { sc.nextInt() }.plus(X)\n val y = (1..M).map { sc.nextInt() }.plus(Y)\n println(if (x.max()!! < y.min()!!) \"No War\" else \"War\")\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 343, "cpu_time_ms": 207, "memory_kb": 31384}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s058431370", "group_id": "codeNet:p03251", "input_text": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val (n, m, x, y) = listOfInt()\n val xx = listOfInt()\n val yy = listOfInt()\n\n val xMax = xx.max()!!\n val yMin = yy.min()!!\n\n for (z in xMax+1..yMin) {\n if (x < z && z <= y) {\n println(\"No War\")\n return\n }\n }\n\n println(\"War\")\n}\n\nfun next() = readLine()!!\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map { it.toInt() }\n\nfun println(value : Any) {\n pw.println(value)\n}", "language": "Kotlin", "metadata": {"date": 1569827988, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Kotlin/s058431370.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s058431370", "user_id": "u262403099"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val (n, m, x, y) = listOfInt()\n val xx = listOfInt()\n val yy = listOfInt()\n\n val xMax = xx.max()!!\n val yMin = yy.min()!!\n\n for (z in xMax+1..yMin) {\n if (x < z && z <= y) {\n println(\"No War\")\n return\n }\n }\n\n println(\"War\")\n}\n\nfun next() = readLine()!!\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map { it.toInt() }\n\nfun println(value : Any) {\n pw.println(value)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 592, "cpu_time_ms": 240, "memory_kb": 37956}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s779871010", "group_id": "codeNet:p03251", "input_text": "fun main(args: Array) {\n var a = \"War\"\n val (n, m, x, y) = readLine()!!.split(\" \").map { it.toInt() }\n val e = readLine()!!.split(\" \").map { it.toInt() }.sortedDescending()\n val w = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n for(i in e[0] until w[0])if(i > x && i < y) a = \"No War\"\n println(a)\n}\n", "language": "Kotlin", "metadata": {"date": 1544631444, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Kotlin/s779871010.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s779871010", "user_id": "u227189389"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "fun main(args: Array) {\n var a = \"War\"\n val (n, m, x, y) = readLine()!!.split(\" \").map { it.toInt() }\n val e = readLine()!!.split(\" \").map { it.toInt() }.sortedDescending()\n val w = readLine()!!.split(\" \").map { it.toInt() }.sorted()\n for(i in e[0] until w[0])if(i > x && i < y) a = \"No War\"\n println(a)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 332, "cpu_time_ms": 250, "memory_kb": 37860}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s035791806", "group_id": "codeNet:p03251", "input_text": "fun main(args: Array) {\n val (n, m, x, y) = readLine()!!.split(\" \").map(String::toInt)\n val xs = readLine()!!.split(\" \").map(String::toInt)\n val ys = readLine()!!.split(\" \").map(String::toInt)\n\n val maxXn = xs.max()!!\n val minYn = ys.min()!!\n\n val nowar = x <= maxXn && minYn <= y && maxXn <= minYn\n\n val ans = if (nowar) {\n \"No War\"\n } else {\n \"War\"\n }\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1537753537, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03251.html", "problem_id": "p03251", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03251/input.txt", "sample_output_relpath": "derived/input_output/data/p03251/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03251/Kotlin/s035791806.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s035791806", "user_id": "u367259152"}, "prompt_components": {"gold_output": "No War\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m, x, y) = readLine()!!.split(\" \").map(String::toInt)\n val xs = readLine()!!.split(\" \").map(String::toInt)\n val ys = readLine()!!.split(\" \").map(String::toInt)\n\n val maxXn = xs.max()!!\n val minYn = ys.min()!!\n\n val nowar = x <= maxXn && minYn <= y && maxXn <= minYn\n\n val ans = if (nowar) {\n \"No War\"\n } else {\n \"War\"\n }\n println(ans)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "sample_input": "3 2 10 20\n8 15 13\n16 22\n"}, "reference_outputs": ["No War\n"], "source_document_id": "p03251", "source_text": "Score : 200 points\n\nProblem Statement\n\nOur world is one-dimensional, and ruled by two empires called Empire A and Empire B.\n\nThe capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.\n\nOne day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.\n\nIf there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.\n\nX < Z \\leq Y\n\nx_1, x_2, ..., x_N < Z\n\ny_1, y_2, ..., y_M \\geq Z\n\nDetermine if war will break out.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 100\n\n-100 \\leq X < Y \\leq 100\n\n-100 \\leq x_i, y_i \\leq 100\n\nx_1, x_2, ..., x_N \\neq X\n\nx_i are all different.\n\ny_1, y_2, ..., y_M \\neq Y\n\ny_i are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X Y\nx_1 x_2 ... x_N\ny_1 y_2 ... y_M\n\nOutput\n\nIf war will break out, print War; otherwise, print No War.\n\nSample Input 1\n\n3 2 10 20\n8 15 13\n16 22\n\nSample Output 1\n\nNo War\n\nThe choice Z = 16 satisfies all of the three conditions as follows, thus they will come to an agreement.\n\nX = 10 < 16 \\leq 20 = Y\n\n8, 15, 13 < 16\n\n16, 22 \\geq 16\n\nSample Input 2\n\n4 2 -48 -1\n-20 -35 -91 -23\n-22 66\n\nSample Output 2\n\nWar\n\nSample Input 3\n\n5 3 6 8\n-10 3 1 5 -100\n100 6 14\n\nSample Output 3\n\nWar", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 421, "cpu_time_ms": 284, "memory_kb": 37956}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s058493007", "group_id": "codeNet:p03260", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextInt()\n val b = sc.nextInt()\n println(problem109a(a, b))\n}\n\nfun problem109a(a: Int, b: Int): String {\n return if (a * b % 2 == 0) \"Yes\" else \"No\"\n}", "language": "Kotlin", "metadata": {"date": 1585539215, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Kotlin/s058493007.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s058493007", "user_id": "u073232808"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextInt()\n val b = sc.nextInt()\n println(problem109a(a, b))\n}\n\nfun problem109a(a: Int, b: Int): String {\n return if (a * b % 2 == 0) \"Yes\" else \"No\"\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 260, "cpu_time_ms": 176, "memory_kb": 29468}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s899076463", "group_id": "codeNet:p03260", "input_text": "fun main(args: Array) {\n\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n\n if (a % 2 != 0 && b % 2 != 0) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1566776303, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Kotlin/s899076463.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s899076463", "user_id": "u108272327"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n\n if (a % 2 != 0 && b % 2 != 0) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 195, "cpu_time_ms": 234, "memory_kb": 36028}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s545422444", "group_id": "codeNet:p03260", "input_text": "fun main(args: Array){\n val (a, b) = readLine()!!.split(\" \")\n .map{ it.toInt() }\n var ans = \"Yes\"\n \n when{\n (a * b) % 2 == 0 -> { ans = \"No\" }\n }\n \n println(ans)\n}\n ", "language": "Kotlin", "metadata": {"date": 1556807428, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Kotlin/s545422444.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s545422444", "user_id": "u165999673"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array){\n val (a, b) = readLine()!!.split(\" \")\n .map{ it.toInt() }\n var ans = \"Yes\"\n \n when{\n (a * b) % 2 == 0 -> { ans = \"No\" }\n }\n \n println(ans)\n}\n ", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 198, "cpu_time_ms": 235, "memory_kb": 37788}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s178984398", "group_id": "codeNet:p03260", "input_text": "import java.io.IOException\nimport java.io.InputStream\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextInt()\n val b = sc.nextInt()\n println(if (a * b % 2 == 1) \"Yes\" else \"No\")\n}\n\nclass Scanner(private val `in`: InputStream) {\n private val buffer = ByteArray(1024)\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) return true\n else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) return false\n }\n return true\n }\n\n private fun readByte(): Byte {\n return if (hasNextByte()) buffer[ptr++] else -1\n }\n\n private fun isPrintableChar(c: Char): Boolean {\n return c in '!'..'~'\n }\n\n private fun skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toChar())) ptr++\n }\n\n fun hasNext(): Boolean {\n skipUnprintable()\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b.toChar())) {\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextInt(): Int {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n if (b.toChar() in '0'..'9') {\n n *= 10\n n += b - '0'.toByte()\n } else return if (b.toInt() == -1 || !isPrintableChar(b.toChar())) {\n if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextIntArray(n: Int): IntArray {\n return IntArray(n) { nextInt() }\n }\n\n fun nextIntArrays(n: Int, m: Int): Array {\n val arrays = Array(m) { IntArray(n) }\n for (i in 0 until n) {\n for (j in 0 until m) {\n arrays[j][i] = nextInt()\n }\n }\n return arrays\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByte()\n if (b == '-'.toByte()) {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n if (b.toChar() in '0'..'9') {\n n *= 10\n n += (b - '0'.toByte()).toLong()\n } else return if (b.toInt() == -1 || !isPrintableChar(b.toChar())) {\n if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextLongArray(n: Int): LongArray {\n return LongArray(n) { nextLong() }\n }\n\n fun nextLongArrays(n: Int, m: Int): Array {\n val arrays = Array(m) { LongArray(n) }\n for (i in 0 until n) {\n for (j in 0 until m) {\n arrays[j][i] = nextLong()\n }\n }\n return arrays\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1536458046, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Kotlin/s178984398.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s178984398", "user_id": "u253203109"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.io.IOException\nimport java.io.InputStream\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextInt()\n val b = sc.nextInt()\n println(if (a * b % 2 == 1) \"Yes\" else \"No\")\n}\n\nclass Scanner(private val `in`: InputStream) {\n private val buffer = ByteArray(1024)\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n if (ptr < buflen) return true\n else {\n ptr = 0\n try {\n buflen = `in`.read(buffer)\n } catch (e: IOException) {\n e.printStackTrace()\n }\n if (buflen <= 0) return false\n }\n return true\n }\n\n private fun readByte(): Byte {\n return if (hasNextByte()) buffer[ptr++] else -1\n }\n\n private fun isPrintableChar(c: Char): Boolean {\n return c in '!'..'~'\n }\n\n private fun skipUnprintable() {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toChar())) ptr++\n }\n\n fun hasNext(): Boolean {\n skipUnprintable()\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b.toChar())) {\n sb.appendCodePoint(b.toInt())\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextInt(): Int {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n if (b.toChar() in '0'..'9') {\n n *= 10\n n += b - '0'.toByte()\n } else return if (b.toInt() == -1 || !isPrintableChar(b.toChar())) {\n if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextIntArray(n: Int): IntArray {\n return IntArray(n) { nextInt() }\n }\n\n fun nextIntArrays(n: Int, m: Int): Array {\n val arrays = Array(m) { IntArray(n) }\n for (i in 0 until n) {\n for (j in 0 until m) {\n arrays[j][i] = nextInt()\n }\n }\n return arrays\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n: Long = 0\n var minus = false\n var b = readByte()\n if (b == '-'.toByte()) {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n if (b.toChar() in '0'..'9') {\n n *= 10\n n += (b - '0'.toByte()).toLong()\n } else return if (b.toInt() == -1 || !isPrintableChar(b.toChar())) {\n if (minus) -n else n\n } else {\n throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n fun nextLongArray(n: Int): LongArray {\n return LongArray(n) { nextLong() }\n }\n\n fun nextLongArrays(n: Int, m: Int): Array {\n val arrays = Array(m) { LongArray(n) }\n for (i in 0 until n) {\n for (j in 0 until m) {\n arrays[j][i] = nextLong()\n }\n }\n return arrays\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3522, "cpu_time_ms": 165, "memory_kb": 31384}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s961942839", "group_id": "codeNet:p03260", "input_text": "import java.util.Scanner\n\nfun main(args:Array){\n val scanner=Scanner(System.`in`)\n\n val n=scanner.nextInt()\n val m=scanner.nextInt()\n\n if(n%2==1&&m%2==1) println(\"Yes\")\n else println(\"No\")\n}", "language": "Kotlin", "metadata": {"date": 1536455025, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03260.html", "problem_id": "p03260", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03260/input.txt", "sample_output_relpath": "derived/input_output/data/p03260/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03260/Kotlin/s961942839.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s961942839", "user_id": "u122997134"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.Scanner\n\nfun main(args:Array){\n val scanner=Scanner(System.`in`)\n\n val n=scanner.nextInt()\n val m=scanner.nextInt()\n\n if(n%2==1&&m%2==1) println(\"Yes\")\n else println(\"No\")\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "sample_input": "3 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03260", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given integers A and B, each between 1 and 3 (inclusive).\n\nDetermine if there is an integer C between 1 and 3 (inclusive) such that A \\times B \\times C is an odd number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\nYes\n\nLet C = 3. Then, A \\times B \\times C = 3 \\times 1 \\times 3 = 9, which is an odd number.\n\nSample Input 2\n\n1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 2\n\nSample Output 3\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 213, "cpu_time_ms": 185, "memory_kb": 31396}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s822962417", "group_id": "codeNet:p03261", "input_text": "fun main(args: Array) {\n abc109b()\n}\n\nfun abc109b() {\n val n = readLine()!!.toInt()\n val words = (1..n).map { readLine()!! }\n\n val duplicated = words.groupBy { it }.let { it.maxBy { it.value.size }!!.let { it.value.size > 1 } }\n\n val isShiritori = (0 until n - 1).all {\n words[it].last() == words[it + 1].first()\n }\n\n val answer = if (!duplicated && isShiritori) \"Yes\" else \"No\"\n\n println(answer)\n}", "language": "Kotlin", "metadata": {"date": 1568493826, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Kotlin/s822962417.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s822962417", "user_id": "u139478771"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n abc109b()\n}\n\nfun abc109b() {\n val n = readLine()!!.toInt()\n val words = (1..n).map { readLine()!! }\n\n val duplicated = words.groupBy { it }.let { it.maxBy { it.value.size }!!.let { it.value.size > 1 } }\n\n val isShiritori = (0 until n - 1).all {\n words[it].last() == words[it + 1].first()\n }\n\n val answer = if (!duplicated && isShiritori) \"Yes\" else \"No\"\n\n println(answer)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 437, "cpu_time_ms": 217, "memory_kb": 33488}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s293581132", "group_id": "codeNet:p03261", "input_text": "fun main(args: Array) {\n\n val n = readLine()!!.toInt()\n\n val w = (1..n).map { readLine()!! }\n\n for(i in 1 until n){\n if(w[i].first() != w[i-1].last()){\n println(\"No\")\n return\n }\n\n for(j in 0 until i){\n if(w[i] == w[j]){\n println(\"No\")\n return\n }\n }\n }\n\n println(\"Yes\")\n}", "language": "Kotlin", "metadata": {"date": 1566776807, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Kotlin/s293581132.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s293581132", "user_id": "u108272327"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n\n val n = readLine()!!.toInt()\n\n val w = (1..n).map { readLine()!! }\n\n for(i in 1 until n){\n if(w[i].first() != w[i-1].last()){\n println(\"No\")\n return\n }\n\n for(j in 0 until i){\n if(w[i] == w[j]){\n println(\"No\")\n return\n }\n }\n }\n\n println(\"Yes\")\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 395, "cpu_time_ms": 228, "memory_kb": 33788}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s815909636", "group_id": "codeNet:p03261", "input_text": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val w = Array(n) { readLine()!! }\n val s = mutableSetOf(w[0])\n var c = w[0].last()\n for (i in 1 until n) {\n val cw = w[i]\n if (cw.first() != c || cw in s) {\n println(\"No\")\n return\n }\n c = cw.last()\n s += cw\n }\n println(\"Yes\")\n}\n", "language": "Kotlin", "metadata": {"date": 1560143773, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Kotlin/s815909636.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s815909636", "user_id": "u051841332"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n val n = readLine()!!.toInt()\n val w = Array(n) { readLine()!! }\n val s = mutableSetOf(w[0])\n var c = w[0].last()\n for (i in 1 until n) {\n val cw = w[i]\n if (cw.first() != c || cw in s) {\n println(\"No\")\n return\n }\n c = cw.last()\n s += cw\n }\n println(\"Yes\")\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 369, "cpu_time_ms": 235, "memory_kb": 38048}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s257005474", "group_id": "codeNet:p03261", "input_text": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val W = Array(N) { readLine()!! }\n\n val areNotDuplicated = W.toSet().size == N\n val areMatched = W.reduce { old, new -> if (old.last() == new.first()) { new.last().toString() } else \"-\" } != \"-\"\n\n println(if (areNotDuplicated && areMatched) \"Yes\" else \"No\")\n}", "language": "Kotlin", "metadata": {"date": 1544071323, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Kotlin/s257005474.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s257005474", "user_id": "u963316883"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val W = Array(N) { readLine()!! }\n\n val areNotDuplicated = W.toSet().size == N\n val areMatched = W.reduce { old, new -> if (old.last() == new.first()) { new.last().toString() } else \"-\" } != \"-\"\n\n println(if (areNotDuplicated && areMatched) \"Yes\" else \"No\")\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 338, "cpu_time_ms": 235, "memory_kb": 37996}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s666997116", "group_id": "codeNet:p03261", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val dic = Array(n) { \"\" }\n var flg = false\n\n for (i in 0 until n) {\n val w = sc.next()\n if (w in dic) {\n flg = true\n }\n if (i != 0 && dic[i - 1].last() != w[0]) {\n flg = true\n }\n dic[i] = w\n }\n println(if (!flg) \"Yes\" else \"No\")\n}\n", "language": "Kotlin", "metadata": {"date": 1541947342, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Kotlin/s666997116.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s666997116", "user_id": "u323680411"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val dic = Array(n) { \"\" }\n var flg = false\n\n for (i in 0 until n) {\n val w = sc.next()\n if (w in dic) {\n flg = true\n }\n if (i != 0 && dic[i - 1].last() != w[0]) {\n flg = true\n }\n dic[i] = w\n }\n println(if (!flg) \"Yes\" else \"No\")\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 422, "cpu_time_ms": 220, "memory_kb": 35916}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s969804886", "group_id": "codeNet:p03261", "input_text": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val words = Array(N) { readLine()!! }\n for (i in 1 until N) {\n val w = words[i]\n if (w[0] != words[i-1][words[i-1].length-1]) {\n println(\"No\")\n return\n }\n for (j in 0 until i) {\n if (w == words[j]) {\n println(\"No\")\n return\n }\n }\n }\n println(\"Yes\")\n}", "language": "Kotlin", "metadata": {"date": 1536622349, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Kotlin/s969804886.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s969804886", "user_id": "u398846051"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "fun main(args: Array) {\n val N = readLine()!!.toInt()\n val words = Array(N) { readLine()!! }\n for (i in 1 until N) {\n val w = words[i]\n if (w[0] != words[i-1][words[i-1].length-1]) {\n println(\"No\")\n return\n }\n for (j in 0 until i) {\n if (w == words[j]) {\n println(\"No\")\n return\n }\n }\n }\n println(\"Yes\")\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 436, "cpu_time_ms": 211, "memory_kb": 33592}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s359439709", "group_id": "codeNet:p03261", "input_text": "package atcoder.abc109\n\nfun main(args : Array) {\n val N = readLine()!!.toInt()\n val W = listOf().toMutableList()\n val alreadySaid = setOf().toMutableSet()\n\n (1..N).forEach {\n val w = readLine()!!\n W.add(w)\n }\n\n var ok = true\n var lastChar : Char = ' '\n\n W.forEach {\n if (alreadySaid.contains(it)) {\n ok = false;\n println(\"No\")\n return\n }\n\n if (lastChar != ' ' && it.get(0) != lastChar) {\n ok = false\n println(\"No\")\n return\n }\n\n alreadySaid.add(it)\n lastChar = it.get(it.length - 1)\n }\n\n\n var answer = if (ok) \"Yes\" else \"No\"\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1536460653, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03261.html", "problem_id": "p03261", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03261/input.txt", "sample_output_relpath": "derived/input_output/data/p03261/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03261/Kotlin/s359439709.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s359439709", "user_id": "u861095163"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "package atcoder.abc109\n\nfun main(args : Array) {\n val N = readLine()!!.toInt()\n val W = listOf().toMutableList()\n val alreadySaid = setOf().toMutableSet()\n\n (1..N).forEach {\n val w = readLine()!!\n W.add(w)\n }\n\n var ok = true\n var lastChar : Char = ' '\n\n W.forEach {\n if (alreadySaid.contains(it)) {\n ok = false;\n println(\"No\")\n return\n }\n\n if (lastChar != ' ' && it.get(0) != lastChar) {\n ok = false\n println(\"No\")\n return\n }\n\n alreadySaid.add(it)\n lastChar = it.get(it.length - 1)\n }\n\n\n var answer = if (ok) \"Yes\" else \"No\"\n println(answer)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "sample_input": "4\nhoge\nenglish\nhoge\nenigma\n"}, "reference_outputs": ["No\n"], "source_document_id": "p03261", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is practicing shiritori alone again today.\n\nShiritori is a game as follows:\n\nIn the first turn, a player announces any one word.\n\nIn the subsequent turns, a player announces a word that satisfies the following conditions:\n\nThat word is not announced before.\n\nThe first character of that word is the same as the last character of the last word announced.\n\nIn this game, he is practicing to announce as many words as possible in ten seconds.\n\nYou are given the number of words Takahashi announced, N, and the i-th word he announced, W_i, for each i. Determine if the rules of shiritori was observed, that is, every word announced by him satisfied the conditions.\n\nConstraints\n\nN is an integer satisfying 2 \\leq N \\leq 100.\n\nW_i is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1\nW_2\n:\nW_N\n\nOutput\n\nIf every word announced by Takahashi satisfied the conditions, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nhoge\nenglish\nhoge\nenigma\n\nSample Output 1\n\nNo\n\nAs hoge is announced multiple times, the rules of shiritori was not observed.\n\nSample Input 2\n\n9\nbasic\nc\ncpp\nphp\npython\nnadesico\nocaml\nlua\nassembly\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaa\naaaaaaa\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\nabc\narc\nagc\n\nSample Output 4\n\nNo", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 723, "cpu_time_ms": 156, "memory_kb": 31388}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s864074782", "group_id": "codeNet:p03262", "input_text": "import java.lang.Math\n\nval MOD: Int = 1000000000 + 7\nval MODL: Long = MOD.toLong()\n\nfun main(args: Array)\n{\n val (n, x) = readLine()!!.split(\" \").map{it.toInt()}\n val pos = readLine()!!.split(\" \").map{Math.abs(it.toInt() - x)}.toIntArray()\n\n var ans = pos[0]\n for (i in 1 until n) {\n ans = gcd(ans, pos[i])\n }\n\n println(ans)\n}\n\nfun gcd(a: Int, b: Int): Int {\n if (b == 0) return a\n return gcd(b, a % b)\n}\n", "language": "Kotlin", "metadata": {"date": 1578615694, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Kotlin/s864074782.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s864074782", "user_id": "u118477733"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.lang.Math\n\nval MOD: Int = 1000000000 + 7\nval MODL: Long = MOD.toLong()\n\nfun main(args: Array)\n{\n val (n, x) = readLine()!!.split(\" \").map{it.toInt()}\n val pos = readLine()!!.split(\" \").map{Math.abs(it.toInt() - x)}.toIntArray()\n\n var ans = pos[0]\n for (i in 1 until n) {\n ans = gcd(ans, pos[i])\n }\n\n println(ans)\n}\n\nfun gcd(a: Int, b: Int): Int {\n if (b == 0) return a\n return gcd(b, a % b)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 444, "cpu_time_ms": 489, "memory_kb": 51748}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s328137435", "group_id": "codeNet:p03262", "input_text": "fun main(args: Array) {\n val (N, X) = readLine()!!.split(\" \").map(String::toInt)\n val x = readLine()!!.split(\" \").map(String::toInt)\n\n val prev = x.filter { it < X }.max()\n val next = x.filter { it > X }.min()\n\n when {\n prev != null && next != null -> Math.min(X - prev, next - X)\n prev != null -> X - prev\n next != null -> next - X\n else -> throw Exception()\n }.let(::println)\n}", "language": "Kotlin", "metadata": {"date": 1569882551, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Kotlin/s328137435.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s328137435", "user_id": "u085288971"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, X) = readLine()!!.split(\" \").map(String::toInt)\n val x = readLine()!!.split(\" \").map(String::toInt)\n\n val prev = x.filter { it < X }.max()\n val next = x.filter { it > X }.min()\n\n when {\n prev != null && next != null -> Math.min(X - prev, next - X)\n prev != null -> X - prev\n next != null -> next - X\n else -> throw Exception()\n }.let(::println)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 433, "cpu_time_ms": 512, "memory_kb": 51600}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s220016688", "group_id": "codeNet:p03262", "input_text": "fun main(args: Array) {\n abc109c()\n}\n\nfun abc109c() {\n val (n, x) = readLine()!!.split(\" \").map { it.toInt() }\n val xList = readLine()!!.split(\" \").map { it.toInt() }\n\n val distances = xList.map { Math.abs(it - x) }\n .filter { it != 0 }\n\n var gcd = distances[0]\n (distances.indices).forEach { gcd = gcd(gcd, distances[it]) }\n\n println(gcd)\n}\n\nprivate fun gcd(a: Int, b: Int): Int {\n var aTemp = a\n var bTemp = b\n var temp: Int\n while (aTemp % bTemp != 0) {\n temp = aTemp\n aTemp = bTemp % aTemp\n bTemp = temp\n }\n return bTemp\n}\n", "language": "Kotlin", "metadata": {"date": 1568495704, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Kotlin/s220016688.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s220016688", "user_id": "u139478771"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n abc109c()\n}\n\nfun abc109c() {\n val (n, x) = readLine()!!.split(\" \").map { it.toInt() }\n val xList = readLine()!!.split(\" \").map { it.toInt() }\n\n val distances = xList.map { Math.abs(it - x) }\n .filter { it != 0 }\n\n var gcd = distances[0]\n (distances.indices).forEach { gcd = gcd(gcd, distances[it]) }\n\n println(gcd)\n}\n\nprivate fun gcd(a: Int, b: Int): Int {\n var aTemp = a\n var bTemp = b\n var temp: Int\n while (aTemp % bTemp != 0) {\n temp = aTemp\n aTemp = bTemp % aTemp\n bTemp = temp\n }\n return bTemp\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 602, "cpu_time_ms": 527, "memory_kb": 55740}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s845327819", "group_id": "codeNet:p03262", "input_text": "import java.math.*\n\nfun main(args: Array) {\n val (n, x) = readInputLine().split(\" \").map { it.toInt() }\n \n val cities = readInputLine().split(\" \").map { Math.abs(x - it.toInt()) }\n\n var gcdNum = cities[0]\n \n for (i in 1 until n) {\n gcdNum = \n if (gcdNum > cities[i]) {\n gcd(gcdNum, cities[i])\n } else {\n gcd(cities[i], gcdNum)\n }\n }\n \n println(gcdNum)\n}\n \nfun readInputLine(): String {\n return readLine()!!\n}\n\nfun gcd(a: Int, b: Int): Int {\n // a >= b とする\n if (b == 0) {\n return a\n }\n return gcd(b, a % b)\n}\n", "language": "Kotlin", "metadata": {"date": 1561842286, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Kotlin/s845327819.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s845327819", "user_id": "u505558493"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.math.*\n\nfun main(args: Array) {\n val (n, x) = readInputLine().split(\" \").map { it.toInt() }\n \n val cities = readInputLine().split(\" \").map { Math.abs(x - it.toInt()) }\n\n var gcdNum = cities[0]\n \n for (i in 1 until n) {\n gcdNum = \n if (gcdNum > cities[i]) {\n gcd(gcdNum, cities[i])\n } else {\n gcd(cities[i], gcdNum)\n }\n }\n \n println(gcdNum)\n}\n \nfun readInputLine(): String {\n return readLine()!!\n}\n\nfun gcd(a: Int, b: Int): Int {\n // a >= b とする\n if (b == 0) {\n return a\n }\n return gcd(b, a % b)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 641, "cpu_time_ms": 487, "memory_kb": 49652}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s247688785", "group_id": "codeNet:p03262", "input_text": "fun main(args: Array) {\n val (n, x0) = readLine()!!.split(\" \").map(String::toInt)\n val x = readLine()!!.split(\" \").map(String::toInt).map{abs(x0 - it)}.reduce{a, b -> gcd(a,b)}\n\n print(x)\n}\n\ntailrec fun gcd(a: Int, b: Int): Int{\n if(b == 0) return a\n return gcd(b, a%b)\n}\n\nfun abs(n: Int): Int {\n return if(n>0) n else -n\n}", "language": "Kotlin", "metadata": {"date": 1557021090, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Kotlin/s247688785.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s247688785", "user_id": "u358554431"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, x0) = readLine()!!.split(\" \").map(String::toInt)\n val x = readLine()!!.split(\" \").map(String::toInt).map{abs(x0 - it)}.reduce{a, b -> gcd(a,b)}\n\n print(x)\n}\n\ntailrec fun gcd(a: Int, b: Int): Int{\n if(b == 0) return a\n return gcd(b, a%b)\n}\n\nfun abs(n: Int): Int {\n return if(n>0) n else -n\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 349, "cpu_time_ms": 498, "memory_kb": 50188}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s717095591", "group_id": "codeNet:p03262", "input_text": "fun main(args: Array) {\n val (N,X) = readLine()!!.split(\" \").map{it.toInt()}\n val xs = readLine()!!.split(\" \").map{it.toInt()} + X\n val min = xs.min()!!\n val ys = xs.map { it-min }.sorted()\n var z=ys[1]\n for(i in 2..N){\n z=gcd(z,ys[i]-ys[i-1])\n }\n println(z)\n}\n\ntailrec fun gcd(a:Int, b:Int):Int = if(b==0) a else gcd(b,a%b)", "language": "Kotlin", "metadata": {"date": 1540469011, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Kotlin/s717095591.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s717095591", "user_id": "u914096045"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val (N,X) = readLine()!!.split(\" \").map{it.toInt()}\n val xs = readLine()!!.split(\" \").map{it.toInt()} + X\n val min = xs.min()!!\n val ys = xs.map { it-min }.sorted()\n var z=ys[1]\n for(i in 2..N){\n z=gcd(z,ys[i]-ys[i-1])\n }\n println(z)\n}\n\ntailrec fun gcd(a:Int, b:Int):Int = if(b==0) a else gcd(b,a%b)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 363, "cpu_time_ms": 813, "memory_kb": 54012}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s186224742", "group_id": "codeNet:p03262", "input_text": "import java.util.ArrayList;\nfun main(args: Array) {\n val (N, X) = readLine()!!.split(\" \").map(String::toInt)\n val x = java.util.ArrayList(readLine()!!.split(\" \").map(String::toInt))\n x.add(X)\n x.sort()\n var ans = x[1] - x[0]\n for (i in 2..N) {\n val d = x[i] - x[i-1]\n ans = if (ans > d) gcd(ans, d) else gcd(d, ans)\n }\n println(ans)\n}\n\ntailrec fun gcd(big: Int, small: Int): Int =\n if (small == 0) big else gcd(small, big % small)", "language": "Kotlin", "metadata": {"date": 1536625333, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Kotlin/s186224742.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s186224742", "user_id": "u398846051"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.ArrayList;\nfun main(args: Array) {\n val (N, X) = readLine()!!.split(\" \").map(String::toInt)\n val x = java.util.ArrayList(readLine()!!.split(\" \").map(String::toInt))\n x.add(X)\n x.sort()\n var ans = x[1] - x[0]\n for (i in 2..N) {\n val d = x[i] - x[i-1]\n ans = if (ans > d) gcd(ans, d) else gcd(d, ans)\n }\n println(ans)\n}\n\ntailrec fun gcd(big: Int, small: Int): Int =\n if (small == 0) big else gcd(small, big % small)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 479, "cpu_time_ms": 599, "memory_kb": 53248}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s486633104", "group_id": "codeNet:p03262", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val xx = Stack()\n\n Scanner(System.`in`).use {\n val n = it.nextInt()\n val x = it.nextInt()\n for (i in 0 until n) {\n val xxI = it.nextInt()\n if (xxI < x) {\n xx.push(x - xxI)\n } else {\n xx.push(xxI - x)\n }\n }\n }\n\n while (1 < xx.size) {\n val xxTmp = (0 until 2).map {\n xx.pop()\n }\n\n val i = if (xxTmp[1] < xxTmp[0]) {\n 1\n } else {\n 0\n }\n xx.push(xxTmp[i])\n val r = xxTmp[(i + 1) % 2] % xxTmp[i]\n\n if (0 < r) {\n xx.push(r)\n }\n }\n\n println(xx.pop())\n}\n", "language": "Kotlin", "metadata": {"date": 1536471442, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Kotlin/s486633104.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s486633104", "user_id": "u839675792"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val xx = Stack()\n\n Scanner(System.`in`).use {\n val n = it.nextInt()\n val x = it.nextInt()\n for (i in 0 until n) {\n val xxI = it.nextInt()\n if (xxI < x) {\n xx.push(x - xxI)\n } else {\n xx.push(xxI - x)\n }\n }\n }\n\n while (1 < xx.size) {\n val xxTmp = (0 until 2).map {\n xx.pop()\n }\n\n val i = if (xxTmp[1] < xxTmp[0]) {\n 1\n } else {\n 0\n }\n xx.push(xxTmp[i])\n val r = xxTmp[(i + 1) % 2] % xxTmp[i]\n\n if (0 < r) {\n xx.push(r)\n }\n }\n\n println(xx.pop())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 731, "cpu_time_ms": 643, "memory_kb": 68344}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s514284937", "group_id": "codeNet:p03262", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val xx = Stack()\n\n Scanner(System.`in`).use {\n val n = it.nextInt()\n val x = it.nextInt()\n for (i in 0 until n) {\n xx.push(Math.abs(it.nextInt() - x))\n }\n }\n\n while (1 < xx.size) {\n val xxx = (0 until 2).map {\n xx.pop()\n }\n\n val i = if (xxx[1] < xxx[0]) {\n 1\n } else {\n 0\n }\n xx.push(xxx[i])\n val r = xxx[(i + 1) % 2] % xxx[i]\n\n if (0 < r) {\n xx.push(r)\n }\n }\n\n println(xx.pop())\n}\n", "language": "Kotlin", "metadata": {"date": 1536471043, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Kotlin/s514284937.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s514284937", "user_id": "u839675792"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val xx = Stack()\n\n Scanner(System.`in`).use {\n val n = it.nextInt()\n val x = it.nextInt()\n for (i in 0 until n) {\n xx.push(Math.abs(it.nextInt() - x))\n }\n }\n\n while (1 < xx.size) {\n val xxx = (0 until 2).map {\n xx.pop()\n }\n\n val i = if (xxx[1] < xxx[0]) {\n 1\n } else {\n 0\n }\n xx.push(xxx[i])\n val r = xxx[(i + 1) % 2] % xxx[i]\n\n if (0 < r) {\n xx.push(r)\n }\n }\n\n println(xx.pop())\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 604, "cpu_time_ms": 651, "memory_kb": 53948}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s561206744", "group_id": "codeNet:p03262", "input_text": "\n\nfun main(args: Array) {\n val (N, X) = readLine()!!.split(\" \").map { it.toInt() }\n val x = readLine()!!.split(\" \").map { Math.abs(it.toInt() - X) }.sorted()\n\n if (x.size == 1) {\n val first = Math.abs(x.first())\n\n if (first == 0) {\n println(1000000000)\n } else {\n println(first)\n }\n return\n }\n\n val diff = listOf().toMutableList();\n (1..(N-1)).forEach {\n val i = it\n diff.add(x.get(i) - x.get(i - 1))\n }\n\n val GCD = diff.reduce { acc, i -> gcd(acc, i) }\n println(Math.abs(GCD))\n}\n\n\n\nfun gcd(a: Int, b: Int): Int {\n if (b == 0) return a\n return gcd(b, a % b)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1536461138, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Kotlin/s561206744.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s561206744", "user_id": "u861095163"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\n\nfun main(args: Array) {\n val (N, X) = readLine()!!.split(\" \").map { it.toInt() }\n val x = readLine()!!.split(\" \").map { Math.abs(it.toInt() - X) }.sorted()\n\n if (x.size == 1) {\n val first = Math.abs(x.first())\n\n if (first == 0) {\n println(1000000000)\n } else {\n println(first)\n }\n return\n }\n\n val diff = listOf().toMutableList();\n (1..(N-1)).forEach {\n val i = it\n diff.add(x.get(i) - x.get(i - 1))\n }\n\n val GCD = diff.reduce { acc, i -> gcd(acc, i) }\n println(Math.abs(GCD))\n}\n\n\n\nfun gcd(a: Int, b: Int): Int {\n if (b == 0) return a\n return gcd(b, a % b)\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 679, "cpu_time_ms": 841, "memory_kb": 58340}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s702485183", "group_id": "codeNet:p03262", "input_text": "\nfun main(args: Array) {\n val (N, X) = readLine()!!.split(\" \").map { it.toInt() }\n val x = readLine()!!.split(\" \").map { it.toInt() - X }.sorted()\n\n if (x.size == 1) {\n println(x.first())\n return\n }\n\n val diff = listOf().toMutableList();\n (1..(N-1)).forEach {\n val i = it\n diff.add(x.get(i) - x.get(i - 1))\n }\n\n val GCD = diff.reduce { acc, i -> gcd(acc.toInt(), i.toInt()) }\n println(GCD)\n}\n\n\n\nfun gcd(a: Int, b: Int): Int {\n if (b == 0) return a\n return gcd(b, a % b)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1536458818, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Kotlin/s702485183.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s702485183", "user_id": "u861095163"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\nfun main(args: Array) {\n val (N, X) = readLine()!!.split(\" \").map { it.toInt() }\n val x = readLine()!!.split(\" \").map { it.toInt() - X }.sorted()\n\n if (x.size == 1) {\n println(x.first())\n return\n }\n\n val diff = listOf().toMutableList();\n (1..(N-1)).forEach {\n val i = it\n diff.add(x.get(i) - x.get(i - 1))\n }\n\n val GCD = diff.reduce { acc, i -> gcd(acc.toInt(), i.toInt()) }\n println(GCD)\n}\n\n\n\nfun gcd(a: Int, b: Int): Int {\n if (b == 0) return a\n return gcd(b, a % b)\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 548, "cpu_time_ms": 822, "memory_kb": 60016}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s585408705", "group_id": "codeNet:p03262", "input_text": "import java.util.*\n\nfun main(args: Array) {\n Scanner(System.`in`).use {\n val n = it.nextInt()\n val x = it.nextInt()\n val xx = mutableListOf()\n var mi: Int? = null\n for (i in 0 until n) {\n val xxx = it.nextInt() - x\n xx.add(xxx)\n val xxxx = Math.abs(xxx)\n if (mi == null || xxxx < mi) {\n mi = xxxx\n }\n }\n if (mi != null) {\n for (i in mi downTo 2) {\n var flag = false\n for (j in 0 until n) {\n if (xx[j] % i != 0) {\n flag = true\n break\n }\n }\n if (!flag) {\n println(mi)\n return\n }\n }\n }\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1536457121, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03262.html", "problem_id": "p03262", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03262/input.txt", "sample_output_relpath": "derived/input_output/data/p03262/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03262/Kotlin/s585408705.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s585408705", "user_id": "u839675792"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n Scanner(System.`in`).use {\n val n = it.nextInt()\n val x = it.nextInt()\n val xx = mutableListOf()\n var mi: Int? = null\n for (i in 0 until n) {\n val xxx = it.nextInt() - x\n xx.add(xxx)\n val xxxx = Math.abs(xxx)\n if (mi == null || xxxx < mi) {\n mi = xxxx\n }\n }\n if (mi != null) {\n for (i in mi downTo 2) {\n var flag = false\n for (j in 0 until n) {\n if (xx[j] % i != 0) {\n flag = true\n break\n }\n }\n if (!flag) {\n println(mi)\n return\n }\n }\n }\n }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "sample_input": "3 3\n1 7 11\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03262", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities on a number line. The i-th city is located at coordinate x_i.\n\nYour objective is to visit all these cities at least once.\n\nIn order to do so, you will first set a positive integer D.\n\nThen, you will depart from coordinate X and perform Move 1 and Move 2 below, as many times as you like:\n\nMove 1: travel from coordinate y to coordinate y + D.\n\nMove 2: travel from coordinate y to coordinate y - D.\n\nFind the maximum value of D that enables you to visit all the cities.\n\nHere, to visit a city is to travel to the coordinate where that city is located.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq X \\leq 10^9\n\n1 \\leq x_i \\leq 10^9\n\nx_i are all different.\n\nx_1, x_2, ..., x_N \\neq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the maximum value of D that enables you to visit all the cities.\n\nSample Input 1\n\n3 3\n1 7 11\n\nSample Output 1\n\n2\n\nSetting D = 2 enables you to visit all the cities as follows, and this is the maximum value of such D.\n\nPerform Move 2 to travel to coordinate 1.\n\nPerform Move 1 to travel to coordinate 3.\n\nPerform Move 1 to travel to coordinate 5.\n\nPerform Move 1 to travel to coordinate 7.\n\nPerform Move 1 to travel to coordinate 9.\n\nPerform Move 1 to travel to coordinate 11.\n\nSample Input 2\n\n3 81\n33 105 57\n\nSample Output 2\n\n24\n\nSample Input 3\n\n1 1\n1000000000\n\nSample Output 3\n\n999999999", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 853, "cpu_time_ms": 558, "memory_kb": 55456}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s596283674", "group_id": "codeNet:p03324", "input_text": "fun main() {\n\n val (d,n) = readLine()!!.split(\" \").map { it.toInt() }\n\n var ans = 0\n\n when (d) {\n 0 -> {\n ans = n\n }\n 1 -> {\n ans = n * 100\n }\n 2 -> {\n ans = n * 10000\n }\n }\n\n println(ans)\n\n}", "language": "Kotlin", "metadata": {"date": 1597240944, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s596283674.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s596283674", "user_id": "u592533051"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main() {\n\n val (d,n) = readLine()!!.split(\" \").map { it.toInt() }\n\n var ans = 0\n\n when (d) {\n 0 -> {\n ans = n\n }\n 1 -> {\n ans = n * 100\n }\n 2 -> {\n ans = n * 10000\n }\n }\n\n println(ans)\n\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 281, "cpu_time_ms": 107, "memory_kb": 36452}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s688987723", "group_id": "codeNet:p03324", "input_text": "import kotlin.math.pow\n\nfun main() {\n\n val (d,n) = readLine()!!.split(\" \").map(String::toInt)\n\n val num = 100.0.pow(d.toDouble()).toInt()\n\n var ans = 0\n\n if (n<=99){\n ans = num * n\n } else if (n==100){\n ans = 101 * num\n }\n\n println(ans)\n\n}", "language": "Kotlin", "metadata": {"date": 1593031614, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s688987723.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s688987723", "user_id": "u592533051"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import kotlin.math.pow\n\nfun main() {\n\n val (d,n) = readLine()!!.split(\" \").map(String::toInt)\n\n val num = 100.0.pow(d.toDouble()).toInt()\n\n var ans = 0\n\n if (n<=99){\n ans = num * n\n } else if (n==100){\n ans = 101 * num\n }\n\n println(ans)\n\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 274, "cpu_time_ms": 114, "memory_kb": 36396}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s373554775", "group_id": "codeNet:p03324", "input_text": "import java.io.BufferedReader\nimport java.io.BufferedWriter\nimport java.io.StringWriter\nimport kotlin.math.pow\n\nfun solve(c: Case) {\n val (d, n) = c.intList()\n c.println((100.toDouble().pow(d).toInt() * n).toString())\n}\n\nopen class Case(\n private val input: BufferedReader = System.`in`.bufferedReader(),\n private val out: BufferedWriter = System.out.bufferedWriter()\n) {\n fun exec(fn: (Case) -> Unit) = input.use { out.use { fn(this) } }\n fun println(c: CharSequence?) = out.appendln(c)\n fun intList(): List = input.readLine().split(\" \").map { it.toInt() }\n}\n\nfun main() = Case().exec(::solve)", "language": "Kotlin", "metadata": {"date": 1592892536, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s373554775.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s373554775", "user_id": "u843036991"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.BufferedWriter\nimport java.io.StringWriter\nimport kotlin.math.pow\n\nfun solve(c: Case) {\n val (d, n) = c.intList()\n c.println((100.toDouble().pow(d).toInt() * n).toString())\n}\n\nopen class Case(\n private val input: BufferedReader = System.`in`.bufferedReader(),\n private val out: BufferedWriter = System.out.bufferedWriter()\n) {\n fun exec(fn: (Case) -> Unit) = input.use { out.use { fn(this) } }\n fun println(c: CharSequence?) = out.appendln(c)\n fun intList(): List = input.readLine().split(\" \").map { it.toInt() }\n}\n\nfun main() = Case().exec(::solve)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 620, "cpu_time_ms": 113, "memory_kb": 36668}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s380453098", "group_id": "codeNet:p03324", "input_text": "fun main(args:Array) {\n val (d, N) = readLine()!!.split(\" \").map(String::toInt)\n val bu = mutableListOf()\n val dd = when(d) {\n 0 -> 1\n 1 -> 100\n else -> 100000\n }!!\n\n ((N-(N-1)/99)*dd).run(::println)}", "language": "Kotlin", "metadata": {"date": 1586043963, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s380453098.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s380453098", "user_id": "u637065983"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args:Array) {\n val (d, N) = readLine()!!.split(\" \").map(String::toInt)\n val bu = mutableListOf()\n val dd = when(d) {\n 0 -> 1\n 1 -> 100\n else -> 100000\n }!!\n\n ((N-(N-1)/99)*dd).run(::println)}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 237, "cpu_time_ms": 246, "memory_kb": 37784}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s512942175", "group_id": "codeNet:p03324", "input_text": "fun main(args: Array) {\n var (D,N) = readLine()!!.split(\" \").map { it.toInt() }\n var i: Int = Math.pow(D.toDouble(), N.toDouble()).toInt()\n \twhen(N) {\n 100 -> {\n println(i * (N+1))\n }\n else -> {\n println(i * N)\n } \n }\t\n}", "language": "Kotlin", "metadata": {"date": 1584905646, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s512942175.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s512942175", "user_id": "u994064513"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args: Array) {\n var (D,N) = readLine()!!.split(\" \").map { it.toInt() }\n var i: Int = Math.pow(D.toDouble(), N.toDouble()).toInt()\n \twhen(N) {\n 100 -> {\n println(i * (N+1))\n }\n else -> {\n println(i * N)\n } \n }\t\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 274, "cpu_time_ms": 231, "memory_kb": 37860}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s926474189", "group_id": "codeNet:p03324", "input_text": "import java.util.*\n \nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val d = sc.nextInt()\n var n = sc.nextInt()\n if (n == 100) {\n n++\n }\n println(n.toString() + (1..d).map { \"00\" }.joinToString(\"\"))\n}", "language": "Kotlin", "metadata": {"date": 1582845878, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s926474189.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s926474189", "user_id": "u733811860"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.*\n \nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val d = sc.nextInt()\n var n = sc.nextInt()\n if (n == 100) {\n n++\n }\n println(n.toString() + (1..d).map { \"00\" }.joinToString(\"\"))\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 241, "cpu_time_ms": 201, "memory_kb": 31396}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s745733071", "group_id": "codeNet:p03324", "input_text": "fun main (args: Array) {\n val (D, N) = readLine()!!.split(\" \").map {it.toInt()}\n var base = 1;\n repeat(D) { base *= 100 }\n println(base * N)\n}", "language": "Kotlin", "metadata": {"date": 1576985282, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s745733071.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s745733071", "user_id": "u979004569"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main (args: Array) {\n val (D, N) = readLine()!!.split(\" \").map {it.toInt()}\n var base = 1;\n repeat(D) { base *= 100 }\n println(base * N)\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 154, "cpu_time_ms": 233, "memory_kb": 37920}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s703721025", "group_id": "codeNet:p03324", "input_text": "fun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() =listOfString().map { it.toInt() }\nfun listOfLong() =listOfString().map { it.toLong() }\nfun listOfDouble() =listOfString().map { it.toDouble() }\nfun main(args:Array){\n var (d,n) = listOfInt()\n var cnt = 0\n var i = 1\n while(true){\n var tmp = i\n var t = 0\n while(tmp%100==0){\n t++\n tmp/=100\n }\n if(t==d)cnt++\n if(cnt==n){\n println(i)\n break\n }\n i++\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1575588850, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s703721025.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s703721025", "user_id": "u352248517"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() =listOfString().map { it.toInt() }\nfun listOfLong() =listOfString().map { it.toLong() }\nfun listOfDouble() =listOfString().map { it.toDouble() }\nfun main(args:Array){\n var (d,n) = listOfInt()\n var cnt = 0\n var i = 1\n while(true){\n var tmp = i\n var t = 0\n while(tmp%100==0){\n t++\n tmp/=100\n }\n if(t==d)cnt++\n if(cnt==n){\n println(i)\n break\n }\n i++\n }\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 591, "cpu_time_ms": 239, "memory_kb": 37868}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s232300176", "group_id": "codeNet:p03324", "input_text": "fun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() =listOfString().map { it.toInt() }\nfun listOfLong() =listOfString().map { it.toLong() }\nfun listOfDouble() =listOfString().map { it.toDouble() }\nfun main(args:Array){\n var (d,n) = listOfInt()\n var v = if(d==0) 1 else if(d==1) 100 else 10000\n println(v*n)\n}\n", "language": "Kotlin", "metadata": {"date": 1575586312, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s232300176.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s232300176", "user_id": "u352248517"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun listOfString() = next().split(\" \")\nfun listOfInt() =listOfString().map { it.toInt() }\nfun listOfLong() =listOfString().map { it.toLong() }\nfun listOfDouble() =listOfString().map { it.toDouble() }\nfun main(args:Array){\n var (d,n) = listOfInt()\n var v = if(d==0) 1 else if(d==1) 100 else 10000\n println(v*n)\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 450, "cpu_time_ms": 236, "memory_kb": 36004}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s722319662", "group_id": "codeNet:p03324", "input_text": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val (d, n) = listOfInt()\n val base = Math.pow(100.0, d.toDouble()).toInt()\n\n var cnt = 0\n var num = 0\n while (cnt < n) {\n num++\n if (num % base == 0 && num % (base * 100) != 0) cnt++\n }\n\n println(num)\n}\n\nfun next() = readLine()!!\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map { it.toInt() }\n\nfun println(value : Any) {\n pw.println(value)\n}", "language": "Kotlin", "metadata": {"date": 1569575841, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s722319662.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s722319662", "user_id": "u262403099"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.io.PrintWriter\nval pw = PrintWriter(System.out)\n\nfun main(args : Array) {\n func()\n pw.flush()\n}\n\nfun func() {\n val (d, n) = listOfInt()\n val base = Math.pow(100.0, d.toDouble()).toInt()\n\n var cnt = 0\n var num = 0\n while (cnt < n) {\n num++\n if (num % base == 0 && num % (base * 100) != 0) cnt++\n }\n\n println(num)\n}\n\nfun next() = readLine()!!\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map { it.toInt() }\n\nfun println(value : Any) {\n pw.println(value)\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 544, "cpu_time_ms": 237, "memory_kb": 37924}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s356544735", "group_id": "codeNet:p03324", "input_text": "\nfun main(args: Array) {\n val (D, N) = readLine()!!.split(\" \").map(String::toInt)\n\n var cnt = 0\n for (i in 1..Int.MAX_VALUE) {\n if (calc(i) == D) {\n cnt++\n if (cnt == N) {\n println(i)\n return\n }\n }\n }\n}\n\nprivate fun calc(x: Int): Int {\n if (x % 100 != 0) {\n return 0\n }\n return calc(x / 100) + 1\n}\n\n", "language": "Kotlin", "metadata": {"date": 1566933176, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s356544735.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s356544735", "user_id": "u085288971"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "\nfun main(args: Array) {\n val (D, N) = readLine()!!.split(\" \").map(String::toInt)\n\n var cnt = 0\n for (i in 1..Int.MAX_VALUE) {\n if (calc(i) == D) {\n cnt++\n if (cnt == N) {\n println(i)\n return\n }\n }\n }\n}\n\nprivate fun calc(x: Int): Int {\n if (x % 100 != 0) {\n return 0\n }\n return calc(x / 100) + 1\n}\n\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 412, "cpu_time_ms": 251, "memory_kb": 37904}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s696568810", "group_id": "codeNet:p03324", "input_text": "import java.io.*\nimport java.util.*\n\nfun solve(D: Long, N: Long){\n println((1..100).map{ it*Math.pow(100.toDouble(), (D.toDouble())) }.map{it.toInt()}[N.toInt()-1])\n return\n}\n\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val D = sc.next().toLong()\n val N = sc.next().toLong()\n solve(D, N)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1564369537, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s696568810.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s696568810", "user_id": "u329232967"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.io.*\nimport java.util.*\n\nfun solve(D: Long, N: Long){\n println((1..100).map{ it*Math.pow(100.toDouble(), (D.toDouble())) }.map{it.toInt()}[N.toInt()-1])\n return\n}\n\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val D = sc.next().toLong()\n val N = sc.next().toLong()\n solve(D, N)\n}\n\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 799, "cpu_time_ms": 189, "memory_kb": 31496}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s212259613", "group_id": "codeNet:p03324", "input_text": "fun main(args: Array) {\n val (d, n) = readInputLine().split(\" \").map { it.toInt() }\n \n println(pow(100, d) * if (n != 100) n else (n + 1))\n}\n \nfun readInputLine(): String {\n return readLine()!!\n}\n\nfun pow(x: Int, y: Int): Int {\n var ret = 1\n \n for (i in 1..y) {\n ret *= x\n }\n \n return ret\n}\n", "language": "Kotlin", "metadata": {"date": 1562463541, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s212259613.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s212259613", "user_id": "u505558493"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args: Array) {\n val (d, n) = readInputLine().split(\" \").map { it.toInt() }\n \n println(pow(100, d) * if (n != 100) n else (n + 1))\n}\n \nfun readInputLine(): String {\n return readLine()!!\n}\n\nfun pow(x: Int, y: Int): Int {\n var ret = 1\n \n for (i in 1..y) {\n ret *= x\n }\n \n return ret\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 336, "cpu_time_ms": 237, "memory_kb": 37904}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s183419001", "group_id": "codeNet:p03324", "input_text": "fun main(args: Array){\n val (d, n) = readLine()!!.split(\" \").map(String::toInt)\n println(when(n) {\n 100 -> when(d) {\n 0 -> (n + 1)\n 1 -> 100 * (n + 1)\n else -> 10000 * (n + 1)\n }\n else -> when(d) {\n 0 -> n\n 1 -> 100 * n\n else -> 10000 * n\n }\n })\n}\n", "language": "Kotlin", "metadata": {"date": 1562083519, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s183419001.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s183419001", "user_id": "u712822150"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args: Array){\n val (d, n) = readLine()!!.split(\" \").map(String::toInt)\n println(when(n) {\n 100 -> when(d) {\n 0 -> (n + 1)\n 1 -> 100 * (n + 1)\n else -> 10000 * (n + 1)\n }\n else -> when(d) {\n 0 -> n\n 1 -> 100 * n\n else -> 10000 * n\n }\n })\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 359, "cpu_time_ms": 241, "memory_kb": 37828}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s688124163", "group_id": "codeNet:p03324", "input_text": "fun main(args: Array) {\n var (a,b) = readLine()!!.split(\" \").map(String::toInt)\n var c = when(a){\n 0 -> 1\n 1-> 100\n else -> 10000\n }\n var list = (1*c..b*c).map{\n it\n }.filter{it%b == 0}\n println(list[list.size-1])\n}\n", "language": "Kotlin", "metadata": {"date": 1555250678, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s688124163.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s688124163", "user_id": "u399261731"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args: Array) {\n var (a,b) = readLine()!!.split(\" \").map(String::toInt)\n var c = when(a){\n 0 -> 1\n 1-> 100\n else -> 10000\n }\n var list = (1*c..b*c).map{\n it\n }.filter{it%b == 0}\n println(list[list.size-1])\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 318, "cpu_time_ms": 580, "memory_kb": 78460}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s956124287", "group_id": "codeNet:p03324", "input_text": "fun main(args : Array) {\n val input = readLine()!!.split(\" \").map(String::toInt)\n val d = input[0]\n var n = input[1]\n\n var x = 0\n if (n == 100) {\n n++\n }\n if (d == 0) {\n x = n\n } else if (d == 1) {\n x = 100 * n\n } else {\n x = 10000 * n\n }\n\n println(Integer.toString(x))\n}\n", "language": "Kotlin", "metadata": {"date": 1542402602, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s956124287.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s956124287", "user_id": "u682435693"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args : Array) {\n val input = readLine()!!.split(\" \").map(String::toInt)\n val d = input[0]\n var n = input[1]\n\n var x = 0\n if (n == 100) {\n n++\n }\n if (d == 0) {\n x = n\n } else if (d == 1) {\n x = 100 * n\n } else {\n x = 10000 * n\n }\n\n println(Integer.toString(x))\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 341, "cpu_time_ms": 250, "memory_kb": 37872}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s802723738", "group_id": "codeNet:p03324", "input_text": "fun main(args: Array){\n val (D, N) = readLine()!!.split(' ').map { it -> it.toInt() }\n\n var kiriban: Int = 1\n var ans: Int = 0\n\n for (i in 0 until D){\n kiriban *= 100\n }\n\n println(kiriban)\n println(N)\n\n if (N == 100){\n ans = kiriban * N\n ans += kiriban\n } else {\n ans = kiriban * N\n }\n\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1529201056, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s802723738.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s802723738", "user_id": "u491523420"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args: Array){\n val (D, N) = readLine()!!.split(' ').map { it -> it.toInt() }\n\n var kiriban: Int = 1\n var ans: Int = 0\n\n for (i in 0 until D){\n kiriban *= 100\n }\n\n println(kiriban)\n println(N)\n\n if (N == 100){\n ans = kiriban * N\n ans += kiriban\n } else {\n ans = kiriban * N\n }\n\n println(ans)\n}\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 371, "cpu_time_ms": 233, "memory_kb": 38356}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s013564696", "group_id": "codeNet:p03324", "input_text": "import java.util.Scanner\n\nfun main(args: Array) {\n val cin = Scanner(System.`in`)\n val d = cin.nextDouble()\n val n = cin.nextInt()\n\n var res = 0\n for (i in 0 until n) {\n res += Math.pow(100.0, d).toInt()\n if (res % (Math.pow(100.0, d + 1.0).toInt()) == 0) {\n res += Math.pow(100.0, d).toInt()\n }\n }\n\n println(res)\n\n cin.close()\n}", "language": "Kotlin", "metadata": {"date": 1529199663, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s013564696.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s013564696", "user_id": "u194575259"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.Scanner\n\nfun main(args: Array) {\n val cin = Scanner(System.`in`)\n val d = cin.nextDouble()\n val n = cin.nextInt()\n\n var res = 0\n for (i in 0 until n) {\n res += Math.pow(100.0, d).toInt()\n if (res % (Math.pow(100.0, d + 1.0).toInt()) == 0) {\n res += Math.pow(100.0, d).toInt()\n }\n }\n\n println(res)\n\n cin.close()\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 359, "cpu_time_ms": 286, "memory_kb": 31268}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s975259952", "group_id": "codeNet:p03324", "input_text": "fun main(args: Array) {\n val (d, n) = readLine()!!.split(' ').map(String::toInt)\n println(Math.pow(100.0, d.toDouble()).toInt() * (if (n % 100 == 0) 101 else n))\n}", "language": "Kotlin", "metadata": {"date": 1529199067, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s975259952.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s975259952", "user_id": "u863309603"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args: Array) {\n val (d, n) = readLine()!!.split(' ').map(String::toInt)\n println(Math.pow(100.0, d.toDouble()).toInt() * (if (n % 100 == 0) 101 else n))\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 177, "cpu_time_ms": 296, "memory_kb": 38492}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s491264128", "group_id": "codeNet:p03324", "input_text": "fun main(args: Array) {\n val (a,b) = readLine()!!.split(\" \").map { it.toInt() }\n\n var x = 1\n for (i in 1..a) x *= 100\n println(x * b)\n}", "language": "Kotlin", "metadata": {"date": 1529197780, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s491264128.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s491264128", "user_id": "u185034753"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args: Array) {\n val (a,b) = readLine()!!.split(\" \").map { it.toInt() }\n\n var x = 1\n for (i in 1..a) x *= 100\n println(x * b)\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 155, "cpu_time_ms": 309, "memory_kb": 37804}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s732542012", "group_id": "codeNet:p03324", "input_text": "\nfun main(args:Array):Unit {\n val (d, n) = readLine()!!.trim().split(' ').map(String::toInt)\n println(\n if (n == 100) digit(d) * 101\n else digit(d) * n\n )\n}\nfun digit(d:Int):Int {\n return when(d){\n 0 -> 1\n else -> digit(d - 1) * 100\n }\n}", "language": "Kotlin", "metadata": {"date": 1529197716, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03324.html", "problem_id": "p03324", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03324/input.txt", "sample_output_relpath": "derived/input_output/data/p03324/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03324/Kotlin/s732542012.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s732542012", "user_id": "u419330815"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "\nfun main(args:Array):Unit {\n val (d, n) = readLine()!!.trim().split(' ').map(String::toInt)\n println(\n if (n == 100) digit(d) * 101\n else digit(d) * n\n )\n}\nfun digit(d:Int):Int {\n return when(d){\n 0 -> 1\n else -> digit(d - 1) * 100\n }\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "sample_input": "0 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03324", "source_text": "Score: 200 points\n\nProblem Statement\n\nToday, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.\n\nAs the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.\n\nFind the N-th smallest integer that would make Ringo happy.\n\nConstraints\n\nD is 0, 1 or 2.\n\nN is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD N\n\nOutput\n\nPrint the N-th smallest integer that can be divided by 100 exactly D times.\n\nSample Input 1\n\n0 5\n\nSample Output 1\n\n5\n\nThe integers that can be divided by 100 exactly 0 times (that is, not divisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...\n\nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\nSample Input 2\n\n1 11\n\nSample Output 2\n\n1100\n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...\n\nThus, the integer we are seeking is 1 \\ 100.\n\nSample Input 3\n\n2 85\n\nSample Output 3\n\n850000\n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\ 000, 20 \\ 000, 30 \\ 000, ...\n\nThus, the integer we are seeking is 850 \\ 000.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 296, "cpu_time_ms": 290, "memory_kb": 38192}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s556696476", "group_id": "codeNet:p03448", "input_text": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n val c = readLine()!!.toInt()\n val x = readLine()!!.toInt()\n\n var cnt = 0\n for (n500 in 0..a) {\n for (n100 in 0..b) {\n for (n50 in 0..c) {\n if (x == n500 * 500 + n100 * 100 + n50 * 50) {\n cnt++\n }\n }\n }\n }\n print(cnt)\n}\n", "language": "Kotlin", "metadata": {"date": 1595328519, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s556696476.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s556696476", "user_id": "u992618480"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n val c = readLine()!!.toInt()\n val x = readLine()!!.toInt()\n\n var cnt = 0\n for (n500 in 0..a) {\n for (n100 in 0..b) {\n for (n50 in 0..c) {\n if (x == n500 * 500 + n100 * 100 + n50 * 50) {\n cnt++\n }\n }\n }\n }\n print(cnt)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 421, "cpu_time_ms": 97, "memory_kb": 34528}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s419215779", "group_id": "codeNet:p03448", "input_text": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n val c = readLine()!!.toInt()\n val x = readLine()!!.toInt()\n var num = 0\n for(i in 0..a) {\n for(j in 0..b) {\n for(k in 0..c) {\n if(x == i * 500 + j * 100 + k * 50) {\n num = num + 1\n }\n }\n }\n }\n println(num)\n}", "language": "Kotlin", "metadata": {"date": 1591848529, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s419215779.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s419215779", "user_id": "u979282295"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n val c = readLine()!!.toInt()\n val x = readLine()!!.toInt()\n var num = 0\n for(i in 0..a) {\n for(j in 0..b) {\n for(k in 0..c) {\n if(x == i * 500 + j * 100 + k * 50) {\n num = num + 1\n }\n }\n }\n }\n println(num)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 409, "cpu_time_ms": 212, "memory_kb": 31604}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s565972756", "group_id": "codeNet:p03448", "input_text": "fun main(args: Array) {\n val a = readLine()?.toInt() ?: return\n val b = readLine()?.toInt() ?: return\n val c = readLine()?.toInt() ?: return\n val x = readLine()?.toInt() ?: return\n\n val count = 0.until(a + 1).map { it * 500 }.map { i ->\n 0.until(b + 1).map { it * 100 }.map { j ->\n 0.until(c + 1).map { it * 50 }.map { k ->\n i + j + k == x\n }\n }.flatten()\n }.flatten().count { it }\n\n println(count.toString())\n}\n", "language": "Kotlin", "metadata": {"date": 1591754709, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s565972756.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s565972756", "user_id": "u979429407"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val a = readLine()?.toInt() ?: return\n val b = readLine()?.toInt() ?: return\n val c = readLine()?.toInt() ?: return\n val x = readLine()?.toInt() ?: return\n\n val count = 0.until(a + 1).map { it * 500 }.map { i ->\n 0.until(b + 1).map { it * 100 }.map { j ->\n 0.until(c + 1).map { it * 50 }.map { k ->\n i + j + k == x\n }\n }.flatten()\n }.flatten().count { it }\n\n println(count.toString())\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 492, "cpu_time_ms": 354, "memory_kb": 40316}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s817015044", "group_id": "codeNet:p03448", "input_text": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n val c = readLine()!!.toInt()\n val x = readLine()!!.toInt()\n var num = 0\n for(i in 0..a) {\n for(j in 0..b) {\n for(k in 0..c) {\n if(x == i * 500 + j * 100 + k * 50) {\n num = num + 1\n }\n }\n }\n }\n println(num)\n}", "language": "Kotlin", "metadata": {"date": 1591567528, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s817015044.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s817015044", "user_id": "u979282295"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n val c = readLine()!!.toInt()\n val x = readLine()!!.toInt()\n var num = 0\n for(i in 0..a) {\n for(j in 0..b) {\n for(k in 0..c) {\n if(x == i * 500 + j * 100 + k * 50) {\n num = num + 1\n }\n }\n }\n }\n println(num)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 408, "cpu_time_ms": 216, "memory_kb": 31680}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s496442014", "group_id": "codeNet:p03448", "input_text": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n val c = readLine()!!.toInt()\n val x = readLine()!!.toInt()\n\n var ans = 0\n for (i in 0..a) {\n for (j in 0..b) {\n for (k in 0..c) {\n if (500 * i + 100 * j + 50 * k == x) ans++\n }\n }\n }\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1591377737, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s496442014.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s496442014", "user_id": "u863309603"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n val c = readLine()!!.toInt()\n val x = readLine()!!.toInt()\n\n var ans = 0\n for (i in 0..a) {\n for (j in 0..b) {\n for (k in 0..c) {\n if (500 * i + 100 * j + 50 * k == x) ans++\n }\n }\n }\n println(ans)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 367, "cpu_time_ms": 217, "memory_kb": 31708}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s725446482", "group_id": "codeNet:p03448", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextInt()\n val b = sc.nextInt()\n val c = sc.nextInt()\n val x = sc.nextInt()\n var ans = 0\n for (ai in 0..a) {\n for (bi in 0..b) {\n for (ci in 0..c) {\n val sum = ai * 500 + bi * 100 + ci * 50\n if (sum == x) ans++\n }\n }\n }\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1584489803, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s725446482.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s725446482", "user_id": "u733811860"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextInt()\n val b = sc.nextInt()\n val c = sc.nextInt()\n val x = sc.nextInt()\n var ans = 0\n for (ai in 0..a) {\n for (bi in 0..b) {\n for (ci in 0..c) {\n val sum = ai * 500 + bi * 100 + ci * 50\n if (sum == x) ans++\n }\n }\n }\n println(ans)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 423, "cpu_time_ms": 208, "memory_kb": 31392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s709160373", "group_id": "codeNet:p03448", "input_text": "fun main(args: Array) {\n val A = readLine()!!.toInt()\n val B = readLine()!!.toInt()\n val C = readLine()!!.toInt()\n val X = readLine()!!.toInt()\n var pattern = 0\n for (a in 0..A) {\n for (b in 0..B) {\n for (c in 0..C) {\n val total = 500*a + 100*b + 50*c\n if (total == X) pattern++\n }\n }\n }\n println(pattern)\n}", "language": "Kotlin", "metadata": {"date": 1583359596, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s709160373.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s709160373", "user_id": "u106908407"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val A = readLine()!!.toInt()\n val B = readLine()!!.toInt()\n val C = readLine()!!.toInt()\n val X = readLine()!!.toInt()\n var pattern = 0\n for (a in 0..A) {\n for (b in 0..B) {\n for (c in 0..C) {\n val total = 500*a + 100*b + 50*c\n if (total == X) pattern++\n }\n }\n }\n println(pattern)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 405, "cpu_time_ms": 210, "memory_kb": 31648}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s981263225", "group_id": "codeNet:p03448", "input_text": "fun main(args: Array) {\n val A = readLine()!!.toInt()\n val B = readLine()!!.toInt()\n val C = readLine()!!.toInt()\n val X = readLine()!!.toInt()\n var count = 0\n\n for (a in 0..A) {\n for (b in 0..B) {\n for (c in 0..C) {\n val total = a * 500 + b * 100 + c * 50\n if (total == X) {\n count++\n }\n }\n }\n }\n println(count)\n}", "language": "Kotlin", "metadata": {"date": 1582695119, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s981263225.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s981263225", "user_id": "u861119357"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val A = readLine()!!.toInt()\n val B = readLine()!!.toInt()\n val C = readLine()!!.toInt()\n val X = readLine()!!.toInt()\n var count = 0\n\n for (a in 0..A) {\n for (b in 0..B) {\n for (c in 0..C) {\n val total = a * 500 + b * 100 + c * 50\n if (total == X) {\n count++\n }\n }\n }\n }\n println(count)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 446, "cpu_time_ms": 212, "memory_kb": 31652}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s978661772", "group_id": "codeNet:p03448", "input_text": "fun main(args: Array) {\n val five_yen = readLine()!!.toInt()\n val one_hund = readLine()!!.toInt()\n val fifty = readLine()!!.toInt()\n val ans = readLine()!!.toInt()\n var con = 0\n\n for(i in 0..five_yen){\n for(n in 0..one_hund){\n for(y in 0..fifty){\n if(500 * i + 100*n + 50 * y == ans){\n con++\n }\n }\n }\n \n }\n println(con)\n\n}", "language": "Kotlin", "metadata": {"date": 1574826324, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s978661772.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s978661772", "user_id": "u035856025"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val five_yen = readLine()!!.toInt()\n val one_hund = readLine()!!.toInt()\n val fifty = readLine()!!.toInt()\n val ans = readLine()!!.toInt()\n var con = 0\n\n for(i in 0..five_yen){\n for(n in 0..one_hund){\n for(y in 0..fifty){\n if(500 * i + 100*n + 50 * y == ans){\n con++\n }\n }\n }\n \n }\n println(con)\n\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 446, "cpu_time_ms": 220, "memory_kb": 31712}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s318060146", "group_id": "codeNet:p03448", "input_text": "fun main() {\n val five_yen = readLine()!!.toInt()\n val one_hund = readLine()!!.toInt()\n val fifty = readLine()!!.toInt()\n val ans = readLine()!!.toInt()\n var con = 0\n\n for(i in 0..five_yen){\n for(n in 0..one_hund){\n for(y in 0..fifty){\n if(500 * i + 100*n + 50 * y == ans){\n con++\n }\n }\n }\n \n }\n println(con)\n\n}", "language": "Kotlin", "metadata": {"date": 1574826237, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s318060146.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s318060146", "user_id": "u035856025"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main() {\n val five_yen = readLine()!!.toInt()\n val one_hund = readLine()!!.toInt()\n val fifty = readLine()!!.toInt()\n val ans = readLine()!!.toInt()\n var con = 0\n\n for(i in 0..five_yen){\n for(n in 0..one_hund){\n for(y in 0..fifty){\n if(500 * i + 100*n + 50 * y == ans){\n con++\n }\n }\n }\n \n }\n println(con)\n\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 427, "cpu_time_ms": 160, "memory_kb": 31268}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s693074264", "group_id": "codeNet:p03448", "input_text": "fun main(args: Array) {\n abc087b()\n}\n\nfun abc087b() {\n val (a, b, c, x) = (1..4).map { readLine()!!.toInt() }\n\n val answer = (0..a).map { y500 ->\n (0..b).map { y100 ->\n (0..c).map { y50 ->\n y500 * 500 + y100 * 100 + y50 * 50 == x\n }\n }.flatten()\n }.flatten().count { it }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1571115596, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s693074264.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s693074264", "user_id": "u139478771"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n abc087b()\n}\n\nfun abc087b() {\n val (a, b, c, x) = (1..4).map { readLine()!!.toInt() }\n\n val answer = (0..a).map { y500 ->\n (0..b).map { y100 ->\n (0..c).map { y50 ->\n y500 * 500 + y100 * 100 + y50 * 50 == x\n }\n }.flatten()\n }.flatten().count { it }\n\n println(answer)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 366, "cpu_time_ms": 299, "memory_kb": 38432}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s199110409", "group_id": "codeNet:p03448", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextInt()\n val b = sc.nextInt()\n val c = sc.nextInt()\n val x = sc.nextInt()\n println(problem087b(a, b, c, x))\n}\n\nfun problem087b(a: Int, b: Int, c: Int, x: Int): Int {\n val fiveHundred = 500\n val hundred = 100\n val fifty = 50\n var count = 0\n for (i in 0..a) {\n for (j in 0..b) {\n for(k in 0..c) {\n if (fiveHundred * i + hundred * j + fifty * k == x) {\n count++\n }\n }\n }\n }\n return count\n}", "language": "Kotlin", "metadata": {"date": 1566850093, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s199110409.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s199110409", "user_id": "u073232808"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val a = sc.nextInt()\n val b = sc.nextInt()\n val c = sc.nextInt()\n val x = sc.nextInt()\n println(problem087b(a, b, c, x))\n}\n\nfun problem087b(a: Int, b: Int, c: Int, x: Int): Int {\n val fiveHundred = 500\n val hundred = 100\n val fifty = 50\n var count = 0\n for (i in 0..a) {\n for (j in 0..b) {\n for(k in 0..c) {\n if (fiveHundred * i + hundred * j + fifty * k == x) {\n count++\n }\n }\n }\n }\n return count\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 607, "cpu_time_ms": 201, "memory_kb": 31384}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s659737291", "group_id": "codeNet:p03448", "input_text": "import java.io.*\nimport java.util.*\n\n// 500A + 100B + 50C = X\nfun solve(A: Int, B: Int, C: Int, X: Int){\n var ans = 0\n for (a in 0..A){\n for (b in 0..B){\n for (c in 0..C){\n if (500*a + 100*b + 50*c == X){\n ans++\n }\n }\n }\n }\n println(ans)\n return\n}\n\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val A = sc.next().toInt()\n val B = sc.next().toInt()\n val C = sc.next().toInt()\n val X = sc.next().toInt()\n solve(A, B, C, X)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1564866415, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s659737291.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s659737291", "user_id": "u329232967"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.*\nimport java.util.*\n\n// 500A + 100B + 50C = X\nfun solve(A: Int, B: Int, C: Int, X: Int){\n var ans = 0\n for (a in 0..A){\n for (b in 0..B){\n for (c in 0..C){\n if (500*a + 100*b + 50*c == X){\n ans++\n }\n }\n }\n }\n println(ans)\n return\n}\n\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n val A = sc.next().toInt()\n val B = sc.next().toInt()\n val C = sc.next().toInt()\n val X = sc.next().toInt()\n solve(A, B, C, X)\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1031, "cpu_time_ms": 182, "memory_kb": 31400}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s528629933", "group_id": "codeNet:p03448", "input_text": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n val c = readLine()!!.toInt()\n val x = readLine()!!.toInt()\n var count = 0\n for (i in 0..a) {\n if (i * 500 > x) continue\n for (j in 0..b) {\n if (i * 500 + j * 100 > x) continue\n val sa = x - (i * 500 + j * 100)\n if (sa == 0) {\n count++\n } else if (sa / 50 <= c) {\n count++\n }\n }\n }\n println(count)\n}\n", "language": "Kotlin", "metadata": {"date": 1528343272, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03448.html", "problem_id": "p03448", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03448/input.txt", "sample_output_relpath": "derived/input_output/data/p03448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03448/Kotlin/s528629933.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s528629933", "user_id": "u099066216"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n val c = readLine()!!.toInt()\n val x = readLine()!!.toInt()\n var count = 0\n for (i in 0..a) {\n if (i * 500 > x) continue\n for (j in 0..b) {\n if (i * 500 + j * 100 > x) continue\n val sa = x - (i * 500 + j * 100)\n if (sa == 0) {\n count++\n } else if (sa / 50 <= c) {\n count++\n }\n }\n }\n println(count)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "sample_input": "2\n2\n2\n100\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03448", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan).\nIn how many ways can we select some of these coins so that they are X yen in total?\n\nCoins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.\n\nConstraints\n\n0 \\leq A, B, C \\leq 50\n\nA + B + C \\geq 1\n\n50 \\leq X \\leq 20 000\n\nA, B and C are integers.\n\nX is a multiple of 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nX\n\nOutput\n\nPrint the number of ways to select coins.\n\nSample Input 1\n\n2\n2\n2\n100\n\nSample Output 1\n\n2\n\nThere are two ways to satisfy the condition:\n\nSelect zero 500-yen coins, one 100-yen coin and zero 50-yen coins.\n\nSelect zero 500-yen coins, zero 100-yen coins and two 50-yen coins.\n\nSample Input 2\n\n5\n1\n0\n150\n\nSample Output 2\n\n0\n\nNote that the total must be exactly X yen.\n\nSample Input 3\n\n30\n40\n50\n6000\n\nSample Output 3\n\n213", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 522, "cpu_time_ms": 202, "memory_kb": 31616}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s365008394", "group_id": "codeNet:p03455", "input_text": "fun main() {\n val (a,b) = readLine()!!.split(\" \").map(String::toInt)\n println(if(a * b % 2 == 0) \"Even\" else \"Odd\")\n}\n", "language": "Kotlin", "metadata": {"date": 1600974327, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s365008394.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s365008394", "user_id": "u774837848"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main() {\n val (a,b) = readLine()!!.split(\" \").map(String::toInt)\n println(if(a * b % 2 == 0) \"Even\" else \"Odd\")\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 124, "cpu_time_ms": 115, "memory_kb": 36324}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s411499094", "group_id": "codeNet:p03455", "input_text": "fun Main() {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n\n if (a * b % 2 == 1) {\n println(\"Odd\")\n } else {\n println(\"Even\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1586312208, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s411499094.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s411499094", "user_id": "u229036046"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun Main() {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n\n if (a * b % 2 == 1) {\n println(\"Odd\")\n } else {\n println(\"Even\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 167, "cpu_time_ms": 156, "memory_kb": 29356}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s822647810", "group_id": "codeNet:p03455", "input_text": "fun main() {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n\n if (a * b % 2 == 1) {\n println(\"Odd\")\n } else {\n println(\"Even\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1586312161, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s822647810.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s822647810", "user_id": "u229036046"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main() {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n\n if (a * b % 2 == 1) {\n println(\"Odd\")\n } else {\n println(\"Even\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 167, "cpu_time_ms": 164, "memory_kb": 31260}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s115269902", "group_id": "codeNet:p03455", "input_text": "fun main(){\n val (a,b) = readLine()!!.split(\" \").map(String::toInt)\n\n when(a * b % 2){\n 0 -> {\n print(\"Even\")\n }\n 1 -> {\n print(\"Odd\")\n }\n }\n}", "language": "Kotlin", "metadata": {"date": 1584930488, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s115269902.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s115269902", "user_id": "u006844829"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main(){\n val (a,b) = readLine()!!.split(\" \").map(String::toInt)\n\n when(a * b % 2){\n 0 -> {\n print(\"Even\")\n }\n 1 -> {\n print(\"Odd\")\n }\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 201, "cpu_time_ms": 155, "memory_kb": 29344}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s692253113", "group_id": "codeNet:p03455", "input_text": "fun main(args: Array) {\n val (a, b) = readLine()!!.split(\" \").map(String::toInt)\n if (a * b % 2 == 0) {\n println(\"Even\")\n } else {\n println(\"Odd\")\n }\n}\n\n", "language": "Kotlin", "metadata": {"date": 1583382728, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s692253113.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s692253113", "user_id": "u085288971"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main(args: Array) {\n val (a, b) = readLine()!!.split(\" \").map(String::toInt)\n if (a * b % 2 == 0) {\n println(\"Even\")\n } else {\n println(\"Odd\")\n }\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 236, "memory_kb": 35956}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s873399269", "group_id": "codeNet:p03455", "input_text": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n val c = a * b\n if (c % 2 == 0) {\n println(\"Even\")\n } else {\n println(\"Odd\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1583355547, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s873399269.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s873399269", "user_id": "u106908407"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n val c = a * b\n if (c % 2 == 0) {\n println(\"Even\")\n } else {\n println(\"Odd\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 205, "cpu_time_ms": 211, "memory_kb": 31704}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s404921015", "group_id": "codeNet:p03455", "input_text": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n if (a*b%2 == 0) {\n println(\"Even\")\n } else {\n println(\"Odd\")\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1583355427, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s404921015.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s404921015", "user_id": "u106908407"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main(args: Array) {\n val a = readLine()!!.toInt()\n val b = readLine()!!.toInt()\n if (a*b%2 == 0) {\n println(\"Even\")\n } else {\n println(\"Odd\")\n }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 188, "cpu_time_ms": 201, "memory_kb": 31728}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s998414853", "group_id": "codeNet:p03455", "input_text": " fun main(args: Array) {\n val inputs = read()\n if (isEven(inputs[0] * inputs[1]))\n println(\"Even\")\n else\n println(\"Odd\")\n }\n\n fun read(): List {\n val input = readLine()\n return input!!.split(\" \").map { Integer.parseInt(it) }\n }\n\n fun isEven(arg: Int): Boolean {\n return (arg % 2) == 0\n }\n", "language": "Kotlin", "metadata": {"date": 1577581120, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s998414853.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s998414853", "user_id": "u393158689"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": " fun main(args: Array) {\n val inputs = read()\n if (isEven(inputs[0] * inputs[1]))\n println(\"Even\")\n else\n println(\"Odd\")\n }\n\n fun read(): List {\n val input = readLine()\n return input!!.split(\" \").map { Integer.parseInt(it) }\n }\n\n fun isEven(arg: Int): Boolean {\n return (arg % 2) == 0\n }\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 383, "cpu_time_ms": 243, "memory_kb": 35948}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s010670502", "group_id": "codeNet:p03455", "input_text": "fun main(args: Array) {\n abc086a()\n}\n\nfun abc086a() {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n\n val answer = if ((a * b) % 2 == 0) \"Even\" else \"Odd\"\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1571116660, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s010670502.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s010670502", "user_id": "u139478771"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main(args: Array) {\n abc086a()\n}\n\nfun abc086a() {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n\n val answer = if ((a * b) % 2 == 0) \"Even\" else \"Odd\"\n\n println(answer)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 206, "cpu_time_ms": 235, "memory_kb": 37864}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s924673725", "group_id": "codeNet:p03455", "input_text": "fun main(args: Array) {\n val (a, b) = readLine()!!.split(\" \").map(String::toInt)\n println(if (a * b % 2 == 0) \"Even\" else \"Odd\")\n}", "language": "Kotlin", "metadata": {"date": 1569434504, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s924673725.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s924673725", "user_id": "u605053892"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main(args: Array) {\n val (a, b) = readLine()!!.split(\" \").map(String::toInt)\n println(if (a * b % 2 == 0) \"Even\" else \"Odd\")\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 144, "cpu_time_ms": 236, "memory_kb": 36072}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s446079862", "group_id": "codeNet:p03455", "input_text": "fun main() {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n val product = a * b\n when {\n product % 2 == 0 -> println(\"Even\")\n else -> println(\"Odd\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1569230117, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s446079862.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s446079862", "user_id": "u993090205"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main() {\n val (a, b) = readLine()!!.split(\" \").map { it.toInt() }\n val product = a * b\n when {\n product % 2 == 0 -> println(\"Even\")\n else -> println(\"Odd\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 190, "cpu_time_ms": 158, "memory_kb": 31004}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s064651222", "group_id": "codeNet:p03455", "input_text": "fun main() {\n val inputs = readLine()!!.split(\" \").map(String::toInt)\n val result =\n if ((inputs[0] * inputs[1] % 2) == 0) {\n \"Even\"\n } else {\n \"Odd\"\n }\n print(result)\n}", "language": "Kotlin", "metadata": {"date": 1558583009, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s064651222.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s064651222", "user_id": "u529787332"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main() {\n val inputs = readLine()!!.split(\" \").map(String::toInt)\n val result =\n if ((inputs[0] * inputs[1] % 2) == 0) {\n \"Even\"\n } else {\n \"Odd\"\n }\n print(result)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 221, "cpu_time_ms": 158, "memory_kb": 29472}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s522669139", "group_id": "codeNet:p03455", "input_text": "import java.util.*;\nfun main(args: Array){\n val(a, b) = readLine()!!.split(\" \").map(String::toInt)\n println(if (a*b%2 == 0) \"Even\" else \"Odd\")\n}", "language": "Kotlin", "metadata": {"date": 1557200057, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s522669139.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s522669139", "user_id": "u024824950"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "import java.util.*;\nfun main(args: Array){\n val(a, b) = readLine()!!.split(\" \").map(String::toInt)\n println(if (a*b%2 == 0) \"Even\" else \"Odd\")\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 158, "cpu_time_ms": 234, "memory_kb": 37724}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s811958358", "group_id": "codeNet:p03455", "input_text": "fun main(args: Array) {\n val a = readLine()!!.split(\" \").map { it.toInt() }\n println(if (a[0] * a[1] % 2 == 0) \"Even\" else \"Odd\")\n}", "language": "Kotlin", "metadata": {"date": 1550334180, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s811958358.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s811958358", "user_id": "u604830826"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main(args: Array) {\n val a = readLine()!!.split(\" \").map { it.toInt() }\n println(if (a[0] * a[1] % 2 == 0) \"Even\" else \"Odd\")\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 145, "cpu_time_ms": 252, "memory_kb": 35960}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s726910296", "group_id": "codeNet:p03455", "input_text": "fun main(args: Array) {\n val input = readLine()!!.split(\" \").map(String::toInt)\n val batu = input[0] * input[1]\n if (batu % 2 == 0) {\n println(\"Even\")\n } else {\n println(\"Odd\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1549080664, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s726910296.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s726910296", "user_id": "u889387271"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main(args: Array) {\n val input = readLine()!!.split(\" \").map(String::toInt)\n val batu = input[0] * input[1]\n if (batu % 2 == 0) {\n println(\"Even\")\n } else {\n println(\"Odd\")\n }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 200, "cpu_time_ms": 244, "memory_kb": 35988}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s274213459", "group_id": "codeNet:p03455", "input_text": "import java.io.InputStream\nimport java.io.PrintStream\nimport java.util.*\n\nclass Abc086A(\n val input: InputStream,\n val output: PrintStream\n) {\n fun proc() {\n val sc = Scanner(input)\n val a = sc.nextInt()\n val b = sc.nextInt()\n if ((a * b) % 2 == 0) {\n output.print(\"Even\")\n }else {\n output.print(\"Odd\")\n }\n }\n}\n\nfun main(args: Array) {\n Abc086A(System.`in`, System.out).proc()\n}\n", "language": "Kotlin", "metadata": {"date": 1542347986, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s274213459.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s274213459", "user_id": "u905389316"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "import java.io.InputStream\nimport java.io.PrintStream\nimport java.util.*\n\nclass Abc086A(\n val input: InputStream,\n val output: PrintStream\n) {\n fun proc() {\n val sc = Scanner(input)\n val a = sc.nextInt()\n val b = sc.nextInt()\n if ((a * b) % 2 == 0) {\n output.print(\"Even\")\n }else {\n output.print(\"Odd\")\n }\n }\n}\n\nfun main(args: Array) {\n Abc086A(System.`in`, System.out).proc()\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 466, "cpu_time_ms": 178, "memory_kb": 29352}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s791434426", "group_id": "codeNet:p03455", "input_text": "fun main(args : Array){\n val input = readLine()!!.split(\" \")\n val a = input[0].toInt()\n val b = input[1].toInt()\n val ans = if(a % 2 == 1 && b % 2 == 1) \"Odd\" else \"Even\"\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1528230139, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03455.html", "problem_id": "p03455", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03455/input.txt", "sample_output_relpath": "derived/input_output/data/p03455/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03455/Kotlin/s791434426.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s791434426", "user_id": "u151176417"}, "prompt_components": {"gold_output": "Even\n", "input_to_evaluate": "fun main(args : Array){\n val input = readLine()!!.split(\" \")\n val a = input[0].toInt()\n val b = input[1].toInt()\n val ans = if(a % 2 == 1 && b % 2 == 1) \"Odd\" else \"Even\"\n println(ans)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "sample_input": "3 4\n"}, "reference_outputs": ["Even\n"], "source_document_id": "p03455", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer found two positive integers, a and b.\nDetermine whether the product of a and b is even or odd.\n\nConstraints\n\n1 ≤ a,b ≤ 10000\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the product is odd, print Odd; if it is even, print Even.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\nEven\n\nAs 3 × 4 = 12 is even, print Even.\n\nSample Input 2\n\n1 21\n\nSample Output 2\n\nOdd\n\nAs 1 × 21 = 21 is odd, print Odd.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 209, "cpu_time_ms": 233, "memory_kb": 37880}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s646100968", "group_id": "codeNet:p03471", "input_text": "import kotlin.math.ceil\nimport kotlin.system.exitProcess\n\nfun main(args: Array) {\n abc085C(args)\n\n //abc085B(args)\n //abc088B(args)\n //abc105B(args)\n //abc087B(args)\n //abc081B(args)\n //abc095(args)\n //abc086(args)\n //tutorial(args)\n}\n\nfun abc085C(args: Array) {\n val (N, Y) = readLine()!!.split(\" \").map(String::toInt)\n\n for (i in 0..N) {\n for (j in 0..N) {\n val k = N - i - j\n if (i + j + k > N) {\n continue\n }\n if((i * 1000 + j * 5000 + k * 10000) == Y && (i + j + k) == N) {\n println(\"$k $j $i\")\n exitProcess(0)\n }\n }\n }\n println(\"-1 -1 -1\")\n}\n", "language": "Kotlin", "metadata": {"date": 1595184674, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s646100968.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s646100968", "user_id": "u802093015"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "import kotlin.math.ceil\nimport kotlin.system.exitProcess\n\nfun main(args: Array) {\n abc085C(args)\n\n //abc085B(args)\n //abc088B(args)\n //abc105B(args)\n //abc087B(args)\n //abc081B(args)\n //abc095(args)\n //abc086(args)\n //tutorial(args)\n}\n\nfun abc085C(args: Array) {\n val (N, Y) = readLine()!!.split(\" \").map(String::toInt)\n\n for (i in 0..N) {\n for (j in 0..N) {\n val k = N - i - j\n if (i + j + k > N) {\n continue\n }\n if((i * 1000 + j * 5000 + k * 10000) == Y && (i + j + k) == N) {\n println(\"$k $j $i\")\n exitProcess(0)\n }\n }\n }\n println(\"-1 -1 -1\")\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 717, "cpu_time_ms": 125, "memory_kb": 36660}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s146763104", "group_id": "codeNet:p03471", "input_text": "import kotlin.math.ceil\nimport kotlin.system.exitProcess\n\nfun main(args: Array) {\n abc085C(args)\n\n //abc085B(args)\n //abc088B(args)\n //abc105B(args)\n //abc087B(args)\n //abc081B(args)\n //abc095(args)\n //abc086(args)\n //tutorial(args)\n}\n\nfun abc085C(args: Array) {\n val (N, Y) = readLine()!!.split(\" \").map(String::toInt)\n\n var loopUpperLimit1000Yen = ceil(Y.toDouble() / 1000).toInt()\n if (loopUpperLimit1000Yen > N) {\n loopUpperLimit1000Yen = N\n }\n var loopUpperLimit5000Yen = ceil(Y.toDouble() / 5000).toInt()\n if (loopUpperLimit5000Yen > N) {\n loopUpperLimit5000Yen = N\n }\n var loopUpperLimit10000Yen = ceil(Y.toDouble() / 10000).toInt()\n\n if (loopUpperLimit10000Yen > N) {\n loopUpperLimit10000Yen = N\n }\n\n for (i in 0 until loopUpperLimit1000Yen) {\n for (j in 0 until loopUpperLimit5000Yen) {\n for (k in 0 until loopUpperLimit10000Yen) {\n if (i + j + k > N) {\n continue\n }\n\n if((i * 1000 + j * 5000 + k * 10000) == Y && (i + j + k) == N) {\n println(\"$k $j $i\")\n exitProcess(0)\n }\n }\n }\n }\n println(\"-1 -1 -1\")\n}", "language": "Kotlin", "metadata": {"date": 1595183609, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s146763104.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s146763104", "user_id": "u802093015"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "import kotlin.math.ceil\nimport kotlin.system.exitProcess\n\nfun main(args: Array) {\n abc085C(args)\n\n //abc085B(args)\n //abc088B(args)\n //abc105B(args)\n //abc087B(args)\n //abc081B(args)\n //abc095(args)\n //abc086(args)\n //tutorial(args)\n}\n\nfun abc085C(args: Array) {\n val (N, Y) = readLine()!!.split(\" \").map(String::toInt)\n\n var loopUpperLimit1000Yen = ceil(Y.toDouble() / 1000).toInt()\n if (loopUpperLimit1000Yen > N) {\n loopUpperLimit1000Yen = N\n }\n var loopUpperLimit5000Yen = ceil(Y.toDouble() / 5000).toInt()\n if (loopUpperLimit5000Yen > N) {\n loopUpperLimit5000Yen = N\n }\n var loopUpperLimit10000Yen = ceil(Y.toDouble() / 10000).toInt()\n\n if (loopUpperLimit10000Yen > N) {\n loopUpperLimit10000Yen = N\n }\n\n for (i in 0 until loopUpperLimit1000Yen) {\n for (j in 0 until loopUpperLimit5000Yen) {\n for (k in 0 until loopUpperLimit10000Yen) {\n if (i + j + k > N) {\n continue\n }\n\n if((i * 1000 + j * 5000 + k * 10000) == Y && (i + j + k) == N) {\n println(\"$k $j $i\")\n exitProcess(0)\n }\n }\n }\n }\n println(\"-1 -1 -1\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1270, "cpu_time_ms": 2207, "memory_kb": 37580}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s974153017", "group_id": "codeNet:p03471", "input_text": "import kotlin.math.ceil\nimport kotlin.system.exitProcess\n\nfun main(args: Array) {\n abc085C(args)\n\n //abc085B(args)\n //abc088B(args)\n //abc105B(args)\n //abc087B(args)\n //abc081B(args)\n //abc095(args)\n //abc086(args)\n //tutorial(args)\n}\n\nfun abc085C(args: Array) {\n val (N, Y) = readLine()!!.split(\" \").map(String::toInt)\n\n var loopUpperLimit1000Yen = ceil(Y.toDouble() / 1000).toInt()\n if (loopUpperLimit1000Yen > N) {\n loopUpperLimit1000Yen = N\n }\n var loopUpperLimit5000Yen = ceil(Y.toDouble() / 5000).toInt()\n if (loopUpperLimit5000Yen > N) {\n loopUpperLimit5000Yen = N\n }\n var loopUpperLimit10000Yen = ceil(Y.toDouble() / 10000).toInt()\n\n if (loopUpperLimit10000Yen > N) {\n loopUpperLimit10000Yen = N\n }\n\n for (i in 0 until loopUpperLimit1000Yen) {\n for (j in 0 until loopUpperLimit5000Yen) {\n for (k in 0 until loopUpperLimit10000Yen) {\n if (i + j + k > N) {\n continue\n }\n\n if((i * 1000 + j * 5000 + k * 10000) == Y) {\n println(\"$k $j $i\")\n exitProcess(0)\n }\n }\n }\n }\n println(\"-1 -1 -1\")\n}\n", "language": "Kotlin", "metadata": {"date": 1595183416, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s974153017.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s974153017", "user_id": "u802093015"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "import kotlin.math.ceil\nimport kotlin.system.exitProcess\n\nfun main(args: Array) {\n abc085C(args)\n\n //abc085B(args)\n //abc088B(args)\n //abc105B(args)\n //abc087B(args)\n //abc081B(args)\n //abc095(args)\n //abc086(args)\n //tutorial(args)\n}\n\nfun abc085C(args: Array) {\n val (N, Y) = readLine()!!.split(\" \").map(String::toInt)\n\n var loopUpperLimit1000Yen = ceil(Y.toDouble() / 1000).toInt()\n if (loopUpperLimit1000Yen > N) {\n loopUpperLimit1000Yen = N\n }\n var loopUpperLimit5000Yen = ceil(Y.toDouble() / 5000).toInt()\n if (loopUpperLimit5000Yen > N) {\n loopUpperLimit5000Yen = N\n }\n var loopUpperLimit10000Yen = ceil(Y.toDouble() / 10000).toInt()\n\n if (loopUpperLimit10000Yen > N) {\n loopUpperLimit10000Yen = N\n }\n\n for (i in 0 until loopUpperLimit1000Yen) {\n for (j in 0 until loopUpperLimit5000Yen) {\n for (k in 0 until loopUpperLimit10000Yen) {\n if (i + j + k > N) {\n continue\n }\n\n if((i * 1000 + j * 5000 + k * 10000) == Y) {\n println(\"$k $j $i\")\n exitProcess(0)\n }\n }\n }\n }\n println(\"-1 -1 -1\")\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1251, "cpu_time_ms": 2207, "memory_kb": 37444}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s719660825", "group_id": "codeNet:p03471", "input_text": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\nfun main() {\n val (N, Y) = nextLongList()\n var x = Y / 10000\n var y = (Y % 10000) / 5000\n var z = ((Y % 10000) % 5000) / 1000\n while (x + y + z <= N - 9) {\n x--\n z += 10\n }\n while (x + y + z <= N - 4) {\n y--\n z += 5\n }\n while (x + y + z <= N - 1) {\n x--\n y += 2\n }\n if (x + y + z == N) {\n println(\"$x $y $z\")\n } else {\n println(\"-1 -1 -1\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1590461205, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s719660825.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s719660825", "user_id": "u860789370"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\nfun main() {\n val (N, Y) = nextLongList()\n var x = Y / 10000\n var y = (Y % 10000) / 5000\n var z = ((Y % 10000) % 5000) / 1000\n while (x + y + z <= N - 9) {\n x--\n z += 10\n }\n while (x + y + z <= N - 4) {\n y--\n z += 5\n }\n while (x + y + z <= N - 1) {\n x--\n y += 2\n }\n if (x + y + z == N) {\n println(\"$x $y $z\")\n } else {\n println(\"-1 -1 -1\")\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 961, "cpu_time_ms": 238, "memory_kb": 38080}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s378936028", "group_id": "codeNet:p03471", "input_text": "fun main(args: Array) {\n val (N, Y) = readLine()!!.split(\" \").map(String::toInt)\n for (i in 0..N) {\n for (j in 0..N - i) {\n val k = N - i - j\n if (i * 10000 + j * 5000 + k * 1000 == Y) {\n println(\"$i $j $k\")\n return\n }\n }\n }\n println(\"-1 -1 -1\")\n}", "language": "Kotlin", "metadata": {"date": 1585704677, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s378936028.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s378936028", "user_id": "u085288971"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, Y) = readLine()!!.split(\" \").map(String::toInt)\n for (i in 0..N) {\n for (j in 0..N - i) {\n val k = N - i - j\n if (i * 10000 + j * 5000 + k * 1000 == Y) {\n println(\"$i $j $k\")\n return\n }\n }\n }\n println(\"-1 -1 -1\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 344, "cpu_time_ms": 241, "memory_kb": 37896}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s760570147", "group_id": "codeNet:p03471", "input_text": "fun main(args: Array) {\n val sLine = readLine()?.split(\" \").orEmpty()\n val numN = sLine[0].toInt()\n val numY = sLine[1].toInt()\n\n var yukichi = - 1\n var ichiyo = - 1\n var goro = - 1\n\n\n run loop@{\n for(i in 0 .. numN){\n for( j in 0 .. numN - i){\n var sum = 10000 * i + 5000 * j + 1000 * (numN - i - j)\n if(sum == numY){\n yukichi = i\n ichiyo = j\n goro = numN - i - j\n return@loop\n }\n\n }\n }\n }\n\n\n println(\"$yukichi $ichiyo $goro\")\n}", "language": "Kotlin", "metadata": {"date": 1585696971, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s760570147.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s760570147", "user_id": "u430710262"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "fun main(args: Array) {\n val sLine = readLine()?.split(\" \").orEmpty()\n val numN = sLine[0].toInt()\n val numY = sLine[1].toInt()\n\n var yukichi = - 1\n var ichiyo = - 1\n var goro = - 1\n\n\n run loop@{\n for(i in 0 .. numN){\n for( j in 0 .. numN - i){\n var sum = 10000 * i + 5000 * j + 1000 * (numN - i - j)\n if(sum == numY){\n yukichi = i\n ichiyo = j\n goro = numN - i - j\n return@loop\n }\n\n }\n }\n }\n\n\n println(\"$yukichi $ichiyo $goro\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 621, "cpu_time_ms": 244, "memory_kb": 37928}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s167737489", "group_id": "codeNet:p03471", "input_text": "fun main(args: Array) {\n val (satsu,kingaku) = readLine()!!.split(\" \").map { it.toInt() }\n if (kingaku >= 1000*satsu && kingaku <=10000*satsu){\n var nokori = kingaku\n var senSatsu = 0\n var gosenSatsu = 0\n var manSatsu = 0\n while(nokori != 0){\n when {\n nokori >= 10000 -> {\n nokori -= 10000\n manSatsu++\n }\n nokori >= 5000 -> {\n nokori -= 5000\n gosenSatsu++\n }\n else -> {\n nokori -= 1000\n senSatsu++\n }\n }\n }\n var originSen = 0\n var originGo = 0\n var originMan = 0\n loop@for (i in 0 until 100){\n if(senSatsu + gosenSatsu + manSatsu < satsu) {\n while (senSatsu + gosenSatsu + manSatsu < satsu) {\n when {\n manSatsu >= 1 -> {\n manSatsu--\n gosenSatsu++\n senSatsu += 5\n }\n gosenSatsu >= 1 -> {\n gosenSatsu--\n senSatsu += 5\n }\n manSatsu >= 1 -> {\n manSatsu--\n gosenSatsu += 2\n }\n }\n }\n }\n if(senSatsu + gosenSatsu + manSatsu > satsu) {\n while (senSatsu + gosenSatsu + manSatsu > satsu) {\n if (gosenSatsu >= 2) {\n gosenSatsu -= 2\n manSatsu++\n } else if (senSatsu >= 5 && gosenSatsu >= 1) {\n senSatsu -= 5\n gosenSatsu--\n manSatsu++\n }else if (senSatsu >= 5) {\n senSatsu -= 5\n gosenSatsu ++\n }\n }\n }\n \n if (originSen == senSatsu && originGo == gosenSatsu && originMan == manSatsu){\n break@loop\n }else{\n originSen = senSatsu\n originGo = gosenSatsu\n originMan = manSatsu\n }\n }\n\n if (senSatsu + gosenSatsu + manSatsu != satsu) {\n senSatsu = -1\n gosenSatsu = -1\n manSatsu = -1\n }\n println(\"$manSatsu $gosenSatsu $senSatsu\")\n }else {\n println(\"-1 -1 -1\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1581218705, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s167737489.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s167737489", "user_id": "u890837164"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "fun main(args: Array) {\n val (satsu,kingaku) = readLine()!!.split(\" \").map { it.toInt() }\n if (kingaku >= 1000*satsu && kingaku <=10000*satsu){\n var nokori = kingaku\n var senSatsu = 0\n var gosenSatsu = 0\n var manSatsu = 0\n while(nokori != 0){\n when {\n nokori >= 10000 -> {\n nokori -= 10000\n manSatsu++\n }\n nokori >= 5000 -> {\n nokori -= 5000\n gosenSatsu++\n }\n else -> {\n nokori -= 1000\n senSatsu++\n }\n }\n }\n var originSen = 0\n var originGo = 0\n var originMan = 0\n loop@for (i in 0 until 100){\n if(senSatsu + gosenSatsu + manSatsu < satsu) {\n while (senSatsu + gosenSatsu + manSatsu < satsu) {\n when {\n manSatsu >= 1 -> {\n manSatsu--\n gosenSatsu++\n senSatsu += 5\n }\n gosenSatsu >= 1 -> {\n gosenSatsu--\n senSatsu += 5\n }\n manSatsu >= 1 -> {\n manSatsu--\n gosenSatsu += 2\n }\n }\n }\n }\n if(senSatsu + gosenSatsu + manSatsu > satsu) {\n while (senSatsu + gosenSatsu + manSatsu > satsu) {\n if (gosenSatsu >= 2) {\n gosenSatsu -= 2\n manSatsu++\n } else if (senSatsu >= 5 && gosenSatsu >= 1) {\n senSatsu -= 5\n gosenSatsu--\n manSatsu++\n }else if (senSatsu >= 5) {\n senSatsu -= 5\n gosenSatsu ++\n }\n }\n }\n \n if (originSen == senSatsu && originGo == gosenSatsu && originMan == manSatsu){\n break@loop\n }else{\n originSen = senSatsu\n originGo = gosenSatsu\n originMan = manSatsu\n }\n }\n\n if (senSatsu + gosenSatsu + manSatsu != satsu) {\n senSatsu = -1\n gosenSatsu = -1\n manSatsu = -1\n }\n println(\"$manSatsu $gosenSatsu $senSatsu\")\n }else {\n println(\"-1 -1 -1\")\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2638, "cpu_time_ms": 2111, "memory_kb": 37928}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s649843583", "group_id": "codeNet:p03471", "input_text": "fun main(args:Array) {\n val (n,y) = readLine()!!.split(\" \").map { it.toInt() }\n val ans = getAns(n,y)\n if(ans.isEmpty()) {\n println(\"-1 -1 -1\")\n } else {\n print(ans.joinToString(\" \"))\n }\n}\n\nval dic = mutableMapOf>>()\n\nfun getAns(remain:Int, amount:Int):List {\n if(remain <= 0) {\n if(amount == 0) {\n return listOf(0,0,0)\n } else {\n return listOf()\n }\n }\n if(amount <= 0) {\n return listOf()\n }\n if(amount > remain * 10000) {\n return listOf()\n }\n if(amount < remain * 1000) {\n return listOf()\n }\n if(!dic.containsKey(remain)) {\n dic[remain] = mutableMapOf()\n }\n dic[remain]!![amount]?.let { return it }\n\n var ans = mutableListOf()\n for(i in Math.min(amount/10000, remain) downTo 1) {\n val ret = getAns(remain-i, amount - (i*10000))\n if(ret.isNotEmpty()) {\n ans = ret.toMutableList()\n ans[0] += i\n break\n }\n }\n if(ans.isEmpty()) {\n for(i in Math.min(amount/5000, remain) downTo 1) {\n val ret = getAns(remain-i, amount-(i*5000))\n if(ret.isNotEmpty()) {\n ans = ret.toMutableList()\n ans[1] += i\n break\n }\n }\n }\n if(ans.isEmpty()) {\n for (i in Math.min(amount/1000, remain) downTo 1) {\n val ret = getAns(remain-i, amount-(i*1000))\n if(ret.isNotEmpty()) {\n ans = ret.toMutableList()\n ans[2] += i\n break\n }\n }\n }\n dic[remain]!![amount] = ans\n return ans\n}", "language": "Kotlin", "metadata": {"date": 1580487550, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s649843583.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s649843583", "user_id": "u269969976"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "fun main(args:Array) {\n val (n,y) = readLine()!!.split(\" \").map { it.toInt() }\n val ans = getAns(n,y)\n if(ans.isEmpty()) {\n println(\"-1 -1 -1\")\n } else {\n print(ans.joinToString(\" \"))\n }\n}\n\nval dic = mutableMapOf>>()\n\nfun getAns(remain:Int, amount:Int):List {\n if(remain <= 0) {\n if(amount == 0) {\n return listOf(0,0,0)\n } else {\n return listOf()\n }\n }\n if(amount <= 0) {\n return listOf()\n }\n if(amount > remain * 10000) {\n return listOf()\n }\n if(amount < remain * 1000) {\n return listOf()\n }\n if(!dic.containsKey(remain)) {\n dic[remain] = mutableMapOf()\n }\n dic[remain]!![amount]?.let { return it }\n\n var ans = mutableListOf()\n for(i in Math.min(amount/10000, remain) downTo 1) {\n val ret = getAns(remain-i, amount - (i*10000))\n if(ret.isNotEmpty()) {\n ans = ret.toMutableList()\n ans[0] += i\n break\n }\n }\n if(ans.isEmpty()) {\n for(i in Math.min(amount/5000, remain) downTo 1) {\n val ret = getAns(remain-i, amount-(i*5000))\n if(ret.isNotEmpty()) {\n ans = ret.toMutableList()\n ans[1] += i\n break\n }\n }\n }\n if(ans.isEmpty()) {\n for (i in Math.min(amount/1000, remain) downTo 1) {\n val ret = getAns(remain-i, amount-(i*1000))\n if(ret.isNotEmpty()) {\n ans = ret.toMutableList()\n ans[2] += i\n break\n }\n }\n }\n dic[remain]!![amount] = ans\n return ans\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1692, "cpu_time_ms": 2107, "memory_kb": 122868}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s082020616", "group_id": "codeNet:p03471", "input_text": "fun main(args: Array) {\n val numbers = readLine()\n ?.split(\" \")\n ?.map { it.toInt() }\n ?: return\n val totalCount = numbers[0]\n val expectedAmount = numbers[1]\n\n for (i in 0..totalCount) {\n for (j in 0..(totalCount - i)) {\n val k = totalCount - (i + j)\n if (k < 0) {\n continue\n }\n val amount = 10000 * i + 5000 * j + 1000 * k\n if (amount == expectedAmount) {\n println(\"$i $j $k\")\n return\n }\n }\n }\n println(\"-1 -1 -1\")\n}", "language": "Kotlin", "metadata": {"date": 1579994355, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s082020616.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s082020616", "user_id": "u026352629"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "fun main(args: Array) {\n val numbers = readLine()\n ?.split(\" \")\n ?.map { it.toInt() }\n ?: return\n val totalCount = numbers[0]\n val expectedAmount = numbers[1]\n\n for (i in 0..totalCount) {\n for (j in 0..(totalCount - i)) {\n val k = totalCount - (i + j)\n if (k < 0) {\n continue\n }\n val amount = 10000 * i + 5000 * j + 1000 * k\n if (amount == expectedAmount) {\n println(\"$i $j $k\")\n return\n }\n }\n }\n println(\"-1 -1 -1\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 590, "cpu_time_ms": 242, "memory_kb": 38004}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s856443606", "group_id": "codeNet:p03471", "input_text": "fun main(args: Array) {\n val inputs = readLine()?.split(\" \")?.map { it.toInt() } ?: return\n println(\"$inputs\")\n val n = inputs[0]\n val y = inputs[1]\n\n val result = searchCombination(n, y)\n println(\"${result.first} ${result.second} ${result.third}\")\n}\n\n/**\n * 合計がsumな1000\n *\n * @param numberOfSheet\n * @param sum\n * @return\n */\nfun searchCombination(numberOfSheet: Int, sum: Int): Triple {\n println(\"numberOfSheet: $numberOfSheet\")\n println(\"sum: $sum\")\n\n for (i1000 in 0..numberOfSheet) {\n for (i5000 in 0..numberOfSheet) {\n for (i10000 in 0..(numberOfSheet - i1000 - i5000)) {\n println(\"$i1000 $i5000 $i10000\")\n if ((i1000 * 1000 + i5000 * 5000 + i10000 * 10000) == sum) return Triple(i1000, i5000, i10000)\n }\n }\n }\n return Triple(-1, -1, -1)\n }\n", "language": "Kotlin", "metadata": {"date": 1569925050, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s856443606.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s856443606", "user_id": "u605053892"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "fun main(args: Array) {\n val inputs = readLine()?.split(\" \")?.map { it.toInt() } ?: return\n println(\"$inputs\")\n val n = inputs[0]\n val y = inputs[1]\n\n val result = searchCombination(n, y)\n println(\"${result.first} ${result.second} ${result.third}\")\n}\n\n/**\n * 合計がsumな1000\n *\n * @param numberOfSheet\n * @param sum\n * @return\n */\nfun searchCombination(numberOfSheet: Int, sum: Int): Triple {\n println(\"numberOfSheet: $numberOfSheet\")\n println(\"sum: $sum\")\n\n for (i1000 in 0..numberOfSheet) {\n for (i5000 in 0..numberOfSheet) {\n for (i10000 in 0..(numberOfSheet - i1000 - i5000)) {\n println(\"$i1000 $i5000 $i10000\")\n if ((i1000 * 1000 + i5000 * 5000 + i10000 * 10000) == sum) return Triple(i1000, i5000, i10000)\n }\n }\n }\n return Triple(-1, -1, -1)\n }\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 877, "cpu_time_ms": 2111, "memory_kb": 46052}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s424394821", "group_id": "codeNet:p03471", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map(String::toInt)\n // n = nx + ny + nz\n var x = -1\n var y = -1\n var z = -1\n if(m % 5000 != 0) {\n if (m/1000 == n) {\n x = 0\n y = 0\n z = n\n }\n println(\"$x $y $z\")\n } else {\n \tfor (i in 0..n) {\n if (m < 10000 * i) continue\n val mx = m % (i * 10000)\n x = i\n \tfor (j in 0..n) {\n if (mx < 5000 * j) continue\n val my = mx % (y * 5000)\n y = j\n z = n - x - y\n if ( my != 1000 * z) continue\n }\n }\n println(\"$x $y $z\")\n }\n}", "language": "Kotlin", "metadata": {"date": 1568676740, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s424394821.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s424394821", "user_id": "u776736596"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map(String::toInt)\n // n = nx + ny + nz\n var x = -1\n var y = -1\n var z = -1\n if(m % 5000 != 0) {\n if (m/1000 == n) {\n x = 0\n y = 0\n z = n\n }\n println(\"$x $y $z\")\n } else {\n \tfor (i in 0..n) {\n if (m < 10000 * i) continue\n val mx = m % (i * 10000)\n x = i\n \tfor (j in 0..n) {\n if (mx < 5000 * j) continue\n val my = mx % (y * 5000)\n y = j\n z = n - x - y\n if ( my != 1000 * z) continue\n }\n }\n println(\"$x $y $z\")\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 592, "cpu_time_ms": 243, "memory_kb": 37820}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s014997708", "group_id": "codeNet:p03471", "input_text": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map(String::toInt)\n // n = nx + ny + nz\n var x = -1\n var y = -1\n var z = -1\n if(m % 5000 != 0) {\n if (m/1000 == n) {\n x = 0\n y = 0\n z = n\n } else {\n return\n }\n } else {\n \tfor (x in 0..n) {\n val mx = m % (x * 10000) \n \tfor (y in 0..n) {\n val my = mx % (y * 5000)\n val z = n - x - y\n if ( my == 1000 * z) return\n }\n }\n }\n \n println(\"$x $y $z\")\n}", "language": "Kotlin", "metadata": {"date": 1568676006, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s014997708.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s014997708", "user_id": "u776736596"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, m) = readLine()!!.split(\" \").map(String::toInt)\n // n = nx + ny + nz\n var x = -1\n var y = -1\n var z = -1\n if(m % 5000 != 0) {\n if (m/1000 == n) {\n x = 0\n y = 0\n z = n\n } else {\n return\n }\n } else {\n \tfor (x in 0..n) {\n val mx = m % (x * 10000) \n \tfor (y in 0..n) {\n val my = mx % (y * 5000)\n val z = n - x - y\n if ( my == 1000 * z) return\n }\n }\n }\n \n println(\"$x $y $z\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 498, "cpu_time_ms": 237, "memory_kb": 37820}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s193887564", "group_id": "codeNet:p03471", "input_text": "fun main(args: Array) {\n val (n, y) = readInputLine().split(\" \").map { it.toInt() }\n \n for (i in 0..n) {\n for (j in 0..(n - i)) {\n if (i * 10000 + j * 5000 + (n - i - j) * 1000 == y) {\n println(\"$i $j ${n - i - j}\")\n return\n }\n }\n }\n \n println(\"-1 -1 -1\")\n}\n \nfun readInputLine(): String {\n return readLine()!!\n}\n", "language": "Kotlin", "metadata": {"date": 1562469086, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s193887564.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s193887564", "user_id": "u505558493"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, y) = readInputLine().split(\" \").map { it.toInt() }\n \n for (i in 0..n) {\n for (j in 0..(n - i)) {\n if (i * 10000 + j * 5000 + (n - i - j) * 1000 == y) {\n println(\"$i $j ${n - i - j}\")\n return\n }\n }\n }\n \n println(\"-1 -1 -1\")\n}\n \nfun readInputLine(): String {\n return readLine()!!\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 408, "cpu_time_ms": 245, "memory_kb": 37980}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s185349957", "group_id": "codeNet:p03471", "input_text": "fun main(args: Array) {\n val (n, y) = readLine()!!.split(\" \").map { it.toInt() }\n\n for (i in 0 until n) {\n for (j in 0 until n-i) {\n if(1000 * i + 5000 * j + 10000 * (n - i - j) == y) {\n print(\"${n - i - j} $j $i\")\n return\n }\n }\n }\n print(\"-1 -1 -1\")\n}", "language": "Kotlin", "metadata": {"date": 1557605674, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s185349957.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s185349957", "user_id": "u889750959"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, y) = readLine()!!.split(\" \").map { it.toInt() }\n\n for (i in 0 until n) {\n for (j in 0 until n-i) {\n if(1000 * i + 5000 * j + 10000 * (n - i - j) == y) {\n print(\"${n - i - j} $j $i\")\n return\n }\n }\n }\n print(\"-1 -1 -1\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 338, "cpu_time_ms": 245, "memory_kb": 38032}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s970090902", "group_id": "codeNet:p03471", "input_text": "fun main(args: Array) {\n val (x, y) = readLine()!!.split(\" \").map { it.toInt() }\n var a = \"-1 -1 -1\"\n var noguchi = 0\n var ichiyo = 0\n var yukichi = 0\n for(i in 0..x){\n for(j in 0..x)\n if(i * 10000 + j * 5000 + ( x - i - j ) * 1000 == y && x - i - j >= 0){\n yukichi = i\n ichiyo = j\n noguchi = x - i - j\n a = \"$yukichi $ichiyo $noguchi\"\n }\n }\n println(a)\n}", "language": "Kotlin", "metadata": {"date": 1547072542, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s970090902.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s970090902", "user_id": "u227189389"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "fun main(args: Array) {\n val (x, y) = readLine()!!.split(\" \").map { it.toInt() }\n var a = \"-1 -1 -1\"\n var noguchi = 0\n var ichiyo = 0\n var yukichi = 0\n for(i in 0..x){\n for(j in 0..x)\n if(i * 10000 + j * 5000 + ( x - i - j ) * 1000 == y && x - i - j >= 0){\n yukichi = i\n ichiyo = j\n noguchi = x - i - j\n a = \"$yukichi $ichiyo $noguchi\"\n }\n }\n println(a)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 452, "cpu_time_ms": 265, "memory_kb": 38204}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s785210392", "group_id": "codeNet:p03471", "input_text": "import java.io.InputStream\nimport java.io.PrintStream\nimport java.util.*\n\nclass Abc085C(\n val input: InputStream,\n val output: PrintStream\n) {\n /**\n * 1000 ≤ Y ≤ 200,000,000\n */\n fun proc() {\n val sc = Scanner(input)\n val N = sc.nextInt()\n val Y = sc.nextInt()\n\n val xn = Math.min(N, Y / 10000)\n val yn = Math.min(N, Y / 5000)\n val zn = Math.min(N, Y / 1000)\n for (x in xn downTo 0) {\n for (y in yn downTo 0) {\n for (z in zn downTo 0) {\n if (x + y + z != N) {\n continue\n }\n\n if (x * 10000 + y * 5000 + z * 1000 == Y) {\n output.print(\"$x $y $z\")\n return\n }\n }\n }\n }\n output.print(\"-1 -1 -1\")\n }\n}\n\nfun main(args: Array) {\n Abc085C(System.`in`, System.out).proc()\n}\n", "language": "Kotlin", "metadata": {"date": 1542354681, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s785210392.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s785210392", "user_id": "u905389316"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "import java.io.InputStream\nimport java.io.PrintStream\nimport java.util.*\n\nclass Abc085C(\n val input: InputStream,\n val output: PrintStream\n) {\n /**\n * 1000 ≤ Y ≤ 200,000,000\n */\n fun proc() {\n val sc = Scanner(input)\n val N = sc.nextInt()\n val Y = sc.nextInt()\n\n val xn = Math.min(N, Y / 10000)\n val yn = Math.min(N, Y / 5000)\n val zn = Math.min(N, Y / 1000)\n for (x in xn downTo 0) {\n for (y in yn downTo 0) {\n for (z in zn downTo 0) {\n if (x + y + z != N) {\n continue\n }\n\n if (x * 10000 + y * 5000 + z * 1000 == Y) {\n output.print(\"$x $y $z\")\n return\n }\n }\n }\n }\n output.print(\"-1 -1 -1\")\n }\n}\n\nfun main(args: Array) {\n Abc085C(System.`in`, System.out).proc()\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 962, "cpu_time_ms": 2111, "memory_kb": 33312}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s241069331", "group_id": "codeNet:p03471", "input_text": "/**\n * @author karayuu\n */\nfun main(args: Array) {\n val (n, y) = readLine()!!.split(\" \").map { it.toInt() }\n for (i in 0..n) {\n if (i * 10000 > y) {\n /* 10000の位 */\n continue\n }\n for (j in 0..n) {\n if (i * 10000 + j * 5000 > y) {\n continue\n }\n val remaining = y - (i * 10000 + j * 5000)\n val k = remaining / 1000\n if (i + j + k == n) {\n print(\"$i $j $k\")\n return\n }\n }\n }\n print(\"-1 -1 -1\")\n}", "language": "Kotlin", "metadata": {"date": 1531102299, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s241069331.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s241069331", "user_id": "u598902504"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "/**\n * @author karayuu\n */\nfun main(args: Array) {\n val (n, y) = readLine()!!.split(\" \").map { it.toInt() }\n for (i in 0..n) {\n if (i * 10000 > y) {\n /* 10000の位 */\n continue\n }\n for (j in 0..n) {\n if (i * 10000 + j * 5000 > y) {\n continue\n }\n val remaining = y - (i * 10000 + j * 5000)\n val k = remaining / 1000\n if (i + j + k == n) {\n print(\"$i $j $k\")\n return\n }\n }\n }\n print(\"-1 -1 -1\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 576, "cpu_time_ms": 252, "memory_kb": 37868}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s215527630", "group_id": "codeNet:p03471", "input_text": "fun Triple.sum() = first * 10000 + second * 5000 + third * 1000\n\nfun solve(N: Int, Y: Int): Triple {\n (0..N).forEach { x ->\n (0..N - x).forEach { y ->\n val z = N - x - y\n Triple(x, y, z).let {\n if (it.sum() == Y) return it\n }\n }\n }\n return Triple(-1, -1, -1)\n}\n\nfun main(args: Array) {\n val (N, Y) = readLine()!!.split(\" \").map{ it.toInt() }\n print(solve(N, Y).toList().joinToString(\" \"))\n}", "language": "Kotlin", "metadata": {"date": 1515386809, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s215527630.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s215527630", "user_id": "u909304507"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "fun Triple.sum() = first * 10000 + second * 5000 + third * 1000\n\nfun solve(N: Int, Y: Int): Triple {\n (0..N).forEach { x ->\n (0..N - x).forEach { y ->\n val z = N - x - y\n Triple(x, y, z).let {\n if (it.sum() == Y) return it\n }\n }\n }\n return Triple(-1, -1, -1)\n}\n\nfun main(args: Array) {\n val (N, Y) = readLine()!!.split(\" \").map{ it.toInt() }\n print(solve(N, Y).toList().joinToString(\" \"))\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 505, "cpu_time_ms": 324, "memory_kb": 66912}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s103963281", "group_id": "codeNet:p03471", "input_text": "import java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.util.*\n\nfun main(args: Array) {\n val br = BufferedReader(InputStreamReader(System.`in`))\n val (n, _y) = br.readLine().split(' ').map { it.toInt() }\n val y = _y / 1000\n //即死\n if (y < n || y > n * 10) {\n println(\"-1 -1 -1\")\n return\n }\n val b = y - n\n //簡単\n if (y == n) {\n println(\"0 0 $n\")\n return\n }\n if (y == 5 * n) {\n println(\"0 $n 0\")\n return\n }\n if (y == 10 * n) {\n println(\"$n 0 0\")\n return\n }\n if (b % 4 == 0) {\n val foo = b / 4\n if (foo < n) {\n println(\"0 $foo ${n - foo}\")\n return\n }\n }\n if (b % 9 == 0) {\n val foo = b / 9\n if (foo < n) {\n println(\"$foo 0 ${n - foo}\")\n return\n }\n }\n val out = arrayOf(n - 2, 1, 1)\n //総当り\n for (s in 0..out[0]) {\n for (t in 0..(out[0] - s)) {\n if (n + s * 4 + t * 9 == y) {\n println(\"$t $s ${n - s - t}\")\n return\n }\n }\n }\n println(\"-1 -1 -1\")\n}\n\nfun err(print: Any) {\n System.err.println(print)\n}", "language": "Kotlin", "metadata": {"date": 1515378440, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03471.html", "problem_id": "p03471", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03471/input.txt", "sample_output_relpath": "derived/input_output/data/p03471/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03471/Kotlin/s103963281.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s103963281", "user_id": "u166163326"}, "prompt_components": {"gold_output": "4 0 5\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStreamReader\nimport java.util.*\n\nfun main(args: Array) {\n val br = BufferedReader(InputStreamReader(System.`in`))\n val (n, _y) = br.readLine().split(' ').map { it.toInt() }\n val y = _y / 1000\n //即死\n if (y < n || y > n * 10) {\n println(\"-1 -1 -1\")\n return\n }\n val b = y - n\n //簡単\n if (y == n) {\n println(\"0 0 $n\")\n return\n }\n if (y == 5 * n) {\n println(\"0 $n 0\")\n return\n }\n if (y == 10 * n) {\n println(\"$n 0 0\")\n return\n }\n if (b % 4 == 0) {\n val foo = b / 4\n if (foo < n) {\n println(\"0 $foo ${n - foo}\")\n return\n }\n }\n if (b % 9 == 0) {\n val foo = b / 9\n if (foo < n) {\n println(\"$foo 0 ${n - foo}\")\n return\n }\n }\n val out = arrayOf(n - 2, 1, 1)\n //総当り\n for (s in 0..out[0]) {\n for (t in 0..(out[0] - s)) {\n if (n + s * 4 + t * 9 == y) {\n println(\"$t $s ${n - s - t}\")\n return\n }\n }\n }\n println(\"-1 -1 -1\")\n}\n\nfun err(print: Any) {\n System.err.println(print)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "sample_input": "9 45000\n"}, "reference_outputs": ["4 0 5\n"], "source_document_id": "p03471", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word \"bill\" refers to only these.\n\nAccording to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1000 ≤ Y ≤ 2 × 10^7\n\nN is an integer.\n\nY is a multiple of 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Y\n\nOutput\n\nIf the total value of N bills cannot be Y yen, print -1 -1 -1.\n\nIf the total value of N bills can be Y yen, let one such set of bills be \"x 10000-yen bills, y 5000-yen bills and z 1000-yen bills\", and print x, y, z with spaces in between. If there are multiple possibilities, any of them may be printed.\n\nSample Input 1\n\n9 45000\n\nSample Output 1\n\n4 0 5\n\nIf the envelope contained 4 10000-yen bills and 5 1000-yen bills, he had 9 bills and 45000 yen in total. It is also possible that the envelope contained 9 5000-yen bills, so the output 0 9 0 is also correct.\n\nSample Input 2\n\n20 196000\n\nSample Output 2\n\n-1 -1 -1\n\nWhen the envelope contained 20 bills in total, the total value would be 200000 yen if all the bills were 10000-yen bills, and would be at most 195000 yen otherwise, so it would never be 196000 yen.\n\nSample Input 3\n\n1000 1234000\n\nSample Output 3\n\n14 27 959\n\nThere are also many other possibilities.\n\nSample Input 4\n\n2000 20000000\n\nSample Output 4\n\n2000 0 0", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1213, "cpu_time_ms": 215, "memory_kb": 35744}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s560632774", "group_id": "codeNet:p03472", "input_text": "import java.util.*\n\nfun main(args: Array){\n\n var (N, H) = readLine()!!.split(\" \").map{it.toLong()}\n var a = LongArray(N.toInt())\n var b = LongArray(N.toInt())\n var maxa = 0L\n\n for(i in a.indices){\n var (tmpa,tmpb) = readLine()!!.split(\" \").map{it.toLong()}\n a[i] = tmpa\n b[i] = tmpb\n maxa = Math.max(a[i],maxa)\n }\n Arrays.sort(b)\n\n var ans = (H + maxa -1) / maxa\n var sumb= 0L\n for(i in N-1 downTo 0){\n sumb += b[i.toInt()]\n ans = Math.min(Math.max((H - sumb + maxa -1) / maxa,1) + N-i,ans)\n }\n if(ans < 1) \n println(ans)\n\n\n\n\n}", "language": "Kotlin", "metadata": {"date": 1600693038, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Kotlin/s560632774.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s560632774", "user_id": "u579455624"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array){\n\n var (N, H) = readLine()!!.split(\" \").map{it.toLong()}\n var a = LongArray(N.toInt())\n var b = LongArray(N.toInt())\n var maxa = 0L\n\n for(i in a.indices){\n var (tmpa,tmpb) = readLine()!!.split(\" \").map{it.toLong()}\n a[i] = tmpa\n b[i] = tmpb\n maxa = Math.max(a[i],maxa)\n }\n Arrays.sort(b)\n\n var ans = (H + maxa -1) / maxa\n var sumb= 0L\n for(i in N-1 downTo 0){\n sumb += b[i.toInt()]\n ans = Math.min(Math.max((H - sumb + maxa -1) / maxa,1) + N-i,ans)\n }\n if(ans < 1) \n println(ans)\n\n\n\n\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 616, "cpu_time_ms": 474, "memory_kb": 62712}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s452594928", "group_id": "codeNet:p03472", "input_text": "import java.io.*\nimport java.lang.*\nimport java.math.*\nimport java.util.*\n\n// Constant\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 9223372036854775807L\n\n// Main\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\n\nfun solve() {\n val n = nextLong()\n val h = nextLong()\n val katana = longAry2(n, 2)\n var maxslush = 0L\n var maxidx = 0L\n for (i in 0 until n) {\n katana[i][0] = nextLong()\n katana[i][1] = nextLong()\n if(katana[i][0] > maxslush) {\n maxslush = katana[i][0]\n maxidx = i\n }\n }\n katana.sortByDescending { it[1] }\n\n var throwcount = 0L\n var res = h\n var throwsum = 0L\n for (i in 0 until n) {\n if(katana[i][1] < maxslush) break\n throwsum += katana[i][1]\n throwcount++\n if(throwsum >= res) {\n println(throwcount)\n return\n }\n }\n\n res -= throwsum\n println(throwcount + (res + maxslush - 1) / maxslush)\n\n\n}\n\n\n\n\n// Rule\noperator fun String.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.set(index: Long, value: Char) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun IntArray.get(index: Long): Int {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun IntArray.set(index: Long, value: Int) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun LongArray.get(index: Long): Long {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun LongArray.set(index: Long, value: Long) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun DoubleArray.get(index: Long): Double {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun DoubleArray.set(index: Long, value: Double) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun Array.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun Array.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun MutableList.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun MutableList.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\n\nval LongArray.siz: Long\n get() = size.toLong()\nval Array.siz: Long\n get() = size.toLong()\nval MutableList.siz: Long\n get() = size.toLong()\nval MutableSet.siz: Long\n get() = size.toLong()\nval String.len: Long\n get() = length.toLong()\n\n// Output\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\nfun next() = sc.next()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Long): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextLongAry(n: Long): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Long): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\nfun ary(n: Long, init: String = \"\") = Array(n.toInt()) { init }\nfun longAry(n: Long, init: Long = 0L) = LongArray(n.toInt()) { init }\nfun doubleAry(n: Long, init: Double = 0.0) = DoubleArray(n.toInt()) { init }\nfun boolAry(n: Long, init: Boolean = false) = Array(n.toInt()) { init }\nfun ary2(n: Long, m: Long, init: String = \"\") = Array(n.toInt()) { ary(m, init) }\nfun longAry2(n: Long, m: Long, init: Long = 0) = Array(n.toInt()) { longAry(m, init) }\nfun doubleAry2(n: Long, m: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry(m, init) }\nfun boolAry2(n: Long, m: Long, init: Boolean = false) = Array(n.toInt()) { boolAry(m, init) }\nfun ary3(n: Long, m: Long, k: Long, init: String = \"\") = Array(n.toInt()) { ary2(m, k, init) }\nfun longAry3(n: Long, m: Long, k: Long, init: Long = 0L) = Array(n.toInt()) { longAry2(m, k, init) }\nfun doubleAry3(n: Long, m: Long, k: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry2(m, k, init) }\nfun boolAry3(n: Long, m: Long, k: Long, init: Boolean = false) = Array(n.toInt()) { boolAry2(m, k, init) }\nfun list() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\nval addFunc = {a: Long, b: Long -> a + b}\nval mulFunc = {a: Long, b: Long -> a * b}\nval maxFunc = {a: Long, b: Long -> max(a, b)}\nval minFunc = {a: Long, b: Long -> min(a, b)}\nval gcdFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\nfun LongArray.lowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1L)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Long) {\n repeat(n.toInt()) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Long) {\n repeat(n.toInt()) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Long) = if (values.isEmpty()) -INF else values.max()!!\nfun min(vararg values: Long) = if (values.isEmpty()) INF else values.min()!!\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun erathos(n: Long): LongArray {\n val res = LongArray(n.toInt() + 1) { it.toLong() }\n for (i in 2..n) {\n if(i * i > n) break\n for (j in i * i..n step i) {\n if(res[j] == j) res[j] = i\n }\n }\n res[0] = -1L\n res[1] = -1L\n return res\n}\nfun modAdd(a: Long, b: Long) = if(a + b >= MOD) a + b - MOD else a + b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Long) {\n private val fac = longAry(max)\n private val finv = longAry(max)\n private val inv = longAry(max)\n private val p = MOD\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Long, r: Long): Long = if (n < r || (n < 0 || r < 0)) 0L else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Long, private var searched: Long = 0L, private var nextIndex: Long = 0L) {\n private val size = fact(n)\n private val permList = longAry2(size, n)\n\n private tailrec fun fact(n: Long, ans: Long = 1L): Long {\n return if (n == 0L) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, longAry(n), boolAry(n))\n }\n\n private fun create(num: Long, list: LongArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): LongArray = permList[nextIndex++]\n}\n\n// Graph\ndata class Node(val id: Long, var past: Long = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Long, val to: Long, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Long, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Long): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size.toLong(), -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Long): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size.toLong(), INF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\nclass GridGraph(\n private val h: Long,\n private val w: Long,\n val nodes: Array = Array((h * w).toInt()) { Node(it.toLong()) },\n private val edges: IntArray = IntArray((h * w).toInt()) { 0 }\n) {\n private val up = 1\n private val right = 2\n private val down = 4\n private val left = 8\n private val queue: ArrayDeque = ArrayDeque()\n private val startPos = longList()\n\n private fun pos(y: Long, x: Long) = y * w + x\n fun canUp(v: Long) = (edges[v] and 1) == 1\n fun canRight(v: Long) = ((edges[v] shr 1) and 1) == 1\n fun canDown(v: Long) = ((edges[v] shr 2) and 1) == 1\n fun canLeft(v: Long) = ((edges[v] shr 3) and 1) == 1\n\n fun init(s: Array, check: Char = '.', road: Char = '.', start: Char = 'S') {\n for (i in 0 until h) {\n for (j in 0 until w) {\n if(s[i][j] != check && s[i][j] != start) continue\n if(i > 0 && s[i - 1][j] == road) edges[pos(i, j)] += up\n if(i < h - 1 && s[i + 1][j] == road) edges[pos(i, j)] += down\n if(j > 0 && s[i][j - 1] == road) edges[pos(i, j)] += left\n if(j < w - 1 && s[i][j + 1] == road) edges[pos(i, j)] += right\n if(s[i][j] == start) {\n queue.add(pos(i, j))\n startPos.add(pos(i, j))\n }\n }\n }\n }\n fun addStart(y: Long, x: Long) {\n startPos.add(pos(y, x))\n queue.add(pos(y, x))\n }\n\n fun bfs(): LongArray {\n val dist = longAry(h * w, -1L)\n for (i in startPos) {\n dist[i] = 0L\n }\n while (queue.isNotEmpty()) {\n val v = queue.poll()\n if(canUp(v) && dist[v - w] == -1L) {\n queue.add(v - w)\n dist[v - w] = dist[v] + 1L\n }\n if(canDown(v) && dist[v + w] == -1L) {\n queue.add(v + w)\n dist[v + w] = dist[v] + 1L\n }\n if(canLeft(v) && dist[v - 1] == -1L) {\n queue.add(v - 1)\n dist[v - 1] = dist[v] + 1L\n }\n if(canRight(v) && dist[v + 1] == -1L) {\n queue.add(v + 1)\n dist[v + 1] = dist[v] + 1L\n }\n }\n return dist\n }\n\n}\n\n// Data Structure\nclass UnionFind(size: Long) {\n private val par = LongArray(size.toInt()) { it.toLong() }\n private val size = longAry(size, 1L)\n private val diffWeight = longAry(size, 0L)\n fun root(x: Long): Long {\n return if (par[x] == x) {\n x\n } else {\n val r = root(par[x])\n diffWeight[x] += diffWeight[par[x]]\n par[x] = r\n par[x]\n }\n }\n fun weight(x: Long): Long {\n root(x)\n return diffWeight[x]\n }\n fun diff(x: Long, y: Long) = abs(weight(y) - weight(x))\n\n fun same(x: Long, y: Long): Boolean = root(x) == root(y)\n fun unite(x: Long, y: Long, d: Long) {\n var w = d\n w += weight(x)\n w -= weight(y)\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n w = -w\n }\n size[a] += size[b]\n par[b] = a\n diffWeight[b] = w\n }\n\n fun size(x: Long): Long = size[root(x)]\n}\n\nclass SegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2L * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Long, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Long, b: Long) = getSub(a, b, 0L, 0L, n.toLong())\n private fun getSub(a: Long, b: Long, k: Long, l: Long, r: Long): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n buflen > 0\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n// \"The world doesn't need you.\"\n//\n// fun nextInt(): Int {\n// val nl = nextLong()\n// if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n// return nl.toInt()\n// }\n}", "language": "Kotlin", "metadata": {"date": 1589802316, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Kotlin/s452594928.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s452594928", "user_id": "u581625805"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.io.*\nimport java.lang.*\nimport java.math.*\nimport java.util.*\n\n// Constant\nval sc = FastScanner()\nval pw = PrintWriter(System.out)\nconst val MOD = 1000000007L\nconst val INF = 9223372036854775807L\n\n// Main\nfun main(args: Array) {\n solve()\n pw.flush()\n}\n\n\nfun solve() {\n val n = nextLong()\n val h = nextLong()\n val katana = longAry2(n, 2)\n var maxslush = 0L\n var maxidx = 0L\n for (i in 0 until n) {\n katana[i][0] = nextLong()\n katana[i][1] = nextLong()\n if(katana[i][0] > maxslush) {\n maxslush = katana[i][0]\n maxidx = i\n }\n }\n katana.sortByDescending { it[1] }\n\n var throwcount = 0L\n var res = h\n var throwsum = 0L\n for (i in 0 until n) {\n if(katana[i][1] < maxslush) break\n throwsum += katana[i][1]\n throwcount++\n if(throwsum >= res) {\n println(throwcount)\n return\n }\n }\n\n res -= throwsum\n println(throwcount + (res + maxslush - 1) / maxslush)\n\n\n}\n\n\n\n\n// Rule\noperator fun String.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.get(index: Long): Char {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun CharArray.set(index: Long, value: Char) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun IntArray.get(index: Long): Int {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun IntArray.set(index: Long, value: Int) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun LongArray.get(index: Long): Long {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun LongArray.set(index: Long, value: Long) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun DoubleArray.get(index: Long): Double {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun DoubleArray.set(index: Long, value: Double) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun Array.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun Array.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\noperator fun MutableList.get(index: Long): T {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n return this[index.toInt()]\n}\noperator fun MutableList.set(index: Long, value: T) {\n if (index !in 0L..Int.MAX_VALUE) throw IllegalArgumentException()\n this[index.toInt()] = value\n}\n\nval LongArray.siz: Long\n get() = size.toLong()\nval Array.siz: Long\n get() = size.toLong()\nval MutableList.siz: Long\n get() = size.toLong()\nval MutableSet.siz: Long\n get() = size.toLong()\nval String.len: Long\n get() = length.toLong()\n\n// Output\nfun println(v: String) {\n pw.println(v)\n}\nfun print(v: String) {\n pw.print(v)\n}\n\n// Input\nfun next() = sc.next()\nfun nextLong() = sc.nextLong()\nfun nextDouble() = next().toDouble()\nfun nextAry(n: Long): Array {\n val ary = ary(n)\n for (i in 0 until n) ary[i] = next()\n return ary\n}\nfun nextLongAry(n: Long): LongArray {\n val ary = longAry(n)\n for (i in 0 until n) ary[i] = nextLong()\n return ary\n}\nfun nextDoubleAry(n: Long): DoubleArray {\n val ary = doubleAry(n)\n for (i in 0 until n) ary[i] = nextDouble()\n return ary\n}\n\n// Statement\nfun ary(n: Long, init: String = \"\") = Array(n.toInt()) { init }\nfun longAry(n: Long, init: Long = 0L) = LongArray(n.toInt()) { init }\nfun doubleAry(n: Long, init: Double = 0.0) = DoubleArray(n.toInt()) { init }\nfun boolAry(n: Long, init: Boolean = false) = Array(n.toInt()) { init }\nfun ary2(n: Long, m: Long, init: String = \"\") = Array(n.toInt()) { ary(m, init) }\nfun longAry2(n: Long, m: Long, init: Long = 0) = Array(n.toInt()) { longAry(m, init) }\nfun doubleAry2(n: Long, m: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry(m, init) }\nfun boolAry2(n: Long, m: Long, init: Boolean = false) = Array(n.toInt()) { boolAry(m, init) }\nfun ary3(n: Long, m: Long, k: Long, init: String = \"\") = Array(n.toInt()) { ary2(m, k, init) }\nfun longAry3(n: Long, m: Long, k: Long, init: Long = 0L) = Array(n.toInt()) { longAry2(m, k, init) }\nfun doubleAry3(n: Long, m: Long, k: Long, init: Double = 0.0) = Array(n.toInt()) { doubleAry2(m, k, init) }\nfun boolAry3(n: Long, m: Long, k: Long, init: Boolean = false) = Array(n.toInt()) { boolAry2(m, k, init) }\nfun list() = mutableListOf()\nfun longList() = mutableListOf()\nfun doubleList() = mutableListOf()\nfun strSet() = mutableSetOf()\nfun longSet() = mutableSetOf()\nfun doubleSet() = mutableSetOf()\nfun map() = mutableMapOf()\n\n// Monoid\nval addFunc = {a: Long, b: Long -> a + b}\nval mulFunc = {a: Long, b: Long -> a * b}\nval maxFunc = {a: Long, b: Long -> max(a, b)}\nval minFunc = {a: Long, b: Long -> min(a, b)}\nval gcdFunc = {a: Long, b: Long -> gcd(a, b)}\nval lcmFunc = {a: Long, b: Long -> lcm(a, b)}\nval xorFunc = {a: Long, b: Long -> a xor b}\nfun calc(a: Long, b: Long, op: (Long, Long) -> Long) = op(a, b)\n\n// Extension\nfun LongArray.lowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun DoubleArray.lowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.longLowerBound(n: Long): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun MutableList.doubleLowerBound(n: Double): Long {\n var ok = this.size.toLong()\n var ng = -1L\n while (abs(ok - ng) > 1) {\n val mid = (ok + ng) / 2\n if (this[mid] >= n) ok = mid\n else ng = mid\n }\n return ok\n}\nfun LongArray.cumsum(op: (Long, Long) -> Long): LongArray {\n val s = longAry(this.size + 1L)\n s[1] = this[0]\n for (i in 1 until this.size) s[i + 1] = calc(s[i], this[i], op)\n return s\n}\nfun MutableMap.counting(n: Long) {\n repeat(n.toInt()) {\n val a = next()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\nfun MutableMap.longCounting(n: Long) {\n repeat(n.toInt()) {\n val a = nextLong()\n if (this.containsKey(a)) this[a] = this[a]!! + 1\n else this[a] = 1\n }\n}\n\n// Mathematics\nfun abs(n: Long): Long = Math.abs(n)\nfun abs(n: Double): Double = Math.abs(n)\nfun max(vararg values: Long) = if (values.isEmpty()) -INF else values.max()!!\nfun min(vararg values: Long) = if (values.isEmpty()) INF else values.min()!!\ntailrec fun gcd(a: Long, b: Long): Long = if (b == 0L) a else if (a % b == 0L) b else gcd(b, (a % b))\nfun lcm(a: Long, b: Long): Long = a / gcd(a, b) * b\nfun erathos(n: Long): LongArray {\n val res = LongArray(n.toInt() + 1) { it.toLong() }\n for (i in 2..n) {\n if(i * i > n) break\n for (j in i * i..n step i) {\n if(res[j] == j) res[j] = i\n }\n }\n res[0] = -1L\n res[1] = -1L\n return res\n}\nfun modAdd(a: Long, b: Long) = if(a + b >= MOD) a + b - MOD else a + b\nfun modpow(a: Long, n: Long, p: Long = MOD): Long {\n var res = 1L\n var ar = a\n var nr = n\n while (nr > 0) {\n if ((nr and 1) == 1L) res = res * ar % p\n ar = ar * ar % p\n nr = nr shr 1\n }\n return res\n}\nfun modinv(a: Long, p: Long = MOD): Long = modpow(a, p - 2, p)\nfun ncr(n: Long, r: Long): Long {\n var a = 1L\n var b = 1L\n for (i in 1..r) {\n a = a * (n + 1 - i) % MOD\n b = b * i % MOD\n }\n return modinv(b, MOD) * a % MOD\n}\n\nclass Combination(private val max: Long) {\n private val fac = longAry(max)\n private val finv = longAry(max)\n private val inv = longAry(max)\n private val p = MOD\n fun init() {\n fac[0] = 1\n fac[1] = 1\n finv[0] = 1\n finv[1] = 1\n inv[1] = 1\n for (i in 2 until max) {\n fac[i] = fac[i - 1] * i % p\n inv[i] = p - inv[p % i] * (p / i) % p;\n finv[i] = finv[i - 1] * inv[i] % p\n }\n }\n\n fun com(n: Long, r: Long): Long = if (n < r || (n < 0 || r < 0)) 0L else fac[n] * (finv[r] * finv[n - r] % p) % p\n}\n\nclass Permutation(private val n: Long, private var searched: Long = 0L, private var nextIndex: Long = 0L) {\n private val size = fact(n)\n private val permList = longAry2(size, n)\n\n private tailrec fun fact(n: Long, ans: Long = 1L): Long {\n return if (n == 0L) ans\n else fact(n - 1, ans * n)\n }\n\n fun init() {\n create(0, longAry(n), boolAry(n))\n }\n\n private fun create(num: Long, list: LongArray, flag: Array) {\n if (num == n) {\n permList[searched] = list.copyOf()\n searched++\n }\n for (i in 0 until n) {\n if (flag[i]) continue\n list[num] = i\n flag[i] = true\n create(num + 1, list, flag)\n flag[i] = false\n }\n }\n\n fun hasNext(): Boolean {\n return if (nextIndex < size) {\n true\n } else {\n nextIndex = 0\n false\n }\n }\n\n fun nextPerm(): LongArray = permList[nextIndex++]\n}\n\n// Graph\ndata class Node(val id: Long, var past: Long = -1, val edges: MutableList = mutableListOf())\ndata class Edge(val from: Long, val to: Long, val cost: Long = 1L)\n\nfun dfs(nodes: Array, now: Long, seen: Array) {\n seen[now] = true\n for (edge in nodes[now].edges) {\n if (seen[edge.to]) continue\n dfs(nodes, edge.to, seen)\n }\n}\n\nfun bfs(nodes: Array, start: Long): LongArray {\n val queue = ArrayDeque()\n queue.add(start)\n val dist = longAry(nodes.size.toLong(), -1L)\n dist[start] = 0L\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n for (edge in nodes[now].edges) {\n if (dist[edge.to] != -1L) continue\n dist[edge.to] = dist[now] + 1\n queue.add(edge.to)\n }\n }\n return dist\n}\n\nfun dijkstra(nodes: Array, start: Long): LongArray {\n val queue = PriorityQueue(16) { e1: Edge, e2: Edge ->\n return@PriorityQueue when {\n e1.cost < e2.cost -> -1\n e2.cost > e1.cost -> 1\n else -> 0\n }\n }\n queue.add(Edge(start, start, 0L))\n val dist = longAry(nodes.size.toLong(), INF / 2)\n dist[start] = 0\n while (queue.isNotEmpty()) {\n val now = queue.poll()\n if (dist[now.to] < now.cost) continue;\n for (edge in nodes[now.to].edges) {\n if (dist[edge.to] <= dist[edge.from] + edge.cost) continue\n dist[edge.to] = dist[edge.from] + edge.cost\n queue.add(Edge(edge.from, edge.to, dist[edge.to]))\n nodes[edge.to].past = edge.from\n }\n }\n return dist\n}\n\nclass GridGraph(\n private val h: Long,\n private val w: Long,\n val nodes: Array = Array((h * w).toInt()) { Node(it.toLong()) },\n private val edges: IntArray = IntArray((h * w).toInt()) { 0 }\n) {\n private val up = 1\n private val right = 2\n private val down = 4\n private val left = 8\n private val queue: ArrayDeque = ArrayDeque()\n private val startPos = longList()\n\n private fun pos(y: Long, x: Long) = y * w + x\n fun canUp(v: Long) = (edges[v] and 1) == 1\n fun canRight(v: Long) = ((edges[v] shr 1) and 1) == 1\n fun canDown(v: Long) = ((edges[v] shr 2) and 1) == 1\n fun canLeft(v: Long) = ((edges[v] shr 3) and 1) == 1\n\n fun init(s: Array, check: Char = '.', road: Char = '.', start: Char = 'S') {\n for (i in 0 until h) {\n for (j in 0 until w) {\n if(s[i][j] != check && s[i][j] != start) continue\n if(i > 0 && s[i - 1][j] == road) edges[pos(i, j)] += up\n if(i < h - 1 && s[i + 1][j] == road) edges[pos(i, j)] += down\n if(j > 0 && s[i][j - 1] == road) edges[pos(i, j)] += left\n if(j < w - 1 && s[i][j + 1] == road) edges[pos(i, j)] += right\n if(s[i][j] == start) {\n queue.add(pos(i, j))\n startPos.add(pos(i, j))\n }\n }\n }\n }\n fun addStart(y: Long, x: Long) {\n startPos.add(pos(y, x))\n queue.add(pos(y, x))\n }\n\n fun bfs(): LongArray {\n val dist = longAry(h * w, -1L)\n for (i in startPos) {\n dist[i] = 0L\n }\n while (queue.isNotEmpty()) {\n val v = queue.poll()\n if(canUp(v) && dist[v - w] == -1L) {\n queue.add(v - w)\n dist[v - w] = dist[v] + 1L\n }\n if(canDown(v) && dist[v + w] == -1L) {\n queue.add(v + w)\n dist[v + w] = dist[v] + 1L\n }\n if(canLeft(v) && dist[v - 1] == -1L) {\n queue.add(v - 1)\n dist[v - 1] = dist[v] + 1L\n }\n if(canRight(v) && dist[v + 1] == -1L) {\n queue.add(v + 1)\n dist[v + 1] = dist[v] + 1L\n }\n }\n return dist\n }\n\n}\n\n// Data Structure\nclass UnionFind(size: Long) {\n private val par = LongArray(size.toInt()) { it.toLong() }\n private val size = longAry(size, 1L)\n private val diffWeight = longAry(size, 0L)\n fun root(x: Long): Long {\n return if (par[x] == x) {\n x\n } else {\n val r = root(par[x])\n diffWeight[x] += diffWeight[par[x]]\n par[x] = r\n par[x]\n }\n }\n fun weight(x: Long): Long {\n root(x)\n return diffWeight[x]\n }\n fun diff(x: Long, y: Long) = abs(weight(y) - weight(x))\n\n fun same(x: Long, y: Long): Boolean = root(x) == root(y)\n fun unite(x: Long, y: Long, d: Long) {\n var w = d\n w += weight(x)\n w -= weight(y)\n var a = root(x)\n var b = root(y)\n if (a == b) return\n if (size[a] < size[b]) {\n var tmp = a\n a = b\n b = tmp\n w = -w\n }\n size[a] += size[b]\n par[b] = a\n diffWeight[b] = w\n }\n\n fun size(x: Long): Long = size[root(x)]\n}\n\nclass SegmentTree(\n private val a: LongArray,\n private val op: (Long, Long) -> Long,\n private val def: Long = 0,\n private val size: Int = a.size,\n private val n: Int = Integer.highestOneBit(size) shl 1\n) {\n private val nodes = longAry(2L * n - 1, def)\n\n fun init() {\n for (i in 0 until size) nodes[i + n - 1] = a[i]\n for (i in n - 2 downTo 0) nodes[i] = calc(nodes[2 * i + 1], nodes[2 * i + 2], op)\n }\n\n fun update(x: Long, value: Long) {\n var index = x + n - 1\n nodes[index] = value\n while (index > 0) {\n index = (index - 1) / 2\n nodes[index] = calc(nodes[2 * index + 1], nodes[2 * index + 2], op)\n }\n }\n\n fun get(a: Long, b: Long) = getSub(a, b, 0L, 0L, n.toLong())\n private fun getSub(a: Long, b: Long, k: Long, l: Long, r: Long): Long {\n return when {\n r <= a || b <= l -> def\n a <= l && r <= b -> nodes[k]\n else -> {\n val vl = getSub(a, b, k * 2 + 1, l, (l + r) / 2)\n val vr = getSub(a, b, k * 2 + 2, (l + r) / 2, r)\n calc(vl, vr, op)\n }\n }\n }\n\n fun joinToString(separator: String) = nodes.drop(n - 1).take(size).joinToString(separator)\n}\n\n// Scanner\nclass FastScanner {\n private val sin: InputStream = System.`in`\n private val buffer: ByteArray = ByteArray(1024) { 0 }\n private var ptr = 0\n private var buflen = 0\n\n private fun hasNextByte(): Boolean {\n return when {\n ptr < buflen -> true\n else -> {\n ptr = 0\n buflen = sin.read(buffer)\n buflen > 0\n }\n }\n }\n\n private fun readByte(): Int {\n return when {\n hasNextByte() -> buffer[ptr++].toInt()\n else -> -1\n }\n }\n\n private fun isPrintableChar(c: Int) = c in 33..126\n\n fun hasNext(): Boolean {\n while (hasNextByte() && !isPrintableChar(buffer[ptr].toInt())) ptr++\n return hasNextByte()\n }\n\n fun next(): String {\n if (!hasNext()) throw NoSuchElementException()\n val sb = StringBuilder()\n var b = readByte()\n while (isPrintableChar(b)) {\n sb.appendCodePoint(b)\n b = readByte()\n }\n return sb.toString()\n }\n\n fun nextLong(): Long {\n if (!hasNext()) throw NoSuchElementException()\n var n = 0L\n var minus = false\n var b = readByte()\n if (b.toChar() == '-') {\n minus = true\n b = readByte()\n }\n if (b.toChar() !in '0'..'9') throw NumberFormatException()\n while (true) {\n when {\n b.toChar() in '0'..'9' -> {\n n *= 10\n n += b.toChar() - '0'\n }\n b == -1 || !isPrintableChar(b) -> return if (minus) -n else n\n else -> throw NumberFormatException()\n }\n b = readByte()\n }\n }\n\n// \"The world doesn't need you.\"\n//\n// fun nextInt(): Int {\n// val nl = nextLong()\n// if (nl !in Int.MIN_VALUE..Int.MAX_VALUE) throw NumberFormatException()\n// return nl.toInt()\n// }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 18195, "cpu_time_ms": 666, "memory_kb": 55048}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s483791928", "group_id": "codeNet:p03472", "input_text": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\n////////////////////////////////////////////////////////////////////////\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val H = sc.next().toInt()\n val ab = Array(N) { Pair(sc.next().toInt(), sc.next().toInt()) }\n val aMax = ab.map { it.first }.max()!!\n val b = ab.map { it.second }.filter { it > aMax }.sorted().reversed().toTypedArray()\n var h = H\n var ans = 0\n var i = 0\n while (h > 0 && i < b.count()) {\n ans++\n h -= b[i]\n i++\n }\n if (h > 0) {\n ans += (h + aMax - 1) / aMax\n }\n pw.println(ans)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1588382784, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Kotlin/s483791928.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s483791928", "user_id": "u297767059"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.util.*\n\nclass Scanner(`in`: java.io.InputStream) {\n private val reader = java.io.BufferedReader(java.io.InputStreamReader(`in`))\n private var tokenizer: StringTokenizer? = null\n\n fun next(): String {\n if (tokenizer?.hasMoreTokens() != true) {\n tokenizer = StringTokenizer(reader.readLine())\n }\n return tokenizer!!.nextToken()\n }\n\n fun nextLine(): String {\n return if (tokenizer?.hasMoreTokens() != true) {\n reader.readLine()\n } else tokenizer!!.nextToken(\"\\n\")\n }\n}\n\nfun main(args: Array) {\n val pw = java.io.PrintWriter(System.out)\n Problem.solve(Scanner(System.`in`), pw)\n pw.flush()\n}\n\n////////////////////////////////////////////////////////////////////////\n\nobject Problem {\n fun solve(sc: Scanner, pw: java.io.PrintWriter) {\n val N = sc.next().toInt()\n val H = sc.next().toInt()\n val ab = Array(N) { Pair(sc.next().toInt(), sc.next().toInt()) }\n val aMax = ab.map { it.first }.max()!!\n val b = ab.map { it.second }.filter { it > aMax }.sorted().reversed().toTypedArray()\n var h = H\n var ans = 0\n var i = 0\n while (h > 0 && i < b.count()) {\n ans++\n h -= b[i]\n i++\n }\n if (h > 0) {\n ans += (h + aMax - 1) / aMax\n }\n pw.println(ans)\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1386, "cpu_time_ms": 820, "memory_kb": 57896}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s201365256", "group_id": "codeNet:p03472", "input_text": "fun main(args: Array) {\n var (n, h) = readIntegerList()\n val abArray = Array(n) { readIntegerList() }\n val maxA = abArray.maxBy { it[0] }!![0]\n val sortedByB = abArray.sortedByDescending { it[1] }\n var ans = 0\n var i = 0\n while (h > 0 && i < n && sortedByB[i][1] > maxA) {\n h -= sortedByB[i][1]\n i++\n ans++\n }\n ans += (Math.max(h, 0) + maxA - 1) / maxA\n println(ans)\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "language": "Kotlin", "metadata": {"date": 1584223116, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Kotlin/s201365256.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s201365256", "user_id": "u784448849"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n var (n, h) = readIntegerList()\n val abArray = Array(n) { readIntegerList() }\n val maxA = abArray.maxBy { it[0] }!![0]\n val sortedByB = abArray.sortedByDescending { it[1] }\n var ans = 0\n var i = 0\n while (h > 0 && i < n && sortedByB[i][1] > maxA) {\n h -= sortedByB[i][1]\n i++\n ans++\n }\n ans += (Math.max(h, 0) + maxA - 1) / maxA\n println(ans)\n}\n\nfun readInteger() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntegerList() = readStringList().map(String::toInt)\nfun readLongList() = readStringList().map(String::toLong)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 674, "cpu_time_ms": 1094, "memory_kb": 82660}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s797744795", "group_id": "codeNet:p03472", "input_text": "import java.lang.Math\nimport kotlin.comparisons.*\n\nval MOD: Int = 1000000000 + 7\nval MODL: Long = MOD.toLong()\n\nfun main(args: Array)\n{\n var (n, h) = read().split().toInt()\n // val damage = mutableListOf>()\n // for (i in 0 until n) {\n // val (a, b) = read().split().toInt()\n // damage.add(Pair(a, b))\n // }\n var a = -1\n val b = mutableListOf()\n for (i in 0 until n) {\n val (s, t) = read().split().toInt()\n a = Math.max(a, s)\n b.add(t)\n }\n\n b.sortWith(compareByDescending{it})\n var ans = 0L\n for (i in 0 until n) {\n if (b[i] <= a) break\n h -= b[i]\n ans++\n if (h <= 0) {\n println(ans)\n return\n }\n }\n\n ans += h.toLong() / a.toLong() + if (h % a == 0) 0L else 1L\n println(ans)\n\n}\n\nfun read(): String = readLine()!!\nfun CharSequence.split(): List = this.split(\" \")\nfun Iterable.toInt(): List = this.map{it.toInt()}\n", "language": "Kotlin", "metadata": {"date": 1578864905, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Kotlin/s797744795.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s797744795", "user_id": "u118477733"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "import java.lang.Math\nimport kotlin.comparisons.*\n\nval MOD: Int = 1000000000 + 7\nval MODL: Long = MOD.toLong()\n\nfun main(args: Array)\n{\n var (n, h) = read().split().toInt()\n // val damage = mutableListOf>()\n // for (i in 0 until n) {\n // val (a, b) = read().split().toInt()\n // damage.add(Pair(a, b))\n // }\n var a = -1\n val b = mutableListOf()\n for (i in 0 until n) {\n val (s, t) = read().split().toInt()\n a = Math.max(a, s)\n b.add(t)\n }\n\n b.sortWith(compareByDescending{it})\n var ans = 0L\n for (i in 0 until n) {\n if (b[i] <= a) break\n h -= b[i]\n ans++\n if (h <= 0) {\n println(ans)\n return\n }\n }\n\n ans += h.toLong() / a.toLong() + if (h % a == 0) 0L else 1L\n println(ans)\n\n}\n\nfun read(): String = readLine()!!\nfun CharSequence.split(): List = this.split(\" \")\nfun Iterable.toInt(): List = this.map{it.toInt()}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1003, "cpu_time_ms": 846, "memory_kb": 75836}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s870159534", "group_id": "codeNet:p03472", "input_text": "class Katana(val at : Int, val th : Int)\n\nfun ceilDiv(t : Int, d : Int) : Int{\n return if(t % d > 0) t / d + 1 else t / d\n}\n\nfun thrower(attacker : Katana, lKatana : MutableList, h : Int, n : Int) : Pair{\n var cnt = 0\n var hp = h\n for(i in 0..(n - 1)){\n if(hp <= attacker.th) return Pair(cnt, hp)\n if(lKatana[i].th <= attacker.at) return Pair(cnt, hp)\n hp -= lKatana[i].th\n cnt++\n if(hp <= 0) return Pair(cnt, hp)\n }\n return Pair(cnt, hp)\n}\n\nfun battle(attacker : Katana, lKatana : MutableList, h : Int, n : Int) : Int{\n var (cnt, hp) = thrower(attacker, lKatana, h, n)\n if(hp <= 0) return cnt\n hp -= attacker.th\n cnt++\n if(hp <= 0) return cnt\n\n return cnt + ceilDiv(hp, attacker.at)\n}\n\nfun main(args: Array){\n val (n, h) = readLine()!!.split(\" \").map(String::toInt)\n\n val lKatana = mutableListOf()\n for(i in 0..(n-1)){\n val (at, th) = readLine()!!.split(\" \").map(String::toInt)\n lKatana.add(Katana(at, th))\n }\n\n lKatana.sortByDescending { it.at }\n val attacker = lKatana[0]\n lKatana.removeAt(0)\n\n lKatana.sortByDescending { it.th }\n println(battle(attacker, lKatana, h, n - 1))\n}", "language": "Kotlin", "metadata": {"date": 1554839860, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Kotlin/s870159534.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s870159534", "user_id": "u712822150"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "class Katana(val at : Int, val th : Int)\n\nfun ceilDiv(t : Int, d : Int) : Int{\n return if(t % d > 0) t / d + 1 else t / d\n}\n\nfun thrower(attacker : Katana, lKatana : MutableList, h : Int, n : Int) : Pair{\n var cnt = 0\n var hp = h\n for(i in 0..(n - 1)){\n if(hp <= attacker.th) return Pair(cnt, hp)\n if(lKatana[i].th <= attacker.at) return Pair(cnt, hp)\n hp -= lKatana[i].th\n cnt++\n if(hp <= 0) return Pair(cnt, hp)\n }\n return Pair(cnt, hp)\n}\n\nfun battle(attacker : Katana, lKatana : MutableList, h : Int, n : Int) : Int{\n var (cnt, hp) = thrower(attacker, lKatana, h, n)\n if(hp <= 0) return cnt\n hp -= attacker.th\n cnt++\n if(hp <= 0) return cnt\n\n return cnt + ceilDiv(hp, attacker.at)\n}\n\nfun main(args: Array){\n val (n, h) = readLine()!!.split(\" \").map(String::toInt)\n\n val lKatana = mutableListOf()\n for(i in 0..(n-1)){\n val (at, th) = readLine()!!.split(\" \").map(String::toInt)\n lKatana.add(Katana(at, th))\n }\n\n lKatana.sortByDescending { it.at }\n val attacker = lKatana[0]\n lKatana.removeAt(0)\n\n lKatana.sortByDescending { it.th }\n println(battle(attacker, lKatana, h, n - 1))\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1234, "cpu_time_ms": 1137, "memory_kb": 82784}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s228137507", "group_id": "codeNet:p03472", "input_text": "fun main(args: Array) {\n val sc = java.util.Scanner(System.`in`)\n val N = sc.next().toInt()\n var H = sc.next().toInt()\n val a = IntArray(N)\n val b = IntArray(N)\n for (i in 0 until N){\n a[i] = sc.next().toInt()\n b[i] = sc.next().toInt()\n }\n\n var turn = 0\n\n b.sort()\n b.reverse()\n val max_a = a.max()!!\n for (bb in b) {\n if (H <= 0) break\n if (bb > max_a) {\n H -= bb\n turn += 1\n } else {\n break\n }\n }\n\n if (H > 0) turn += (H+max_a-1) / max_a\n\n println(turn)\n}", "language": "Kotlin", "metadata": {"date": 1521294821, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Kotlin/s228137507.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s228137507", "user_id": "u509457191"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val sc = java.util.Scanner(System.`in`)\n val N = sc.next().toInt()\n var H = sc.next().toInt()\n val a = IntArray(N)\n val b = IntArray(N)\n for (i in 0 until N){\n a[i] = sc.next().toInt()\n b[i] = sc.next().toInt()\n }\n\n var turn = 0\n\n b.sort()\n b.reverse()\n val max_a = a.max()!!\n for (bb in b) {\n if (H <= 0) break\n if (bb > max_a) {\n H -= bb\n turn += 1\n } else {\n break\n }\n }\n\n if (H > 0) turn += (H+max_a-1) / max_a\n\n println(turn)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 585, "cpu_time_ms": 737, "memory_kb": 55356}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s727226171", "group_id": "codeNet:p03472", "input_text": "fun main(args: Array) {\n val sc = java.util.Scanner(System.`in`)\n val N = sc.next().toInt()\n var H = sc.next().toInt()\n val a = IntArray(N)\n val b = IntArray(N)\n for (i in 0 until N){\n a[i] = sc.next().toInt()\n b[i] = sc.next().toInt()\n }\n\n var turn = 0\n\n b.sort()\n b.reverse()\n val max_a = a.max()!!\n for (bb in b) {\n if (bb > max_a) {\n H -= bb\n turn += 1\n } else {\n break\n }\n\n if (H < 0) break\n }\n\n if (H > 0) turn += (H+max_a-1) / max_a\n\n println(turn)\n}", "language": "Kotlin", "metadata": {"date": 1521294197, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Kotlin/s727226171.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s727226171", "user_id": "u509457191"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val sc = java.util.Scanner(System.`in`)\n val N = sc.next().toInt()\n var H = sc.next().toInt()\n val a = IntArray(N)\n val b = IntArray(N)\n for (i in 0 until N){\n a[i] = sc.next().toInt()\n b[i] = sc.next().toInt()\n }\n\n var turn = 0\n\n b.sort()\n b.reverse()\n val max_a = a.max()!!\n for (bb in b) {\n if (bb > max_a) {\n H -= bb\n turn += 1\n } else {\n break\n }\n\n if (H < 0) break\n }\n\n if (H > 0) turn += (H+max_a-1) / max_a\n\n println(turn)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 585, "cpu_time_ms": 744, "memory_kb": 55384}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s861312453", "group_id": "codeNet:p03472", "input_text": "fun main(args: Array) {\n val (n, h) = readLine()!!.split(\" \").map(String::toInt)\n val aArray = Array(n, {0})\n val bArray = Array(n, {0})\n for (i in 0 until n) {\n val(a, b) = readLine()!!.split(\" \").map(String::toInt)\n aArray[i] = a\n bArray[i] = b\n }\n val aMax = aArray.max()!!\n val filteredBArray = bArray.filter { it > aMax }.sortedDescending()\n\n var ans = 0\n var acc = 0\n for (b in filteredBArray) {\n acc += b\n ans += 1\n if (acc >= h) {\n println(ans)\n return\n }\n }\n println(ans + (h - acc + aMax - 1) / aMax)\n}", "language": "Kotlin", "metadata": {"date": 1515378076, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03472.html", "problem_id": "p03472", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03472/input.txt", "sample_output_relpath": "derived/input_output/data/p03472/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03472/Kotlin/s861312453.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s861312453", "user_id": "u771276542"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, h) = readLine()!!.split(\" \").map(String::toInt)\n val aArray = Array(n, {0})\n val bArray = Array(n, {0})\n for (i in 0 until n) {\n val(a, b) = readLine()!!.split(\" \").map(String::toInt)\n aArray[i] = a\n bArray[i] = b\n }\n val aMax = aArray.max()!!\n val filteredBArray = bArray.filter { it > aMax }.sortedDescending()\n\n var ans = 0\n var acc = 0\n for (b in filteredBArray) {\n acc += b\n ans += 1\n if (acc >= h) {\n println(ans)\n return\n }\n }\n println(ans + (h - acc + aMax - 1) / aMax)\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "sample_input": "1 10\n3 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03472", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:\n\nWield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.\n\nThrow one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.\n\nThe monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ H ≤ 10^9\n\n1 ≤ a_i ≤ b_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the minimum total number of attacks required to vanish the monster.\n\nSample Input 1\n\n1 10\n3 5\n\nSample Output 1\n\n3\n\nYou have one katana. Wielding it deals 3 points of damage, and throwing it deals 5 points of damage. By wielding it twice and then throwing it, you will deal 3 + 3 + 5 = 11 points of damage in a total of three attacks, vanishing the monster.\n\nSample Input 2\n\n2 10\n3 5\n2 6\n\nSample Output 2\n\n2\n\nIn addition to the katana above, you also have another katana. Wielding it deals 2 points of damage, and throwing it deals 6 points of damage. By throwing both katana, you will deal 5 + 6 = 11 points of damage in two attacks, vanishing the monster.\n\nSample Input 3\n\n4 1000000000\n1 1\n1 10000000\n1 30000000\n1 99999999\n\nSample Output 3\n\n860000004\n\nSample Input 4\n\n5 500\n35 44\n28 83\n46 62\n31 79\n40 43\n\nSample Output 4\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 627, "cpu_time_ms": 842, "memory_kb": 58492}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s552891461", "group_id": "codeNet:p03478", "input_text": "fun main() {\n val (numMax, min, max) = readLine()!!.split(\" \").map(String::toInt)\n var sum = 0\n\n for (i in 0..9) {\n for (j in 0..9) {\n var tmp = i + 10*j\n if(numMax >= 100){\n for(k in 1..9) {\n tmp = i + 10*j + 100*k\n if(numMax > 1000) {\n for(l in 1..9) {\n tmp = i + 10*j + 100*k + 1000*l\n if((i+j+k+l) in min..max && tmp <= numMax) {\n sum += tmp\n }\n }\n }else if((i+j+k) in min..max && tmp <= numMax) {\n sum += tmp\n }\n }\n }else if(i + j in min..max && tmp <= numMax) {\n sum += tmp\n }\n }\n }\n println(sum)\n}\n", "language": "Kotlin", "metadata": {"date": 1600981960, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s552891461.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s552891461", "user_id": "u774837848"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main() {\n val (numMax, min, max) = readLine()!!.split(\" \").map(String::toInt)\n var sum = 0\n\n for (i in 0..9) {\n for (j in 0..9) {\n var tmp = i + 10*j\n if(numMax >= 100){\n for(k in 1..9) {\n tmp = i + 10*j + 100*k\n if(numMax > 1000) {\n for(l in 1..9) {\n tmp = i + 10*j + 100*k + 1000*l\n if((i+j+k+l) in min..max && tmp <= numMax) {\n sum += tmp\n }\n }\n }else if((i+j+k) in min..max && tmp <= numMax) {\n sum += tmp\n }\n }\n }else if(i + j in min..max && tmp <= numMax) {\n sum += tmp\n }\n }\n }\n println(sum)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 880, "cpu_time_ms": 107, "memory_kb": 36220}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s270998792", "group_id": "codeNet:p03478", "input_text": "fun main(args: Array) = yorukatsu9a()\n\nfun yorukatsu9a() {\n val (n, a, b) = readLine()!!.split(' ').map { it.toInt() }\n\n var answer = 0\n\n for (i in 1..n) {\n val digitSum = i.toString().map { Character.getNumericValue(it) }.sum()\n if (digitSum in a..b) answer += i\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1586308451, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s270998792.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s270998792", "user_id": "u139478771"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main(args: Array) = yorukatsu9a()\n\nfun yorukatsu9a() {\n val (n, a, b) = readLine()!!.split(' ').map { it.toInt() }\n\n var answer = 0\n\n for (i in 1..n) {\n val digitSum = i.toString().map { Character.getNumericValue(it) }.sum()\n if (digitSum in a..b) answer += i\n }\n\n println(answer)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 324, "cpu_time_ms": 329, "memory_kb": 41188}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s843749154", "group_id": "codeNet:p03478", "input_text": "fun main(args: Array) {\n val (n, a, b) = readLine()!!.split(\" \").map(String::toInt)\n val sum =\n (1..n).filter { digitSum(it) in a..b }.sum()\n println(sum)\n}\n\nfun digitSum(n: Int): Int = n.toString().split(\"\").filter(String::isNotEmpty).map(String::toInt).sum()\n", "language": "Kotlin", "metadata": {"date": 1582696706, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s843749154.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s843749154", "user_id": "u861119357"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, a, b) = readLine()!!.split(\" \").map(String::toInt)\n val sum =\n (1..n).filter { digitSum(it) in a..b }.sum()\n println(sum)\n}\n\nfun digitSum(n: Int): Int = n.toString().split(\"\").filter(String::isNotEmpty).map(String::toInt).sum()\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 285, "cpu_time_ms": 535, "memory_kb": 42304}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s909086156", "group_id": "codeNet:p03478", "input_text": " fun main(args: Array) {\n val input = read()\n println(someSums(input))\n }\n\n data class Inputs(val max: Int, val lower: Int, val higher: Int)\n\n fun read(): Inputs {\n val args = readLine()!!.split(' ').map { Integer.parseInt(it) }\n return Inputs(args[0], args[1], args[2])\n }\n\n fun someSums(inputs: Inputs): Int {\n val judge = { value: Int ->\n val sum = value.toString().sumBy { Integer.parseInt(it.toString()) }\n (inputs.lower <= sum && sum <= inputs.higher)\n }\n\n return (0..inputs.max).filter(judge).sum()\n }", "language": "Kotlin", "metadata": {"date": 1577598769, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s909086156.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s909086156", "user_id": "u393158689"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": " fun main(args: Array) {\n val input = read()\n println(someSums(input))\n }\n\n data class Inputs(val max: Int, val lower: Int, val higher: Int)\n\n fun read(): Inputs {\n val args = readLine()!!.split(' ').map { Integer.parseInt(it) }\n return Inputs(args[0], args[1], args[2])\n }\n\n fun someSums(inputs: Inputs): Int {\n val judge = { value: Int ->\n val sum = value.toString().sumBy { Integer.parseInt(it.toString()) }\n (inputs.lower <= sum && sum <= inputs.higher)\n }\n\n return (0..inputs.max).filter(judge).sum()\n }", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 608, "cpu_time_ms": 324, "memory_kb": 39108}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s596139314", "group_id": "codeNet:p03478", "input_text": "fun main(args: Array) {\n val (N, A, B) = readLine()!!.split(\" \").map(String::toInt)\n var sum = 0\n for (i in 1..N) {\n val c = i.toString().toCharArray().sumBy { it.toString().toInt() }\n if (c in A..B) {\n sum += i\n }\n }\n println(sum)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1566961129, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s596139314.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s596139314", "user_id": "u085288971"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, A, B) = readLine()!!.split(\" \").map(String::toInt)\n var sum = 0\n for (i in 1..N) {\n val c = i.toString().toCharArray().sumBy { it.toString().toInt() }\n if (c in A..B) {\n sum += i\n }\n }\n println(sum)\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 290, "cpu_time_ms": 301, "memory_kb": 40688}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s851500206", "group_id": "codeNet:p03478", "input_text": "fun main(args: Array){\n val (n, a, b) = readLine()!!.split(' ').map(String::toInt)\n print((1..n).filter {i -> calc(i) in a..b}.sum())\n}\n\nfun calc(a : Int): Int{\n var i = a\n var ret = 0\n while(i != 0){\n ret += i % 10\n i /= 10\n }\n return ret\n}", "language": "Kotlin", "metadata": {"date": 1562301777, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s851500206.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s851500206", "user_id": "u526818046"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main(args: Array){\n val (n, a, b) = readLine()!!.split(' ').map(String::toInt)\n print((1..n).filter {i -> calc(i) in a..b}.sum())\n}\n\nfun calc(a : Int): Int{\n var i = a\n var ret = 0\n while(i != 0){\n ret += i % 10\n i /= 10\n }\n return ret\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 284, "cpu_time_ms": 268, "memory_kb": 38380}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s638159078", "group_id": "codeNet:p03478", "input_text": "fun main(args: Array){\n val (n, a, b) = readLine()!!.split(' ').map(String::toInt)\n print((1..n).filter {i -> i.toString().map { c -> c.toInt() - 48}.sum() in a..b}.sum())\n}", "language": "Kotlin", "metadata": {"date": 1562301538, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s638159078.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s638159078", "user_id": "u526818046"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main(args: Array){\n val (n, a, b) = readLine()!!.split(' ').map(String::toInt)\n print((1..n).filter {i -> i.toString().map { c -> c.toInt() - 48}.sum() in a..b}.sum())\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 312, "memory_kb": 39100}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s775684747", "group_id": "codeNet:p03478", "input_text": "fun main(args: Array) {\n val (n, a, b) = readLine()!!.split(\" \").map(String::toInt)\n val ans = (1..n).filter { it.toString().map { it - '0' }.sum() in a..b }\n .sum()\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1559614677, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s775684747.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s775684747", "user_id": "u911700901"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, a, b) = readLine()!!.split(\" \").map(String::toInt)\n val ans = (1..n).filter { it.toString().map { it - '0' }.sum() in a..b }\n .sum()\n println(ans)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 197, "cpu_time_ms": 324, "memory_kb": 39180}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s219806067", "group_id": "codeNet:p03478", "input_text": "fun main (args: Array) {\n\tval (num1, num2, num3) = readLine()!!.split(\" \").map(String::toInt)\n\t\n\tvar num : Int\n\tvar calc : Int\n\tvar result : Int = 0\n\tvar total : Int = 0\n\t\n\tfor (i in 1..num1) {\n\t\tnum = i\n\t\t\n\t\twhile (num > 0) {\n\t\t\tcalc = num % 10\n\t\t\tresult += calc\n\t\t\tnum = num / 10\n\t\t\t\n\t\t}\n\t\t\n\t\tif (result >= num2 && result <= num3) {\n\t\t\ttotal += i\n\t\t\t\n\t\t}\n\t\tresult = 0\n\t\t\n\t}\n\t\n\tprintln(\"${total}\")\n\t\n}", "language": "Kotlin", "metadata": {"date": 1559522313, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s219806067.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s219806067", "user_id": "u651257341"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main (args: Array) {\n\tval (num1, num2, num3) = readLine()!!.split(\" \").map(String::toInt)\n\t\n\tvar num : Int\n\tvar calc : Int\n\tvar result : Int = 0\n\tvar total : Int = 0\n\t\n\tfor (i in 1..num1) {\n\t\tnum = i\n\t\t\n\t\twhile (num > 0) {\n\t\t\tcalc = num % 10\n\t\t\tresult += calc\n\t\t\tnum = num / 10\n\t\t\t\n\t\t}\n\t\t\n\t\tif (result >= num2 && result <= num3) {\n\t\t\ttotal += i\n\t\t\t\n\t\t}\n\t\tresult = 0\n\t\t\n\t}\n\t\n\tprintln(\"${total}\")\n\t\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 410, "cpu_time_ms": 243, "memory_kb": 37936}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s488063141", "group_id": "codeNet:p03478", "input_text": "fun main(args: Array) {\n var (N,a,b) = readLine()!!.split(\" \").map(String::toInt)\n var ans = 0\n (1..N).map{ idx->\n idx.toString().map{\n it.toString().toInt()\n }.sum().let{\n when{\n a<=it && it<=b -> idx\n else -> 0\n }\n }\n }.sum().let{\n print(it)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1553532560, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s488063141.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488063141", "user_id": "u399261731"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main(args: Array) {\n var (N,a,b) = readLine()!!.split(\" \").map(String::toInt)\n var ans = 0\n (1..N).map{ idx->\n idx.toString().map{\n it.toString().toInt()\n }.sum().let{\n when{\n a<=it && it<=b -> idx\n else -> 0\n }\n }\n }.sum().let{\n print(it)\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 387, "cpu_time_ms": 348, "memory_kb": 41352}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s458639830", "group_id": "codeNet:p03478", "input_text": "fun main(args: Array) {\n\n var (n, a, b) = readLine()!!.split(\" \").map { it.toInt() }\n\n var cnt = 0\n for (i in 1..n) {\n val sum = digitSum(i)\n if (sum in a..b) cnt += i\n }\n print(cnt)\n}\n\nfun digitSum(num: Int): Int{\n var sum = 0\n sum += num%10\n sum += num/10%10\n sum += num/100%10\n sum += num/1000%10\n sum += num/10000%10\n\n\n return sum\n}", "language": "Kotlin", "metadata": {"date": 1549130873, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s458639830.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s458639830", "user_id": "u889750959"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main(args: Array) {\n\n var (n, a, b) = readLine()!!.split(\" \").map { it.toInt() }\n\n var cnt = 0\n for (i in 1..n) {\n val sum = digitSum(i)\n if (sum in a..b) cnt += i\n }\n print(cnt)\n}\n\nfun digitSum(num: Int): Int{\n var sum = 0\n sum += num%10\n sum += num/10%10\n sum += num/100%10\n sum += num/1000%10\n sum += num/10000%10\n\n\n return sum\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 394, "cpu_time_ms": 253, "memory_kb": 37820}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s375538826", "group_id": "codeNet:p03478", "input_text": "fun main(args: Array) {\n val (x, y, z) = readLine()!!.split(\" \").map { it.toInt() }\n var a = 0\n var s = mutableListOf()\n var t = \"\"\n for (i in 0..x) {\n t = i.toString()\n s = mutableListOf()\n while(t.count() > 0){\n s.add(t[0].toInt() - 48)\n t = t.substring(1 until t.count())\n }\n if(s.sum() in (y..z)){\n a += i\n }\n }\n println(a)\n}", "language": "Kotlin", "metadata": {"date": 1545180829, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s375538826.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s375538826", "user_id": "u227189389"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main(args: Array) {\n val (x, y, z) = readLine()!!.split(\" \").map { it.toInt() }\n var a = 0\n var s = mutableListOf()\n var t = \"\"\n for (i in 0..x) {\n t = i.toString()\n s = mutableListOf()\n while(t.count() > 0){\n s.add(t[0].toInt() - 48)\n t = t.substring(1 until t.count())\n }\n if(s.sum() in (y..z)){\n a += i\n }\n }\n println(a)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 443, "cpu_time_ms": 361, "memory_kb": 40368}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s108829011", "group_id": "codeNet:p03478", "input_text": "fun main(args: Array) {\n val (n,a,b)= readLine()!!.split(\" \").map{ it.toInt() }\n (1..n).filter{\n (it.toString().toList().map{it.toString().toInt()}.sum() ) in a..b\n }.sum().let { println(it) }\n}", "language": "Kotlin", "metadata": {"date": 1541727325, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s108829011.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s108829011", "user_id": "u914096045"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main(args: Array) {\n val (n,a,b)= readLine()!!.split(\" \").map{ it.toInt() }\n (1..n).filter{\n (it.toString().toList().map{it.toString().toInt()}.sum() ) in a..b\n }.sum().let { println(it) }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 218, "cpu_time_ms": 376, "memory_kb": 41132}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s601484126", "group_id": "codeNet:p03478", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val cin = Scanner(System.`in`)\n val N = cin.nextInt()\n val A = cin.nextInt()\n val B = cin.nextInt()\n\n val ans = (1..N).map {\n var sum = 0\n var tmp = it\n while (tmp > 0) {\n sum += (tmp % 10)\n tmp /= 10\n }\n if (A <= sum && sum <= B) it else 0\n }.sum()\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1528082218, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s601484126.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s601484126", "user_id": "u185034753"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val cin = Scanner(System.`in`)\n val N = cin.nextInt()\n val A = cin.nextInt()\n val B = cin.nextInt()\n\n val ans = (1..N).map {\n var sum = 0\n var tmp = it\n while (tmp > 0) {\n sum += (tmp % 10)\n tmp /= 10\n }\n if (A <= sum && sum <= B) it else 0\n }.sum()\n println(ans)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 396, "cpu_time_ms": 365, "memory_kb": 31524}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s242627111", "group_id": "codeNet:p03478", "input_text": "fun main(args: Array) {\n val (N, A, B) = readLine()!!.split(\" \").map { it.toInt() }\n var sum = 0\n for (i in 1..N) {\n var t = 0\n for (c in i.toString()) {\n t += c.toString().toInt()\n }\n if (t >= A && t <= B) sum += t\n }\n println(sum)\n}\n", "language": "Kotlin", "metadata": {"date": 1518487128, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03478.html", "problem_id": "p03478", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03478/input.txt", "sample_output_relpath": "derived/input_output/data/p03478/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03478/Kotlin/s242627111.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s242627111", "user_id": "u668726177"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "fun main(args: Array) {\n val (N, A, B) = readLine()!!.split(\" \").map { it.toInt() }\n var sum = 0\n for (i in 1..N) {\n var t = 0\n for (c in i.toString()) {\n t += c.toString().toInt()\n }\n if (t >= A && t <= B) sum += t\n }\n println(sum)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "sample_input": "20 2 5\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03478", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A \\leq B \\leq 36\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).\n\nSample Input 1\n\n20 2 5\n\nSample Output 1\n\n84\n\nAmong the integers not greater than 20, the ones whose sums of digits are between 2 and 5, are: 2,3,4,5,11,12,13,14 and 20. We should print the sum of these, 84.\n\nSample Input 2\n\n10 1 2\n\nSample Output 2\n\n13\n\nSample Input 3\n\n100 4 16\n\nSample Output 3\n\n4554", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 297, "cpu_time_ms": 297, "memory_kb": 40492}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s800825918", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array) {\n val s = readLine()!!\n var num = 0\n when(true) {\n s[0] == '1' -> {\n num += 1\n }\n }\n when(true) {\n s[1] == '1' -> {\n num += 1\n }\n }\n when(true) {\n s[2] == '1' -> {\n num += 1\n }\n }\n println(num)\n}", "language": "Kotlin", "metadata": {"date": 1592155995, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s800825918.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s800825918", "user_id": "u979282295"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!\n var num = 0\n when(true) {\n s[0] == '1' -> {\n num += 1\n }\n }\n when(true) {\n s[1] == '1' -> {\n num += 1\n }\n }\n when(true) {\n s[2] == '1' -> {\n num += 1\n }\n }\n println(num)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 328, "cpu_time_ms": 198, "memory_kb": 31480}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s346452677", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array) {\n val s = readLine()!!\n var num = 0\n if(s[0] == '1') {\n num += 1\n }\n if(s[1] == '1') {\n num += 1\n }\n if(s[2] == '1') {\n num += 1\n }\n print(num)\n}", "language": "Kotlin", "metadata": {"date": 1591560514, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s346452677.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s346452677", "user_id": "u979282295"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!\n var num = 0\n if(s[0] == '1') {\n num += 1\n }\n if(s[1] == '1') {\n num += 1\n }\n if(s[2] == '1') {\n num += 1\n }\n print(num)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 224, "cpu_time_ms": 198, "memory_kb": 31724}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s291983041", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array){\n println(readLine()!!.count({it=='1'}))\n}", "language": "Kotlin", "metadata": {"date": 1584968198, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s291983041.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s291983041", "user_id": "u661977789"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array){\n println(readLine()!!.count({it=='1'}))\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 73, "cpu_time_ms": 211, "memory_kb": 31812}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s814429610", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array) {\n println(readLine()!!.count { c -> c == '1' })\n}", "language": "Kotlin", "metadata": {"date": 1582609438, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s814429610.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s814429610", "user_id": "u861119357"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n println(readLine()!!.count { c -> c == '1' })\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 83, "cpu_time_ms": 226, "memory_kb": 33636}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s338385030", "group_id": "codeNet:p03493", "input_text": "fun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\n\nfun main(args: Array) {\n val s = readString()\n val res = s.count { it == '1' }\n println(res)\n}", "language": "Kotlin", "metadata": {"date": 1574573834, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s338385030.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s338385030", "user_id": "u657541767"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)\nfun readLongList() = readLine()!!.split(\" \").map(String::toLong)\n\nfun main(args: Array) {\n val s = readString()\n val res = s.count { it == '1' }\n println(res)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 348, "cpu_time_ms": 218, "memory_kb": 33716}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s836060223", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array) {\n abc081a()\n}\n\nfun abc081a() {\n val s = readLine()!!\n\n val answer = s.count { it == '1' }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1571122621, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s836060223.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s836060223", "user_id": "u139478771"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n abc081a()\n}\n\nfun abc081a() {\n val s = readLine()!!\n\n val answer = s.count { it == '1' }\n\n println(answer)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 153, "cpu_time_ms": 203, "memory_kb": 33708}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s141423541", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array) {\n println(readLine()!!.toList().count { it == '1' })\n}\n", "language": "Kotlin", "metadata": {"date": 1570469970, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s141423541.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s141423541", "user_id": "u979004569"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n println(readLine()!!.toList().count { it == '1' })\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 87, "cpu_time_ms": 206, "memory_kb": 35884}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s399611943", "group_id": "codeNet:p03493", "input_text": "import java.io.*\nimport java.util.*\n\nvar pw = PrintWriter(System.out)\nfun solve(s: String){\n pw.println(s.count{ it == '1' })\n pw.flush()\n return\n}\n\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n solve(sc.next())\n}\n\n", "language": "Kotlin", "metadata": {"date": 1564964332, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s399611943.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s399611943", "user_id": "u329232967"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.*\nimport java.util.*\n\nvar pw = PrintWriter(System.out)\nfun solve(s: String){\n pw.println(s.count{ it == '1' })\n pw.flush()\n return\n}\n\n\nfun main(args: Array) {\n fun StringArray(size: Int, init: (Int) -> String = { \"\\u0000\" }): Array {\n return Array(size, init)\n }\n class Scanner(stream: InputStream) {\n private val reader = BufferedInputStream(stream).bufferedReader()\n private var st: StringTokenizer? = null\n fun next(): String {\n while (!(st?.hasMoreTokens() ?: false)) st = StringTokenizer(reader.readLine())\n return st!!.nextToken()\n }\n }\n val sc = Scanner(System.`in`)\n solve(sc.next())\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 718, "cpu_time_ms": 208, "memory_kb": 31388}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s162194487", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array) {\n println(readLine()!!.count { it == '1' })\n}", "language": "Kotlin", "metadata": {"date": 1559614291, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s162194487.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s162194487", "user_id": "u911700901"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n println(readLine()!!.count { it == '1' })\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 77, "cpu_time_ms": 207, "memory_kb": 33608}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s237435349", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array) {\n val inputs = readLine()!!.map(Character::getNumericValue)\n print(inputs.sum())\n}", "language": "Kotlin", "metadata": {"date": 1558669478, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s237435349.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s237435349", "user_id": "u529787332"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val inputs = readLine()!!.map(Character::getNumericValue)\n print(inputs.sum())\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 119, "cpu_time_ms": 209, "memory_kb": 33576}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s143171934", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array){\n println(readLine()!!.count{ it == '1'})\n}", "language": "Kotlin", "metadata": {"date": 1557201297, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s143171934.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s143171934", "user_id": "u024824950"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array){\n println(readLine()!!.count{ it == '1'})\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 76, "cpu_time_ms": 205, "memory_kb": 33660}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s362842219", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array) {\n\tval s = readLine()!!;\n\tvar x = 0;\n\tfor (e in s) {\n\t\tif (e == '1') {x += 1}\n\t}\n\tprint(x);\n}\n\n", "language": "Kotlin", "metadata": {"date": 1542657111, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s362842219.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s362842219", "user_id": "u330133819"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n\tval s = readLine()!!;\n\tvar x = 0;\n\tfor (e in s) {\n\t\tif (e == '1') {x += 1}\n\t}\n\tprint(x);\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 125, "cpu_time_ms": 215, "memory_kb": 31864}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s411353812", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array) {\n a81(readLineList())\n}\n\nfun readLineList(): Array {\n val lineList = mutableListOf()\n while (true) {\n val line = readLine()\n if (line.isNullOrBlank()) {\n break\n } else {\n lineList.add(line!!)\n }\n }\n return lineList.toTypedArray()\n}\n\nfun a81(args: Array) {\n if (args.size != 1) {\n throw IllegalArgumentException()\n }\n println(args[0].count { it == '1' })\n}", "language": "Kotlin", "metadata": {"date": 1540508011, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s411353812.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s411353812", "user_id": "u227166381"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n a81(readLineList())\n}\n\nfun readLineList(): Array {\n val lineList = mutableListOf()\n while (true) {\n val line = readLine()\n if (line.isNullOrBlank()) {\n break\n } else {\n lineList.add(line!!)\n }\n }\n return lineList.toTypedArray()\n}\n\nfun a81(args: Array) {\n if (args.size != 1) {\n throw IllegalArgumentException()\n }\n println(args[0].count { it == '1' })\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 491, "cpu_time_ms": 209, "memory_kb": 33692}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s690137880", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array) {\n println(readLine()!!.count{ it == '1'})\n\n}", "language": "Kotlin", "metadata": {"date": 1521651166, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s690137880.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s690137880", "user_id": "u735906430"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n println(readLine()!!.count{ it == '1'})\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 78, "cpu_time_ms": 203, "memory_kb": 31864}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s517214723", "group_id": "codeNet:p03493", "input_text": "fun main(args: Array) {\n val s = readLine()!!\n var cnt = 0\n for (c in s) {\n if (c == '1') cnt++\n }\n println(cnt)\n}\n", "language": "Kotlin", "metadata": {"date": 1518500889, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s517214723.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s517214723", "user_id": "u668726177"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!\n var cnt = 0\n for (c in s) {\n if (c == '1') cnt++\n }\n println(cnt)\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 145, "cpu_time_ms": 204, "memory_kb": 33652}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s896145650", "group_id": "codeNet:p03493", "input_text": "import java.io.BufferedReader\nimport java.io.InputStreamReader\n\nfun main(args: Array) {\n val br = BufferedReader(InputStreamReader(System.`in`))\n val s = br.readLine()\n println(s.count { it == '1' })\n}\n\nfun err(print: Any) {\n System.err.println(print)\n}", "language": "Kotlin", "metadata": {"date": 1512957676, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03493.html", "problem_id": "p03493", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03493/input.txt", "sample_output_relpath": "derived/input_output/data/p03493/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03493/Kotlin/s896145650.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s896145650", "user_id": "u166163326"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStreamReader\n\nfun main(args: Array) {\n val br = BufferedReader(InputStreamReader(System.`in`))\n val s = br.readLine()\n println(s.count { it == '1' })\n}\n\nfun err(print: Any) {\n System.err.println(print)\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "sample_input": "101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03493", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a grid consisting of three squares numbered 1, 2 and 3.\nIn each square, either 0 or 1 is written. The number written in Square i is s_i.\n\nSnuke will place a marble on each square that says 1.\nFind the number of squares on which Snuke will place a marble.\n\nConstraints\n\nEach of s_1, s_2 and s_3 is either 1 or 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_{1}s_{2}s_{3}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n101\n\nSample Output 1\n\n2\n\nA marble will be placed on Square 1 and 3.\n\nSample Input 2\n\n000\n\nSample Output 2\n\n0\n\nNo marble will be placed on any square.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 273, "cpu_time_ms": 248, "memory_kb": 31392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s201451679", "group_id": "codeNet:p03565", "input_text": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun Iterable.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\nfun main() {\n val S = next()\n val T = next()\n for (i in S.length - T.length downTo 0) {\n val sub = S.substring(i, i + T.length)\n if (match(sub, T)) {\n val ans = S.replaceRange(i, i + T.length, T).replace(\"?\", \"a\")\n println(ans)\n return\n }\n }\n println(\"UNRESTORABLE\")\n}\n\nfun match(S: String, T: String): Boolean {\n for (i in S.indices) {\n if (S[i] != '?' && S[i] != T[i]) return false\n }\n return true\n}", "language": "Kotlin", "metadata": {"date": 1591472761, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Kotlin/s201451679.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s201451679", "user_id": "u860789370"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun Iterable.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\nfun main() {\n val S = next()\n val T = next()\n for (i in S.length - T.length downTo 0) {\n val sub = S.substring(i, i + T.length)\n if (match(sub, T)) {\n val ans = S.replaceRange(i, i + T.length, T).replace(\"?\", \"a\")\n println(ans)\n return\n }\n }\n println(\"UNRESTORABLE\")\n}\n\nfun match(S: String, T: String): Boolean {\n for (i in S.indices) {\n if (S[i] != '?' && S[i] != T[i]) return false\n }\n return true\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT'\n\nOutput\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT'\n\nOutput\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1164, "cpu_time_ms": 236, "memory_kb": 37952}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s341327424", "group_id": "codeNet:p03565", "input_text": "fun main(args: Array) {\n var sResult = \"\"\n val sDash = readLine().orEmpty()\n val sLength = sDash.length\n val tStr = readLine().orEmpty()\n val tLength = tStr.length\n var foundId = 0\n var judge = \"UNRESTORABLE\"\n\n run loop@{\n for(i in 0 .. sLength - tLength){\n val sSub = sDash.substring(i ,i + tLength)\n var sJudge = \"\"\n sSub.forEach {\n if(it == '?'){\n sJudge += \"[a-z]\"\n }else{\n sJudge += it\n }\n }\n val sReg = Regex(sJudge)\n val tmp = sReg.matchEntire(tStr)\n\n if(tmp != null){\n foundId = i\n judge = \"\"\n return@loop\n }\n\n }\n }\n\n if(judge == \"UNRESTORABLE\"){\n println(judge)\n }else{\n val sRepl = sDash.substring(foundId, foundId + tLength)\n sResult = sDash.replace(sRepl,tStr)\n sResult = sResult.replace(\"?\",\"a\")\n println(sResult)\n }\n\n\n\n}", "language": "Kotlin", "metadata": {"date": 1585334149, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Kotlin/s341327424.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s341327424", "user_id": "u430710262"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "fun main(args: Array) {\n var sResult = \"\"\n val sDash = readLine().orEmpty()\n val sLength = sDash.length\n val tStr = readLine().orEmpty()\n val tLength = tStr.length\n var foundId = 0\n var judge = \"UNRESTORABLE\"\n\n run loop@{\n for(i in 0 .. sLength - tLength){\n val sSub = sDash.substring(i ,i + tLength)\n var sJudge = \"\"\n sSub.forEach {\n if(it == '?'){\n sJudge += \"[a-z]\"\n }else{\n sJudge += it\n }\n }\n val sReg = Regex(sJudge)\n val tmp = sReg.matchEntire(tStr)\n\n if(tmp != null){\n foundId = i\n judge = \"\"\n return@loop\n }\n\n }\n }\n\n if(judge == \"UNRESTORABLE\"){\n println(judge)\n }else{\n val sRepl = sDash.substring(foundId, foundId + tLength)\n sResult = sDash.replace(sRepl,tStr)\n sResult = sResult.replace(\"?\",\"a\")\n println(sResult)\n }\n\n\n\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT'\n\nOutput\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT'\n\nOutput\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1043, "cpu_time_ms": 271, "memory_kb": 36348}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s799052819", "group_id": "codeNet:p03565", "input_text": "fun main(args: Array) {\n val s = readLine()!!\n val t = readLine()!!\n\n (0..s.length - t.length)\n .filter { i -> (t.indices).all { j -> s[i + j] == t[j] || s[i + j] == '?' } }\n .map { s.slice(0 until it) + t + s.slice(it + t.length until s.length) }\n .map { it.replace('?', 'a') }\n .min()\n .let { println(it ?: \"UNRESTORABLE\") }\n}\n", "language": "Kotlin", "metadata": {"date": 1579815435, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Kotlin/s799052819.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s799052819", "user_id": "u863309603"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!\n val t = readLine()!!\n\n (0..s.length - t.length)\n .filter { i -> (t.indices).all { j -> s[i + j] == t[j] || s[i + j] == '?' } }\n .map { s.slice(0 until it) + t + s.slice(it + t.length until s.length) }\n .map { it.replace('?', 'a') }\n .min()\n .let { println(it ?: \"UNRESTORABLE\") }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT'\n\nOutput\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT'\n\nOutput\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 401, "cpu_time_ms": 216, "memory_kb": 33656}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s290455169", "group_id": "codeNet:p03565", "input_text": "fun main(args: Array) {\n val s = readInputLine()\n val t = readInputLine()\n \n var ans = \"UNRESTORABLE\"\n \n for (i in 0..s.length - t.length) {\n var ok = true\n for (j in 0 until t.length) {\n if (s.get(i + j) == '?') {\n continue\n }\n if (s.get(i + j) != t.get(j)) {\n ok = false\n break\n }\n }\n \n if (ok) {\n ans = s.replaceRange(i, i + t.length, t).replace('?', 'a')\n break\n }\n }\n \n println(ans)\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "language": "Kotlin", "metadata": {"date": 1563080662, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Kotlin/s290455169.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s290455169", "user_id": "u505558493"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readInputLine()\n val t = readInputLine()\n \n var ans = \"UNRESTORABLE\"\n \n for (i in 0..s.length - t.length) {\n var ok = true\n for (j in 0 until t.length) {\n if (s.get(i + j) == '?') {\n continue\n }\n if (s.get(i + j) != t.get(j)) {\n ok = false\n break\n }\n }\n \n if (ok) {\n ans = s.replaceRange(i, i + t.length, t).replace('?', 'a')\n break\n }\n }\n \n println(ans)\n}\n\nfun readInputLine(): String {\n return readLine()!!\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT'\n\nOutput\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT'\n\nOutput\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 635, "cpu_time_ms": 209, "memory_kb": 33532}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s057237447", "group_id": "codeNet:p03565", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.util.StringTokenizer\n\nfun main(args: Array) {\n val sc = FastScanner(System.`in`)\n\n val s = sc.next()\n val t = sc.next()\n\n\n var best = \"\"\n for (i in 0..s.length - t.length) {\n if (test(i, s, t)) {\n val res = construct(i, s, t)\n if (best == \"\" || best > res) best = res\n }\n }\n println(if (best == \"\") \"UNRESTORABLE\" else best)\n\n}\n\nfun construct(i: Int, s: String, t: String): String {\n val sb = StringBuilder()\n for (j in 0 until i) {\n if (s[j] == '?') sb.append('a')\n else sb.append(s[j])\n }\n\n for (j in 0 until t.length) {\n sb.append(t[j])\n }\n for (j in i + t.length until s.length) {\n if (s[j] == '?') sb.append('a')\n else sb.append(s[j])\n }\n return sb.toString()\n}\n\nfun test(i: Int, s: String, t: String): Boolean {\n if (i + t.length > s.length) return false\n for (j in 0 until t.length) {\n if (s[i + j] != '?' && s[i + j] != t[j]) return false\n }\n return true\n}\n\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n\n\n", "language": "Kotlin", "metadata": {"date": 1509691594, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03565.html", "problem_id": "p03565", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03565/input.txt", "sample_output_relpath": "derived/input_output/data/p03565/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03565/Kotlin/s057237447.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s057237447", "user_id": "u178770699"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.util.StringTokenizer\n\nfun main(args: Array) {\n val sc = FastScanner(System.`in`)\n\n val s = sc.next()\n val t = sc.next()\n\n\n var best = \"\"\n for (i in 0..s.length - t.length) {\n if (test(i, s, t)) {\n val res = construct(i, s, t)\n if (best == \"\" || best > res) best = res\n }\n }\n println(if (best == \"\") \"UNRESTORABLE\" else best)\n\n}\n\nfun construct(i: Int, s: String, t: String): String {\n val sb = StringBuilder()\n for (j in 0 until i) {\n if (s[j] == '?') sb.append('a')\n else sb.append(s[j])\n }\n\n for (j in 0 until t.length) {\n sb.append(t[j])\n }\n for (j in i + t.length until s.length) {\n if (s[j] == '?') sb.append('a')\n else sb.append(s[j])\n }\n return sb.toString()\n}\n\nfun test(i: Int, s: String, t: String): Boolean {\n if (i + t.length > s.length) return false\n for (j in 0 until t.length) {\n if (s[i + j] != '?' && s[i + j] != t[j]) return false\n }\n return true\n}\n\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT'\n\nOutput\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "sample_input": "?tc????\ncoder\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p03565", "source_text": "Score : 300 points\n\nProblem Statement\n\nE869120 found a chest which is likely to contain treasure.\n\nHowever, the chest is locked. In order to open it, he needs to enter a string S consisting of lowercase English letters.\n\nHe also found a string S', which turns out to be the string S with some of its letters (possibly all or none) replaced with ?.\n\nOne more thing he found is a sheet of paper with the following facts written on it:\n\nCondition 1: The string S contains a string T as a contiguous substring.\n\nCondition 2: S is the lexicographically smallest string among the ones that satisfy Condition 1.\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE.\n\nConstraints\n\n1 \\leq |S'|, |T| \\leq 50\n\nS' consists of lowercase English letters and ?.\n\nT consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT'\n\nOutput\n\nPrint the string S.\n\nIf such a string does not exist, print UNRESTORABLE instead.\n\nSample Input 1\n\n?tc????\ncoder\n\nSample Output 1\n\natcoder\n\nThere are 26 strings that satisfy Condition 1: atcoder, btcoder, ctcoder,..., ztcoder.\nAmong them, the lexicographically smallest is atcoder, so we can say S = atcoder.\n\nSample Input 2\n\n??p??d??\nabc\n\nSample Output 2\n\nUNRESTORABLE\n\nThere is no string that satisfies Condition 1, so the string S does not exist.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1564, "cpu_time_ms": 170, "memory_kb": 29352}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s093232691", "group_id": "codeNet:p03574", "input_text": "fun main(args: Array) {\n var (h, w) = readIntList()\n val s = List(h) { readString() }\n\n val ans = List(h) { MutableList(w) { 0 } }\n\n for (i in 0 until h) {\n for (j in 0 until w) {\n for (x in -1..1) {\n for (y in -1..1) {\n val di = i + x\n val dj = j + y\n if (di < 0 || di >= h) continue\n if (dj < 0 || dj >= w) continue\n if (s[di][dj] == '#') {\n ans[i][j]++\n }\n }\n }\n }\n }\n\n for (i in 0 until h) {\n for (j in 0 until w) {\n if (s[i][j] == '#') {\n print('#')\n } else {\n print(ans[i][j])\n }\n }\n println()\n }\n}\n\n// Tools\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)", "language": "Kotlin", "metadata": {"date": 1595707960, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Kotlin/s093232691.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s093232691", "user_id": "u697467902"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "fun main(args: Array) {\n var (h, w) = readIntList()\n val s = List(h) { readString() }\n\n val ans = List(h) { MutableList(w) { 0 } }\n\n for (i in 0 until h) {\n for (j in 0 until w) {\n for (x in -1..1) {\n for (y in -1..1) {\n val di = i + x\n val dj = j + y\n if (di < 0 || di >= h) continue\n if (dj < 0 || dj >= w) continue\n if (s[di][dj] == '#') {\n ans[i][j]++\n }\n }\n }\n }\n }\n\n for (i in 0 until h) {\n for (j in 0 until w) {\n if (s[i][j] == '#') {\n print('#')\n } else {\n print(ans[i][j])\n }\n }\n println()\n }\n}\n\n// Tools\nfun readString() = readLine()!!\nfun readInt() = readLine()!!.toInt()\nfun readLong() = readLine()!!.toLong()\nfun readStringList() = readLine()!!.split(\" \")\nfun readIntList() = readLine()!!.split(\" \").map(String::toInt)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1048, "cpu_time_ms": 151, "memory_kb": 38320}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s278540912", "group_id": "codeNet:p03574", "input_text": "import java.lang.NumberFormatException\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val h = sc.nextInt()\n val w = sc.nextInt()\n val s = (0 until h).map { sc.next().toCharArray() }\n println(problem075b(h, w, s))\n}\n\nfun problem075b(h: Int, w: Int, s: List): String {\n val ans = Array(h) { Array(w) { \"0\" } }\n for (i in 0 until h) {\n for (j in 0 until w) {\n if (s[i][j] != '#') {\n continue\n }\n ans[i][j] = \"#\"\n try {\n if (i != 0) ans[i - 1][j] = (ans[i - 1][j].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (j != 0) ans[i][j - 1] = (ans[i][j - 1].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (i != 0 && j != 0) ans[i - 1][j - 1] = (ans[i - 1][j - 1].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (i != h - 1) ans[i + 1][j] = (ans[i + 1][j].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (j != w - 1) ans[i][j + 1] = (ans[i][j + 1].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (i != h - 1 && j != w - 1) ans[i + 1][j + 1] = (ans[i + 1][j + 1].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (i != 0 && j != w - 1) ans[i - 1][j + 1] = (ans[i - 1][j + 1].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (i != h - 1 && j != 0) ans[i + 1][j - 1] = (ans[i + 1][j - 1].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n }\n }\n return ans.map { it.joinToString(\"\") }.joinToString(\"\\n\")\n}", "language": "Kotlin", "metadata": {"date": 1590544070, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Kotlin/s278540912.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s278540912", "user_id": "u073232808"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "import java.lang.NumberFormatException\nimport java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val h = sc.nextInt()\n val w = sc.nextInt()\n val s = (0 until h).map { sc.next().toCharArray() }\n println(problem075b(h, w, s))\n}\n\nfun problem075b(h: Int, w: Int, s: List): String {\n val ans = Array(h) { Array(w) { \"0\" } }\n for (i in 0 until h) {\n for (j in 0 until w) {\n if (s[i][j] != '#') {\n continue\n }\n ans[i][j] = \"#\"\n try {\n if (i != 0) ans[i - 1][j] = (ans[i - 1][j].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (j != 0) ans[i][j - 1] = (ans[i][j - 1].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (i != 0 && j != 0) ans[i - 1][j - 1] = (ans[i - 1][j - 1].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (i != h - 1) ans[i + 1][j] = (ans[i + 1][j].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (j != w - 1) ans[i][j + 1] = (ans[i][j + 1].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (i != h - 1 && j != w - 1) ans[i + 1][j + 1] = (ans[i + 1][j + 1].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (i != 0 && j != w - 1) ans[i - 1][j + 1] = (ans[i - 1][j + 1].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n try {\n if (i != h - 1 && j != 0) ans[i + 1][j - 1] = (ans[i + 1][j - 1].toInt() + 1).toString()\n } catch (e: NumberFormatException) {\n }\n }\n }\n return ans.map { it.joinToString(\"\") }.joinToString(\"\\n\")\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2020, "cpu_time_ms": 293, "memory_kb": 38728}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s887649747", "group_id": "codeNet:p03574", "input_text": "fun main(args: Array) = yorukatsu17b()\n\nfun yorukatsu17b() {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n val grid = (1..h).map { readLine()!!.toCharArray() }\n\n val answer = grid.mapIndexed { y, row ->\n row.mapIndexed { x, c ->\n if (c == '#') c else {\n around.map { y + it.first to x + it.second }\n .filter { it.first in 0 until h && it.second in 0 until w }\n .count { grid[it.first][it.second] == '#' }\n }\n }.joinToString(\"\")\n }.joinToString(System.lineSeparator())\n\n println(answer)\n}\n\nprivate val around = (-1..1).map { i1 -> (-1..1).map { i2 -> i1 to i2 } }.flatten().filterNot { it == 0 to 0 }\n", "language": "Kotlin", "metadata": {"date": 1587085760, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Kotlin/s887649747.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s887649747", "user_id": "u139478771"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "fun main(args: Array) = yorukatsu17b()\n\nfun yorukatsu17b() {\n val (h, w) = readLine()!!.split(' ').map { it.toInt() }\n val grid = (1..h).map { readLine()!!.toCharArray() }\n\n val answer = grid.mapIndexed { y, row ->\n row.mapIndexed { x, c ->\n if (c == '#') c else {\n around.map { y + it.first to x + it.second }\n .filter { it.first in 0 until h && it.second in 0 until w }\n .count { grid[it.first][it.second] == '#' }\n }\n }.joinToString(\"\")\n }.joinToString(System.lineSeparator())\n\n println(answer)\n}\n\nprivate val around = (-1..1).map { i1 -> (-1..1).map { i2 -> i1 to i2 } }.flatten().filterNot { it == 0 to 0 }\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 724, "cpu_time_ms": 326, "memory_kb": 38756}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s154947181", "group_id": "codeNet:p03574", "input_text": "import java.lang.StringBuilder\n\nfun main(arr:Array) {\n val (h,w) = readLine()!!.split(\" \").map { it.toInt() }\n val map = (1..h).map { readLine()!! }\n for(i in map.indices) {\n val line = StringBuilder()\n for(j in map[i].indices) {\n if(map[i][j] == '#') {\n line.append(\"#\")\n continue\n }\n var cnt = 0\n for(k in (i-1..i+1)) {\n if(k < 0 || k >= h) {\n continue\n }\n for(l in (j-1..j+1)) {\n if(l < 0 || l >= w) {\n continue\n }\n if(k == i && l == j) {\n continue\n }\n if(map[k][l] == '#') {\n cnt++\n }\n }\n }\n line.append(cnt)\n }\n println(line.toString())\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1586019770, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Kotlin/s154947181.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s154947181", "user_id": "u269969976"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "import java.lang.StringBuilder\n\nfun main(arr:Array) {\n val (h,w) = readLine()!!.split(\" \").map { it.toInt() }\n val map = (1..h).map { readLine()!! }\n for(i in map.indices) {\n val line = StringBuilder()\n for(j in map[i].indices) {\n if(map[i][j] == '#') {\n line.append(\"#\")\n continue\n }\n var cnt = 0\n for(k in (i-1..i+1)) {\n if(k < 0 || k >= h) {\n continue\n }\n for(l in (j-1..j+1)) {\n if(l < 0 || l >= w) {\n continue\n }\n if(k == i && l == j) {\n continue\n }\n if(map[k][l] == '#') {\n cnt++\n }\n }\n }\n line.append(cnt)\n }\n println(line.toString())\n }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 953, "cpu_time_ms": 245, "memory_kb": 37928}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s851161818", "group_id": "codeNet:p03574", "input_text": "import java.lang.StringBuilder\n\nfun main(arr:Array) {\n val (h, w) = readLine()!!.split(\" \").map { it.toInt() }\n val map = (1..h).map { readLine()!! }\n val ans = (1..h).map { (1..w).toMutableList() }\n for(r in ans.indices) {\n for(c in ans[r].indices) {\n if(map[r][c] == '#') {\n ans[r][c] = 9\n continue\n }\n var cnt = 0\n for(r2 in (Math.max(0, r-1)..Math.min(r+1,ans.lastIndex))) {\n for(c2 in (Math.max(0, c-1)..Math.min(c+1, ans[r].lastIndex))) {\n if(map[r2][c2] == '#') {\n cnt++\n }\n }\n }\n ans[r][c] = cnt\n }\n }\n val ansText = StringBuilder()\n ans.forEach { ansText.appendln(it.map { if(it == 9) \"#\" else it.toString() }.joinToString(\"\")) }\n print(ansText.toString())\n}", "language": "Kotlin", "metadata": {"date": 1580389961, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Kotlin/s851161818.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s851161818", "user_id": "u269969976"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "import java.lang.StringBuilder\n\nfun main(arr:Array) {\n val (h, w) = readLine()!!.split(\" \").map { it.toInt() }\n val map = (1..h).map { readLine()!! }\n val ans = (1..h).map { (1..w).toMutableList() }\n for(r in ans.indices) {\n for(c in ans[r].indices) {\n if(map[r][c] == '#') {\n ans[r][c] = 9\n continue\n }\n var cnt = 0\n for(r2 in (Math.max(0, r-1)..Math.min(r+1,ans.lastIndex))) {\n for(c2 in (Math.max(0, c-1)..Math.min(c+1, ans[r].lastIndex))) {\n if(map[r2][c2] == '#') {\n cnt++\n }\n }\n }\n ans[r][c] = cnt\n }\n }\n val ansText = StringBuilder()\n ans.forEach { ansText.appendln(it.map { if(it == 9) \"#\" else it.toString() }.joinToString(\"\")) }\n print(ansText.toString())\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 900, "cpu_time_ms": 268, "memory_kb": 38036}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s751604912", "group_id": "codeNet:p03574", "input_text": "fun main(args: Array) {\n val (h, w) = readLine()!!.split(' ').map(String::toInt)\n val s = (1..h).map { readLine()!! }\n\n val hs = listOf(-1, -1, 0, 1, 1, 1, 0, -1)\n val ws = listOf(0, 1, 1, 1, 0, -1, -1, -1)\n\n for (i in (0..(h - 1))) {\n var sb = StringBuilder(w)\n\n for (j in (0..(w - 1))) {\n\n if (s[i][j] == '#') {\n sb.append('#')\n continue\n }\n\n var c = 0\n\n for (k in 0..7) {\n if (i + hs[k] !in (0..(h - 1))) {\n continue\n }\n\n if (j + ws[k] !in (0..(w - 1))) {\n continue\n }\n\n if (s[i + hs[k]][j + ws[k]] == '#') {\n c++\n }\n }\n\n sb.append(c)\n }\n\n println(sb)\n }\n\n}", "language": "Kotlin", "metadata": {"date": 1527992247, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Kotlin/s751604912.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s751604912", "user_id": "u863309603"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "fun main(args: Array) {\n val (h, w) = readLine()!!.split(' ').map(String::toInt)\n val s = (1..h).map { readLine()!! }\n\n val hs = listOf(-1, -1, 0, 1, 1, 1, 0, -1)\n val ws = listOf(0, 1, 1, 1, 0, -1, -1, -1)\n\n for (i in (0..(h - 1))) {\n var sb = StringBuilder(w)\n\n for (j in (0..(w - 1))) {\n\n if (s[i][j] == '#') {\n sb.append('#')\n continue\n }\n\n var c = 0\n\n for (k in 0..7) {\n if (i + hs[k] !in (0..(h - 1))) {\n continue\n }\n\n if (j + ws[k] !in (0..(w - 1))) {\n continue\n }\n\n if (s[i + hs[k]][j + ws[k]] == '#') {\n c++\n }\n }\n\n sb.append(c)\n }\n\n println(sb)\n }\n\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 857, "cpu_time_ms": 276, "memory_kb": 37904}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s210097408", "group_id": "codeNet:p03574", "input_text": "fun main(args:Array) {\n val (H,W)=readLine()!!.split(\" \").map(String::toInt)\n val blocks=(1..H).map{readLine()!!}.map {\n it.map {c->\n if(c=='#') {true} else {false}\n }\n }\n blocks.indices.map{\n Pair(it,blocks[it])\n }.map {\n val (i,row) = it\n (0.until(row.size)).map {j->\n if(blocks[i][j]) {\n \"#\"\n } else {\n val num = \n listOf(Pair(i-1,j-1),Pair(i-1,j),Pair(i-1,j+1),\n Pair(i,j-1),Pair(i,j+1),\n Pair(i+1,j-1),Pair(i+1,j),Pair(i+1,j+1))\n .filter {pair->\n pair.first >=0 && pair.first =0 && pair.second < W\n }.map {pair->\n blocks[pair.first][pair.second]\n }.filter {isMine-> isMine}.size\n \"${num}\"\n }\n }\n .joinToString(\"\")\n }.forEach {\n println(it)\n }\n }\n", "language": "Kotlin", "metadata": {"date": 1508030633, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03574.html", "problem_id": "p03574", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03574/input.txt", "sample_output_relpath": "derived/input_output/data/p03574/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03574/Kotlin/s210097408.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s210097408", "user_id": "u181807786"}, "prompt_components": {"gold_output": "11211\n1#2#1\n11211\n", "input_to_evaluate": "fun main(args:Array) {\n val (H,W)=readLine()!!.split(\" \").map(String::toInt)\n val blocks=(1..H).map{readLine()!!}.map {\n it.map {c->\n if(c=='#') {true} else {false}\n }\n }\n blocks.indices.map{\n Pair(it,blocks[it])\n }.map {\n val (i,row) = it\n (0.until(row.size)).map {j->\n if(blocks[i][j]) {\n \"#\"\n } else {\n val num = \n listOf(Pair(i-1,j-1),Pair(i-1,j),Pair(i-1,j+1),\n Pair(i,j-1),Pair(i,j+1),\n Pair(i+1,j-1),Pair(i+1,j),Pair(i+1,j+1))\n .filter {pair->\n pair.first >=0 && pair.first =0 && pair.second < W\n }.map {pair->\n blocks[pair.first][pair.second]\n }.filter {isMine-> isMine}.size\n \"${num}\"\n }\n }\n .joinToString(\"\")\n }.forEach {\n println(it)\n }\n }\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "sample_input": "3 5\n.....\n.#.#.\n.....\n"}, "reference_outputs": ["11211\n1#2#1\n11211\n"], "source_document_id": "p03574", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an H × W grid.\n\nThe squares in the grid are described by H strings, S_1,...,S_H.\n\nThe j-th character in the string S_i corresponds to the square at the i-th row from the top and j-th column from the left (1 \\leq i \\leq H,1 \\leq j \\leq W).\n\n. stands for an empty square, and # stands for a square containing a bomb.\n\nDolphin is interested in how many bomb squares are horizontally, vertically or diagonally adjacent to each empty square.\n\n(Below, we will simply say \"adjacent\" for this meaning. For each square, there are at most eight adjacent squares.)\n\nHe decides to replace each . in our H strings with a digit that represents the number of bomb squares adjacent to the corresponding empty square.\n\nPrint the strings after the process.\n\nConstraints\n\n1 \\leq H,W \\leq 50\n\nS_i is a string of length W consisting of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the H strings after the process.\n\nThe i-th line should contain a string T_i of length W, where the j-th character in T_i corresponds to the square at the i-th row from the top and j-th row from the left in the grid (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\nSample Input 1\n\n3 5\n.....\n.#.#.\n.....\n\nSample Output 1\n\n11211\n1#2#1\n11211\n\nFor example, let us observe the empty square at the first row from the top and first column from the left.\n\nThere is one bomb square adjacent to this empty square: the square at the second row and second column.\n\nThus, the . corresponding to this empty square is replaced with 1.\n\nSample Input 2\n\n3 5\n#####\n#####\n#####\n\nSample Output 2\n\n#####\n#####\n#####\n\nIt is possible that there is no empty square.\n\nSample Input 3\n\n6 6\n#####.\n#.#.##\n####.#\n.#..#.\n#.##..\n#.#...\n\nSample Output 3\n\n#####3\n#8#7##\n####5#\n4#65#2\n#5##21\n#4#310", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 847, "cpu_time_ms": 341, "memory_kb": 39536}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s351423487", "group_id": "codeNet:p03606", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val n = readInt() \n val count = (0 until n).map {\n val (l, r) = readListOfInt()\n r - l + 1\n }.sum()\n println(count)\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n }\n }\n return v.map { it.toList() }.toList()\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n if(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n a / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun isDecimal(v: Double): Boolean = ((v - Math.floor(v)) != 0.0)\n\n// Data Structures\nclass Stack(private var st: MutableList = mutableListOf()) {\n fun isEmpty() = st.isEmpty()\n fun top(): T = st.last()\n fun push(e: T) { st.add(e) }\n fun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n fun isEmpty() = que.isEmpty()\n fun top(): T = que.first()\n fun push(e: T) { que.add(e) }\n fun pop() { que = que.drop(1).toMutableList() }\n}\n", "language": "Kotlin", "metadata": {"date": 1566272386, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03606.html", "problem_id": "p03606", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03606/input.txt", "sample_output_relpath": "derived/input_output/data/p03606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03606/Kotlin/s351423487.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s351423487", "user_id": "u026686258"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\nimport kotlin.comparisons.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val n = readInt() \n val count = (0 until n).map {\n val (l, r) = readListOfInt()\n r - l + 1\n }.sum()\n println(count)\n pw.flush()\n}\n\n/****** Declared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD\n }\n }\n return v.map { it.toList() }.toList()\n}\n\n// should be a >= b\nfun gcd(a: Long, b: Long): Long = \n if(b == 0L) a else gcd(b, a % b)\n\n// shoud be a >= b\nfun lcm(a: Long, b: Long): Long = \n a / gcd(a, b) * b\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun isDecimal(v: Double): Boolean = ((v - Math.floor(v)) != 0.0)\n\n// Data Structures\nclass Stack(private var st: MutableList = mutableListOf()) {\n fun isEmpty() = st.isEmpty()\n fun top(): T = st.last()\n fun push(e: T) { st.add(e) }\n fun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n fun isEmpty() = que.isEmpty()\n fun top(): T = que.first()\n fun push(e: T) { que.add(e) }\n fun pop() { que = que.drop(1).toMutableList() }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "sample_input": "1\n24 30\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03606", "source_text": "Score : 200 points\n\nProblem Statement\n\nJoisino is working as a receptionist at a theater.\n\nThe theater has 100000 seats, numbered from 1 to 100000.\n\nAccording to her memo, N groups of audiences have come so far, and the i-th group occupies the consecutive seats from Seat l_i to Seat r_i (inclusive).\n\nHow many people are sitting at the theater now?\n\nConstraints\n\n1≤N≤1000\n\n1≤l_i≤r_i≤100000\n\nNo seat is occupied by more than one person.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nl_1 r_1\n:\nl_N r_N\n\nOutput\n\nPrint the number of people sitting at the theater.\n\nSample Input 1\n\n1\n24 30\n\nSample Output 1\n\n7\n\nThere are 7 people, sitting at Seat 24,25,26,27,28,29 and 30.\n\nSample Input 2\n\n2\n6 8\n3 3\n\nSample Output 2\n\n4", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2758, "cpu_time_ms": 293, "memory_kb": 38180}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s156323252", "group_id": "codeNet:p03624", "input_text": "fun main(arr:Array) {\n println(getAns(readLine()!!))\n}\n\nfun getAns(str:String):String {\n for(i in ('a'..'z')) {\n if(!str.contains(i)) {\n return i.toString()\n }\n }\n return \"None\"\n}\n", "language": "Kotlin", "metadata": {"date": 1580890202, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Kotlin/s156323252.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s156323252", "user_id": "u269969976"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "fun main(arr:Array) {\n println(getAns(readLine()!!))\n}\n\nfun getAns(str:String):String {\n for(i in ('a'..'z')) {\n if(!str.contains(i)) {\n return i.toString()\n }\n }\n return \"None\"\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 225, "cpu_time_ms": 223, "memory_kb": 32172}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s013056505", "group_id": "codeNet:p03624", "input_text": "fun main(args: Array) {\n val s = readLine()?.toCharArray()?.toSet() ?: return\n if (s.size == 26) {\n println(\"None\")\n return\n }\n val alphabet = (97..122).map { it.toChar() }.toSet()\n println((alphabet - s).toList().min()!!)\n}", "language": "Kotlin", "metadata": {"date": 1580787421, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Kotlin/s013056505.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s013056505", "user_id": "u026352629"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()?.toCharArray()?.toSet() ?: return\n if (s.size == 26) {\n println(\"None\")\n return\n }\n val alphabet = (97..122).map { it.toChar() }.toSet()\n println((alphabet - s).toList().min()!!)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 261, "cpu_time_ms": 276, "memory_kb": 40716}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s877002705", "group_id": "codeNet:p03624", "input_text": "fun main(args: Array) {\n val s = readInputLine().toCharArray()\n s.sort()\n val s2 = s.distinct()\n\n for ((i, c) in ('a'..'z').withIndex()) {\n if (s2[i] != c) {\n println(c.toString())\n return\n }\n }\n\n println(\"None\")\n}\n \nfun readInputLine(): String {\n return readLine()!!\n}\n", "language": "Kotlin", "metadata": {"date": 1562545306, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Kotlin/s877002705.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s877002705", "user_id": "u505558493"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readInputLine().toCharArray()\n s.sort()\n val s2 = s.distinct()\n\n for ((i, c) in ('a'..'z').withIndex()) {\n if (s2[i] != c) {\n println(c.toString())\n return\n }\n }\n\n println(\"None\")\n}\n \nfun readInputLine(): String {\n return readLine()!!\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 335, "cpu_time_ms": 294, "memory_kb": 42244}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s699906588", "group_id": "codeNet:p03624", "input_text": "fun main(args: Array) {\n var s = readLine()!!.toSet().sorted()\n var tmp=s[0]\n var flag = 0\n \n for(i in 1..s.size-1 ){\n if(s[i].toInt() - tmp.toInt() >= 2){\n flag= 1\n println((tmp.toInt() + 1).toChar())\n return \n }\n tmp = s[i]\n }\n \n if(s.size != 26) println((s[s.size-1].toInt() + 1).toChar())\n else println(\"None\")\n}\n", "language": "Kotlin", "metadata": {"date": 1552491949, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Kotlin/s699906588.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s699906588", "user_id": "u399261731"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "fun main(args: Array) {\n var s = readLine()!!.toSet().sorted()\n var tmp=s[0]\n var flag = 0\n \n for(i in 1..s.size-1 ){\n if(s[i].toInt() - tmp.toInt() >= 2){\n flag= 1\n println((tmp.toInt() + 1).toChar())\n return \n }\n tmp = s[i]\n }\n \n if(s.size != 26) println((s[s.size-1].toInt() + 1).toChar())\n else println(\"None\")\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 406, "cpu_time_ms": 287, "memory_kb": 39576}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s091645084", "group_id": "codeNet:p03624", "input_text": "fun main( args : Array ) {\n val s = \"abcdefghijklmnopqrstuvwxyz\".toSet()\n val t = readLine()!!.toSet()\n (s - t).toList().sorted().let {\n when {\n it.size > 0 -> it.first().toString() \n else -> \"None\"\n }.let { println(it) }\n }\n}", "language": "Kotlin", "metadata": {"date": 1505196316, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Kotlin/s091645084.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s091645084", "user_id": "u693048766"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "fun main( args : Array ) {\n val s = \"abcdefghijklmnopqrstuvwxyz\".toSet()\n val t = readLine()!!.toSet()\n (s - t).toList().sorted().let {\n when {\n it.size > 0 -> it.first().toString() \n else -> \"None\"\n }.let { println(it) }\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 254, "cpu_time_ms": 289, "memory_kb": 37644}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s806243948", "group_id": "codeNet:p03624", "input_text": "fun main(args : Array){\n val S = readLine()!!\n println(('a'..'z').subtract(S.asIterable().distinct()).min() ?: \"None\")\n}", "language": "Kotlin", "metadata": {"date": 1504136849, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Kotlin/s806243948.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s806243948", "user_id": "u545850453"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "fun main(args : Array){\n val S = readLine()!!\n println(('a'..'z').subtract(S.asIterable().distinct()).min() ?: \"None\")\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 134, "cpu_time_ms": 297, "memory_kb": 34420}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s509956905", "group_id": "codeNet:p03624", "input_text": "import java.util.Scanner\n\nfun main(argv : Array){\n \n val sc = Scanner(System.`in`)\n \n val S = sc.next()\n \n var stop : Char = 'a'\n for(c in S) {\n if(c<=stop) {\n stop=c+1\n }\n }\n \n if(stop=='z'+1)\n println(\"None\")\n else\n println(stop)\n \n}\n\n", "language": "Kotlin", "metadata": {"date": 1503495528, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03624.html", "problem_id": "p03624", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03624/input.txt", "sample_output_relpath": "derived/input_output/data/p03624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03624/Kotlin/s509956905.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s509956905", "user_id": "u951750034"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "import java.util.Scanner\n\nfun main(argv : Array){\n \n val sc = Scanner(System.`in`)\n \n val S = sc.next()\n \n var stop : Char = 'a'\n for(c in S) {\n if(c<=stop) {\n stop=c+1\n }\n }\n \n if(stop=='z'+1)\n println(\"None\")\n else\n println(stop)\n \n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "sample_input": "atcoderregularcontest\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03624", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nFind the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5 (|S| is the length of string S.)\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the lexicographically smallest lowercase English letter that does not occur in S.\nIf every lowercase English letter occurs in S, print None instead.\n\nSample Input 1\n\natcoderregularcontest\n\nSample Output 1\n\nb\n\nThe string atcoderregularcontest contains a, but does not contain b.\n\nSample Input 2\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 2\n\nNone\n\nThis string contains every lowercase English letter.\n\nSample Input 3\n\nfajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg\n\nSample Output 3\n\nd", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 320, "cpu_time_ms": 271, "memory_kb": 34056}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s554928611", "group_id": "codeNet:p03639", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (1..n).map { sc.nextInt() }\n\n val size4 = a.filter { it % 4 == 0 }.size\n val sizeOdd = a.filter { it % 2 != 0 }.size\n\n if (sizeOdd <= size4) {\n println(\"Yes\")\n return\n }\n if (sizeOdd <= size4 + 1 && sizeOdd + size4 == n) {\n println(\"Yes\")\n return\n }\n\n\n println(\"No\")\n\n}\n", "language": "Kotlin", "metadata": {"date": 1595135249, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Kotlin/s554928611.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s554928611", "user_id": "u323522006"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (1..n).map { sc.nextInt() }\n\n val size4 = a.filter { it % 4 == 0 }.size\n val sizeOdd = a.filter { it % 2 != 0 }.size\n\n if (sizeOdd <= size4) {\n println(\"Yes\")\n return\n }\n if (sizeOdd <= size4 + 1 && sizeOdd + size4 == n) {\n println(\"Yes\")\n return\n }\n\n\n println(\"No\")\n\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "sample_input": "3\n1 10 100\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03639", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 406, "cpu_time_ms": 485, "memory_kb": 62040}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s833597013", "group_id": "codeNet:p03639", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (1..n).map { sc.nextInt() }\n\n val size4 = a.filter { it % 4 == 0 }.size\n val size2 = a.filter { it == 2 }.size\n val size = a.filter { it % 2 != 0 }.size\n\n if (size + size2 / 2 <= size4 + 1) {\n println(\"Yes\")\n return\n }\n println(\"No\")\n\n}\n", "language": "Kotlin", "metadata": {"date": 1595133666, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Kotlin/s833597013.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s833597013", "user_id": "u323522006"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (1..n).map { sc.nextInt() }\n\n val size4 = a.filter { it % 4 == 0 }.size\n val size2 = a.filter { it == 2 }.size\n val size = a.filter { it % 2 != 0 }.size\n\n if (size + size2 / 2 <= size4 + 1) {\n println(\"Yes\")\n return\n }\n println(\"No\")\n\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "sample_input": "3\n1 10 100\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03639", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 366, "cpu_time_ms": 474, "memory_kb": 62164}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s302035528", "group_id": "codeNet:p03639", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (1..n).map { sc.nextLong() }\n\n val size4 = a.filter { it % 4L == 0L }.size\n val size2 = a.filter { it == 2L }.size\n if (size4 == (n-size2) / 2 && size2 > 0) {\n println(\"Yes\")\n return\n }\n if (size4 >= n / 2) {\n println(\"Yes\")\n return\n }\n println(\"No\")\n\n}\n", "language": "Kotlin", "metadata": {"date": 1595132760, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Kotlin/s302035528.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s302035528", "user_id": "u323522006"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val a = (1..n).map { sc.nextLong() }\n\n val size4 = a.filter { it % 4L == 0L }.size\n val size2 = a.filter { it == 2L }.size\n if (size4 == (n-size2) / 2 && size2 > 0) {\n println(\"Yes\")\n return\n }\n if (size4 >= n / 2) {\n println(\"Yes\")\n return\n }\n println(\"No\")\n\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "sample_input": "3\n1 10 100\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03639", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 390, "cpu_time_ms": 477, "memory_kb": 63088}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s461867744", "group_id": "codeNet:p03639", "input_text": "fun longList() = readLine()?.split(\" \")?.map(String::toLong) ?: TODO()\nfun main(args: Array) {\n val n = readLine()?.toInt() ?: return\n val a = longList()\n var four = 0\n var notFour = 0\n var has2 = false\n a.forEach {\n if (it == 2L) {\n has2 = true\n } else if (it % 4 == 0L) {\n four++\n } else {\n notFour++\n }\n }\n if (has2) {\n notFour++\n }\n if (four >= notFour - 1) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1591063219, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Kotlin/s461867744.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s461867744", "user_id": "u979429407"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun longList() = readLine()?.split(\" \")?.map(String::toLong) ?: TODO()\nfun main(args: Array) {\n val n = readLine()?.toInt() ?: return\n val a = longList()\n var four = 0\n var notFour = 0\n var has2 = false\n a.forEach {\n if (it == 2L) {\n has2 = true\n } else if (it % 4 == 0L) {\n four++\n } else {\n notFour++\n }\n }\n if (has2) {\n notFour++\n }\n if (four >= notFour - 1) {\n println(\"Yes\")\n } else {\n println(\"No\")\n }\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "sample_input": "3\n1 10 100\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03639", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 536, "cpu_time_ms": 489, "memory_kb": 51924}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s535023927", "group_id": "codeNet:p03639", "input_text": "import java.lang.Math\n\nval MOD: Int = 1000000000 + 7\nval MODL: Long = MOD.toLong()\n\nfun main(args: Array)\n{\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map{it.toInt()}.toIntArray()\n\n var cnt2 = 0\n var cnt4 = 0\n for (i in 0 until n) {\n cnt2 += if (a[i] % 2 == 0) 1 else 0\n cnt4 += if (a[i] % 4 == 0) 1 else 0\n }\n\n if (cnt2 == n || cnt4 * 2 >= (n - cnt2)) println(\"Yes\")\n else println(\"No\")\n}\n", "language": "Kotlin", "metadata": {"date": 1578617234, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Kotlin/s535023927.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s535023927", "user_id": "u118477733"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.lang.Math\n\nval MOD: Int = 1000000000 + 7\nval MODL: Long = MOD.toLong()\n\nfun main(args: Array)\n{\n val n = readLine()!!.toInt()\n val a = readLine()!!.split(\" \").map{it.toInt()}.toIntArray()\n\n var cnt2 = 0\n var cnt4 = 0\n for (i in 0 until n) {\n cnt2 += if (a[i] % 2 == 0) 1 else 0\n cnt4 += if (a[i] % 4 == 0) 1 else 0\n }\n\n if (cnt2 == n || cnt4 * 2 >= (n - cnt2)) println(\"Yes\")\n else println(\"No\")\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "sample_input": "3\n1 10 100\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03639", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 456, "cpu_time_ms": 503, "memory_kb": 52076}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s043860713", "group_id": "codeNet:p03639", "input_text": "fun main(args: Array) {\n arc080c()\n}\n\nfun arc080c() {\n val n = readLine()!!.toInt()\n val aList = readLine()!!.split(\" \").map { it.toLong() }\n\n val multipleOf2 = aList.filterNot { it % 4 == 0L }.count { it % 2 == 0L }\n val multipleOf4 = aList.count { it % 4 == 0L }\n\n val answer = when {\n multipleOf4 >= n / 2 -> \"Yes\"\n multipleOf4 * 2 + multipleOf2 >= n -> \"Yes\"\n else -> \"No\"\n }\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1573702893, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Kotlin/s043860713.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s043860713", "user_id": "u139478771"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "fun main(args: Array) {\n arc080c()\n}\n\nfun arc080c() {\n val n = readLine()!!.toInt()\n val aList = readLine()!!.split(\" \").map { it.toLong() }\n\n val multipleOf2 = aList.filterNot { it % 4 == 0L }.count { it % 2 == 0L }\n val multipleOf4 = aList.count { it % 4 == 0L }\n\n val answer = when {\n multipleOf4 >= n / 2 -> \"Yes\"\n multipleOf4 * 2 + multipleOf2 >= n -> \"Yes\"\n else -> \"No\"\n }\n\n println(answer)\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "sample_input": "3\n1 10 100\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03639", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 453, "cpu_time_ms": 522, "memory_kb": 56096}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s998219421", "group_id": "codeNet:p03639", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val H = scanner.nextInt()\n val W = scanner.nextInt()\n val N = scanner.nextInt()\n\n val c = IntArray(H*W)\n var curIndex = 0\n for (i in 1..N) {\n val noc = scanner.nextInt()\n for (j in 1..noc) {\n c[curIndex] = i\n curIndex++\n }\n }\n\n val builder = StringBuilder()\n for (i in 0 until H) {\n builder.append(if (i%2==0) c.copyOfRange(i*W,(i+1)*W).toStringWithSpace() else c.copyOfRange(i*W,(i+1)*W).reversedArray().toStringWithSpace()).append(\"\\n\")\n }\n print(builder.toString())\n}\n\nfun IntArray.toStringWithSpace(): String {\n val builder = StringBuilder()\n this.forEach { builder.append(it).append(\" \") }\n return builder.removeSuffix(\" \").toString()\n}", "language": "Kotlin", "metadata": {"date": 1503695274, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03639.html", "problem_id": "p03639", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03639/input.txt", "sample_output_relpath": "derived/input_output/data/p03639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03639/Kotlin/s998219421.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s998219421", "user_id": "u324614336"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val H = scanner.nextInt()\n val W = scanner.nextInt()\n val N = scanner.nextInt()\n\n val c = IntArray(H*W)\n var curIndex = 0\n for (i in 1..N) {\n val noc = scanner.nextInt()\n for (j in 1..noc) {\n c[curIndex] = i\n curIndex++\n }\n }\n\n val builder = StringBuilder()\n for (i in 0 until H) {\n builder.append(if (i%2==0) c.copyOfRange(i*W,(i+1)*W).toStringWithSpace() else c.copyOfRange(i*W,(i+1)*W).reversedArray().toStringWithSpace()).append(\"\\n\")\n }\n print(builder.toString())\n}\n\nfun IntArray.toStringWithSpace(): String {\n val builder = StringBuilder()\n this.forEach { builder.append(it).append(\" \") }\n return builder.removeSuffix(\" \").toString()\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "sample_input": "3\n1 10 100\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03639", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 825, "cpu_time_ms": 202, "memory_kb": 51656}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s391391891", "group_id": "codeNet:p03639", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val N = scanner.nextInt()\n var mo4 = 0\n var odd = 0\n for (i in 1..N) {\n val a = scanner.nextInt()\n if (a % 2 == 1)\n odd++\n else if (a % 4 == 0)\n mo4++\n }\n if (mo4+odd) {\n val scanner = Scanner(System.`in`)\n val N = scanner.nextInt()\n var mo4 = 0\n var odd = 0\n for (i in 1..N) {\n val a = scanner.nextInt()\n if (a % 2 == 1)\n odd++\n else if (a % 4 == 0)\n mo4++\n }\n if (mo4+odd) {\n val sc = Scanner(System.`in`)\n val n = sc.nextLong()\n val a = sc.nextLong()\n val b = sc.nextLong()\n\n if (n == 1L && a < b) {\n println(0)\n return\n }\n if (a > b) {\n println(0)\n return\n }\n if (n != 1L && a == b) {\n println(1)\n return\n }\n if (n == 2L) {\n println(1)\n return\n }\n\n val min = a + a + a + b\n val max = a + b + b + b\n println(max - min + 1L)\n\n\n\n}\n", "language": "Kotlin", "metadata": {"date": 1594783761, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Kotlin/s634648887.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s634648887", "user_id": "u323522006"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextLong()\n val a = sc.nextLong()\n val b = sc.nextLong()\n\n if (n == 1L && a < b) {\n println(0)\n return\n }\n if (a > b) {\n println(0)\n return\n }\n if (n != 1L && a == b) {\n println(1)\n return\n }\n if (n == 2L) {\n println(1)\n return\n }\n\n val min = a + a + a + b\n val max = a + b + b + b\n println(max - min + 1L)\n\n\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 448, "cpu_time_ms": 127, "memory_kb": 36392}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s279823304", "group_id": "codeNet:p03705", "input_text": "fun main(args: Array) {\n agc015a()\n}\n\nfun agc015a() {\n val (n, a, b) = readLine()!!.split(' ').map { it.toInt() }\n\n if (a > b || a + n + 1 < b) return println(0)\n if (n == 1) return if (a != b) println(0) else println(1)\n if (n == 2) return println(1)\n\n val answer = (a + b * (n - 1)) - (a * (n - 1) + b) + 1\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1574836323, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Kotlin/s279823304.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s279823304", "user_id": "u139478771"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args: Array) {\n agc015a()\n}\n\nfun agc015a() {\n val (n, a, b) = readLine()!!.split(' ').map { it.toInt() }\n\n if (a > b || a + n + 1 < b) return println(0)\n if (n == 1) return if (a != b) println(0) else println(1)\n if (n == 2) return println(1)\n\n val answer = (a + b * (n - 1)) - (a * (n - 1) + b) + 1\n\n println(answer)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 358, "cpu_time_ms": 232, "memory_kb": 38052}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s476752069", "group_id": "codeNet:p03705", "input_text": "import java.util.*\n\n\nfun main(args: Array){\n\tval cin = Scanner(System.`in`)\n val n = cin.nextLong()\n val a = cin.nextLong()\n val b = cin.nextLong()\n\n val c: Long = b - a\n\n if (0 > c) {\n println(0)\n } else if (n == 1.toLong()) {\n if (c > 0) {\n println(0)\n } else {\n println(1)\n }\n } else {\n val max: Long = b*(n-1) + a\n val min: Long = a*(n-1) + b\n println(max - min + 1)\n }\n}", "language": "Kotlin", "metadata": {"date": 1550104319, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03705.html", "problem_id": "p03705", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03705/input.txt", "sample_output_relpath": "derived/input_output/data/p03705/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03705/Kotlin/s476752069.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s476752069", "user_id": "u111421568"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.*\n\n\nfun main(args: Array){\n\tval cin = Scanner(System.`in`)\n val n = cin.nextLong()\n val a = cin.nextLong()\n val b = cin.nextLong()\n\n val c: Long = b - a\n\n if (0 > c) {\n println(0)\n } else if (n == 1.toLong()) {\n if (c > 0) {\n println(0)\n } else {\n println(1)\n }\n } else {\n val max: Long = b*(n-1) + a\n val min: Long = a*(n-1) + b\n println(max - min + 1)\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "sample_input": "4 4 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03705", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N integers. Among them, the smallest is A, and the largest is B.\nWe are interested in the sum of those N integers. How many different possible sums there are?\n\nConstraints\n\n1 ≤ N,A,B ≤ 10^9\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of the different possible sums.\n\nSample Input 1\n\n4 4 6\n\nSample Output 1\n\n5\n\nThere are five possible sums: 18=4+4+4+6, 19=4+4+5+6, 20=4+5+5+6, 21=4+5+6+6 and 22=4+6+6+6.\n\nSample Input 2\n\n5 4 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n1 7 10\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 3 3\n\nSample Output 4\n\n1", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 478, "cpu_time_ms": 185, "memory_kb": 29356}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s543664228", "group_id": "codeNet:p03714", "input_text": "import java.util.PriorityQueue\nimport kotlin.comparisons.compareByDescending\nfun main(args: Array) {\n val N = nextInt()\n val A = listOfLong()\n //前半\n val first = fun(): LongArray {\n \tval array = LongArray(N + 1)\n \tval Q = PriorityQueue(N)\n \tQ.addAll(A.subList(0, N))\n \tvar S = Q.toList().sum()\n \tfor (n in 0 .. N) {\n \tarray[n] = S\n \tS += A[N + n]\n \tQ.add(A[N + n])\n \tS -= Q.poll()!! //一番小さい引く\n \t}\n \treturn array\n\t}()\n //後半\n val latter = fun(): LongArray {\n\t val array = LongArray(N + 1)\n \tval Q = PriorityQueue(N, compareByDescending { it })\n \tQ.addAll(A.subList(2 * N, 3 * N))\n \tvar S = Q.toList().sum()\n \tfor (n in 0 .. N) {\n \tarray[N - n] = S\n \tS += A[2 * N - n - 1]\n \tQ.add(A[2 * N - n - 1])\n \tS -= Q.poll()!! // 一番大きい引く\n \t}\n \treturn array\n }()\n var ans = (0 .. N).map { first[it] - latter[it] }.max()!!\n println(ans)\n}\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfInt(vararg deltas: Int) = listOfString().map { Integer.parseInt(it) }.mapIndexed { index, int -> int + deltas[index % deltas.size] }\nfun listOfLong(offset: Long = 0L) = listOfString().map { it.toLong() + offset}\n", "language": "Kotlin", "metadata": {"date": 1585913776, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Kotlin/s543664228.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s543664228", "user_id": "u043150661"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.PriorityQueue\nimport kotlin.comparisons.compareByDescending\nfun main(args: Array) {\n val N = nextInt()\n val A = listOfLong()\n //前半\n val first = fun(): LongArray {\n \tval array = LongArray(N + 1)\n \tval Q = PriorityQueue(N)\n \tQ.addAll(A.subList(0, N))\n \tvar S = Q.toList().sum()\n \tfor (n in 0 .. N) {\n \tarray[n] = S\n \tS += A[N + n]\n \tQ.add(A[N + n])\n \tS -= Q.poll()!! //一番小さい引く\n \t}\n \treturn array\n\t}()\n //後半\n val latter = fun(): LongArray {\n\t val array = LongArray(N + 1)\n \tval Q = PriorityQueue(N, compareByDescending { it })\n \tQ.addAll(A.subList(2 * N, 3 * N))\n \tvar S = Q.toList().sum()\n \tfor (n in 0 .. N) {\n \tarray[N - n] = S\n \tS += A[2 * N - n - 1]\n \tQ.add(A[2 * N - n - 1])\n \tS -= Q.poll()!! // 一番大きい引く\n \t}\n \treturn array\n }()\n var ans = (0 .. N).map { first[it] - latter[it] }.max()!!\n println(ans)\n}\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfInt(vararg deltas: Int) = listOfString().map { Integer.parseInt(it) }.mapIndexed { index, int -> int + deltas[index % deltas.size] }\nfun listOfLong(offset: Long = 0L) = listOfString().map { it.toLong() + offset}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1408, "cpu_time_ms": 938, "memory_kb": 107888}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s532762788", "group_id": "codeNet:p03714", "input_text": "import java.util.PriorityQueue\nimport kotlin.comparisons.compareByDescending\nfun main(args: Array) {\n val N = nextInt()\n val A = listOfLong()\n //前半\n val first = LongArray(N + 1)\n val fQ = PriorityQueue(N)\n fQ.addAll(A.subList(0, N))\n var fS = fQ.toList().sum()\n for (n in 0 .. N) {\n first[n] = fS\n fS += A[n + N]\n fQ.add(A[n + N])\n fS -= fQ.poll()!! //一番小さい引く\n }\n //後半\n val latter = LongArray(N + 1)\n val lQ = PriorityQueue(N, compareByDescending { it })\n lQ.addAll(A.subList(2 * N, 3 * N))\n var lS = lQ.toList().sum()\n for (n in 0 .. N) {\n latter[N - n] = lS\n lS += A[2 * N - n - 1]\n lQ.add(A[2 * N - n - 1])\n lS -= lQ.poll()!! // 一番大きい引く\n }\n var ans = (0 .. N).map { first[it] - latter[it] }.max()!!\n println(ans)\n}\n\nfun List.SUM() = this.reduce { acc, value -> acc + value }\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfInt(vararg deltas: Int) = listOfString().map { Integer.parseInt(it) }.mapIndexed { index, int -> int + deltas[index % deltas.size] }\nfun listOfLong(offset: Long = 0L) = listOfString().map { it.toLong() + offset}\n", "language": "Kotlin", "metadata": {"date": 1585911130, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Kotlin/s532762788.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s532762788", "user_id": "u043150661"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.PriorityQueue\nimport kotlin.comparisons.compareByDescending\nfun main(args: Array) {\n val N = nextInt()\n val A = listOfLong()\n //前半\n val first = LongArray(N + 1)\n val fQ = PriorityQueue(N)\n fQ.addAll(A.subList(0, N))\n var fS = fQ.toList().sum()\n for (n in 0 .. N) {\n first[n] = fS\n fS += A[n + N]\n fQ.add(A[n + N])\n fS -= fQ.poll()!! //一番小さい引く\n }\n //後半\n val latter = LongArray(N + 1)\n val lQ = PriorityQueue(N, compareByDescending { it })\n lQ.addAll(A.subList(2 * N, 3 * N))\n var lS = lQ.toList().sum()\n for (n in 0 .. N) {\n latter[N - n] = lS\n lS += A[2 * N - n - 1]\n lQ.add(A[2 * N - n - 1])\n lS -= lQ.poll()!! // 一番大きい引く\n }\n var ans = (0 .. N).map { first[it] - latter[it] }.max()!!\n println(ans)\n}\n\nfun List.SUM() = this.reduce { acc, value -> acc + value }\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun listOfString() = next().split(\" \")\nfun listOfInt() = listOfString().map(String::toInt)\nfun listOfInt(vararg deltas: Int) = listOfString().map { Integer.parseInt(it) }.mapIndexed { index, int -> int + deltas[index % deltas.size] }\nfun listOfLong(offset: Long = 0L) = listOfString().map { it.toLong() + offset}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1354, "cpu_time_ms": 942, "memory_kb": 107364}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s836492357", "group_id": "codeNet:p03714", "input_text": "import java.util.PriorityQueue\nimport java.util.Comparator\n\nobject MainKt {\n @JvmStatic fun main(args:Array) {\n val N=readLine()!!.toInt()\n val a=readLine()!!.split(\" \").map(String::toInt)\n assert(a.size==N)\n \n val front_queue = PriorityQueue()\n val last_queue=PriorityQueue(N,object: Comparator {\n override fun compare(a:Int,b:Int) = b-a\n })\n \n var front_acc=0L\n var last_acc=0L\n var front_sum=Array(N+1) {0L}\n var last_sum=Array(N+1) {0L}\n\n a.slice(0.until(N)).forEach{\n front_acc+=it\n front_queue.add(it)\n }\n a.slice((2*N).until(3*N)).forEach{ \n last_acc+=it\n last_queue.add(it)\n }\n front_sum[0]=front_acc\n last_sum[N]=last_acc\n (N.until(2*N)).forEach{\n front_queue.add(a[it])\n front_acc+=a[it]-front_queue.poll()\n front_sum[it-N+1]=front_acc\n }\n (2*N-1 downTo N).forEach {\n last_queue.add(a[it])\n last_acc+=a[it]-last_queue.poll()\n last_sum[it-N]=last_acc\n }\n println((0..N).map{ front_sum[it]-last_sum[it]}.max()!!)\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1495344854, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Kotlin/s836492357.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s836492357", "user_id": "u181807786"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.PriorityQueue\nimport java.util.Comparator\n\nobject MainKt {\n @JvmStatic fun main(args:Array) {\n val N=readLine()!!.toInt()\n val a=readLine()!!.split(\" \").map(String::toInt)\n assert(a.size==N)\n \n val front_queue = PriorityQueue()\n val last_queue=PriorityQueue(N,object: Comparator {\n override fun compare(a:Int,b:Int) = b-a\n })\n \n var front_acc=0L\n var last_acc=0L\n var front_sum=Array(N+1) {0L}\n var last_sum=Array(N+1) {0L}\n\n a.slice(0.until(N)).forEach{\n front_acc+=it\n front_queue.add(it)\n }\n a.slice((2*N).until(3*N)).forEach{ \n last_acc+=it\n last_queue.add(it)\n }\n front_sum[0]=front_acc\n last_sum[N]=last_acc\n (N.until(2*N)).forEach{\n front_queue.add(a[it])\n front_acc+=a[it]-front_queue.poll()\n front_sum[it-N+1]=front_acc\n }\n (2*N-1 downTo N).forEach {\n last_queue.add(a[it])\n last_acc+=a[it]-last_queue.poll()\n last_sum[it-N]=last_acc\n }\n println((0..N).map{ front_sum[it]-last_sum[it]}.max()!!)\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1103, "cpu_time_ms": 1043, "memory_kb": 106660}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s577732064", "group_id": "codeNet:p03714", "input_text": "import java.util.PriorityQueue\nimport java.util.Comparator\n\nobject MainKt {\n @JvmStatic fun main(args:Array) {\n val N=readLine()!!.toInt()\n val a=readLine()!!.split(\" \").map(String::toInt)\n assert(a.size==N)\n \n val default_front_queue = PriorityQueue()\n val default_last_queue=PriorityQueue(N,object: Comparator {\n override fun compare(a:Int,b:Int) = b-a\n })\n \n var default_front_acc=0L\n var default_last_acc=0L\n \n a.slice(0.until(N)).forEach{\n default_front_acc+=it\n default_front_queue.add(it)\n }\n a.slice((2*N).until(3*N)).forEach{ \n default_last_acc+=it\n default_last_queue.add(it)\n }\n\n println(\n if(N==1) {\n arrayOf(a[0]-a.slice(1..2).max()!!,a.slice(0..1).max()!!-a[2]).max()!!\n }\n else {\n ((N-1).until(2*N)).fold(0L) {res,k->\n \n val front_queue=default_front_queue\n var front_acc=default_front_acc\n val last_queue=default_last_queue\n var last_acc=default_last_acc\n \n for(i in N..k) {\n front_queue.add(a[i])\n front_acc+=a[i]\n front_acc-=front_queue.poll()\n }\n for(i in (k+1).until(2*N)) {\n last_queue.add(a[i])\n last_acc+=a[i]\n last_acc-=last_queue.poll() \n }\n // println(k)\n // println(front_queue)\n // println(last_queue)\n if(front_acc-last_acc > res) {front_acc-last_acc} else {res}\n }\n })\n }\n}\n", "language": "Kotlin", "metadata": {"date": 1495343595, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03714.html", "problem_id": "p03714", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03714/input.txt", "sample_output_relpath": "derived/input_output/data/p03714/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03714/Kotlin/s577732064.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s577732064", "user_id": "u181807786"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.util.PriorityQueue\nimport java.util.Comparator\n\nobject MainKt {\n @JvmStatic fun main(args:Array) {\n val N=readLine()!!.toInt()\n val a=readLine()!!.split(\" \").map(String::toInt)\n assert(a.size==N)\n \n val default_front_queue = PriorityQueue()\n val default_last_queue=PriorityQueue(N,object: Comparator {\n override fun compare(a:Int,b:Int) = b-a\n })\n \n var default_front_acc=0L\n var default_last_acc=0L\n \n a.slice(0.until(N)).forEach{\n default_front_acc+=it\n default_front_queue.add(it)\n }\n a.slice((2*N).until(3*N)).forEach{ \n default_last_acc+=it\n default_last_queue.add(it)\n }\n\n println(\n if(N==1) {\n arrayOf(a[0]-a.slice(1..2).max()!!,a.slice(0..1).max()!!-a[2]).max()!!\n }\n else {\n ((N-1).until(2*N)).fold(0L) {res,k->\n \n val front_queue=default_front_queue\n var front_acc=default_front_acc\n val last_queue=default_last_queue\n var last_acc=default_last_acc\n \n for(i in N..k) {\n front_queue.add(a[i])\n front_acc+=a[i]\n front_acc-=front_queue.poll()\n }\n for(i in (k+1).until(2*N)) {\n last_queue.add(a[i])\n last_acc+=a[i]\n last_acc-=last_queue.poll() \n }\n // println(k)\n // println(front_queue)\n // println(last_queue)\n if(front_acc-last_acc > res) {front_acc-last_acc} else {res}\n }\n })\n }\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03714", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1572, "cpu_time_ms": 2111, "memory_kb": 101616}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s656984115", "group_id": "codeNet:p03814", "input_text": "fun main(args: Array) {\n\n val str = readLine()!!\n\n val begin = str.indexOf(\"A\")\n // lastIndexOf覚えて!!\n val end = str.lastIndexOf(\"Z\")\n\n // QWERTYASDFZXCVの場合、indexは0から始まるので6になる\n // substringの始点も0になるため、indexOfの開始位置は\n // substringの開始位置に利用できる\n // substringのbegin-endの場合、末尾文字列を含めるとき+1が必要\n val result = str.substring(begin, end + 1)\n println(result)\n}", "language": "Kotlin", "metadata": {"date": 1590868255, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Kotlin/s656984115.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s656984115", "user_id": "u048507231"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args: Array) {\n\n val str = readLine()!!\n\n val begin = str.indexOf(\"A\")\n // lastIndexOf覚えて!!\n val end = str.lastIndexOf(\"Z\")\n\n // QWERTYASDFZXCVの場合、indexは0から始まるので6になる\n // substringの始点も0になるため、indexOfの開始位置は\n // substringの開始位置に利用できる\n // substringのbegin-endの場合、末尾文字列を含めるとき+1が必要\n val result = str.substring(begin, end + 1)\n println(result)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 510, "cpu_time_ms": 252, "memory_kb": 32692}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s104047604", "group_id": "codeNet:p03814", "input_text": "fun main(args: Array) {\n abc053b()\n}\n\nfun abc053b() {\n val s = readLine()!!\n\n val answer = s.indexOfLast { it == 'Z' } - s.indexOfFirst { it == 'A' } + 1\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1573436690, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Kotlin/s104047604.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s104047604", "user_id": "u139478771"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args: Array) {\n abc053b()\n}\n\nfun abc053b() {\n val s = readLine()!!\n\n val answer = s.indexOfLast { it == 'Z' } - s.indexOfFirst { it == 'A' } + 1\n\n println(answer)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 194, "cpu_time_ms": 247, "memory_kb": 34340}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s751306082", "group_id": "codeNet:p03814", "input_text": "import java.io.BufferedReader\nimport java.io.PrintWriter\n\nvar out: PrintWriter = PrintWriter(System.out) // これを使って出力すると早い\nfun main(args: Array) {\n try {\n val s = ReadLib.readString()\n val a = s.indexOf('A')\n val z = s.indexOf('Z', startIndex = a)\n \n out.println(z - a + 1)\n } finally {\n out.flush() // 消さない\n }\n}\n\n/**\n * 読み取り\n */\nclass ReadLib {\n companion object {\n private var reader: BufferedReader = System.`in`.bufferedReader()\n\n fun reset() {\n reader = System.`in`.bufferedReader()\n }\n\n fun readInt(): Int {\n return Integer.parseInt(reader.readLine())\n }\n\n // Int\n fun readIntArray(delimiters: String = \" \"): IntArray {\n return reader\n .readLine()\n .split(delimiters)\n .map { s -> Integer.parseInt(s) }\n .toIntArray()\n }\n\n fun readNTimesInt(n: Int): IntArray {\n return (1..n).map { readInt() }.toIntArray()\n }\n\n fun readNTimesIntArray(n: Int): Array {\n return (1..n).map { readIntArray() }.toTypedArray()\n }\n\n // long\n // TODO 別の方法を考える\n fun readLong(): Long {\n return reader.readLine().toLong()\n }\n\n fun readLongArray(delimiters: String = \" \"): LongArray {\n return reader.readLine()\n .split(delimiters)\n .map { s -> s.toLong() }\n .toLongArray()\n }\n\n fun readNTimesLong(n: Int): LongArray {\n return (1..n).map { readLong() }.toLongArray()\n }\n\n fun readString(): String {\n return reader.readLine()\n }\n\n fun readStringArray(delimiters: String = \" \"): Array {\n return readString().split(delimiters).toTypedArray()\n }\n\n fun readNTimesString(n: Int): Array {\n return (1..n).map { readString() }.toTypedArray()\n }\n\n }\n}\n\n/**\n * 要素とその個数を出力\n */\nfun Array.ofCountMap(): Map {\n return this.groupBy { it }.mapValues { it.value.count() }\n}\n\n/**\n * 文字とその個数を出力\n */\nfun String.ofCountMap(): Map {\n return this.toCharArray().ofCountMap()\n}\n\n/**\n * 文字とその個数を出力\n */\nfun CharArray.ofCountMap(): Map {\n return this.groupBy { it }.mapValues { it.value.count() }\n}\n\n/**\n * Combination, nCk mod p を求める\n * https://ja.wikipedia.org/wiki/%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%A9%E9%80%86%E6%95%B0\n * http://drken1215.hatenablog.com/entry/2018/06/08/210000\n * @param maxN 最大のn\n * @param mod 素数p\n */\nclass ModCombination(private val maxN: Int, private val mod: Int = 1000000007) {\n val fac: IntArray = IntArray(maxN)\n val finv: IntArray = IntArray(maxN)\n\n init {\n val inv: IntArray = IntArray(maxN)\n fac[0] = 1\n fac[1] = 1\n\n inv[0] = 1\n inv[1] = 1\n for (i in 2..maxN) {\n fac[i] = fac[i - 1] * i % mod // 累積\n // mod % i < i\n inv[i] = mod - ((inv[mod % i].toLong()) * (mod / i) % mod).toInt()\n finv[i] = finv[i - 1] * inv[i] % mod\n }\n }\n\n /**\n * nCk mod p\n */\n fun Calc(n: Int, k: Int): Int {\n if (n < k || n < 0 || k < 0) {\n return 0\n }\n\n return ((fac[n].toLong() * finv[k] % mod) * finv[n - k] % mod).toInt()\n }\n}", "language": "Kotlin", "metadata": {"date": 1570938885, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Kotlin/s751306082.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s751306082", "user_id": "u368201579"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.PrintWriter\n\nvar out: PrintWriter = PrintWriter(System.out) // これを使って出力すると早い\nfun main(args: Array) {\n try {\n val s = ReadLib.readString()\n val a = s.indexOf('A')\n val z = s.indexOf('Z', startIndex = a)\n \n out.println(z - a + 1)\n } finally {\n out.flush() // 消さない\n }\n}\n\n/**\n * 読み取り\n */\nclass ReadLib {\n companion object {\n private var reader: BufferedReader = System.`in`.bufferedReader()\n\n fun reset() {\n reader = System.`in`.bufferedReader()\n }\n\n fun readInt(): Int {\n return Integer.parseInt(reader.readLine())\n }\n\n // Int\n fun readIntArray(delimiters: String = \" \"): IntArray {\n return reader\n .readLine()\n .split(delimiters)\n .map { s -> Integer.parseInt(s) }\n .toIntArray()\n }\n\n fun readNTimesInt(n: Int): IntArray {\n return (1..n).map { readInt() }.toIntArray()\n }\n\n fun readNTimesIntArray(n: Int): Array {\n return (1..n).map { readIntArray() }.toTypedArray()\n }\n\n // long\n // TODO 別の方法を考える\n fun readLong(): Long {\n return reader.readLine().toLong()\n }\n\n fun readLongArray(delimiters: String = \" \"): LongArray {\n return reader.readLine()\n .split(delimiters)\n .map { s -> s.toLong() }\n .toLongArray()\n }\n\n fun readNTimesLong(n: Int): LongArray {\n return (1..n).map { readLong() }.toLongArray()\n }\n\n fun readString(): String {\n return reader.readLine()\n }\n\n fun readStringArray(delimiters: String = \" \"): Array {\n return readString().split(delimiters).toTypedArray()\n }\n\n fun readNTimesString(n: Int): Array {\n return (1..n).map { readString() }.toTypedArray()\n }\n\n }\n}\n\n/**\n * 要素とその個数を出力\n */\nfun Array.ofCountMap(): Map {\n return this.groupBy { it }.mapValues { it.value.count() }\n}\n\n/**\n * 文字とその個数を出力\n */\nfun String.ofCountMap(): Map {\n return this.toCharArray().ofCountMap()\n}\n\n/**\n * 文字とその個数を出力\n */\nfun CharArray.ofCountMap(): Map {\n return this.groupBy { it }.mapValues { it.value.count() }\n}\n\n/**\n * Combination, nCk mod p を求める\n * https://ja.wikipedia.org/wiki/%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%A9%E9%80%86%E6%95%B0\n * http://drken1215.hatenablog.com/entry/2018/06/08/210000\n * @param maxN 最大のn\n * @param mod 素数p\n */\nclass ModCombination(private val maxN: Int, private val mod: Int = 1000000007) {\n val fac: IntArray = IntArray(maxN)\n val finv: IntArray = IntArray(maxN)\n\n init {\n val inv: IntArray = IntArray(maxN)\n fac[0] = 1\n fac[1] = 1\n\n inv[0] = 1\n inv[1] = 1\n for (i in 2..maxN) {\n fac[i] = fac[i - 1] * i % mod // 累積\n // mod % i < i\n inv[i] = mod - ((inv[mod % i].toLong()) * (mod / i) % mod).toInt()\n finv[i] = finv[i - 1] * inv[i] % mod\n }\n }\n\n /**\n * nCk mod p\n */\n fun Calc(n: Int, k: Int): Int {\n if (n < k || n < 0 || k < 0) {\n return 0\n }\n\n return ((fac[n].toLong() * finv[k] % mod) * finv[n - k] % mod).toInt()\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3528, "cpu_time_ms": 205, "memory_kb": 32348}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s455948919", "group_id": "codeNet:p03814", "input_text": "fun main(args: Array) {\n val S = readLine()!!\n (S.indexOfFirst { 'A' == it }..S.indexOfLast { 'Z' == it }).count().let(::println)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1567476950, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Kotlin/s455948919.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s455948919", "user_id": "u085288971"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "fun main(args: Array) {\n val S = readLine()!!\n (S.indexOfFirst { 'A' == it }..S.indexOfLast { 'Z' == it }).count().let(::println)\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 147, "cpu_time_ms": 255, "memory_kb": 36696}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s444400036", "group_id": "codeNet:p03814", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s: String = sc.next()\n var a: Int = 0\n var z: Int = 0\n for (i in 0 until s.length) {\n if (s[i] == 'A') {\n a = i\n break\n }\n }\n for (i in s.length - 1 downTo 0) {\n if (s[i] == 'Z') {\n z = i\n break\n }\n }\n print(z - a + 1)\n}", "language": "Kotlin", "metadata": {"date": 1547656722, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03814.html", "problem_id": "p03814", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03814/input.txt", "sample_output_relpath": "derived/input_output/data/p03814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03814/Kotlin/s444400036.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s444400036", "user_id": "u602865659"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val s: String = sc.next()\n var a: Int = 0\n var z: Int = 0\n for (i in 0 until s.length) {\n if (s[i] == 'A') {\n a = i\n break\n }\n }\n for (i in s.length - 1 downTo 0) {\n if (s[i] == 'Z') {\n z = i\n break\n }\n }\n print(z - a + 1)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "sample_input": "QWERTYASDFZXCV\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03814", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has decided to construct a string that starts with A and ends with Z, by taking out a substring of a string s (that is, a consecutive part of s).\n\nFind the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with A and ends with Z.\n\nConstraints\n\n1 ≦ |s| ≦ 200{,}000\n\ns consists of uppercase English letters.\n\nThere exists a substring of s that starts with A and ends with Z.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\nQWERTYASDFZXCV\n\nSample Output 1\n\n5\n\nBy taking out the seventh through eleventh characters, it is possible to construct ASDFZ, which starts with A and ends with Z.\n\nSample Input 2\n\nZABCZ\n\nSample Output 2\n\n4\n\nSample Input 3\n\nHASFJGHOGAKZZFEGA\n\nSample Output 3\n\n12", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 407, "cpu_time_ms": 265, "memory_kb": 32304}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s961114833", "group_id": "codeNet:p03835", "input_text": "fun main(args: Array) = println(run {\n val (k,s) = readLine()!!.split(\" \").map { it.toInt() }\n\n (0..k).map { a ->\n (0..k).count { b ->\n val c = s-a-b\n c in 0..k\n }\n }.sum()\n\n})\n", "language": "Kotlin", "metadata": {"date": 1588720060, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s961114833.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s961114833", "user_id": "u563556491"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "fun main(args: Array) = println(run {\n val (k,s) = readLine()!!.split(\" \").map { it.toInt() }\n\n (0..k).map { a ->\n (0..k).count { b ->\n val c = s-a-b\n c in 0..k\n }\n }.sum()\n\n})\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 230, "cpu_time_ms": 293, "memory_kb": 40136}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s525674951", "group_id": "codeNet:p03835", "input_text": "fun main(args: Array) = ABC051B.main()\n\nobject ABC051B {\n fun readInts() = readLine()!!.split(\" \").map { it.toInt() }\n\n fun main() {\n val (K, S) = readInts()\n\n var cnt = 0\n (0..K).forEach { x ->\n (0..K).forEach { y ->\n val z = S - x - y\n if (0 <= z && z <= K) cnt++\n }\n }\n\n println(cnt)\n }\n}", "language": "Kotlin", "metadata": {"date": 1584715070, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s525674951.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s525674951", "user_id": "u981616728"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "fun main(args: Array) = ABC051B.main()\n\nobject ABC051B {\n fun readInts() = readLine()!!.split(\" \").map { it.toInt() }\n\n fun main() {\n val (K, S) = readInts()\n\n var cnt = 0\n (0..K).forEach { x ->\n (0..K).forEach { y ->\n val z = S - x - y\n if (0 <= z && z <= K) cnt++\n }\n }\n\n println(cnt)\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 395, "cpu_time_ms": 327, "memory_kb": 40420}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s421436814", "group_id": "codeNet:p03835", "input_text": "fun main(args: Array) {\n val (k, s) = readLine()!!.split(' ').map { it.toInt() }\n var ans = 0\n for (x in 0..k) {\n for (y in 0..k) {\n val z = s - x - y\n if (z in 0..k) ans++\n }\n }\n println(ans)\n}\n", "language": "Kotlin", "metadata": {"date": 1577654017, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s421436814.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s421436814", "user_id": "u863309603"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "fun main(args: Array) {\n val (k, s) = readLine()!!.split(' ').map { it.toInt() }\n var ans = 0\n for (x in 0..k) {\n for (y in 0..k) {\n val z = s - x - y\n if (z in 0..k) ans++\n }\n }\n println(ans)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 254, "cpu_time_ms": 250, "memory_kb": 38176}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s142049997", "group_id": "codeNet:p03835", "input_text": "\nfun main(args: Array) {\n val (K, S) = readLine()!!.split(\" \").map { it.toInt() }\n\n val sum = calculateSumOfCombination(K, S)\n\n println(sum)\n}\n\nfun calculateSumOfCombination(K :Int, S: Int): Int {\n var sum = 0\n for (x in 0 .. K) {\n for (y in 0 .. K) {\n for (z in 0 .. K) {\n if (x + y + z == S) sum ++\n }\n }\n }\n return sum\n}\n", "language": "Kotlin", "metadata": {"date": 1571570296, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s142049997.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s142049997", "user_id": "u605053892"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "\nfun main(args: Array) {\n val (K, S) = readLine()!!.split(\" \").map { it.toInt() }\n\n val sum = calculateSumOfCombination(K, S)\n\n println(sum)\n}\n\nfun calculateSumOfCombination(K :Int, S: Int): Int {\n var sum = 0\n for (x in 0 .. K) {\n for (y in 0 .. K) {\n for (z in 0 .. K) {\n if (x + y + z == S) sum ++\n }\n }\n }\n return sum\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 404, "cpu_time_ms": 2111, "memory_kb": 37824}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s049652516", "group_id": "codeNet:p03835", "input_text": "import java.io.BufferedReader\nimport java.io.PrintWriter\n\nvar out: PrintWriter = PrintWriter(System.out) // これを使って出力すると早い\nfun main(args: Array) {\n try {\n val ks = ReadLib.readIntArray()\n var score = 0L\n for (x in 0..ks[0]){\n for (y in 0..ks[0]){\n val z = ks[1] - x - y\n if (z >= 0 && z <= ks[1]){\n score++\n }\n }\n }\n out.println(score)\n } finally {\n out.flush() // 消さない\n }\n}\n\n/**\n * 読み取り\n */\nclass ReadLib {\n companion object {\n private var reader: BufferedReader = System.`in`.bufferedReader()\n\n fun reset() {\n reader = System.`in`.bufferedReader()\n }\n\n fun readInt(): Int {\n return Integer.parseInt(reader.readLine())\n }\n\n // Int\n fun readIntArray(delimiters: String = \" \"): IntArray {\n return reader\n .readLine()\n .split(delimiters)\n .map { s -> Integer.parseInt(s) }\n .toIntArray()\n }\n\n fun readNTimesInt(n: Int): IntArray {\n return (1..n).map { readInt() }.toIntArray()\n }\n\n fun readNTimesIntArray(n: Int): Array {\n return (1..n).map { readIntArray() }.toTypedArray()\n }\n\n // long\n // TODO 別の方法を考える\n fun readLong(): Long {\n return reader.readLine().toLong()\n }\n\n fun readLongArray(delimiters: String = \" \"): LongArray {\n return reader.readLine()\n .split(delimiters)\n .map { s -> s.toLong() }\n .toLongArray()\n }\n\n fun readNTimesLong(n: Int): LongArray {\n return (1..n).map { readLong() }.toLongArray()\n }\n\n fun readString(): String {\n return reader.readLine()\n }\n\n fun readStringArray(delimiters: String = \" \"): Array {\n return readString().split(delimiters).toTypedArray()\n }\n\n fun readNTimesString(n: Int): Array {\n return (1..n).map { readString() }.toTypedArray()\n }\n\n }\n}\n\n/**\n * 要素とその個数を出力\n */\nfun Array.ofCountMap(): Map {\n return this.groupBy { it }.mapValues { it.value.count() }\n}\n\n/**\n * 文字とその個数を出力\n */\nfun String.ofCountMap(): Map {\n return this.toCharArray().ofCountMap()\n}\n\n/**\n * 文字とその個数を出力\n */\nfun CharArray.ofCountMap(): Map {\n return this.groupBy { it }.mapValues { it.value.count() }\n}\n\n/**\n * Combination, nCk mod p を求める\n * https://ja.wikipedia.org/wiki/%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%A9%E9%80%86%E6%95%B0\n * http://drken1215.hatenablog.com/entry/2018/06/08/210000\n * @param maxN 最大のn\n * @param mod 素数p\n */\nclass ModCombination(private val maxN: Int, private val mod: Int = 1000000007) {\n val fac: IntArray = IntArray(maxN)\n val finv: IntArray = IntArray(maxN)\n\n init {\n val inv: IntArray = IntArray(maxN)\n fac[0] = 1\n fac[1] = 1\n\n inv[0] = 1\n inv[1] = 1\n for (i in 2..maxN) {\n fac[i] = fac[i - 1] * i % mod // 累積\n // mod % i < i\n inv[i] = mod - ((inv[mod % i].toLong()) * (mod / i) % mod).toInt()\n finv[i] = finv[i - 1] * inv[i] % mod\n }\n }\n\n /**\n * nCk mod p\n */\n fun Calc(n: Int, k: Int): Int {\n if (n < k || n < 0 || k < 0) {\n return 0\n }\n\n return ((fac[n].toLong() * finv[k] % mod) * finv[n - k] % mod).toInt()\n }\n}", "language": "Kotlin", "metadata": {"date": 1570938683, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s049652516.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s049652516", "user_id": "u368201579"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.PrintWriter\n\nvar out: PrintWriter = PrintWriter(System.out) // これを使って出力すると早い\nfun main(args: Array) {\n try {\n val ks = ReadLib.readIntArray()\n var score = 0L\n for (x in 0..ks[0]){\n for (y in 0..ks[0]){\n val z = ks[1] - x - y\n if (z >= 0 && z <= ks[1]){\n score++\n }\n }\n }\n out.println(score)\n } finally {\n out.flush() // 消さない\n }\n}\n\n/**\n * 読み取り\n */\nclass ReadLib {\n companion object {\n private var reader: BufferedReader = System.`in`.bufferedReader()\n\n fun reset() {\n reader = System.`in`.bufferedReader()\n }\n\n fun readInt(): Int {\n return Integer.parseInt(reader.readLine())\n }\n\n // Int\n fun readIntArray(delimiters: String = \" \"): IntArray {\n return reader\n .readLine()\n .split(delimiters)\n .map { s -> Integer.parseInt(s) }\n .toIntArray()\n }\n\n fun readNTimesInt(n: Int): IntArray {\n return (1..n).map { readInt() }.toIntArray()\n }\n\n fun readNTimesIntArray(n: Int): Array {\n return (1..n).map { readIntArray() }.toTypedArray()\n }\n\n // long\n // TODO 別の方法を考える\n fun readLong(): Long {\n return reader.readLine().toLong()\n }\n\n fun readLongArray(delimiters: String = \" \"): LongArray {\n return reader.readLine()\n .split(delimiters)\n .map { s -> s.toLong() }\n .toLongArray()\n }\n\n fun readNTimesLong(n: Int): LongArray {\n return (1..n).map { readLong() }.toLongArray()\n }\n\n fun readString(): String {\n return reader.readLine()\n }\n\n fun readStringArray(delimiters: String = \" \"): Array {\n return readString().split(delimiters).toTypedArray()\n }\n\n fun readNTimesString(n: Int): Array {\n return (1..n).map { readString() }.toTypedArray()\n }\n\n }\n}\n\n/**\n * 要素とその個数を出力\n */\nfun Array.ofCountMap(): Map {\n return this.groupBy { it }.mapValues { it.value.count() }\n}\n\n/**\n * 文字とその個数を出力\n */\nfun String.ofCountMap(): Map {\n return this.toCharArray().ofCountMap()\n}\n\n/**\n * 文字とその個数を出力\n */\nfun CharArray.ofCountMap(): Map {\n return this.groupBy { it }.mapValues { it.value.count() }\n}\n\n/**\n * Combination, nCk mod p を求める\n * https://ja.wikipedia.org/wiki/%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%A9%E9%80%86%E6%95%B0\n * http://drken1215.hatenablog.com/entry/2018/06/08/210000\n * @param maxN 最大のn\n * @param mod 素数p\n */\nclass ModCombination(private val maxN: Int, private val mod: Int = 1000000007) {\n val fac: IntArray = IntArray(maxN)\n val finv: IntArray = IntArray(maxN)\n\n init {\n val inv: IntArray = IntArray(maxN)\n fac[0] = 1\n fac[1] = 1\n\n inv[0] = 1\n inv[1] = 1\n for (i in 2..maxN) {\n fac[i] = fac[i - 1] * i % mod // 累積\n // mod % i < i\n inv[i] = mod - ((inv[mod % i].toLong()) * (mod / i) % mod).toInt()\n finv[i] = finv[i - 1] * inv[i] % mod\n }\n }\n\n /**\n * nCk mod p\n */\n fun Calc(n: Int, k: Int): Int {\n if (n < k || n < 0 || k < 0) {\n return 0\n }\n\n return ((fac[n].toLong() * finv[k] % mod) * finv[n - k] % mod).toInt()\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3676, "cpu_time_ms": 228, "memory_kb": 35524}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s196630160", "group_id": "codeNet:p03835", "input_text": "fun main(args: Array) {\n val (K, S) = readLine()!!.split(\" \").map(String::toInt)\n\n var cnt = 0\n for (X in 0..K) {\n for (Y in 0..K) {\n val Z = S - X - Y\n if (Z in 0..K) {\n cnt++\n }\n }\n }\n println(cnt)\n}\n\n", "language": "Kotlin", "metadata": {"date": 1567476533, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s196630160.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s196630160", "user_id": "u085288971"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "fun main(args: Array) {\n val (K, S) = readLine()!!.split(\" \").map(String::toInt)\n\n var cnt = 0\n for (X in 0..K) {\n for (Y in 0..K) {\n val Z = S - X - Y\n if (Z in 0..K) {\n cnt++\n }\n }\n }\n println(cnt)\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 288, "cpu_time_ms": 255, "memory_kb": 37992}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s085864499", "group_id": "codeNet:p03835", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val k = scanner.nextInt()\n val s = scanner.nextInt()\n var answer = 0\n for (x in 0..k) {\n for (y in 0..k) {\n val z = s - x - y\n if (z in 0..k) {\n answer++\n }\n }\n }\n print(answer)\n\n}", "language": "Kotlin", "metadata": {"date": 1565966835, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s085864499.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s085864499", "user_id": "u482066761"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val scanner = Scanner(System.`in`)\n val k = scanner.nextInt()\n val s = scanner.nextInt()\n var answer = 0\n for (x in 0..k) {\n for (y in 0..k) {\n val z = s - x - y\n if (z in 0..k) {\n answer++\n }\n }\n }\n print(answer)\n\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 352, "cpu_time_ms": 191, "memory_kb": 31376}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s925836974", "group_id": "codeNet:p03835", "input_text": "fun main(args: Array) {\n val (K, S) = readLine()!!.split(\" \").map(String::toInt)\n var ans = 0\n (0..K).forEach { X ->\n (0..K).forEach {Y ->\n (0..K).forEach { Z ->\n if (X+Y+Z == S) {\n ans = ans + 1\n }\n }\n }\n }\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1563492540, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s925836974.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s925836974", "user_id": "u794753968"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "fun main(args: Array) {\n val (K, S) = readLine()!!.split(\" \").map(String::toInt)\n var ans = 0\n (0..K).forEach { X ->\n (0..K).forEach {Y ->\n (0..K).forEach { Z ->\n if (X+Y+Z == S) {\n ans = ans + 1\n }\n }\n }\n }\n println(ans)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 275, "cpu_time_ms": 2111, "memory_kb": 48608}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s065736561", "group_id": "codeNet:p03835", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\n\nval pw = PrintWriter(System.out)\n\nfun main(args: Array) {\n val (k, s) = readListOfInt()\n\n var cnt = 0\n for(i in 0..k) {\n for(j in 0..k) {\n val x = s - i - j\n if(x >= 0 && x <= k) {\n cnt++\n }\n }\n }\n println(cnt)\n pw.flush()\n}\n\nfun inputList() = \n readLine()!!.split(\" \").map(String::toInt)\n\nfun sum_digits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\n/****** Decrared Functions ******/\n\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\n\nfun println(value : Any) {\n pw.println(value)\n}\n\nfun gcd(a: Long, b: Long): Long = \n if(b != 0L) a else gcd(b, a % b)\n\nfun lcm(a: Long, b: Long) = \n if(b==0L) a else gcd(b, a % b)\n", "language": "Kotlin", "metadata": {"date": 1563164214, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s065736561.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s065736561", "user_id": "u026686258"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\n\nval pw = PrintWriter(System.out)\n\nfun main(args: Array) {\n val (k, s) = readListOfInt()\n\n var cnt = 0\n for(i in 0..k) {\n for(j in 0..k) {\n val x = s - i - j\n if(x >= 0 && x <= k) {\n cnt++\n }\n }\n }\n println(cnt)\n pw.flush()\n}\n\nfun inputList() = \n readLine()!!.split(\" \").map(String::toInt)\n\nfun sum_digits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\n/****** Decrared Functions ******/\n\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\n\nfun println(value : Any) {\n pw.println(value)\n}\n\nfun gcd(a: Long, b: Long): Long = \n if(b != 0L) a else gcd(b, a % b)\n\nfun lcm(a: Long, b: Long) = \n if(b==0L) a else gcd(b, a % b)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1233, "cpu_time_ms": 252, "memory_kb": 35996}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s999632510", "group_id": "codeNet:p03835", "input_text": "import java.util.*\n\nfun main(args : Array) {\n val sc = Scanner(System.`in`)\n val k = sc.nextInt()\n val s = sc.nextInt()\n\n var result = 0\n for (x in 0..k) {\n for (y in 0..k) {\n if (x + y > s) break\n for (z in 0..k) {\n if (x + y + z > s) break\n val sum = x + y + z\n if (sum == s) result++\n }\n }\n }\n print(result)\n}", "language": "Kotlin", "metadata": {"date": 1562464732, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s999632510.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s999632510", "user_id": "u073232808"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.util.*\n\nfun main(args : Array) {\n val sc = Scanner(System.`in`)\n val k = sc.nextInt()\n val s = sc.nextInt()\n\n var result = 0\n for (x in 0..k) {\n for (y in 0..k) {\n if (x + y > s) break\n for (z in 0..k) {\n if (x + y + z > s) break\n val sum = x + y + z\n if (sum == s) result++\n }\n }\n }\n print(result)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 433, "cpu_time_ms": 2111, "memory_kb": 31400}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s657746034", "group_id": "codeNet:p03835", "input_text": "fun main(args : Array) { \n val (K, S) = readLine()!!.split(\" \").map { x -> x.toInt() } \n var t = (0..K).map{x->\n (0..K).map{y ->\n var z = S -x -y\n if(z >= 0 && z <= K) 1\n else 0\n }\n }.flatMap{x->x}.sum()\n println(t)\n}\n", "language": "Kotlin", "metadata": {"date": 1550327765, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s657746034.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s657746034", "user_id": "u399261731"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "fun main(args : Array) { \n val (K, S) = readLine()!!.split(\" \").map { x -> x.toInt() } \n var t = (0..K).map{x->\n (0..K).map{y ->\n var z = S -x -y\n if(z >= 0 && z <= K) 1\n else 0\n }\n }.flatMap{x->x}.sum()\n println(t)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 263, "cpu_time_ms": 1092, "memory_kb": 177716}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s859293559", "group_id": "codeNet:p03835", "input_text": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val k: Int = sc.nextInt()\n val s: Int = sc.nextInt()\n var count = 0\n for (i in 0..k) {\n for (j in 0..k) {\n if (s - i - j in 0..k) {\n count++\n }\n }\n }\n println(count)\n}", "language": "Kotlin", "metadata": {"date": 1547833191, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s859293559.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s859293559", "user_id": "u602865659"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val k: Int = sc.nextInt()\n val s: Int = sc.nextInt()\n var count = 0\n for (i in 0..k) {\n for (j in 0..k) {\n if (s - i - j in 0..k) {\n count++\n }\n }\n }\n println(count)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 323, "cpu_time_ms": 195, "memory_kb": 31396}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s598712735", "group_id": "codeNet:p03835", "input_text": "private fun readInts() = readLine()!!.split(\" \").map { it.toInt() }\n\nfun main(args: Array) {\n val (K, S) = readInts()\n\n var c = 0\n for (x in 0..K) {\n for (y in 0..K) {\n val z = S - x - y\n if (!(z < 0 || K < z) && x + y + z == S) c++\n }\n }\n\n println(c)\n}", "language": "Kotlin", "metadata": {"date": 1527286566, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03835.html", "problem_id": "p03835", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03835/input.txt", "sample_output_relpath": "derived/input_output/data/p03835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03835/Kotlin/s598712735.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s598712735", "user_id": "u963316883"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "private fun readInts() = readLine()!!.split(\" \").map { it.toInt() }\n\nfun main(args: Array) {\n val (K, S) = readInts()\n\n var c = 0\n for (x in 0..K) {\n for (y in 0..K) {\n val z = S - x - y\n if (!(z < 0 || K < z) && x + y + z == S) c++\n }\n }\n\n println(c)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "sample_input": "2 2\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03835", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two integers K and S.\n\nThree variable X, Y and Z takes integer values satisfying 0≤X,Y,Z≤K.\n\nHow many different assignments of values to X, Y and Z are there such that X + Y + Z = S?\n\nConstraints\n\n2≤K≤2500\n\n0≤S≤3K\n\nK and S are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nK S\n\nOutput\n\nPrint the number of the triples of X, Y and Z that satisfy the condition.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n6\n\nThere are six triples of X, Y and Z that satisfy the condition:\n\nX = 0, Y = 0, Z = 2\n\nX = 0, Y = 2, Z = 0\n\nX = 2, Y = 0, Z = 0\n\nX = 0, Y = 1, Z = 1\n\nX = 1, Y = 0, Z = 1\n\nX = 1, Y = 1, Z = 0\n\nSample Input 2\n\n5 15\n\nSample Output 2\n\n1\n\nThe maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 312, "cpu_time_ms": 245, "memory_kb": 36004}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s836197998", "group_id": "codeNet:p03854", "input_text": "fun main(args: Array) {\n val S = readLine()!!\n\n if(check(S))\n println(\"YES\")\n else\n println(\"NO\")\n}\n\nfun check(s:String) : Boolean\n{\n var result : Boolean = false\n\n if(s == \"dreamer\" || s == \"dream\" || s == \"erase\" || s == \"eraser\")\n return true\n else {\n if(s.startsWith(\"dreamer\") || s.startsWith(\"dream\") || s.startsWith(\"erase\") || s.startsWith(\"eraser\"))\n {\n if(check(s.substring(7))) return true\n if(check(s.substring(5))) return true\n if(check(s.substring(5))) return true\n if(check(s.substring(6))) return true\n } \n return false\n }\n}", "language": "Kotlin", "metadata": {"date": 1591301029, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s836197998.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s836197998", "user_id": "u805867943"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(args: Array) {\n val S = readLine()!!\n\n if(check(S))\n println(\"YES\")\n else\n println(\"NO\")\n}\n\nfun check(s:String) : Boolean\n{\n var result : Boolean = false\n\n if(s == \"dreamer\" || s == \"dream\" || s == \"erase\" || s == \"eraser\")\n return true\n else {\n if(s.startsWith(\"dreamer\") || s.startsWith(\"dream\") || s.startsWith(\"erase\") || s.startsWith(\"eraser\"))\n {\n if(check(s.substring(7))) return true\n if(check(s.substring(5))) return true\n if(check(s.substring(5))) return true\n if(check(s.substring(6))) return true\n } \n return false\n }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 694, "cpu_time_ms": 2111, "memory_kb": 308684}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s479044529", "group_id": "codeNet:p03854", "input_text": "fun main(args: Array) {\n val S = readLine()!!\n var T = \"\"\n var ans = \"NO\"\n val length = S.length\n\n var i = 0\n while (i < length) {\n // 最初がdかeじゃなければ終了。また文字列長が不十分な場合も終了。\n if(S[i] == 'd' && length - i >= 5){\n // dreamとなっているか調べる\n if(S[i+1] == 'r' && S[i+2] == 'e' && S[i+3] == 'a' && S[i+4] == 'm') {\n // dreamかdreamerかを調べる\n // 文字列の終端か次の文字がe以外だったらdream\n if(i+4 == length - 1 || S[i+5] != 'e') {\n i += 5\n } else if(length - i >= 7 && S[i+5] == 'e' && S[i+6] == 'r') {\n i += 7\n } else break;\n } else break;\n } else if(S[i] == 'e' && length - i >= 5) {\n // erasとなっているか調べる\n if(S[i+1] == 'r' && S[i+2] == 'a' && S[i+3] == 's' && S[i+4] == 'e') {\n // eraseかeraserかを調べる\n // 文字列の終端か次の文字がr以外だったらerase\n if(i+4 == length -1 || S[i+5] != 'r')\n {\n i += 5\n } else if(length - i >= 6 && S[i+5] == 'r') {\n i += 6\n } else break;\n } else break;\n } else break;\n }\n\n if(i == S.length) ans = \"YES\"\n\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1591295030, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s479044529.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s479044529", "user_id": "u805867943"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(args: Array) {\n val S = readLine()!!\n var T = \"\"\n var ans = \"NO\"\n val length = S.length\n\n var i = 0\n while (i < length) {\n // 最初がdかeじゃなければ終了。また文字列長が不十分な場合も終了。\n if(S[i] == 'd' && length - i >= 5){\n // dreamとなっているか調べる\n if(S[i+1] == 'r' && S[i+2] == 'e' && S[i+3] == 'a' && S[i+4] == 'm') {\n // dreamかdreamerかを調べる\n // 文字列の終端か次の文字がe以外だったらdream\n if(i+4 == length - 1 || S[i+5] != 'e') {\n i += 5\n } else if(length - i >= 7 && S[i+5] == 'e' && S[i+6] == 'r') {\n i += 7\n } else break;\n } else break;\n } else if(S[i] == 'e' && length - i >= 5) {\n // erasとなっているか調べる\n if(S[i+1] == 'r' && S[i+2] == 'a' && S[i+3] == 's' && S[i+4] == 'e') {\n // eraseかeraserかを調べる\n // 文字列の終端か次の文字がr以外だったらerase\n if(i+4 == length -1 || S[i+5] != 'r')\n {\n i += 5\n } else if(length - i >= 6 && S[i+5] == 'r') {\n i += 6\n } else break;\n } else break;\n } else break;\n }\n\n if(i == S.length) ans = \"YES\"\n\n println(ans)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1455, "cpu_time_ms": 233, "memory_kb": 34316}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s248327998", "group_id": "codeNet:p03854", "input_text": "fun main(args: Array) {\n var s = StringBuilder(readLine()!!)\n val words = listOf(\"dream\", \"erase\", \"eraser\", \"dreamer\")\n whileloop@ while(s.isNotEmpty()) {\n for(word in words){\n if(s.endsWith(word)){\n s = s.delete(s.length - word.length, s.length)\n continue@whileloop\n }\n }\n println(\"NO\")\n return\n }\n println(\"YES\")\n}", "language": "Kotlin", "metadata": {"date": 1590526440, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s248327998.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s248327998", "user_id": "u556570650"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(args: Array) {\n var s = StringBuilder(readLine()!!)\n val words = listOf(\"dream\", \"erase\", \"eraser\", \"dreamer\")\n whileloop@ while(s.isNotEmpty()) {\n for(word in words){\n if(s.endsWith(word)){\n s = s.delete(s.length - word.length, s.length)\n continue@whileloop\n }\n }\n println(\"NO\")\n return\n }\n println(\"YES\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 420, "cpu_time_ms": 325, "memory_kb": 39304}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s497698687", "group_id": "codeNet:p03854", "input_text": "fun main(args: Array){\n val s = readLine()!!\n\n fun search(sub: String): Boolean {\n if(s == sub){\n return true\n }\n if(sub.length > s.length){\n return false\n }\n return search(sub + \"dream\") ||\n search(sub + \"dreamer\") ||\n search(sub + \"erase\") ||\n search(sub + \"eraser\")\n }\n\n println(if(search(\"\")) \"YES\" else \"NO\")\n}", "language": "Kotlin", "metadata": {"date": 1589421185, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s497698687.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Memory Limit Exceeded", "submission_id": "s497698687", "user_id": "u531770859"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(args: Array){\n val s = readLine()!!\n\n fun search(sub: String): Boolean {\n if(s == sub){\n return true\n }\n if(sub.length > s.length){\n return false\n }\n return search(sub + \"dream\") ||\n search(sub + \"dreamer\") ||\n search(sub + \"erase\") ||\n search(sub + \"eraser\")\n }\n\n println(if(search(\"\")) \"YES\" else \"NO\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 413, "cpu_time_ms": 883, "memory_kb": 304056}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s645017075", "group_id": "codeNet:p03854", "input_text": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n var s = sc.nextLine()\n var ok = true\n do {\n ok = false\n if (s.endsWith(\"eraser\")) {\n s = s.removeSuffix(\"eraser\")\n ok = true\n } else if (s.endsWith(\"erase\")) {\n s = s.removeSuffix(\"erase\")\n ok = true\n } else if (s.endsWith(\"dreamer\")) {\n s = s.removeSuffix(\"dreamer\")\n ok = true\n } else if (s.endsWith(\"dream\")) {\n s = s.removeSuffix(\"dream\")\n ok = true\n }\n } while (ok)\n println(if (s.length == 0) \"YES\" else \"NO\")\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}", "language": "Kotlin", "metadata": {"date": 1586346211, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s645017075.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s645017075", "user_id": "u190507186"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.io.BufferedReader\nimport java.io.InputStream\nimport java.io.InputStreamReader\nimport java.io.PrintWriter\nimport java.lang.StringBuilder\nimport java.util.*\n\nfun PrintWriter.solve(sc: FastScanner) {\n var s = sc.nextLine()\n var ok = true\n do {\n ok = false\n if (s.endsWith(\"eraser\")) {\n s = s.removeSuffix(\"eraser\")\n ok = true\n } else if (s.endsWith(\"erase\")) {\n s = s.removeSuffix(\"erase\")\n ok = true\n } else if (s.endsWith(\"dreamer\")) {\n s = s.removeSuffix(\"dreamer\")\n ok = true\n } else if (s.endsWith(\"dream\")) {\n s = s.removeSuffix(\"dream\")\n ok = true\n }\n } while (ok)\n println(if (s.length == 0) \"YES\" else \"NO\")\n}\n\nfun main(args: Array) {\n val writer = PrintWriter(System.out, false)\n writer.solve(FastScanner(System.`in`))\n writer.flush()\n}\n\nclass FastScanner(s: InputStream) {\n private var st = StringTokenizer(\"\")\n private val br = BufferedReader(InputStreamReader(s))\n\n fun next(): String {\n while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())\n\n return st.nextToken()\n }\n\n fun nextInt() = next().toInt()\n fun nextLong() = next().toLong()\n fun nextLine() = br.readLine()\n fun nextDouble() = next().toDouble()\n fun ready() = br.ready()\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1368, "cpu_time_ms": 590, "memory_kb": 114600}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s688045504", "group_id": "codeNet:p03854", "input_text": "fun main(arg: Array) {\n var S = next()\n val K = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\")\n do {\n if (S.length == 0) return println(\"YES\")\n var done = false\n for (k in K)\n if (S.endsWith(k)) {\n S = S.substring(0, S.length - k.length)\n done = true\n break\n }\n } while (done)\n println(\"NO\")\n}\n\nfun next() = readLine()!!\n", "language": "Kotlin", "metadata": {"date": 1586290844, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s688045504.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s688045504", "user_id": "u043150661"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(arg: Array) {\n var S = next()\n val K = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\")\n do {\n if (S.length == 0) return println(\"YES\")\n var done = false\n for (k in K)\n if (S.endsWith(k)) {\n S = S.substring(0, S.length - k.length)\n done = true\n break\n }\n } while (done)\n println(\"NO\")\n}\n\nfun next() = readLine()!!\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 431, "cpu_time_ms": 624, "memory_kb": 118848}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s538291674", "group_id": "codeNet:p03854", "input_text": "fun main(arg: Array) {\n var S = next()\n val K = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\")\n do {\n var done = false\n if (S.length == 0) return println(\"YES\")\n for (n in K.indices)\n if (S.endsWith(K[n])) {\n S = S.substring(0, S.length - K[n].length)\n done = true\n break\n }\n } while (done)\n println(\"NO\")\n}\n\nfun next() = readLine()!!\n", "language": "Kotlin", "metadata": {"date": 1586289352, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s538291674.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s538291674", "user_id": "u043150661"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(arg: Array) {\n var S = next()\n val K = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\")\n do {\n var done = false\n if (S.length == 0) return println(\"YES\")\n for (n in K.indices)\n if (S.endsWith(K[n])) {\n S = S.substring(0, S.length - K[n].length)\n done = true\n break\n }\n } while (done)\n println(\"NO\")\n}\n\nfun next() = readLine()!!\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 445, "cpu_time_ms": 623, "memory_kb": 117184}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s211829636", "group_id": "codeNet:p03854", "input_text": " fun main(args: Array) {\n val input = read()\n println(daydream(input))\n }\n\n enum class Choices { dream, dreamer, erase, eraser }\n\n fun read(): String {\n return readLine()!!\n }\n\n fun daydream(input: String): String {\n val reversed = input.reversed()\n val reversedChoices = Choices.values().map { it.name.reversed() }\n\n tailrec fun erasing(str: String): Boolean {\n if (str.isEmpty()) return true\n val found = reversedChoices.find { it.substring(0, 3) == str.substring(0, 3) }\n if (found == null || str.length < found.length || str.substring(0, found.length) != found)\n return false\n else\n return erasing(str.drop(found.length))\n }\n\n return if (erasing(reversed)) \"YES\" else \"NO\"\n }", "language": "Kotlin", "metadata": {"date": 1577607479, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s211829636.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s211829636", "user_id": "u393158689"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": " fun main(args: Array) {\n val input = read()\n println(daydream(input))\n }\n\n enum class Choices { dream, dreamer, erase, eraser }\n\n fun read(): String {\n return readLine()!!\n }\n\n fun daydream(input: String): String {\n val reversed = input.reversed()\n val reversedChoices = Choices.values().map { it.name.reversed() }\n\n tailrec fun erasing(str: String): Boolean {\n if (str.isEmpty()) return true\n val found = reversedChoices.find { it.substring(0, 3) == str.substring(0, 3) }\n if (found == null || str.length < found.length || str.substring(0, found.length) != found)\n return false\n else\n return erasing(str.drop(found.length))\n }\n\n return if (erasing(reversed)) \"YES\" else \"NO\"\n }", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 838, "cpu_time_ms": 584, "memory_kb": 117020}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s629624742", "group_id": "codeNet:p03854", "input_text": "fun main(args: Array) {\n abc049c()\n}\n\nfun abc049c() {\n var s = readLine()!!\n val words = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\")\n\n while (s.isNotBlank()) {\n if (words.none { word ->\n if (s.endsWith(word)) {\n s = s.slice(0..s.lastIndex - word.length)\n true\n } else false\n }) return println(\"NO\")\n }\n\n println(\"YES\")\n}\n", "language": "Kotlin", "metadata": {"date": 1572057733, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s629624742.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s629624742", "user_id": "u139478771"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(args: Array) {\n abc049c()\n}\n\nfun abc049c() {\n var s = readLine()!!\n val words = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\")\n\n while (s.isNotBlank()) {\n if (words.none { word ->\n if (s.endsWith(word)) {\n s = s.slice(0..s.lastIndex - word.length)\n true\n } else false\n }) return println(\"NO\")\n }\n\n println(\"YES\")\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 435, "cpu_time_ms": 736, "memory_kb": 121156}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s680627096", "group_id": "codeNet:p03854", "input_text": "fun main(args: Array) {\n val additionForT = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\")\n\n val s = readLine()!!\n\n val flag = checkCanSame(s, additionForT)\n\n if (flag) {\n println(\"YES\")\n } else {\n println(\"NO\")\n }\n}\n\nfun checkCanSame(s: String, additionForT: List): Boolean {\n for (add1 in additionForT) {\n for (add2 in additionForT) {\n if (s.endsWith(add1)) {\n val subS = s.substring(0, s.length - add1.length)\n println(subS)\n if (subS.endsWith(add2)) {\n return true\n }\n }\n }\n }\n return false\n}", "language": "Kotlin", "metadata": {"date": 1570011795, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s680627096.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s680627096", "user_id": "u605053892"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(args: Array) {\n val additionForT = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\")\n\n val s = readLine()!!\n\n val flag = checkCanSame(s, additionForT)\n\n if (flag) {\n println(\"YES\")\n } else {\n println(\"NO\")\n }\n}\n\nfun checkCanSame(s: String, additionForT: List): Boolean {\n for (add1 in additionForT) {\n for (add2 in additionForT) {\n if (s.endsWith(add1)) {\n val subS = s.substring(0, s.length - add1.length)\n println(subS)\n if (subS.endsWith(add2)) {\n return true\n }\n }\n }\n }\n return false\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 667, "cpu_time_ms": 266, "memory_kb": 38504}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s389238720", "group_id": "codeNet:p03854", "input_text": "fun main(args: Array) {\n val additionForT = arrayOf(\"dream\", \"dreamer\", \"erase\", \"eraser\")\n\n val s = readLine() ?: return\n\n val flag = checkCanSame(s, additionForT)\n\n if (flag) {\n println(\"YES\")\n } else {\n println(\"NO\")\n }\n}\n\nfun checkCanSame(s: String, additionForT: Array): Boolean {\n for (add1 in additionForT) {\n for (add2 in additionForT) {\n val t = \"$add1$add2\"\n if (s.equals(t)) return true\n }\n }\n return false\n}", "language": "Kotlin", "metadata": {"date": 1570010460, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s389238720.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s389238720", "user_id": "u605053892"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(args: Array) {\n val additionForT = arrayOf(\"dream\", \"dreamer\", \"erase\", \"eraser\")\n\n val s = readLine() ?: return\n\n val flag = checkCanSame(s, additionForT)\n\n if (flag) {\n println(\"YES\")\n } else {\n println(\"NO\")\n }\n}\n\nfun checkCanSame(s: String, additionForT: Array): Boolean {\n for (add1 in additionForT) {\n for (add2 in additionForT) {\n val t = \"$add1$add2\"\n if (s.equals(t)) return true\n }\n }\n return false\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 512, "cpu_time_ms": 237, "memory_kb": 33636}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s753615012", "group_id": "codeNet:p03854", "input_text": "fun main(args: Array)\n{\n var s = readString().reversed()\n val words = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\").map{ it.reversed() }\n\n var flag = true\n while(flag && s.length > 0)\n {\n val containFlag = if (s.take(words[0].length) == words[0])\n {\n 0\n }\n else if (s.take(words[1].length) == words[1])\n {\n 1\n }\n else if (s.take(words[2].length) == words[2])\n {\n 2\n }\n else if (s.take(words[3].length) == words[3])\n {\n 3\n }\n else\n {\n -1\n }\n \n if (containFlag != -1)\n {\n s = s.drop(words[containFlag].length)\n }\n else\n {\n flag = false\n }\n }\n\n println(if (flag) \"YES\" else \"NO\")\n}\n\n// Read an integer\n// Usage: val a = readInt()\nfun readInt() = readLine()!!.toInt()\n\n// Read N integers separated by \" \"\n// Usage: val (a, b, c) = readNInts()\nfun readNInts() = readLine()!!.split(\" \").map(String::toInt)\n\n// Read a string\n// Usage: val a = readString()\nfun readString() = readLine()!!\n", "language": "Kotlin", "metadata": {"date": 1565561810, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s753615012.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s753615012", "user_id": "u118477733"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(args: Array)\n{\n var s = readString().reversed()\n val words = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\").map{ it.reversed() }\n\n var flag = true\n while(flag && s.length > 0)\n {\n val containFlag = if (s.take(words[0].length) == words[0])\n {\n 0\n }\n else if (s.take(words[1].length) == words[1])\n {\n 1\n }\n else if (s.take(words[2].length) == words[2])\n {\n 2\n }\n else if (s.take(words[3].length) == words[3])\n {\n 3\n }\n else\n {\n -1\n }\n \n if (containFlag != -1)\n {\n s = s.drop(words[containFlag].length)\n }\n else\n {\n flag = false\n }\n }\n\n println(if (flag) \"YES\" else \"NO\")\n}\n\n// Read an integer\n// Usage: val a = readInt()\nfun readInt() = readLine()!!.toInt()\n\n// Read N integers separated by \" \"\n// Usage: val (a, b, c) = readNInts()\nfun readNInts() = readLine()!!.split(\" \").map(String::toInt)\n\n// Read a string\n// Usage: val a = readString()\nfun readString() = readLine()!!\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1141, "cpu_time_ms": 639, "memory_kb": 121128}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s439236430", "group_id": "codeNet:p03854", "input_text": "fun main(args: Array) {\n val input = readLine()!!.reversed()\n val words = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\").map(String::reversed)\n val wl = words.map{it to it.length}\n var position = 0\n val len = input.length\n var ret = true\n loop@ while(position < len){\n for((w, l) in wl){\n if(position + l < len + 1 && input.substring(position, position + l) == w){\n position += l\n continue@loop\n }\n }\n ret = false\n break@loop\n }\n print(if(ret)\"YES\" else \"NO\")\n}", "language": "Kotlin", "metadata": {"date": 1562437395, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s439236430.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s439236430", "user_id": "u526818046"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(args: Array) {\n val input = readLine()!!.reversed()\n val words = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\").map(String::reversed)\n val wl = words.map{it to it.length}\n var position = 0\n val len = input.length\n var ret = true\n loop@ while(position < len){\n for((w, l) in wl){\n if(position + l < len + 1 && input.substring(position, position + l) == w){\n position += l\n continue@loop\n }\n }\n ret = false\n break@loop\n }\n print(if(ret)\"YES\" else \"NO\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 575, "cpu_time_ms": 314, "memory_kb": 40680}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s510010202", "group_id": "codeNet:p03854", "input_text": "fun main(args: Array) {\n val s = StringBuilder(readLine()!!)\n while (s.isNotEmpty()) {\n if (s.endsWith(\"dream\")) {\n s.delete(s.length - 5, s.length)\n } else if (s.endsWith(\"dreamer\")) {\n s.delete(s.length - 7, s.length)\n } else if (s.endsWith(\"erase\")) {\n s.delete(s.length - 5, s.length)\n } else if (s.endsWith(\"eraser\")) {\n s.delete(s.length - 6, s.length)\n } else {\n println(\"NO\")\n return\n }\n }\n println(\"YES\")\n}\n", "language": "Kotlin", "metadata": {"date": 1548828826, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s510010202.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s510010202", "user_id": "u051841332"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(args: Array) {\n val s = StringBuilder(readLine()!!)\n while (s.isNotEmpty()) {\n if (s.endsWith(\"dream\")) {\n s.delete(s.length - 5, s.length)\n } else if (s.endsWith(\"dreamer\")) {\n s.delete(s.length - 7, s.length)\n } else if (s.endsWith(\"erase\")) {\n s.delete(s.length - 5, s.length)\n } else if (s.endsWith(\"eraser\")) {\n s.delete(s.length - 6, s.length)\n } else {\n println(\"NO\")\n return\n }\n }\n println(\"YES\")\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 544, "cpu_time_ms": 279, "memory_kb": 34364}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s797588566", "group_id": "codeNet:p03854", "input_text": "import java.io.InputStream\nimport java.io.PrintStream\nimport java.util.*\n\nclass Arc065A(\n val input: InputStream,\n val output: PrintStream\n) {\n fun proc() {\n val sc = Scanner(input)\n var input = sc.nextLine()\n\n val strs = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\")\n\n while (input.isNotEmpty()) {\n val a = strs.find { input.endsWith(it) }\n if (a == null) {\n output.print(\"NO\")\n return\n }\n input = input.removeSuffix(a)\n }\n output.print(\"YES\")\n }\n}\n\nfun main(args: Array) {\n Arc065A(System.`in`, System.out).proc()\n}\n", "language": "Kotlin", "metadata": {"date": 1542356121, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s797588566.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s797588566", "user_id": "u905389316"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "import java.io.InputStream\nimport java.io.PrintStream\nimport java.util.*\n\nclass Arc065A(\n val input: InputStream,\n val output: PrintStream\n) {\n fun proc() {\n val sc = Scanner(input)\n var input = sc.nextLine()\n\n val strs = listOf(\"dream\", \"dreamer\", \"erase\", \"eraser\")\n\n while (input.isNotEmpty()) {\n val a = strs.find { input.endsWith(it) }\n if (a == null) {\n output.print(\"NO\")\n return\n }\n input = input.removeSuffix(a)\n }\n output.print(\"YES\")\n }\n}\n\nfun main(args: Array) {\n Arc065A(System.`in`, System.out).proc()\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 657, "cpu_time_ms": 709, "memory_kb": 120304}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s263119325", "group_id": "codeNet:p03854", "input_text": "private fun readStrings() = readLine()!!.split(\" \")\nprivate fun readInts() = readStrings().map { it.toInt() }\n\nprivate fun String.dropIfStartsWith(s: String) = if (startsWith(s)) drop(s.length) else null\n\nval targets = listOf(\"dreamer\", \"dream\", \"eraser\", \"erase\")\n\nprivate fun String.searchSeparationPath(): Unit? =\n if (isEmpty()) Unit\n else targets.mapNotNull {\n dropIfStartsWith(it)?.searchSeparationPath()\n }.firstOrNull()\n\nfun main(args: Array) {\n val S = readLine()!!\n println(if(S.searchSeparationPath() != null) \"YES\" else \"NO\")\n}", "language": "Kotlin", "metadata": {"date": 1520920069, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s263119325.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Memory Limit Exceeded", "submission_id": "s263119325", "user_id": "u909304507"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "private fun readStrings() = readLine()!!.split(\" \")\nprivate fun readInts() = readStrings().map { it.toInt() }\n\nprivate fun String.dropIfStartsWith(s: String) = if (startsWith(s)) drop(s.length) else null\n\nval targets = listOf(\"dreamer\", \"dream\", \"eraser\", \"erase\")\n\nprivate fun String.searchSeparationPath(): Unit? =\n if (isEmpty()) Unit\n else targets.mapNotNull {\n dropIfStartsWith(it)?.searchSeparationPath()\n }.firstOrNull()\n\nfun main(args: Array) {\n val S = readLine()!!\n println(if(S.searchSeparationPath() != null) \"YES\" else \"NO\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 585, "cpu_time_ms": 550, "memory_kb": 302840}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s314537643", "group_id": "codeNet:p03854", "input_text": "private fun readStrings() = readLine()!!.split(\" \")\nprivate fun readInts() = readStrings().map { it.toInt() }\n\nprivate fun String.dropIfStartsWith(s: String) = if (startsWith(s)) drop(s.length) else null\n\nprivate fun String.searchSeparationPath(targets: List): Unit? =\n if (isEmpty()) Unit\n else targets.mapNotNull {\n dropIfStartsWith(it)?.searchSeparationPath(targets)\n }.firstOrNull()\n\nfun main(args: Array) {\n val S = readLine()!!\n val targets = listOf(\"dreamer\", \"dream\", \"eraser\", \"erase\")\n println(if(S.searchSeparationPath(targets) != null) \"YES\" else \"NO\")\n}", "language": "Kotlin", "metadata": {"date": 1520919969, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03854.html", "problem_id": "p03854", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03854/input.txt", "sample_output_relpath": "derived/input_output/data/p03854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03854/Kotlin/s314537643.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Memory Limit Exceeded", "submission_id": "s314537643", "user_id": "u909304507"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "private fun readStrings() = readLine()!!.split(\" \")\nprivate fun readInts() = readStrings().map { it.toInt() }\n\nprivate fun String.dropIfStartsWith(s: String) = if (startsWith(s)) drop(s.length) else null\n\nprivate fun String.searchSeparationPath(targets: List): Unit? =\n if (isEmpty()) Unit\n else targets.mapNotNull {\n dropIfStartsWith(it)?.searchSeparationPath(targets)\n }.firstOrNull()\n\nfun main(args: Array) {\n val S = readLine()!!\n val targets = listOf(\"dreamer\", \"dream\", \"eraser\", \"erase\")\n println(if(S.searchSeparationPath(targets) != null) \"YES\" else \"NO\")\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03854", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 623, "cpu_time_ms": 544, "memory_kb": 303784}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s789441553", "group_id": "codeNet:p03856", "input_text": "fun main(args: Array) {\n val s = readLine()!!\n var i = s.length - 1\n while (i > 0) {\n if (i - 4 >= 0 && s.substring(i - 4..i) == \"dream\") {\n i -= 5\n } else if (i - 6 >= 0 && s.substring(i - 6..i) == \"dreamer\") {\n i -= 7\n } else if (i - 4 >= 0 && s.substring(i - 4..i) == \"erase\") {\n i -= 5\n } else if (i - 5 >= 0 && s.substring(i - 5..i) == \"eraser\") {\n i -= 6\n } else {\n println(\"NO\")\n return\n }\n }\n println(\"YES\")\n}\n", "language": "Kotlin", "metadata": {"date": 1570188955, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03856.html", "problem_id": "p03856", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03856/input.txt", "sample_output_relpath": "derived/input_output/data/p03856/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03856/Kotlin/s789441553.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s789441553", "user_id": "u858748695"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!\n var i = s.length - 1\n while (i > 0) {\n if (i - 4 >= 0 && s.substring(i - 4..i) == \"dream\") {\n i -= 5\n } else if (i - 6 >= 0 && s.substring(i - 6..i) == \"dreamer\") {\n i -= 7\n } else if (i - 4 >= 0 && s.substring(i - 4..i) == \"erase\") {\n i -= 5\n } else if (i - 5 >= 0 && s.substring(i - 5..i) == \"eraser\") {\n i -= 6\n } else {\n println(\"NO\")\n return\n }\n }\n println(\"YES\")\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "sample_input": "erasedream\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03856", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nAnother string T is initially empty.\nDetermine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:\n\nAppend one of the following at the end of T: dream, dreamer, erase and eraser.\n\nConstraints\n\n1≦|S|≦10^5\n\nS consists of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to obtain S = T, print YES. Otherwise, print NO.\n\nSample Input 1\n\nerasedream\n\nSample Output 1\n\nYES\n\nAppend erase and dream at the end of T in this order, to obtain S = T.\n\nSample Input 2\n\ndreameraser\n\nSample Output 2\n\nYES\n\nAppend dream and eraser at the end of T in this order, to obtain S = T.\n\nSample Input 3\n\ndreamerer\n\nSample Output 3\n\nNO", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 479, "cpu_time_ms": 298, "memory_kb": 39036}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s919157594", "group_id": "codeNet:p03945", "input_text": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun Iterable.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\nfun Array.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\nfun main() {\n val S = next()\n var ans = 0\n for (i in 1 until S.length) {\n if (S[i - 1] != S[i]) ans++\n }\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1591935279, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Kotlin/s919157594.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s919157594", "user_id": "u860789370"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.PrintWriter\n\nfun next() = readLine()!!\nfun nextInt() = next().toInt()\nfun nextLong() = next().toLong()\nfun nextDouble() = next().toDouble()\nfun nextList() = next().split(\" \")\nfun nextIntList() = nextList().map(String::toInt)\nfun nextLongList() = nextList().map(String::toLong)\nfun nextDoubleList() = nextList().map(String::toDouble)\n\nval pw = PrintWriter(System.out)\nfun print(s: Any = \"\") = pw.print(s)\nfun println(s: Any = \"\") = pw.println(s)\n\nfun Iterable.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\nfun Array.join(separator: CharSequence = \", \", prefix: CharSequence = \"\", postfix: CharSequence = \"\") = joinToString(separator, prefix, postfix)\n\nfun main(args: Array) {\n main()\n pw.flush()\n}\n\nfun main() {\n val S = next()\n var ans = 0\n for (i in 1 until S.length) {\n if (S[i - 1] != S[i]) ans++\n }\n println(ans)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 972, "cpu_time_ms": 243, "memory_kb": 34204}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s232915347", "group_id": "codeNet:p03945", "input_text": "fun main(args: Array) {\n abc047c()\n}\n\nfun abc047c() {\n val s = readLine()!!\n\n if (s.all { it == 'B' }) return println(2)\n\n var answer = 0\n for (i in 0 until s.lastIndex) if (s[i] != s[i + 1]) answer++\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1571980001, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Kotlin/s232915347.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s232915347", "user_id": "u139478771"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun main(args: Array) {\n abc047c()\n}\n\nfun abc047c() {\n val s = readLine()!!\n\n if (s.all { it == 'B' }) return println(2)\n\n var answer = 0\n for (i in 0 until s.lastIndex) if (s[i] != s[i + 1]) answer++\n\n println(answer)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 247, "cpu_time_ms": 247, "memory_kb": 34324}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s288875452", "group_id": "codeNet:p03945", "input_text": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val s = read()\n var cnt = 0\n for(i in 0 until s.length-1) {\n if(s[i] != s[i+1]) {\n cnt++\n }\n }\n println(cnt)\n pw.flush()\n}\n\n/****** Decrared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j] % MOD)\n }\n }\n return v.map { it.toList() }.toList()\n}\n\nfun gcd(a: Long, b: Long): Long = \n if(b != 0L) a else gcd(b, a % b)\n\nfun lcm(a: Long, b: Long) = \n if(b==0L) a else gcd(b, a % b)\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun isDecimal(v: Double): Boolean = ((v - Math.floor(v)) != 0.0)\n\n// Data Structures\nclass Stack(private var st: MutableList = mutableListOf()) {\n fun isEmpty() = st.isEmpty()\n fun top(): T = st.last()\n fun push(e: T) { st.add(e) }\n fun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n fun isEmpty() = que.isEmpty()\n fun top(): T = que.first()\n fun push(e: T) { que.add(e) }\n fun pop() { que = que.drop(1).toMutableList() }\n}\n", "language": "Kotlin", "metadata": {"date": 1563902447, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Kotlin/s288875452.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s288875452", "user_id": "u026686258"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "import java.io.PrintWriter\nimport java.util.*\nimport java.math.*\nimport java.lang.*\n\nval pw = PrintWriter(System.out)\nval MOD: Long = (1e+9 + 7).toLong()\n\nfun main(args: Array) {\n val s = read()\n var cnt = 0\n for(i in 0 until s.length-1) {\n if(s[i] != s[i+1]) {\n cnt++\n }\n }\n println(cnt)\n pw.flush()\n}\n\n/****** Decrared Functions and Data Structures ******/\n// IO\nfun read() = readLine()!!\nfun readInt() = read().toInt()\nfun readLong() = read().toLong()\nfun readDouble() = read().toDouble()\nfun readListOfString() = read().split(\" \")\nfun readListOfInt() = readListOfString().map { it.toInt() }\nfun readListOfLong() = readListOfString().map { it.toLong() }\nfun readListOfDouble() = readListOfString().map { it.toDouble() }\n\nfun Double.format(digits: Int) = String.format(\"%.${digits}f\", this)\nfun Float.format(digits: Int) = String.format(\"%.${digits}f\", this)\n\nfun print(value: Any) { pw.print(value) }\nfun println(value : Any) { pw.println(value) }\n\nfun permutations(src: List): List> {\n if(src.size == 1) return listOf(src)\n val perms = mutableListOf>()\n val insertElement = src[0]\n permutations(src.drop(1)).forEach { perm ->\n for(i in 0..perm.size) {\n val newPerm = perm.toMutableList()\n newPerm.add(i, insertElement)\n perms.add(newPerm.toList())\n }\n }\n return perms\n}\n\n// return nCr, if you want nCr, please access v[n][r]\nfun combinations(n: Long): List> {\n val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()\n for(i in 0 until v.size) {\n v[i][0] = 1L\n v[i][i] = 1L\n }\n for(i in 0 until v.size) {\n for(j in 1 until i) {\n v[i][j] = (v[i-1][j-1] + v[i-1][j] % MOD)\n }\n }\n return v.map { it.toList() }.toList()\n}\n\nfun gcd(a: Long, b: Long): Long = \n if(b != 0L) a else gcd(b, a % b)\n\nfun lcm(a: Long, b: Long) = \n if(b==0L) a else gcd(b, a % b)\n\nfun sumDigits(num_: Long): Long {\n var num = num_\n var rtn: Long = 0\n while(num != 0.toLong()) {\n val tmp = num % 10\n rtn += tmp\n num /= 10\n }\n return rtn\n}\n\nfun isDecimal(v: Double): Boolean = ((v - Math.floor(v)) != 0.0)\n\n// Data Structures\nclass Stack(private var st: MutableList = mutableListOf()) {\n fun isEmpty() = st.isEmpty()\n fun top(): T = st.last()\n fun push(e: T) { st.add(e) }\n fun pop() { st = st.dropLast(1).toMutableList() }\n}\n\nclass Queue(private var que: MutableList = mutableListOf()) {\n fun isEmpty() = que.isEmpty()\n fun top(): T = que.first()\n fun push(e: T) { que.add(e) }\n fun pop() { que = que.drop(1).toMutableList() }\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2701, "cpu_time_ms": 239, "memory_kb": 34180}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s401061942", "group_id": "codeNet:p03945", "input_text": "fun main(args: Array) {\n var s = readLine()!!.toString()\n var c = 0\n for(i in 1..s.length-1){\n if(s[i-1] != s[i]) c++\n }\n println(c)\n}", "language": "Kotlin", "metadata": {"date": 1549906993, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Kotlin/s401061942.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s401061942", "user_id": "u399261731"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun main(args: Array) {\n var s = readLine()!!.toString()\n var c = 0\n for(i in 1..s.length-1){\n if(s[i-1] != s[i]) c++\n }\n println(c)\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 164, "cpu_time_ms": 242, "memory_kb": 34056}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s045624646", "group_id": "codeNet:p03945", "input_text": "fun main(args: Array) {\n val s = readLine()!!\n var pre = s[0]\n var border = 0\n for (i in 1..(s.length - 1)) {\n if (pre != s[i]) {\n pre = s[i]\n border++\n }\n }\n println(border)\n}\n", "language": "Kotlin", "metadata": {"date": 1548635509, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p03945.html", "problem_id": "p03945", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p03945/input.txt", "sample_output_relpath": "derived/input_output/data/p03945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03945/Kotlin/s045624646.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s045624646", "user_id": "u051841332"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "fun main(args: Array) {\n val s = readLine()!!\n var pre = s[0]\n var border = 0\n for (i in 1..(s.length - 1)) {\n if (pre != s[i]) {\n pre = s[i]\n border++\n }\n }\n println(border)\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03945", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "test_out_of_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 239, "cpu_time_ms": 235, "memory_kb": 31984}, "variant": "medium_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Kotlin:s339403971", "group_id": "codeNet:p04044", "input_text": "fun main() {\n val (n, _) = readLine()!!.split(\" \").map { it.toInt() }\n val list = mutableListOf()\n for (i in 1..n) list.add(readLine()!!)\n println(bubbleSort(n, list).joinToString(\"\"))\n}\n\nfun MutableList.swap(index1: Int, index2: Int) {\n val tmp = this[index1]\n this[index1] = this[index2]\n this[index2] = tmp\n}\n\nfun bubbleSort(listSize: Int, list: MutableList): List {\n var head = 0\n while (head < listSize - 1) {\n for (j in listSize - 1 downTo head + 1) {\n if (list[j] < list[j - 1]) {\n list.swap(j, j - 1) // list[j]とlist[j - 1]の入れ替え\n }\n }\n head ++\n }\n return list\n}", "language": "Kotlin", "metadata": {"date": 1594616036, "filename_ext": "kt", "original_language": "Kotlin (1.3.71)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Kotlin/s339403971.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s339403971", "user_id": "u817663013"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "fun main() {\n val (n, _) = readLine()!!.split(\" \").map { it.toInt() }\n val list = mutableListOf()\n for (i in 1..n) list.add(readLine()!!)\n println(bubbleSort(n, list).joinToString(\"\"))\n}\n\nfun MutableList.swap(index1: Int, index2: Int) {\n val tmp = this[index1]\n this[index1] = this[index2]\n this[index2] = tmp\n}\n\nfun bubbleSort(listSize: Int, list: MutableList): List {\n var head = 0\n while (head < listSize - 1) {\n for (j in listSize - 1 downTo head + 1) {\n if (list[j] < list[j - 1]) {\n list.swap(j, j - 1) // list[j]とlist[j - 1]の入れ替え\n }\n }\n head ++\n }\n return list\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val l = sc.nextInt()\n val s = (0 until n).map { sc.next() }\n println(problem042b(n, l, s))\n}\n\nfun problem042b(n: Int, l: Int, s: List): String {\n return s.sorted().joinToString(\"\")\n}", "language": "Kotlin", "metadata": {"date": 1591485260, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Kotlin/s957057901.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s957057901", "user_id": "u073232808"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "import java.util.*\n\nfun main(args: Array) {\n val sc = Scanner(System.`in`)\n val n = sc.nextInt()\n val l = sc.nextInt()\n val s = (0 until n).map { sc.next() }\n println(problem042b(n, l, s))\n}\n\nfun problem042b(n: Int, l: Int, s: List): String {\n return s.sorted().joinToString(\"\")\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j) {\n val (l, m) = readLine()!!.split(\" \").map { it.toInt() }\n val list = mutableListOf()\n repeat(l) {\n list.add(readLine()!!)\n }\n list.sorted().forEach { print(it) }\n}", "language": "Kotlin", "metadata": {"date": 1590951820, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Kotlin/s156009141.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s156009141", "user_id": "u124119858"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "fun main(array: Array) {\n val (l, m) = readLine()!!.split(\" \").map { it.toInt() }\n val list = mutableListOf()\n repeat(l) {\n list.add(readLine()!!)\n }\n list.sorted().forEach { print(it) }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j) {\n val (n, l) = readLine()!!.split(\" \").map(String::toInt)\n val s = (0 until n).map { readLine()!! }.toList()\n println(s.sorted().joinToString(\"\"))\n}", "language": "Kotlin", "metadata": {"date": 1590379125, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Kotlin/s411400530.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s411400530", "user_id": "u794753968"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, l) = readLine()!!.split(\" \").map(String::toInt)\n val s = (0 until n).map { readLine()!! }.toList()\n println(s.sorted().joinToString(\"\"))\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j) = yorukatsu9b()\n\nfun yorukatsu9b() {\n val (n, l) = readLine()!!.split(' ').map { it.toInt() }\n val sList = (1..n).map { readLine()!! }\n\n val answer = sList.sorted().joinToString(\"\")\n\n println(answer)\n}\n", "language": "Kotlin", "metadata": {"date": 1586308507, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Kotlin/s482843005.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s482843005", "user_id": "u139478771"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "fun main(args: Array) = yorukatsu9b()\n\nfun yorukatsu9b() {\n val (n, l) = readLine()!!.split(' ').map { it.toInt() }\n val sList = (1..n).map { readLine()!! }\n\n val answer = sList.sorted().joinToString(\"\")\n\n println(answer)\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j()\n val num = readLine()!!.split(\" \").map { it.toInt() }\n val volume = num[0]\n \n for (i in 0..volume){\n str.add(readLine()!!.toString())\n }\n str.sortedBy{it}\n for (i in str){\n if(i == str.last()) println(i)\n print(i)\n }\n}", "language": "Kotlin", "metadata": {"date": 1581293585, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Kotlin/s041170204.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s041170204", "user_id": "u255834721"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "fun main(){\n val str = mutableListOf()\n val num = readLine()!!.split(\" \").map { it.toInt() }\n val volume = num[0]\n \n for (i in 0..volume){\n str.add(readLine()!!.toString())\n }\n str.sortedBy{it}\n for (i in str){\n if(i == str.last()) println(i)\n print(i)\n }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j){\n val (n,l) = readLine()!!.split(\" \").map{it.toInt()}\n val s = ArrayList()\n for(i in 0 until n){\n s.add(readLine()!!)\n }\n s.sort()\n s.forEach{\n print(it)\n }\n println()\n}\n", "language": "Kotlin", "metadata": {"date": 1580257880, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Kotlin/s919492337.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s919492337", "user_id": "u480831358"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "import java.util.*\n\nfun main(args:Array){\n val (n,l) = readLine()!!.split(\" \").map{it.toInt()}\n val s = ArrayList()\n for(i in 0 until n){\n s.add(readLine()!!)\n }\n s.sort()\n s.forEach{\n print(it)\n }\n println()\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j) {\n val (n, l) = readLine()!!.split(\" \").map { it.toInt() }\n\n val inputs = Array(n){ readLine()!! }\n\n // ソートするだけ？？\n val sorted = inputs.sorted()\n println(sorted.joinToString(\"\"))\n}", "language": "Kotlin", "metadata": {"date": 1562809735, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Kotlin/s080810200.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s080810200", "user_id": "u889750959"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, l) = readLine()!!.split(\" \").map { it.toInt() }\n\n val inputs = Array(n){ readLine()!! }\n\n // ソートするだけ？？\n val sorted = inputs.sorted()\n println(sorted.joinToString(\"\"))\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j) {\n val (n, l) = readLine()!!.split(' ').map(String::toInt)\n val s = mutableListOf()\n (1..n).forEach { s.add(readLine()!!) }\n s.sorted().forEach { print(it) }\n println(\"\")\n}", "language": "Kotlin", "metadata": {"date": 1551731517, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Kotlin/s413511022.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s413511022", "user_id": "u099066216"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "fun main(args: Array) {\n val (n, l) = readLine()!!.split(' ').map(String::toInt)\n val s = mutableListOf()\n (1..n).forEach { s.add(readLine()!!) }\n s.sorted().forEach { print(it) }\n println(\"\")\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j) {\n val (n,l)= readLine()!!.split(\" \").map { it.toInt() }\n val s = (1..n).map { readLine()!! }\n\n val ans = s.sorted().fold(StringBuilder()){sb,it -> sb.append(it)}\n println(ans)\n}", "language": "Kotlin", "metadata": {"date": 1542223035, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Kotlin/s401395398.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s401395398", "user_id": "u914096045"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "fun main(args: Array) {\n val (n,l)= readLine()!!.split(\" \").map { it.toInt() }\n val s = (1..n).map { readLine()!! }\n\n val ans = s.sorted().fold(StringBuilder()){sb,it -> sb.append(it)}\n println(ans)\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j) {\n var a = mutableListOf()\n val (n,l) = readLine()!!.split(\" \").map(String::toInt)\n for (i in 0 until n){\n a.add(readLine()!!.toString())\n }\n println(a.sorted().reduce{x, y -> x + y})\n}", "language": "Kotlin", "metadata": {"date": 1541448026, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Kotlin/s198629685.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s198629685", "user_id": "u227189389"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "fun main(args: Array) {\n var a = mutableListOf()\n val (n,l) = readLine()!!.split(\" \").map(String::toInt)\n for (i in 0 until n){\n a.add(readLine()!!.toString())\n }\n println(a.sorted().reduce{x, y -> x + y})\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j) {\n\tval (n, l) = readLine()!!.split(' ').map { it.toInt() }\n\tval s = mutableListOf()\n\n\tfor (i in 0 until n){\n\t\ts.add(readLine()!!)\n\t}\n\ts.sort()\n\tprintln(s.joinToString(\"\"))\n}\n", "language": "Kotlin", "metadata": {"date": 1540055577, "filename_ext": "kt", "original_language": "Kotlin (1.0.0)", "problem_description_relpath": "problem_descriptions/p04044.html", "problem_id": "p04044", "resource_group": "medium_resource", "sample_input_relpath": "derived/input_output/data/p04044/input.txt", "sample_output_relpath": "derived/input_output/data/p04044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04044/Kotlin/s082177526.kt", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s082177526", "user_id": "u323680411"}, "prompt_components": {"gold_output": "axxcxxdxx\n", "input_to_evaluate": "fun main(args: Array) {\n\tval (n, l) = readLine()!!.split(' ').map { it.toInt() }\n\tval s = mutableListOf()\n\n\tfor (i in 0 until n){\n\t\ts.add(readLine()!!)\n\t}\n\ts.sort()\n\tprintln(s.joinToString(\"\"))\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.\n\nShe will concatenate all of the strings in some order, to produce a long string.\n\nAmong all strings that she can produce in this way, find the lexicographically smallest one.\n\nHere, a string s=s_1s_2s_3...s_n is lexicographically smaller than another string t=t_1t_2t_3...t_m if and only if one of the following holds:\n\nThere exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j