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: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 269248514,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 270588457,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 269373047,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 296938731,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 295679225,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 295247151,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 269623339,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 269289145,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 269581552,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 269388783,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 294971873,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 294857082,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 269449996,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 298747511,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 269414544,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 269276978,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 269255049,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 278956875,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 271436556,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Your Loss\ntime_limit_ms: 3000\nmemory_limit_mb: 256\nDescription: You are given a tree with $n$ nodes numbered from $1$ to $n$, along with an array of size $n$... | TestCase-Eval | null | {
"problem_id": "1983G",
"submission_id": 269351667,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 262085150,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 260911592,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 287879898,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 270636737,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 292113539,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 287870850,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 287667340,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 266951633,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 306792201,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 259540874,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 259803492,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 264649086,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 263779257,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 269456380,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 263766223,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 279058833,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 268642268,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 291384141,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 260864947,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Playing Quidditch (Hard)\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: This afternoon, you decided to enjoy the first days of Spring by taking a walk... | TestCase-Eval | null | {
"problem_id": "1970F3",
"submission_id": 260545138,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279172613,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 290126236,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279165723,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279464344,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279195200,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279165093,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 282620885,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279173689,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279162868,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279094030,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279145005,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 281118781,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279439696,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 284493799,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279184745,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 282714009,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279142139,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279151328,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279163903,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Longest Good Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Today, Sakurako was studying arrays. An array $a$ of length $n$ is considered good i... | TestCase-Eval | null | {
"problem_id": "2008C",
"submission_id": 279142181,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 302267024,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 257974943,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 272021384,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 256681946,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 256503832,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 257428182,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 257398890,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 257269286,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 256591898,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 256504231,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 256551176,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 256535980,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 270844372,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 256523701,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 256517567,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 256492579,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 256550270,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 257510477,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 256545748,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Nene's Magical Matrix\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: The magical girl Nene has an $$$n\\times n$$$ matrix $$$a$$$ filled with zeroes. ... | TestCase-Eval | null | {
"problem_id": "1956C",
"submission_id": 256510398,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 285832928,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 285123833,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 283221824,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 283251708,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 287829700,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 283232571,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 283211547,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 284041653,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 283524350,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 285968842,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 295663180,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 284644577,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 285111990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 285040650,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 283250699,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 283247564,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 283247183,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 283235570,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 283258264,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Max Plus Min Plus Size\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: [EnV - The Dusty Dragon Tavern](https://soundcloud.com/envyofficial/env-the- dus... | TestCase-Eval | null | {
"problem_id": "2018D",
"submission_id": 283259545,
"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.