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: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269231402,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269261118,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269248127,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 270451916,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269251706,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269821850,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 304251867,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 304704688,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269306560,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269228502,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269238882,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269236203,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269254124,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269280906,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269353860,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 270624637,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269235185,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269227338,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269236464,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Array Divisibility\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: An array of integers $$$a_1,a_2,\\cdots,a_n$$$ is beautiful subject to an integer $$... | TestCase-Eval | null | {
"problem_id": "1983A",
"submission_id": 269245541,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285979036,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285727642,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285716690,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285721763,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285710712,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285725011,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 288945433,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285726106,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285719661,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 286078437,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 286612917,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285735563,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285726045,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285738902,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285724153,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 286067652,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285716237,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285724237,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285745423,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Gerrymandering\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: We all steal a little bit. But I have only one hand, while my adversaries have two.\n\nÁ... | TestCase-Eval | null | {
"problem_id": "2022C",
"submission_id": 285719817,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 275355842,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274676020,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 282909686,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274418627,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274417065,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274451159,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274398677,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274449949,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274986043,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274419749,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274403256,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 275171845,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 298962607,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274420008,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274917773,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 275455906,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274535144,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 274435901,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 281649394,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Xor-Grid Problem\ntime_limit_ms: 5000\nmemory_limit_mb: 256\nDescription: Given a matrix $a$ of size $n \\times m$, each cell of which contains a non-negative i... | TestCase-Eval | null | {
"problem_id": "1993E",
"submission_id": 286079354,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 257635708,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 258365596,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 257633309,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 257630571,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 257820053,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 257728854,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 292563552,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 271051911,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 258520599,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 257646275,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 292598650,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 257625772,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 292847296,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 298179240,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 270138089,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 299907657,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 257632955,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 259103110,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 257628103,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A BIT of an Inequality\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an array $$$a_1, a_2, \\ldots, a_n$$$. Find the number of tuples (... | TestCase-Eval | null | {
"problem_id": "1957D",
"submission_id": 257620978,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 304752637,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 304184540,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 304676039,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 304785976,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 292787926,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 292187013,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 305404109,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 305041061,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 292402778,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 297162663,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 293309600,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 292176325,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 294436214,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 294429834,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 292293038,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 294565604,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 292341793,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 292340180,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 293312324,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Divide OR Conquer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You are given an array $$$[a_1, a_2, \\ldots a_n]$$$ consisting of integers between $... | TestCase-Eval | null | {
"problem_id": "2038D",
"submission_id": 293313325,
"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.