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: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 261934090,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 295290202,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 261390850,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 295470726,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 261468622,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 261468335,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 292697122,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 261565419,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 262143241,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 294490846,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 288345187,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 261553792,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 278898059,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 261695538,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 272632443,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 261714241,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 263097921,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 263102505,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 263098675,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Maximum GCD Sum Queries\ntime_limit_ms: 5000\nmemory_limit_mb: 512\nDescription: For $k$ positive integers $x_1, x_2, \\ldots, x_k$, the value $\\gcd(x_1, x_2, ... | TestCase-Eval | null | {
"problem_id": "1973F",
"submission_id": 288688181,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288357285,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288373819,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288467995,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288398956,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 293422984,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288370228,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288889669,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288349727,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 289029427,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 289946118,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288406821,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288339807,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288345717,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288367768,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288460232,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 292146573,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288471145,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 290145276,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288380474,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yet Another Real Number Problem\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Three r there are's in strawberry.\n\nYou are given an array $b$ of len... | TestCase-Eval | null | {
"problem_id": "2035D",
"submission_id": 288613942,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 262919248,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 264680059,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 283420062,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 259520826,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 261069596,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 262915310,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 262410958,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 259490824,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 266311039,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 259470579,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 264185113,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 263096121,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 263086953,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 264177387,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 261575177,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 263175288,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 263221590,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 262318173,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 260826779,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Balanced Shuffle (Easy)\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: A parentheses sequence is a string consisting of characters \"(\" and \")\", fo... | TestCase-Eval | null | {
"problem_id": "1970A1",
"submission_id": 269538745,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 285200297,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282994533,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 284096829,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 285355446,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282616841,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282378743,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282559011,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282322239,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282412539,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282384475,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282552332,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282366069,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 287318226,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282294209,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282749611,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282260287,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282571471,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282250113,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282257471,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Robin Hood and the Major Oak\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: In Sherwood, the trees are our shelter, and we are all children of the for... | TestCase-Eval | null | {
"problem_id": "2014B",
"submission_id": 282262866,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 304241374,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 302802476,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 304776527,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 305125390,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 305080538,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 304696535,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 302799128,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 305084117,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 304492142,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 299774514,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 293498299,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 292636642,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 304185654,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 304726345,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 292719355,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 292729255,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 292203371,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 292200763,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 292223963,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Guess One Character\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: This is an interactive problem. You have to use flush operation right after printin... | TestCase-Eval | null | {
"problem_id": "2038G",
"submission_id": 292223775,
"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.