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: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292943627,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292974025,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 296575420,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292955793,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292998371,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 299180211,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292986666,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292986933,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 293789888,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292938070,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292955274,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 302046273,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292945294,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 304661584,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292932067,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292961842,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 304399298,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292950154,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 292974282,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves XOR (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The differences between the tw... | TestCase-Eval | null | {
"problem_id": "2039C2",
"submission_id": 302733574,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 275380202,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 263502496,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 263516975,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 268801008,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 265911407,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 281986566,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 276738303,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 283170112,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 267238460,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 275382714,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 268801647,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 263784518,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 263784184,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 266410775,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 264297980,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 266183209,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 263784017,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 263625205,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 264235361,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Paths on a Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Note the unusual definition of $\\text{MEX}$ in this problem.\n\nPiggy gave... | TestCase-Eval | null | {
"problem_id": "1981F",
"submission_id": 265489175,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288117692,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288124887,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288159558,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 299702270,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 295564500,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 295291214,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288508875,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288286525,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288140004,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288143505,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288168335,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288142692,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 290009887,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288159164,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288122184,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288194503,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288234920,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288165471,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288128880,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Rectangle Arrangement\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You are coloring an infinite square grid, in which all cells are initially white.... | TestCase-Eval | null | {
"problem_id": "2027A",
"submission_id": 288132223,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 279252975,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 273560065,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 273586457,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 276452012,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 273656403,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 273580793,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 273622599,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 273590361,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 273537322,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 273616352,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 278776461,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 274324280,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 273582683,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 286179444,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 277237376,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 273571029,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 273632914,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 273600760,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 275235487,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Root\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a rooted tree, consisting of $n$ vertices. The vertices in the tree are... | TestCase-Eval | null | {
"problem_id": "1997D",
"submission_id": 275313207,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275621868,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275637548,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275990645,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275648352,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275629778,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275626119,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275616560,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275615294,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275638976,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275601763,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 283050468,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275648476,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275727278,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 276084113,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275619936,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275616403,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275607587,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 276420030,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 282165569,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Eliminating Balls With Merging (Easy Version)\ntime_limit_ms: 4000\nmemory_limit_mb: 512\nDescription: Drink water.\n\n— Sun Tzu, The Art of Becoming a Healthy ... | TestCase-Eval | null | {
"problem_id": "1998E1",
"submission_id": 275619411,
"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.