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: Min-Fund Prison (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 273824594,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 264519377,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 274015808,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 295427203,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 274032576,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 270344238,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 291527801,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 260873748,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 263159452,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 259486471,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 259476879,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 259479572,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 260873901,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 260983512,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 264079263,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 259901775,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 259993758,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 260155685,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 276353599,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-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 (Medium)\ntime_limit_ms: 1500\nmemory_limit_mb: 256\nDescription: In the medium version, $$$2 \\leq \\sum n \\leq 300$$$ and $$$1 \\leq \\sum m ... | TestCase-Eval | null | {
"problem_id": "1970G2",
"submission_id": 267289453,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 299415318,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298881987,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 302786092,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298849654,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298885009,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298947309,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 299115865,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298896064,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 299171321,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298888189,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 302285119,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298884763,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298876847,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298869500,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298920829,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298854891,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298995248,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298883515,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298870153,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Refined Product Optimality\ntime_limit_ms: 3000\nmemory_limit_mb: 512\nDescription: Although Iris occasionally sets a problem where the solution is possibly wro... | TestCase-Eval | null | {
"problem_id": "2053D",
"submission_id": 298886675,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 256298441,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 270365286,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 256300354,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 281779966,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 258026008,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 256325553,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 276680079,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 256296066,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 257161183,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 256268611,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 256274844,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 258146851,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 256344365,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 258777135,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 256285986,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 256308137,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 256340253,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 272558809,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 288071868,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Painting the Ribbon\ntime_limit_ms: 2000\nmemory_limit_mb: 512\nDescription: Alice and Bob have bought a ribbon consisting of $$$n$$$ parts. Now they want to pa... | TestCase-Eval | null | {
"problem_id": "1954A",
"submission_id": 256319141,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 305020697,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 292950225,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 292987292,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 304206625,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 294204630,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 293159598,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 292980140,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 292965567,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 292967301,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 293637151,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 292967129,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 292979793,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 293637737,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 293156477,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 293015811,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 293224315,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 292958889,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 303218818,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 303218736,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Shohag Loves Inversions\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Shohag has an array $$$a$$$ of integers. Initially $$$a = [0, 1]$$$. He can rep... | TestCase-Eval | null | {
"problem_id": "2039E",
"submission_id": 293156522,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 279824639,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 291924740,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 279609760,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 280321784,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 279556297,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 279527625,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 295872126,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 279649180,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 279999768,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 279602372,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 287966116,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 281005541,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 279583815,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 279639561,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 300810674,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 300798152,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 287971484,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 279623413,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 279586305,
"task_type": "TestCase-Eval-Task2"
} |
TestCase-Eval-Task2 | [
{
"content": "**Task:**\nGenerate a challenging test input that exposes the bug in the buggy code of the algorithm problem:\nAlgorithm Problem:\nTitle: Satyam and Counting\ntime_limit_ms: 2000\nmemory_limit_mb: 256\nDescription: Satyam is given $$$n$$$ distinct points on the 2D coordinate plane. It is guarantee... | TestCase-Eval | null | {
"problem_id": "2009D",
"submission_id": 279641524,
"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.