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: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 264022649,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 264027746,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 264016661,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 297184140,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 263997673,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 265634896,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 264268594,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 271431598,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 264190994,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 264184223,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 297184789,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 264728560,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 299396608,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 289998804,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 264210901,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 273251309,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 264050622,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 264561181,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 264018990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Permutation of Rows and Columns\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You have been given a matrix $a$ of size $n$ by $m$, containing a permu... | TestCase-Eval | null | {
"problem_id": "1980E",
"submission_id": 264031975,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284667789,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284653918,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284586998,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284555970,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284567648,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 285399247,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284577638,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284654443,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284566846,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284582659,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 285128165,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 287221433,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284628102,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284884368,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284573580,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284552686,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284586440,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284549795,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 299231490,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximize Mex\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ positive integers and an integer $x$. You can do the fol... | TestCase-Eval | null | {
"problem_id": "2021B",
"submission_id": 284557713,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268197773,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 269263433,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268197630,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268170190,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 273377203,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 275073951,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 269668891,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268190292,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 286588813,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268177490,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268179380,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268302949,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268174199,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268198149,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268258067,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268216425,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268275986,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268249609,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 269847677,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Basil's Garden\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ flowers in a row, the $i$-th of them initially has a positive height of $h... | TestCase-Eval | null | {
"problem_id": "1987C",
"submission_id": 268164174,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287786191,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287727772,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 299207437,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 288434612,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287766511,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287795916,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 291147476,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287731027,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287800150,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287782259,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287770713,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287796737,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287942386,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 289977948,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287787126,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 288012463,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 291189376,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287970282,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287791889,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako, Kosuke, and the Permutation\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sakurako's exams are over, and she did excellently. As a reward, ... | TestCase-Eval | null | {
"problem_id": "2033E",
"submission_id": 287738048,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263604185,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263345762,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263350116,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263415808,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263350628,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263333888,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263358447,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263428739,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263349867,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263356732,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263358930,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263338415,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263344460,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263728860,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263511139,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263355402,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263348727,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263341931,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 263334860,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Job Interview\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Monocarp is opening his own IT company. He wants to hire $n$ programmers and $m$ testers.... | TestCase-Eval | null | {
"problem_id": "1976C",
"submission_id": 270746282,
"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.