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: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 265049644,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 263141422,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 274995249,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 262885505,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 264115791,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 262767694,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 263044816,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 272210465,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 262783287,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 262757608,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 263055245,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 263142110,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 262767365,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 262746154,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 262832842,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 262742854,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 263232498,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 262777360,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 293383875,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nikita and LCM\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Nikita is a student passionate about number theory and algorithms. He faces an interesti... | TestCase-Eval | null | {
"problem_id": "1977C",
"submission_id": 263033492,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288279003,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288161404,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 293355585,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288169538,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288192729,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288179781,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288155611,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 292658808,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288167955,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288179376,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288230996,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 295819445,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288166746,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288168125,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 291187701,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288167540,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288172956,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288154406,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 288257605,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: The Endspeaker (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: This is the easy version of this problem. The only difference is that you... | TestCase-Eval | null | {
"problem_id": "2027D1",
"submission_id": 291883705,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 283243355,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 283195749,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 283199557,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 286645571,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 283225601,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 284617961,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 284130986,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 283368269,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 284405845,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 283988754,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 285081833,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 283188768,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 283186119,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 293763950,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 283279227,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 293990391,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 299727211,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 283200429,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 283306209,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Size\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: [EnV - Dynasty](https://soundcloud.com/envyofficial/env-dynasty)\n\n⠀\n\nYou are given an... | TestCase-Eval | null | {
"problem_id": "2019A",
"submission_id": 286358944,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 258749655,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 258738275,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 276525609,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 260006709,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 302185373,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 259416225,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 258731561,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 258816424,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 258754311,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 262003917,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 258747670,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 306477710,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 258766522,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 258743017,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 260864835,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 258742350,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 258745879,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 258725245,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 258744688,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimizing the Sum\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer array $$$a$$$ of length $$$n$$$.\n\nYou can perform the fol... | TestCase-Eval | null | {
"problem_id": "1969C",
"submission_id": 299218232,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 283697126,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 283217747,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 285123723,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 285065380,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 295678550,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 283240047,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 300392568,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 295807473,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 283266148,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 283377207,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 285550972,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 283700786,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 300393780,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 295807746,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 284212964,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 289328023,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 283226728,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 284187955,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 296911059,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Pruning\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: [t+pazolite, ginkiha, Hommarju - Paved Garden](https://soundcloud.com/fractalex-gd/ginkiha... | TestCase-Eval | null | {
"problem_id": "2018C",
"submission_id": 292589609,
"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.