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: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 267749117,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 299303351,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 267719461,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 288206072,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 269157709,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 267746982,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 267744175,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 267825619,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 267762203,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 267886291,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 267758059,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 268984648,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 267890200,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 267727238,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 268858975,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 267808375,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 268756939,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 270393354,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 270752922,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Two Movies\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A movie company has released $2$ movies. These $2$ movies were watched by $n$ people. For ea... | TestCase-Eval | null | {
"problem_id": "1989C",
"submission_id": 272907072,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292074036,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292065044,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292059497,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 301567478,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292072559,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292070060,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292717231,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292378672,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 299232735,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292723519,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292013066,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292060637,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 304839307,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292097838,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292069274,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292074829,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292071877,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292408190,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 292168517,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Natlan Exploring\ntime_limit_ms: 4000\nmemory_limit_mb: 256\nDescription: You are exploring the stunning region of Natlan! This region consists of $$$n$$$ citie... | TestCase-Eval | null | {
"problem_id": "2037G",
"submission_id": 295452358,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298833598,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298860245,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 299359420,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 304947529,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298914549,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 299213524,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298852244,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298820194,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298886298,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298834891,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298848445,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298870998,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 305941443,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298863895,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298858159,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 299096005,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298860015,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 304951848,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298859991,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Outstanding Impressionist\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Even after copying the paintings from famous artists for ten years, unfortuna... | TestCase-Eval | null | {
"problem_id": "2053B",
"submission_id": 298848892,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 258766759,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 258772457,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 258728445,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 304877422,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 276815299,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 258749790,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 258730794,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 262275803,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 273922327,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 258807824,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 301368231,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 299986715,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 259325271,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 258738158,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 258767371,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 281859419,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 260974149,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 263071918,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 258771644,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shifts and Sorting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s... | TestCase-Eval | null | {
"problem_id": "1969B",
"submission_id": 258711306,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 258443148,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 258448874,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 259762536,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 262598479,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 262285249,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 267783347,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 305069785,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 285592178,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 258448935,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 261274436,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 258463288,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 258462464,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 258493865,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 258493399,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 258440576,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 259903424,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 258441043,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 258432397,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 258426486,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Card Exchange\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: You have a hand of $$$n$$$ cards, where each card has a number written on it, and a fixed... | TestCase-Eval | null | {
"problem_id": "1966A",
"submission_id": 258425085,
"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.