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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274371879,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 275259197,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274415628,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274606435,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 277898846,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 298775314,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274529859,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274401364,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274381187,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274412070,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 290047220,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274414014,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274412652,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274439607,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274490817,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274385734,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 284057660,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274974781,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 283174404,
"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: Light Switches\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There is an apartment consisting of $n$ rooms, each with its light initially turned off.... | TestCase-Eval | null | {
"problem_id": "1993C",
"submission_id": 274428097,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297910325,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297949507,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297922526,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 299541311,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297994571,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297882710,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297934132,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297875585,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297891419,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297877744,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297939138,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297948543,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 298135115,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297943847,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297878895,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297878227,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297957342,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 300933932,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297925369,
"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: Counting Pairs\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a sequence $$$a$$$, consisting of $$$n$$$ integers, where the $$$i$$$-th e... | TestCase-Eval | null | {
"problem_id": "2051D",
"submission_id": 297979741,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 299467068,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 305607892,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298501831,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 300365764,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298290144,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298485013,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 305104567,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 300955596,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298599813,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298291160,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298261140,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298564534,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298258304,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298365817,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 299118916,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298518762,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298287372,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298269845,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298321469,
"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: Matrix Transformation\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given two matrices $$$A$$$ and $$$B$$$ of size $$$n \\times m$$$, filled ... | TestCase-Eval | null | {
"problem_id": "2043E",
"submission_id": 298312738,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 256498003,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 256520381,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 282089701,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 266320580,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 266319887,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 257706681,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 283624779,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 266735449,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 256483499,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 256477712,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 256516957,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 256473215,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 256557077,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 256524570,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 259832058,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 256495968,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 258499197,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 257654951,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 280215234,
"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: Nene's Game\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Nene invented a new game based on an increasing sequence of integers $$$a_1, a_2, \\ldots, ... | TestCase-Eval | null | {
"problem_id": "1956A",
"submission_id": 256516301,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 295103109,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 299997383,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 304813163,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 295089315,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 295049859,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 295054731,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 300081947,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 300453666,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 297372896,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 302685700,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 303166902,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 299044235,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 295090294,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 295254893,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 296173614,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 295062382,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 300102382,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 300100261,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 304977735,
"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: Maximum modulo equality\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a$$$ of length $$$n$$$ and $$$q$$$ queries $$$l$$$, $... | TestCase-Eval | null | {
"problem_id": "2050F",
"submission_id": 302303340,
"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.