data_source stringclasses 1 value | prompt listlengths 1 1 | ability stringclasses 1 value | reward_model null | extra_info dict |
|---|---|---|---|---|
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 259756190,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 293374272,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 262218146,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 259522259,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 259519447,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 259519254,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 266082969,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 259484917,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 265732273,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 263552404,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 260441650,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 260375035,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 259499110,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 277264842,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 270099302,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 259498171,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 260559709,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 262170941,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 292698231,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Hard)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the hard version, $$$2 \\leq \\sum n \\leq 10^5$$$ and $$$1 \\leq \\sum m \\l... | TestCase-Eval | null | {
"problem_id": "1970G3",
"submission_id": 260073583,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 275923405,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 275843210,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 275844082,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 276097635,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 275974492,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 275898342,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 279460997,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 279393849,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 275886878,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 275820928,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 295537203,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 295315962,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 287914432,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 287913671,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 278022783,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 275860955,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 281273436,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 276998081,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 279461432,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cosmic Rays\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Given an array of integers $s_1, s_2, \\ldots, s_l$, every second, cosmic rays will cause a... | TestCase-Eval | null | {
"problem_id": "2002E",
"submission_id": 275844912,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 273068064,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272797447,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272849893,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272817673,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272812472,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 278045091,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272814671,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272843183,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 295869971,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272794116,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272839007,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272806502,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272787750,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272817468,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272799985,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272810098,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272809005,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 296419603,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272801205,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sort\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given two strings $a$ and $b$ of length $n$. Then, you are (forced against your will) to a... | TestCase-Eval | null | {
"problem_id": "1996C",
"submission_id": 272782913,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 259495696,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 284505962,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 258761559,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 286201212,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 304567064,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 260257786,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 300349996,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 275440162,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 259909120,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 258754460,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 258851888,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 286214156,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 258762114,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 291901113,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 283347864,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 259796101,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 275497225,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 258999545,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 258770085,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shop Game\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game in the shop. There are $$$n$$$ items in the shop; each item ... | TestCase-Eval | null | {
"problem_id": "1969D",
"submission_id": 259857052,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258909547,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258976690,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258906580,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 259743474,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258924807,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258915978,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258903610,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258933614,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258917242,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258913563,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258918463,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258919243,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 271479637,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258902645,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258958783,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258914678,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258914186,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258912536,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 260123414,
"task_type": "TestCase-Eval-Task2-DO"
} |
TestCase-Eval-Task2-DO | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D1",
"submission_id": 258896102,
"task_type": "TestCase-Eval-Task2-DO"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.