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: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 267199942,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 266625766,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 268024982,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 266068518,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 266021716,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 276349024,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 270259851,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 271092393,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 266022384,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 268716655,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 266676767,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 269432541,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 271092718,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 270489517,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 275210345,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 266092730,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 268947622,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 266038199,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 268801518,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Computing Machine\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Sasha has two binary strings $s$ and $t$ of the same length $n$, consisting of the ch... | TestCase-Eval | null | {
"problem_id": "1978E",
"submission_id": 266637578,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 268855804,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 267751418,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 269759905,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 295688899,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 268303072,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 268019999,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 267760527,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 273433437,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 268378126,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 268912031,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 268979475,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 268978662,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 284323553,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 268129245,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 267772533,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 272202071,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 268860444,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 268413465,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 283373217,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Simultaneous Coloring\ntime_limit_ms: 6000\nmemory_limit_mb: 512\nDescription: You are given a matrix, consisting of $n$ rows and $m$ columns.\n\nYou can perfor... | TestCase-Eval | null | {
"problem_id": "1989F",
"submission_id": 267830610,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259151051,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 260002760,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259222284,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259222789,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 264492922,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259198888,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 260766130,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259170311,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259168127,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259152077,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259164076,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259158370,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 276404979,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 261175785,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259167574,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259213404,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 261686167,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 260731096,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259218606,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Prefiquence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given two binary strings $$$a$$$ and $$$b$$$. A binary string is a string consistin... | TestCase-Eval | null | {
"problem_id": "1968B",
"submission_id": 259199901,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 274179001,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 271440011,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270724192,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270743881,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270700800,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 271369861,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 271015538,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270728786,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270698465,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270816806,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270785840,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270681451,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270932588,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270717857,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270720121,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270735119,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270746094,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270738711,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270713295,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Omnipotent Monster Killer\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: You, the monster killer, want to kill a group of monsters. The monsters a... | TestCase-Eval | null | {
"problem_id": "1988D",
"submission_id": 270721492,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 304914260,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 301608626,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 292787444,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 292440723,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 292286181,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 304412156,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 304194569,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 304471469,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 297147086,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 292194298,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 292199515,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 292947585,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 292437790,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 300381782,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 306083084,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 292186804,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 292198265,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 292192952,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 292364701,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bridge Renovation\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Recently, Monocarp started working as a director of a park located near his house. Th... | TestCase-Eval | null | {
"problem_id": "2038L",
"submission_id": 295967605,
"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.