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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 283861750,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 285190316,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 283666642,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 284310017,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 283648986,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 283630385,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 284185186,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 283639731,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 284482787,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 284975165,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 291379123,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 285402146,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 288346780,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 283635925,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 293856178,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 294478500,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 283627998,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 283616310,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 283712003,
"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: Connect the Dots\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: One fine evening, Alice sat down to play the classic game \"Connect the Dots\", but wi... | TestCase-Eval | null | {
"problem_id": "2020D",
"submission_id": 283618069,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 289936998,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 297607230,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266067619,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266070642,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266212643,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 283378564,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266787570,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266465818,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266365628,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 292895058,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266796346,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266011409,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 287767125,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266171146,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266777565,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266022665,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266003679,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266046174,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 272239569,
"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: Elections\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Elections are taking place in Berland. There are $n$ candidates participating in the election... | TestCase-Eval | null | {
"problem_id": "1978D",
"submission_id": 266806817,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 291549350,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 293147123,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 290882780,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 297705225,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 297704669,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 291792634,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 290820171,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 290757812,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 290771211,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 295498306,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 297703675,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 293146973,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 290748519,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 290795371,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 293148745,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 291518806,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 291520822,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 291549644,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 293497086,
"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: Balanced Problem\ntime_limit_ms: 3000\nmemory_limit_mb: 1024\nDescription: There is an array $a$ consisting of $n$ integers. Initially, all elements of $a$ are ... | TestCase-Eval | null | {
"problem_id": "2029G",
"submission_id": 290762841,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 275183262,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 274923901,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 274923561,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 275369620,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 275220426,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 275013789,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 274944026,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 275056133,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 274908172,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 274981487,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 280467961,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 274978949,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 276321698,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 274882185,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 278944813,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 274852014,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 275062972,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 274936530,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 274816873,
"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: Expected Median\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Arul has a binary array$^{\\text{∗}}$ $a$ of length $n$.\n\nHe will take all subsequenc... | TestCase-Eval | null | {
"problem_id": "1999F",
"submission_id": 296260176,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 270822414,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 267830731,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 266450426,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 281118299,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 266192208,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 264599753,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 264631202,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 264099526,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 276417524,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 264205512,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 281115538,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 264600913,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 265925918,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 265925713,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 264046337,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 264259990,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 266191902,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 266191418,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 265871346,
"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: Field Division (hard version)\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: This is a hard version of the problem; it differs from the easy version o... | TestCase-Eval | null | {
"problem_id": "1980F2",
"submission_id": 264089421,
"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.