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: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272796269,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272833581,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272894758,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 276001537,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 274292827,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 274292380,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272834813,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272803754,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272854939,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272853425,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 274292548,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 273250303,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272813227,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272794160,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272885057,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272818074,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272837315,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272858863,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272842768,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Fun\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Counting is Fun!\n\nβ satyam343\n\nGiven two integers $n$ and $x$, find the number of triplets ($a,... | TestCase-Eval | null | {
"problem_id": "1996D",
"submission_id": 272829655,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 273651872,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 278649987,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 278646465,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 271654965,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 271651622,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 271651041,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 271650279,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 271559464,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 280745323,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 288438381,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 297646282,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 296943351,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 272053532,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 272051023,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 271925549,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 283278920,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 271614050,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 271658163,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 271655984,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Polygonal Segments\ntime_limit_ms: 8000\nmemory_limit_mb: 512\nDescription: You are given an array $a$ of size $n$.\n\nA segment $[l, r](1 \\le l < r \\le n)$ i... | TestCase-Eval | null | {
"problem_id": "1990F",
"submission_id": 271656569,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263549400,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263478060,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263457900,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263483371,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263697818,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263485621,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263459580,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 265775638,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263481894,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263461599,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263489989,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263618354,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 264581016,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 264160880,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263487587,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263483659,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 279787661,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 273972991,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263472164,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and an Infinite Sequence\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: There is a sequence $a_0, a_1, a_2, \\ldots$ of infinite length. Initia... | TestCase-Eval | null | {
"problem_id": "1981B",
"submission_id": 263485459,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261364981,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261353628,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261558555,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 262428690,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261402511,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 284464714,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261860000,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261561570,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 299280168,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261617956,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261404044,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261401532,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261664378,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 262382079,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 263363702,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261523674,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261397786,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 266929816,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261387226,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and the Lonely Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Cat and Fox found an array $a$ consisting of $n$ non-negative inte... | TestCase-Eval | null | {
"problem_id": "1973B",
"submission_id": 261385338,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 297032608,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 306465406,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295060503,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 297039878,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295044950,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295180977,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295094045,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295031091,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295238195,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295090001,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295074330,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295314335,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295083191,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 300568420,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 296230142,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 298081234,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 298127540,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295060452,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295073450,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Digital string maximization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a string $$$s$$$, consisting of digits from $$$0$$$ to $$$9$$... | TestCase-Eval | null | {
"problem_id": "2050D",
"submission_id": 295063231,
"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.