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: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286925607,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286924181,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 287000732,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286944080,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 295177306,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 295172771,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286923696,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286921753,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286934318,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286913033,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286915317,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286928857,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 287014642,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 287210497,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286923260,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286927128,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 297644977,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286927948,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286972807,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Profitable Interest Rate\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Alice has $a$ coins. She can open a bank deposit called \"Profitable\", but th... | TestCase-Eval | null | {
"problem_id": "2024A",
"submission_id": 286915403,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 270680415,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 270682911,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 280104505,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 274662834,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 279856632,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 285090917,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 270683470,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 270853962,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 271122501,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 270703939,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 270693748,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 295722148,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 273459126,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 270729009,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 270866283,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 271127188,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 270727682,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 275678808,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 270688047,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Make Majority\ntime_limit_ms: 1500\nmemory_limit_mb: 512\nDescription: You are given a sequence $[a_1,\\ldots,a_n]$ where each element $a_i$ is either $0$ or $1... | TestCase-Eval | null | {
"problem_id": "1988B",
"submission_id": 270763358,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277399956,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277501465,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277443501,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277418426,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 296945089,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277598190,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277805941,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277410364,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277551890,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277527303,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 278037696,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277900594,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277598971,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277513004,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277437316,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277565637,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 284534048,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277423731,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277698084,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 Max Min Subsequence\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: You are given an integer sequence $a_1, a_2, \\ldots, a_n$. Let $S$ be the ... | TestCase-Eval | null | {
"problem_id": "2001D",
"submission_id": 277491211,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276365558,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276290136,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276813654,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 284910788,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276711609,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276283885,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 298646868,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 280777739,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276289990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276510872,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276350547,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 285031642,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 298617939,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276251974,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 281554638,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276438675,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 277179755,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276147820,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276228089,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Ksyusha and the Loaded Set\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Ksyusha decided to start a game development company. To stand out among comp... | TestCase-Eval | null | {
"problem_id": "2000H",
"submission_id": 276171226,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 298861549,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 298867946,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 298865228,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 300445627,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 299029391,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 298858957,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 298909970,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 298858377,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 298850300,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 298924767,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 299139115,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 299138527,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 299765008,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 299025285,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 298842160,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 298870609,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 298855361,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 300909785,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 298864710,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Bewitching Stargazer\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Iris looked at the stars and a beautiful problem emerged in her mind. She is invit... | TestCase-Eval | null | {
"problem_id": "2053C",
"submission_id": 301227843,
"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.