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: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 280250919,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 275864065,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272289262,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272524538,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272290409,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272216462,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272105397,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272125034,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272098267,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 276866255,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272095522,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272106724,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272296197,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 275870419,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272098176,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272260887,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272159143,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272150590,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272108222,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Diagonals\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Vitaly503 is given a checkered board with a side of $n$ and $k$ chips. He realized that all t... | TestCase-Eval | null | {
"problem_id": "1995A",
"submission_id": 272117323,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 281466950,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 281615652,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 279678314,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 281167435,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 281744563,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 296877439,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 302742574,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 302742280,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 282890624,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 286441647,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 280212985,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 279887415,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 279607919,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 279552329,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 279620666,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 279601198,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 279956396,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 280118063,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 279637286,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Klee's SUPER DUPER LARGE Array!!!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Klee has an array $$$a$$$ of length $$$n$$$ containing integers $$$[k... | TestCase-Eval | null | {
"problem_id": "2009E",
"submission_id": 279600110,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273153131,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273881412,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 274116868,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273144341,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273140661,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273216290,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 275737754,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273145096,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273148340,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 275989406,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273156974,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273144634,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273151232,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273144669,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 291352182,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273135671,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 277916058,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273163974,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273980100,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Last Element\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are given an array $a$ of $n$ integers, where $n$ is odd.\n\nIn one opera... | TestCase-Eval | null | {
"problem_id": "1991A",
"submission_id": 273141418,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 285159446,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 285642655,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 284583048,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 285989631,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 285349272,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 284714778,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 284585990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 284641320,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 285825005,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 290166113,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 284572701,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 284760657,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 286175824,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 285053833,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 284731451,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 285643915,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 290328949,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 285361887,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 285044840,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Boss, Thirsty\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Pak Chanek has a friend who runs a drink stall in a canteen. His friend will sell drinks ... | TestCase-Eval | null | {
"problem_id": "2021D",
"submission_id": 285050573,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 274930734,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 274911504,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 283450347,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 281671636,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 281671283,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 299466348,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 287365968,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 276861895,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 274988970,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 275888876,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 276391963,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 296260080,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 277834914,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 275429969,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 274952759,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 282556650,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 277118636,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 283892468,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 275007432,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ruler (easy version)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This is the easy version of the problem. The only difference between the two versi... | TestCase-Eval | null | {
"problem_id": "1999G1",
"submission_id": 274954771,
"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.