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: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 286988429,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 287982692,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 295309803,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 300416914,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 300416848,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 289125911,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 291442801,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 287015469,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 287140149,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 287500672,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 292306009,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 288811538,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 287177073,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 288100770,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 287176629,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 287501045,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 287359740,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 295310059,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 295310446,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Tree of Life\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: In the heart of an ancient kingdom grows the legendary Tree of Life β the only one of its ... | TestCase-Eval | null | {
"problem_id": "2023E",
"submission_id": 300264109,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 285881248,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 285996892,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 286002717,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 286271046,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 285899930,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 285927142,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 289023323,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 291530120,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 287257104,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 285926504,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 295675135,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 285922148,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 285928180,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 285897282,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 285894760,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 299001099,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 288097622,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 285903481,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 285889047,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: New Game\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: There's a new game Monocarp wants to play. The game uses a deck of $n$ cards, where the $i$-th... | TestCase-Eval | null | {
"problem_id": "2025C",
"submission_id": 285919787,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 287528825,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 259711449,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 290109615,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 259601221,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 259499390,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 259496020,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 259496285,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 259496087,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 294703147,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 282878254,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 259568274,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 259532238,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 266332202,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 266331644,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 260771405,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 279404664,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 288005185,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 259512532,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 279404227,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Unshuffle (Hard)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The only difference with the medium version is the maximum length of the inpu... | TestCase-Eval | null | {
"problem_id": "1970A3",
"submission_id": 261086486,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 260427252,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 260434857,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 262083693,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 261306168,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 264492395,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 262011236,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 264191591,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 260375086,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 260418409,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 260406668,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 260473161,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 264735611,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 261640068,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 298241174,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 260432070,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 281768939,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 263725178,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 260670552,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 260476665,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Circle Perimeter\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given an integer $r$, find the number of lattice points that have a Euclidean distance... | TestCase-Eval | null | {
"problem_id": "1971F",
"submission_id": 283983078,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288164897,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 289119181,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288207927,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288272373,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288357652,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288168415,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288158364,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288125375,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288274217,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 300299867,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288164389,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288156836,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288171140,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288134350,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288158022,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 295890993,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288146234,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288178550,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288164423,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Add Zeros\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You're given an array $a$ initially containing $n$ integers. In one operation, you must do th... | TestCase-Eval | null | {
"problem_id": "2027C",
"submission_id": 288164108,
"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.