data_source stringclasses 1 value | prompt listlengths 1 1 | ability stringclasses 1 value | reward_model null | extra_info dict |
|---|---|---|---|---|
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 284572729,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 284595268,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 286121678,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 284721848,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 284565352,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 284968458,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 286035941,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 284571856,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 297365965,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 296516256,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 284591815,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 284598736,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 284586949,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 285791269,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 284764699,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 287418451,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 300648505,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 284567433,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 284584394,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Adjust The Presentation (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. In the two versions, th... | TestCase-Eval | null | {
"problem_id": "2021C1",
"submission_id": 296965872,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279163067,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279226125,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279168347,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 285178394,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 282220334,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 288200321,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279234512,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279240654,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279202548,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279378982,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279164912,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279189229,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279226483,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279388549,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279204566,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279165105,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 285187539,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 287551532,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279225833,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako's Hobby\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: For a certain permutation $p$$^{\\text{∗}}$ Sakurako calls an integer $j$ reachable fr... | TestCase-Eval | null | {
"problem_id": "2008D",
"submission_id": 279188476,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 264948276,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 266124355,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 264961307,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 273311685,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 284375819,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 264998499,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 268603421,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 265760630,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 268405113,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 264948485,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 264962275,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 265180388,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 264962479,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 264943904,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 265506874,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 264942362,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 265140373,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 265781169,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 284375876,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reconstruction\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is a hidden array $a_1, a_2, \\ldots, a_n$ of length $n$ whose elements are intege... | TestCase-Eval | null | {
"problem_id": "1984F",
"submission_id": 275515960,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 293934804,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 297768490,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 292352673,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 296289402,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 293311089,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 292691886,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 305024903,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 305074253,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 292189058,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 292592466,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 292444454,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 292174991,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 302757104,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 302279952,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 292188583,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 292213969,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 292181024,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 292171534,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 292649957,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Grid Walk\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You have an $$$n \\times n$$$ grid and two integers $$$a$$$ and $$$b$$$. Both the rows and th... | TestCase-Eval | null | {
"problem_id": "2038K",
"submission_id": 292178790,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 264177368,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 260591389,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 261722798,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 260423199,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 265106872,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 260424000,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 275833621,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 275512644,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 270444971,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 260817655,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 284771328,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 260878190,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 261327107,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 261307188,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 266731537,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 299214632,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 280161625,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 260390852,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 269222375,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: ±1\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Bob has a grid with $3$ rows and $n$ columns, each of which contains either $a_i$ or $-a_i$ for some... | TestCase-Eval | null | {
"problem_id": "1971H",
"submission_id": 267402948,
"task_type": "TestCase-Eval-Task2"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.