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: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283415821,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 284292165,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283196937,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283211195,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283246667,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283249792,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 297763021,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283219464,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283248461,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283234250,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283242575,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283262444,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283819305,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 298356080,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283205447,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 284341347,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283225082,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 285105661,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283665694,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: All Pairs Segments\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: [Shirobon - FOX](https://soundcloud.com/shirobon/fox?in=mart_207/sets/fav)\n\n⠀\n\nY... | TestCase-Eval | null | {
"problem_id": "2019B",
"submission_id": 283273503,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 280576797,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 278841293,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 278943230,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 278856679,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 278839850,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 278837430,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 284851397,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 293545129,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 297791314,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 278840795,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 279750402,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 279654489,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 280425329,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 280085880,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 287560091,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 281294889,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 280853549,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 279998996,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 295512887,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 the Tree\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: Given a rooted tree with the root at vertex $1$. For any vertex $i$ ($1 < i \\leq n$)... | TestCase-Eval | null | {
"problem_id": "2006B",
"submission_id": 287545283,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 291366967,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 287824164,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 290945832,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 288075746,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 288971994,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 288423070,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 294346990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 294345749,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 287864978,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 287866353,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 296179107,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 291005289,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 291546744,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 287789219,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 287957324,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 287938343,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 289818825,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 288202241,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 287795030,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sakurako and Chefir\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: Given a tree with $n$ vertices rooted at vertex $1$. While walking through it with ... | TestCase-Eval | null | {
"problem_id": "2033G",
"submission_id": 288962089,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261370595,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 269385392,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261369519,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261600405,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261366743,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261429085,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261378959,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 280827983,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261364249,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261455371,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261778920,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 264780468,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261400305,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 272455962,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261363701,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261362935,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261376399,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261371798,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 264782688,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chess For Three\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Three friends gathered to play a few games of chess together.\n\nIn every game, two of ... | TestCase-Eval | null | {
"problem_id": "1973A",
"submission_id": 261382338,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 265826028,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 265552444,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 265178408,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 264946288,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 266087909,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 264965354,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 266461804,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 266428119,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 264934632,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 264946018,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 266089032,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 264959234,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 266427850,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 264965466,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 265858493,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 264962523,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 264999946,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 264961965,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 264957719,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shuffle\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Two hungry red pandas, Oscar and Lura, have a tree $T$ with $n$ nodes. They are willing to perf... | TestCase-Eval | null | {
"problem_id": "1984E",
"submission_id": 264960546,
"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.