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: Turtle and a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278183081,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278143624,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278685684,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 285837712,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 283127632,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278109119,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278124820,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278481855,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278188765,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278144776,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278145408,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 285495956,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278134720,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 282463651,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278166035,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 282969984,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 279938634,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278226590,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 278084061,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 a MEX Problem (Easy Version)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The two versions are different problems. In this version of the... | TestCase-Eval | null | {
"problem_id": "2003D1",
"submission_id": 299216829,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 304022295,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296701634,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296742657,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296790943,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 300649361,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 297065406,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296709470,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 297712410,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 297718785,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296732997,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296933604,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296708886,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 297164981,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296651401,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296646983,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296712511,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296702112,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 297198008,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296742197,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Hard Problem\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Ball is the teacher in Paperfold University. The seats of his classroom are arranged in $$... | TestCase-Eval | null | {
"problem_id": "2044C",
"submission_id": 296644147,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282908825,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282515728,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 284890605,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282324558,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 284440575,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282359007,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282915284,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282493737,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282342045,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282354300,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 284440771,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282353916,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282500326,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282365717,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282745347,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 283066384,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 283227898,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 282490309,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 285435783,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Sheriff's Defense\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: \"Why, master,\" quoth Little John, taking the bags and weighing them in his hand, \"... | TestCase-Eval | null | {
"problem_id": "2014F",
"submission_id": 284157737,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290763946,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290767472,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290746902,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 296987130,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 296983862,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290767159,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290761470,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290747982,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 292818240,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290756868,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 296983947,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 296980142,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290760431,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290722807,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290729037,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290744056,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290775053,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290767012,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290764469,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Palindrome Everywhere\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: You are given a cycle with $n$ vertices numbered from $0$ to $n-1$. For each $0\\... | TestCase-Eval | null | {
"problem_id": "2029F",
"submission_id": 290759284,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268248741,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268197626,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 270930394,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 272460351,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 271397992,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268458803,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268289444,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268301256,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268269359,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 269021407,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268980277,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 271396145,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 271395693,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268553761,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268206239,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 275358856,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268208188,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268207010,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268198841,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Spinning Round (Easy Version)\ntime_limit_ms: 7000\nmemory_limit_mb: 1024\nDescription: This is the easy version of the problem. The only difference between the... | TestCase-Eval | null | {
"problem_id": "1987G1",
"submission_id": 268578103,
"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.