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: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 287303248,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 287068837,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 289601280,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 296233228,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 286983902,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 295286327,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 288253865,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 298936290,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 287149822,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 295154881,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 288985599,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 288016177,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 288016002,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 288015687,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 295167710,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 287154658,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 295150766,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 295291139,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 290040423,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: C+K+S\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given two strongly connected$^{\\dagger}$ directed graphs, each with exactly $n$ vertices... | TestCase-Eval | null | {
"problem_id": "2023C",
"submission_id": 289722663,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276677169,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276939804,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 280901303,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 286607305,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 288926848,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276819757,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276645130,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 284104308,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276734472,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 286609104,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276657694,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 281943278,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276640986,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276674442,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276686211,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276685484,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276677176,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276666345,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 278243910,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Colored Portals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: There are $n$ cities located on a straight line. The cities are numbered from $1$ to $n... | TestCase-Eval | null | {
"problem_id": "2004D",
"submission_id": 276659978,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 290811195,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 291275673,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 294869888,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 295158628,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 295687519,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 295389416,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 295337063,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 288561677,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 294946683,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 288598433,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 289843106,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 288850193,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 288594510,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 288592280,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 288646282,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 288656538,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 288597755,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 288595400,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 288593142,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bermart Ice Cream\ntime_limit_ms: 2000\nmemory_limit_mb: 1024\nDescription: In the Bermart chain of stores, a variety of ice cream is sold. Each type of ice cre... | TestCase-Eval | null | {
"problem_id": "2026F",
"submission_id": 289447976,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267053750,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 268030881,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267947640,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267033577,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267056286,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267046516,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267025446,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267036102,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267026668,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267015945,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267022469,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267097445,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267035596,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267033015,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267038786,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 281586830,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267058310,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267047614,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267056674,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Matrix Stabilization\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given a matrix of size $n \\times m$, where the rows are numbered from $1$... | TestCase-Eval | null | {
"problem_id": "1986B",
"submission_id": 267003350,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 277424065,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 278450210,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 277415635,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 277939661,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 277928401,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 277418493,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 277424887,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 277456255,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 278448606,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 295392820,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 284671701,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 278328616,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 277407981,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 277412049,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 280309611,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 277417753,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 283294757,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 281946491,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 277412641,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Deterministic Heap (Easy Version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. The difference between the t... | TestCase-Eval | null | {
"problem_id": "2001E1",
"submission_id": 285400211,
"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.