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: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295043305,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 296887967,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295021857,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295380885,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295034139,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 298467489,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295008644,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295143638,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295078545,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295235223,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295331721,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 302236672,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 296281229,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295054016,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295014781,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 299141731,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 296432629,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295010554,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295022457,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Line Breaks\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Kostya has a text $$$s$$$ consisting of $$$n$$$ words made up of Latin alphabet letters. He... | TestCase-Eval | null | {
"problem_id": "2050A",
"submission_id": 295006006,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 262031892,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 262349158,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261356564,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 292504999,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261408496,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261406213,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261391798,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261378208,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261395538,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261610275,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261408761,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261667347,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261444932,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261376384,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261483195,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 262348610,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261448935,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 265420163,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261436423,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Cat, Fox and Swaps\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Fox has found an array $p_1, p_2, \\ldots, p_n$, that is a permutation of length $n^... | TestCase-Eval | null | {
"problem_id": "1973E",
"submission_id": 261444591,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 280567361,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 278826515,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 282109857,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 297097139,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 297095910,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 279048230,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 281962892,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 278799719,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 278832107,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 278820648,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 281909979,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 279830166,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 278895344,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 278894398,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 282803552,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 278842015,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 278840847,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 279018400,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 278866357,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris and Game on the Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris has a tree rooted at vertex $1$. Each vertex has a value of $\\mathtt 0$... | TestCase-Eval | null | {
"problem_id": "2006A",
"submission_id": 278849915,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 276711904,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 279365235,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 276651695,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 279978829,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 294898501,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 279012966,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 276679006,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 277308652,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 276831256,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 276619280,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 276673597,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 299827742,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 287908672,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 276676016,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 276757319,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 284775117,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 276671480,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 277255247,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 276672572,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Not a Nim Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Two players, Alice and Bob, are playing a game. They have $n$ piles of stones, with t... | TestCase-Eval | null | {
"problem_id": "2004E",
"submission_id": 276716751,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 280543367,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 278928841,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 278833556,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 281710910,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 278851862,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 278842540,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 280284222,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 278841125,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 278843121,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 278930416,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 280183318,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 279475310,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 292461425,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 278847305,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 278943352,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 292592720,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 281711081,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 278846141,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 279340157,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Iris's Full Binary Tree\ntime_limit_ms: 4000\nmemory_limit_mb: 1024\nDescription: Iris likes full binary trees.\n\nLet's define the depth of a rooted tree as th... | TestCase-Eval | null | {
"problem_id": "2006E",
"submission_id": 279473857,
"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.