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: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272167255,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272160750,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272289018,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 273037424,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272176868,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 276496119,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272174600,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272640496,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 273009065,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272126759,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272269405,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 273270945,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272456118,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272166060,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272273685,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272183136,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272226362,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272137805,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272289725,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bouquet (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only difference is that in this ver... | TestCase-Eval | null | {
"problem_id": "1995B2",
"submission_id": 272177382,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 260474495,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 273977196,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 260474614,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 259074620,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 258882921,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 258888979,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 273243930,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 262339836,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 279869869,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 258877751,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 260792087,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 269514259,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 263026332,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 294975607,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 265659532,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 265056916,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 280122614,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 273249873,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 287979294,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1967B1",
"submission_id": 272965591,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278743286,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 285653941,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278116963,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278096265,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278140915,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278145970,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278077877,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278143553,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278091144,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278083860,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278098145,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278097675,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 291536343,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278094250,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278138561,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278097985,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278136756,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278507331,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278133869,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Piggy Are Playing a Game 2\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle and Piggy are playing a game on a sequence. They are given... | TestCase-Eval | null | {
"problem_id": "2003B",
"submission_id": 278128746,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 283140369,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281606132,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281176547,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 284443380,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281223606,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281234183,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281256358,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281211335,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 282000429,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281712947,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281251325,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281251170,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281319852,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281513787,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 286426935,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281244856,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 297676896,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 289708803,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281497402,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Strict Teacher (Hard Version)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: This is the hard version of the problem. The only differences between... | TestCase-Eval | null | {
"problem_id": "2005B2",
"submission_id": 281234066,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 261310336,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 259001484,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258911150,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258918906,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258917292,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 259050245,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258909682,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258933564,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258926721,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 259092564,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258915658,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 259029198,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258925553,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 293562115,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258917896,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258927913,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 262089834,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258970420,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258915384,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Reverse Card (Hard Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. You may want to read both versions... | TestCase-Eval | null | {
"problem_id": "1972D2",
"submission_id": 258932530,
"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.