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: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 291910558,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 253213805,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 299328972,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 300140347,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 290620481,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 294136391,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 294903443,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 294722146,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 306307189,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 263624211,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 253213301,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 254893378,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 260482071,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 294721015,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 282193724,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 270353367,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 253095199,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 269656938,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 253109104,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Charming Meals\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The Czech cuisine features $$$n$$$ appetizers and $$$n$$$ main dishes. The $$$i$$$-th ap... | TestCase-Eval | null | {
"problem_id": "1949B",
"submission_id": 253106716,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 270471831,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265437968,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265341393,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265372811,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265417262,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265278041,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265371063,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265368220,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 268047937,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265351144,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265317416,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265313635,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 283293354,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265383048,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265294813,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265519547,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 266332524,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265436616,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 267107183,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Secret Box\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ntarsis has a box $B$ with side lengths $x$, $y$, and $z$. It lies in the 3D coordinate plan... | TestCase-Eval | null | {
"problem_id": "1985E",
"submission_id": 265609022,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 291418249,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 290317830,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 289992342,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 301339272,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 291515059,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 301339133,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 304483382,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 304539321,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 290145619,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 289610750,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 289599150,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 289554910,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 290543035,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 289605770,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 301335827,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 294902216,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 289601071,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 292694598,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 289605638,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Library of Magic\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nThe Department of Supernatural Phenomena at the Oxe... | TestCase-Eval | null | {
"problem_id": "2036G",
"submission_id": 289665966,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 263492771,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 270993334,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 263487033,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 264518366,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 263461996,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 263523618,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 263485478,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 295388713,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 295191656,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 295319944,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 295161278,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 295173943,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 295525500,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 263473588,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 295162661,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 295165782,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 263487014,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 267652866,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 294260777,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Intersected Segments\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: Turtle just received $n$ segments and a sequence $a_1, a_2, \\ldots, a_... | TestCase-Eval | null | {
"problem_id": "1981E",
"submission_id": 293784383,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277375717,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277393450,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277460973,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 304634042,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277364489,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277391458,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277369706,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277381175,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277414517,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277418388,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277519554,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 278027368,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277391307,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277463363,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277413206,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277440635,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277990104,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277814232,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 277428025,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess The Tree\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is an interactive problem.\n\nMisuki has chosen a secret tree with $$$n$$$ nodes, i... | TestCase-Eval | null | {
"problem_id": "2001C",
"submission_id": 297416068,
"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.