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: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268181286,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268204575,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268205812,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268202424,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268495261,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268373803,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268292277,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268187924,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268436964,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268219451,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268190219,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268209927,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 275483312,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268210194,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 271016790,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268201489,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268219874,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268424810,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268519981,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Wonderful Tree!\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: God's Blessing on This ArrayForces!\n\nA Random Pebble\n\nYou are given a tree with $n$... | TestCase-Eval | null | {
"problem_id": "1987E",
"submission_id": 268220295,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283581580,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283644065,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283614382,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283601250,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283600840,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283618338,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 284827756,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283652961,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283638952,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283637314,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283637112,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283647224,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283651222,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283614155,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283853834,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 287331544,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283587952,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283637507,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 285823381,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Brightness Begins\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Imagine you have $n$ light bulbs numbered $1, 2, \\ldots, n$. Initially, all bulbs ar... | TestCase-Eval | null | {
"problem_id": "2020B",
"submission_id": 283651681,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 284340137,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 283640905,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 283609479,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 288763209,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 283621919,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 285649565,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 285028810,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 284052663,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 283632546,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 286557326,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 283617049,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 296463666,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 285436735,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 285436415,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 283644335,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 283854998,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 295465748,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 284974971,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 283747326,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Count Leaves\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Let $n$ and $d$ be positive integers. We build the the divisor tree $T_{n,d}$ as follows:\... | TestCase-Eval | null | {
"problem_id": "2020F",
"submission_id": 283596777,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 295717324,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 269308121,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 269308011,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 270937002,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 270114313,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 269503339,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 269319749,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 269237963,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 274251959,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 269626828,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 284772239,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 269369504,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 269472124,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 269282723,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 272566342,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 269283715,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 275268732,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 269472272,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 269652262,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: I Love Balls\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Alice and Bob are playing a game. There are $n$ balls, out of which $k$ are special. Each ... | TestCase-Eval | null | {
"problem_id": "1983E",
"submission_id": 270316470,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 293634797,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 271121589,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 296943131,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 295155310,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 272301883,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 272301050,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 277613930,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 270702532,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 275178533,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 272652883,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 275476592,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 270698342,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 271685308,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 271101813,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 296121565,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 270712080,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 279368035,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 270726990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 275021394,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Heartbeat\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For an array $u_1, u_2, \\ldots, u_n$, define\n\n * a prefix maximum as an index $i$ such th... | TestCase-Eval | null | {
"problem_id": "1988F",
"submission_id": 270708902,
"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.