data_source stringclasses 1
value | prompt listlengths 1 1 | ability stringclasses 1
value | reward_model null | extra_info dict |
|---|---|---|---|---|
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278095899,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278050292,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 280294179,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278053581,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278062793,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278084572,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278079756,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278061374,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278337922,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278163031,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278092868,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 279285624,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278093697,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278137435,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278051596,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278061151,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278121243,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278079941,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278732315,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Turtle and Good Strings\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Turtle thinks a string $s$ is a good string if there exists a sequence of strin... | TestCase-Eval | null | {
"problem_id": "2003A",
"submission_id": 278098401,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 286785463,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275595179,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275925919,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275562350,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275613332,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 304734765,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 305596537,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275610194,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275607638,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275595011,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275616208,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275581237,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275583709,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275622826,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275838792,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275592910,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275621910,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275592594,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275583124,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Minimize Equal Sum Subarrays\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: You are given a permutation$$$^{\\text{β}}$$$ $$$p$$$ of length $$$n$$$.\n... | TestCase-Eval | null | {
"problem_id": "1998B",
"submission_id": 275591991,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 259491811,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 263380277,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 259667875,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 295244838,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 262806479,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 259880267,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 268699700,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 273309866,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 284752429,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 282880983,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 266502249,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 266502019,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 267653290,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 259998920,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 262355646,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 261755205,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 304970811,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 285256524,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 266713533,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Min-Fund Prison (Easy)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the easy version, $$$m = n-1$$$ and there exists a path between $$$u$$$ and $... | TestCase-Eval | null | {
"problem_id": "1970G1",
"submission_id": 260865058,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253825894,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 266360639,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253733379,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253730227,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253794904,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253768585,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253757916,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253885982,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253712655,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253704893,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253733396,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253818410,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 254616426,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253785131,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 285335421,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253957436,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253803244,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253719030,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 253764146,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Clock Conversion\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: Given the time in 24-hour format, output the equivalent time in 12-hour format.\n\n- 2... | TestCase-Eval | null | {
"problem_id": "1950C",
"submission_id": 282930840,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 262979564,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 262793456,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 266333835,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 264634502,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 294870109,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 265538923,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 280307724,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 262727353,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 262725428,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 263785299,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 268835895,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 262751832,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 262777810,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 262745311,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 263929625,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 262787735,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 263527975,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 264112455,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 262728019,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Little Nikita\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: The little boy Nikita was given some cubes as a present. He decided to build a tower out ... | TestCase-Eval | null | {
"problem_id": "1977A",
"submission_id": 264093134,
"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.