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: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 296962384,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 293090147,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 296864947,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 293292061,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 294104657,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 293179027,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 294978075,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 295744988,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 293094375,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 294475079,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 295747808,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 293116880,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 295842669,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 295842902,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 293367062,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 293085713,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 293762348,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 293229133,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 293082988,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Segmentation Folds\ntime_limit_ms: 1000\nmemory_limit_mb: 1024\nDescription: Peter loves folding segments. There is a segment on a number line occupying the int... | TestCase-Eval | null | {
"problem_id": "2041F",
"submission_id": 293092445,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 279792308,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 305094191,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 279894670,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 282859177,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 297118402,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 290485799,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 280201796,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 281600515,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 279886054,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 281706872,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 279745921,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 304475457,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 279803276,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 281626916,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 279746696,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 279983573,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 290312642,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 305083544,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 281624690,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Yunli's Subarray Queries (easy version)\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: This is the easy version of the problem. In this version, it is... | TestCase-Eval | null | {
"problem_id": "2009G1",
"submission_id": 281626987,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 262568964,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 262683176,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 299337327,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 262578135,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 263016687,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 264757946,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 262859679,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 262544220,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 286520398,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 264142152,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 262572522,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 262604206,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 268716752,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 289756401,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 262551350,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 262537658,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 262593422,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 295184347,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 263596089,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Chamo and Mocha's Array\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Mocha likes arrays, so before her departure, Chamo gave her an array $a$ consis... | TestCase-Eval | null | {
"problem_id": "1975C",
"submission_id": 262566379,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286716133,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286742311,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286893374,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286721376,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286804954,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 291447962,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 289331443,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 287230543,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286733509,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286725828,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286758653,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286861027,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 289330220,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286758463,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286730284,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286788169,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286807088,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286809941,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286764886,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: A Gift From Orangutan\ntime_limit_ms: 1000\nmemory_limit_mb: 256\nDescription: While exploring the jungle, you have bumped into a rare orangutan with a bow tie!... | TestCase-Eval | null | {
"problem_id": "2030A",
"submission_id": 286793464,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276543003,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 294654157,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276166554,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276150870,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276139427,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276206598,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 280534034,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276254916,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 277163581,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276160970,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276186006,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276211817,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276200452,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276214938,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 287581623,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276282047,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 280637990,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 276173670,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 278552301,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Seating in a Bus\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: In Berland, a bus consists of a row of $n$ seats numbered from $1$ to $n$. Passengers ... | TestCase-Eval | null | {
"problem_id": "2000B",
"submission_id": 290821621,
"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.