Dataset Viewer
messages
list | ground_truth
list | dataset
string | difficulty
string | id
string | problem_family
string | name
string |
|---|---|---|---|---|---|---|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nTreat Blue as 1 and Red as 0. Output the maximum of 23 and input. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' (value 0) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' (value 0) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' (value 1) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' (value 6) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' (value 2) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' (value 1) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'BRB' (value 5) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BR' (value 2) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'B' (value 1) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RBRB' (value 5) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BRBRB' (value 21) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "BRBRB"
},
{
"check_output": true,
"description": "Input 'BRBBR' (value 22) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "BRBBR"
},
{
"check_output": true,
"description": "Input 'BRBBB' (value 23) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "BRBBB"
},
{
"check_output": true,
"description": "Input 'BBRRR' (value 24) should output 'BBRRR' (value 24)",
"expected_accepted": true,
"expected_output": "BBRRR",
"input": "BBRRR"
},
{
"check_output": true,
"description": "Input 'BBRRB' (value 25) should output 'BBRRB' (value 25)",
"expected_accepted": true,
"expected_output": "BBRRB",
"input": "BBRRB"
},
{
"check_output": true,
"description": "Input 'BRR' (value 4) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "BRR"
},
{
"check_output": true,
"description": "Input 'BRRR' (value 8) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "BRRR"
},
{
"check_output": true,
"description": "Input 'BRRRR' (value 16) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "BRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRR' (value 32) should output 'BRRRRR' (value 32)",
"expected_accepted": true,
"expected_output": "BRRRRR",
"input": "BRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRR' (value 64) should output 'BRRRRRR' (value 64)",
"expected_accepted": true,
"expected_output": "BRRRRRR",
"input": "BRRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRRR' (value 128) should output 'BRRRRRRR' (value 128)",
"expected_accepted": true,
"expected_output": "BRRRRRRR",
"input": "BRRRRRRR"
},
{
"check_output": true,
"description": "Input 'BB' (value 3) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'BBB' (value 7) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'BBBB' (value 15) should output 'BRBBB' (value 23)",
"expected_accepted": true,
"expected_output": "BRBBB",
"input": "BBBB"
},
{
"check_output": true,
"description": "Input 'BBBBB' (value 31) should output 'BBBBB' (value 31)",
"expected_accepted": true,
"expected_output": "BBBBB",
"input": "BBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBB' (value 63) should output 'BBBBBB' (value 63)",
"expected_accepted": true,
"expected_output": "BBBBBB",
"input": "BBBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBBB' (value 127) should output 'BBBBBBB' (value 127)",
"expected_accepted": true,
"expected_output": "BBBBBBB",
"input": "BBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRBRBRB' (value 85) should output 'BRBRBRB' (value 85)",
"expected_accepted": true,
"expected_output": "BRBRBRB",
"input": "BRBRBRB"
},
{
"check_output": true,
"description": "Input 'BRBRBRBR' (value 170) should output 'BRBRBRBR' (value 170)",
"expected_accepted": true,
"expected_output": "BRBRBRBR",
"input": "BRBRBRBR"
},
{
"check_output": true,
"description": "Input 'BBBBBBBB' (value 255) should output 'BBBBBBBB' (value 255)",
"expected_accepted": true,
"expected_output": "BBBBBBBB",
"input": "BBBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRRRRRRRR' (value 256) should output 'BRRRRRRRR' (value 256)",
"expected_accepted": true,
"expected_output": "BRRRRRRRR",
"input": "BRRRRRRRR"
},
{
"check_output": true,
"description": "Input 'RBBRBRRBR' (value 210) should output 'BBRBRRBR' (value 210)",
"expected_accepted": true,
"expected_output": "BBRBRRBR",
"input": "RBBRBRRBR"
},
{
"check_output": true,
"description": "Input 'BRBBBBBB' (value 191) should output 'BRBBBBBB' (value 191)",
"expected_accepted": true,
"expected_output": "BRBBBBBB",
"input": "BRBBBBBB"
},
{
"check_output": true,
"description": "Input 'RBRBRBRR' (value 84) should output 'BRBRBRR' (value 84)",
"expected_accepted": true,
"expected_output": "BRBRBRR",
"input": "RBRBRBRR"
},
{
"check_output": true,
"description": "Input 'BRBRBR' (value 42) should output 'BRBRBR' (value 42)",
"expected_accepted": true,
"expected_output": "BRBRBR",
"input": "BRBRBR"
}
] |
manufactoria
|
medium
|
0e9b7205-1294-4caa-ab87-2bc1d50d84b8
|
numerical_max_min
|
Numerical MAX(23, input)
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nTreat Blue as 1 and Red as 0. Output the maximum of 222 and input. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' (value 0) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' (value 0) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' (value 1) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' (value 6) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' (value 2) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' (value 1) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'RR' (value 0) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BR' (value 2) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BRB' (value 5) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'B' (value 1) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RBRB' (value 5) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BBRBBBRR' (value 220) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BBRBBBRR"
},
{
"check_output": true,
"description": "Input 'BBRBBBRB' (value 221) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BBRBBBRB"
},
{
"check_output": true,
"description": "Input 'BBRBBBBR' (value 222) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BBRBBBBR"
},
{
"check_output": true,
"description": "Input 'BBRBBBBB' (value 223) should output 'BBRBBBBB' (value 223)",
"expected_accepted": true,
"expected_output": "BBRBBBBB",
"input": "BBRBBBBB"
},
{
"check_output": true,
"description": "Input 'BBBRRRRR' (value 224) should output 'BBBRRRRR' (value 224)",
"expected_accepted": true,
"expected_output": "BBBRRRRR",
"input": "BBBRRRRR"
},
{
"check_output": true,
"description": "Input 'BRR' (value 4) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BRR"
},
{
"check_output": true,
"description": "Input 'BRRR' (value 8) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BRRR"
},
{
"check_output": true,
"description": "Input 'BRRRR' (value 16) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRR' (value 32) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRR' (value 64) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BRRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRRR' (value 128) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BRRRRRRR"
},
{
"check_output": true,
"description": "Input 'BB' (value 3) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'BBB' (value 7) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'BBBB' (value 15) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BBBB"
},
{
"check_output": true,
"description": "Input 'BBBBB' (value 31) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBB' (value 63) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BBBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBBB' (value 127) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRBRBRB' (value 85) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BRBRBRB"
},
{
"check_output": true,
"description": "Input 'BRBRBRBR' (value 170) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BRBRBRBR"
},
{
"check_output": true,
"description": "Input 'BBBBBBBB' (value 255) should output 'BBBBBBBB' (value 255)",
"expected_accepted": true,
"expected_output": "BBBBBBBB",
"input": "BBBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRRRRRRRR' (value 256) should output 'BRRRRRRRR' (value 256)",
"expected_accepted": true,
"expected_output": "BRRRRRRRR",
"input": "BRRRRRRRR"
},
{
"check_output": true,
"description": "Input 'RBBRBRRBR' (value 210) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "RBBRBRRBR"
},
{
"check_output": true,
"description": "Input 'BRBBBBBB' (value 191) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "BRBBBBBB"
},
{
"check_output": true,
"description": "Input 'RBRBRBRR' (value 84) should output 'BBRBBBBR' (value 222)",
"expected_accepted": true,
"expected_output": "BBRBBBBR",
"input": "RBRBRBRR"
}
] |
manufactoria
|
medium
|
e17efcaf-8279-4f57-a482-67a3db57d5c4
|
numerical_max_min
|
Numerical MAX(222, input)
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nTreat Blue as 1 and Red as 0. Output the minimum of 235 and input. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' (value 6) should output 'BBR' (value 6)",
"expected_accepted": true,
"expected_output": "BBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' (value 2) should output 'BR' (value 2)",
"expected_accepted": true,
"expected_output": "BR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'RR' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BR' (value 2) should output 'BR' (value 2)",
"expected_accepted": true,
"expected_output": "BR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BRB' (value 5) should output 'BRB' (value 5)",
"expected_accepted": true,
"expected_output": "BRB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'B' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RBRB' (value 5) should output 'BRB' (value 5)",
"expected_accepted": true,
"expected_output": "BRB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BBBRBRRB' (value 233) should output 'BBBRBRRB' (value 233)",
"expected_accepted": true,
"expected_output": "BBBRBRRB",
"input": "BBBRBRRB"
},
{
"check_output": true,
"description": "Input 'BBBRBRBR' (value 234) should output 'BBBRBRBR' (value 234)",
"expected_accepted": true,
"expected_output": "BBBRBRBR",
"input": "BBBRBRBR"
},
{
"check_output": true,
"description": "Input 'BBBRBRBB' (value 235) should output 'BBBRBRBB' (value 235)",
"expected_accepted": true,
"expected_output": "BBBRBRBB",
"input": "BBBRBRBB"
},
{
"check_output": true,
"description": "Input 'BBBRBBRR' (value 236) should output 'BBBRBRBB' (value 235)",
"expected_accepted": true,
"expected_output": "BBBRBRBB",
"input": "BBBRBBRR"
},
{
"check_output": true,
"description": "Input 'BBBRBBRB' (value 237) should output 'BBBRBRBB' (value 235)",
"expected_accepted": true,
"expected_output": "BBBRBRBB",
"input": "BBBRBBRB"
},
{
"check_output": true,
"description": "Input 'BRR' (value 4) should output 'BRR' (value 4)",
"expected_accepted": true,
"expected_output": "BRR",
"input": "BRR"
},
{
"check_output": true,
"description": "Input 'BRRR' (value 8) should output 'BRRR' (value 8)",
"expected_accepted": true,
"expected_output": "BRRR",
"input": "BRRR"
},
{
"check_output": true,
"description": "Input 'BRRRR' (value 16) should output 'BRRRR' (value 16)",
"expected_accepted": true,
"expected_output": "BRRRR",
"input": "BRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRR' (value 32) should output 'BRRRRR' (value 32)",
"expected_accepted": true,
"expected_output": "BRRRRR",
"input": "BRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRR' (value 64) should output 'BRRRRRR' (value 64)",
"expected_accepted": true,
"expected_output": "BRRRRRR",
"input": "BRRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRRR' (value 128) should output 'BRRRRRRR' (value 128)",
"expected_accepted": true,
"expected_output": "BRRRRRRR",
"input": "BRRRRRRR"
},
{
"check_output": true,
"description": "Input 'BB' (value 3) should output 'BB' (value 3)",
"expected_accepted": true,
"expected_output": "BB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'BBB' (value 7) should output 'BBB' (value 7)",
"expected_accepted": true,
"expected_output": "BBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'BBBB' (value 15) should output 'BBBB' (value 15)",
"expected_accepted": true,
"expected_output": "BBBB",
"input": "BBBB"
},
{
"check_output": true,
"description": "Input 'BBBBB' (value 31) should output 'BBBBB' (value 31)",
"expected_accepted": true,
"expected_output": "BBBBB",
"input": "BBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBB' (value 63) should output 'BBBBBB' (value 63)",
"expected_accepted": true,
"expected_output": "BBBBBB",
"input": "BBBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBBB' (value 127) should output 'BBBBBBB' (value 127)",
"expected_accepted": true,
"expected_output": "BBBBBBB",
"input": "BBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRBRBRB' (value 85) should output 'BRBRBRB' (value 85)",
"expected_accepted": true,
"expected_output": "BRBRBRB",
"input": "BRBRBRB"
},
{
"check_output": true,
"description": "Input 'BRBRBRBR' (value 170) should output 'BRBRBRBR' (value 170)",
"expected_accepted": true,
"expected_output": "BRBRBRBR",
"input": "BRBRBRBR"
},
{
"check_output": true,
"description": "Input 'BBBBBBBB' (value 255) should output 'BBBRBRBB' (value 235)",
"expected_accepted": true,
"expected_output": "BBBRBRBB",
"input": "BBBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRRRRRRRR' (value 256) should output 'BBBRBRBB' (value 235)",
"expected_accepted": true,
"expected_output": "BBBRBRBB",
"input": "BRRRRRRRR"
},
{
"check_output": true,
"description": "Input 'RBBRBRRBR' (value 210) should output 'BBRBRRBR' (value 210)",
"expected_accepted": true,
"expected_output": "BBRBRRBR",
"input": "RBBRBRRBR"
},
{
"check_output": true,
"description": "Input 'BRBBBBBB' (value 191) should output 'BRBBBBBB' (value 191)",
"expected_accepted": true,
"expected_output": "BRBBBBBB",
"input": "BRBBBBBB"
},
{
"check_output": true,
"description": "Input 'RBRBRBRR' (value 84) should output 'BRBRBRR' (value 84)",
"expected_accepted": true,
"expected_output": "BRBRBRR",
"input": "RBRBRBRR"
}
] |
manufactoria
|
medium
|
a2179eaa-8d38-4ad3-b948-a2e4cc0cf3bd
|
numerical_max_min
|
Numerical MIN(235, input)
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nTreat Blue as 1 and Red as 0. Output the minimum of 67 and input. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' (value 6) should output 'BBR' (value 6)",
"expected_accepted": true,
"expected_output": "BBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' (value 2) should output 'BR' (value 2)",
"expected_accepted": true,
"expected_output": "BR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'BRB' (value 5) should output 'BRB' (value 5)",
"expected_accepted": true,
"expected_output": "BRB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BR' (value 2) should output 'BR' (value 2)",
"expected_accepted": true,
"expected_output": "BR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BB' (value 3) should output 'BB' (value 3)",
"expected_accepted": true,
"expected_output": "BB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'B' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RBRB' (value 5) should output 'BRB' (value 5)",
"expected_accepted": true,
"expected_output": "BRB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BRRRRRB' (value 65) should output 'BRRRRRB' (value 65)",
"expected_accepted": true,
"expected_output": "BRRRRRB",
"input": "BRRRRRB"
},
{
"check_output": true,
"description": "Input 'BRRRRBR' (value 66) should output 'BRRRRBR' (value 66)",
"expected_accepted": true,
"expected_output": "BRRRRBR",
"input": "BRRRRBR"
},
{
"check_output": true,
"description": "Input 'BRRRRBB' (value 67) should output 'BRRRRBB' (value 67)",
"expected_accepted": true,
"expected_output": "BRRRRBB",
"input": "BRRRRBB"
},
{
"check_output": true,
"description": "Input 'BRRRBRR' (value 68) should output 'BRRRRBB' (value 67)",
"expected_accepted": true,
"expected_output": "BRRRRBB",
"input": "BRRRBRR"
},
{
"check_output": true,
"description": "Input 'BRRRBRB' (value 69) should output 'BRRRRBB' (value 67)",
"expected_accepted": true,
"expected_output": "BRRRRBB",
"input": "BRRRBRB"
},
{
"check_output": true,
"description": "Input 'BRR' (value 4) should output 'BRR' (value 4)",
"expected_accepted": true,
"expected_output": "BRR",
"input": "BRR"
},
{
"check_output": true,
"description": "Input 'BRRR' (value 8) should output 'BRRR' (value 8)",
"expected_accepted": true,
"expected_output": "BRRR",
"input": "BRRR"
},
{
"check_output": true,
"description": "Input 'BRRRR' (value 16) should output 'BRRRR' (value 16)",
"expected_accepted": true,
"expected_output": "BRRRR",
"input": "BRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRR' (value 32) should output 'BRRRRR' (value 32)",
"expected_accepted": true,
"expected_output": "BRRRRR",
"input": "BRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRR' (value 64) should output 'BRRRRRR' (value 64)",
"expected_accepted": true,
"expected_output": "BRRRRRR",
"input": "BRRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRRR' (value 128) should output 'BRRRRBB' (value 67)",
"expected_accepted": true,
"expected_output": "BRRRRBB",
"input": "BRRRRRRR"
},
{
"check_output": true,
"description": "Input 'BBB' (value 7) should output 'BBB' (value 7)",
"expected_accepted": true,
"expected_output": "BBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'BBBB' (value 15) should output 'BBBB' (value 15)",
"expected_accepted": true,
"expected_output": "BBBB",
"input": "BBBB"
},
{
"check_output": true,
"description": "Input 'BBBBB' (value 31) should output 'BBBBB' (value 31)",
"expected_accepted": true,
"expected_output": "BBBBB",
"input": "BBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBB' (value 63) should output 'BBBBBB' (value 63)",
"expected_accepted": true,
"expected_output": "BBBBBB",
"input": "BBBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBBB' (value 127) should output 'BRRRRBB' (value 67)",
"expected_accepted": true,
"expected_output": "BRRRRBB",
"input": "BBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRBRBRB' (value 85) should output 'BRRRRBB' (value 67)",
"expected_accepted": true,
"expected_output": "BRRRRBB",
"input": "BRBRBRB"
},
{
"check_output": true,
"description": "Input 'BRBRBRBR' (value 170) should output 'BRRRRBB' (value 67)",
"expected_accepted": true,
"expected_output": "BRRRRBB",
"input": "BRBRBRBR"
},
{
"check_output": true,
"description": "Input 'BBBBBBBB' (value 255) should output 'BRRRRBB' (value 67)",
"expected_accepted": true,
"expected_output": "BRRRRBB",
"input": "BBBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRRRRRRRR' (value 256) should output 'BRRRRBB' (value 67)",
"expected_accepted": true,
"expected_output": "BRRRRBB",
"input": "BRRRRRRRR"
},
{
"check_output": true,
"description": "Input 'RBBRBRRBR' (value 210) should output 'BRRRRBB' (value 67)",
"expected_accepted": true,
"expected_output": "BRRRRBB",
"input": "RBBRBRRBR"
},
{
"check_output": true,
"description": "Input 'BRBBBBBB' (value 191) should output 'BRRRRBB' (value 67)",
"expected_accepted": true,
"expected_output": "BRRRRBB",
"input": "BRBBBBBB"
},
{
"check_output": true,
"description": "Input 'RBRBRBRR' (value 84) should output 'BRRRRBB' (value 67)",
"expected_accepted": true,
"expected_output": "BRRRRBB",
"input": "RBRBRBRR"
},
{
"check_output": true,
"description": "Input 'BRBRBR' (value 42) should output 'BRBRBR' (value 42)",
"expected_accepted": true,
"expected_output": "BRBRBR",
"input": "BRBRBR"
}
] |
manufactoria
|
medium
|
334b338b-afc8-4992-802b-2ea3bae2334b
|
numerical_max_min
|
Numerical MIN(67, input)
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nTreat Blue as 1 and Red as 0. Output the maximum of 196 and input. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' (value 0) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' (value 0) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' (value 1) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' (value 6) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' (value 2) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' (value 1) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'BRB' (value 5) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BR' (value 2) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BB' (value 3) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'B' (value 1) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RBRB' (value 5) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BBRRRRBR' (value 194) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BBRRRRBR"
},
{
"check_output": true,
"description": "Input 'BBRRRRBB' (value 195) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BBRRRRBB"
},
{
"check_output": true,
"description": "Input 'BBRRRBRR' (value 196) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BBRRRBRR"
},
{
"check_output": true,
"description": "Input 'BBRRRBRB' (value 197) should output 'BBRRRBRB' (value 197)",
"expected_accepted": true,
"expected_output": "BBRRRBRB",
"input": "BBRRRBRB"
},
{
"check_output": true,
"description": "Input 'BBRRRBBR' (value 198) should output 'BBRRRBBR' (value 198)",
"expected_accepted": true,
"expected_output": "BBRRRBBR",
"input": "BBRRRBBR"
},
{
"check_output": true,
"description": "Input 'BRR' (value 4) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BRR"
},
{
"check_output": true,
"description": "Input 'BRRR' (value 8) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BRRR"
},
{
"check_output": true,
"description": "Input 'BRRRR' (value 16) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRR' (value 32) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRR' (value 64) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BRRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRRR' (value 128) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BRRRRRRR"
},
{
"check_output": true,
"description": "Input 'BBB' (value 7) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'BBBB' (value 15) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BBBB"
},
{
"check_output": true,
"description": "Input 'BBBBB' (value 31) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBB' (value 63) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BBBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBBB' (value 127) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRBRBRB' (value 85) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BRBRBRB"
},
{
"check_output": true,
"description": "Input 'BRBRBRBR' (value 170) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BRBRBRBR"
},
{
"check_output": true,
"description": "Input 'BBBBBBBB' (value 255) should output 'BBBBBBBB' (value 255)",
"expected_accepted": true,
"expected_output": "BBBBBBBB",
"input": "BBBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRRRRRRRR' (value 256) should output 'BRRRRRRRR' (value 256)",
"expected_accepted": true,
"expected_output": "BRRRRRRRR",
"input": "BRRRRRRRR"
},
{
"check_output": true,
"description": "Input 'RBBRBRRBR' (value 210) should output 'BBRBRRBR' (value 210)",
"expected_accepted": true,
"expected_output": "BBRBRRBR",
"input": "RBBRBRRBR"
},
{
"check_output": true,
"description": "Input 'BRBBBBBB' (value 191) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BRBBBBBB"
},
{
"check_output": true,
"description": "Input 'RBRBRBRR' (value 84) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "RBRBRBRR"
},
{
"check_output": true,
"description": "Input 'BRBRBR' (value 42) should output 'BBRRRBRR' (value 196)",
"expected_accepted": true,
"expected_output": "BBRRRBRR",
"input": "BRBRBR"
}
] |
manufactoria
|
medium
|
1a161909-f46e-4a0b-aa04-7ee8d8108b5c
|
numerical_max_min
|
Numerical MAX(196, input)
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nTreat Blue as 1 and Red as 0. Output the maximum of 154 and input. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' (value 0) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' (value 0) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' (value 1) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' (value 6) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' (value 2) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' (value 1) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'B' (value 1) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "B"
},
{
"check_output": true,
"description": "Input 'BRB' (value 5) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BR' (value 2) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BB' (value 3) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'RBRB' (value 5) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BRRBBRRR' (value 152) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BRRBBRRR"
},
{
"check_output": true,
"description": "Input 'BRRBBRRB' (value 153) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BRRBBRRB"
},
{
"check_output": true,
"description": "Input 'BRRBBRBR' (value 154) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BRRBBRBR"
},
{
"check_output": true,
"description": "Input 'BRRBBRBB' (value 155) should output 'BRRBBRBB' (value 155)",
"expected_accepted": true,
"expected_output": "BRRBBRBB",
"input": "BRRBBRBB"
},
{
"check_output": true,
"description": "Input 'BRRBBBRR' (value 156) should output 'BRRBBBRR' (value 156)",
"expected_accepted": true,
"expected_output": "BRRBBBRR",
"input": "BRRBBBRR"
},
{
"check_output": true,
"description": "Input 'BRR' (value 4) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BRR"
},
{
"check_output": true,
"description": "Input 'BRRR' (value 8) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BRRR"
},
{
"check_output": true,
"description": "Input 'BRRRR' (value 16) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRR' (value 32) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRR' (value 64) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BRRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRRR' (value 128) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BRRRRRRR"
},
{
"check_output": true,
"description": "Input 'BBB' (value 7) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'BBBB' (value 15) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BBBB"
},
{
"check_output": true,
"description": "Input 'BBBBB' (value 31) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBB' (value 63) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BBBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBBB' (value 127) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRBRBRB' (value 85) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BRBRBRB"
},
{
"check_output": true,
"description": "Input 'BRBRBRBR' (value 170) should output 'BRBRBRBR' (value 170)",
"expected_accepted": true,
"expected_output": "BRBRBRBR",
"input": "BRBRBRBR"
},
{
"check_output": true,
"description": "Input 'BBBBBBBB' (value 255) should output 'BBBBBBBB' (value 255)",
"expected_accepted": true,
"expected_output": "BBBBBBBB",
"input": "BBBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRRRRRRRR' (value 256) should output 'BRRRRRRRR' (value 256)",
"expected_accepted": true,
"expected_output": "BRRRRRRRR",
"input": "BRRRRRRRR"
},
{
"check_output": true,
"description": "Input 'RBBRBRRBR' (value 210) should output 'BBRBRRBR' (value 210)",
"expected_accepted": true,
"expected_output": "BBRBRRBR",
"input": "RBBRBRRBR"
},
{
"check_output": true,
"description": "Input 'BRBBBBBB' (value 191) should output 'BRBBBBBB' (value 191)",
"expected_accepted": true,
"expected_output": "BRBBBBBB",
"input": "BRBBBBBB"
},
{
"check_output": true,
"description": "Input 'RBRBRBRR' (value 84) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "RBRBRBRR"
},
{
"check_output": true,
"description": "Input 'BRBRBR' (value 42) should output 'BRRBBRBR' (value 154)",
"expected_accepted": true,
"expected_output": "BRRBBRBR",
"input": "BRBRBR"
}
] |
manufactoria
|
medium
|
8fc3e396-a0ce-416b-96df-520f731fd461
|
numerical_max_min
|
Numerical MAX(154, input)
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nTreat Blue as 1 and Red as 0. Output the maximum of 219 and input. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' (value 0) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' (value 0) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' (value 1) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' (value 6) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' (value 2) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' (value 1) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'BRB' (value 5) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BR' (value 2) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BB' (value 3) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'B' (value 1) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RBRB' (value 5) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BBRBBRRB' (value 217) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BBRBBRRB"
},
{
"check_output": true,
"description": "Input 'BBRBBRBR' (value 218) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BBRBBRBR"
},
{
"check_output": true,
"description": "Input 'BBRBBRBB' (value 219) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BBRBBRBB"
},
{
"check_output": true,
"description": "Input 'BBRBBBRR' (value 220) should output 'BBRBBBRR' (value 220)",
"expected_accepted": true,
"expected_output": "BBRBBBRR",
"input": "BBRBBBRR"
},
{
"check_output": true,
"description": "Input 'BBRBBBRB' (value 221) should output 'BBRBBBRB' (value 221)",
"expected_accepted": true,
"expected_output": "BBRBBBRB",
"input": "BBRBBBRB"
},
{
"check_output": true,
"description": "Input 'BRR' (value 4) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BRR"
},
{
"check_output": true,
"description": "Input 'BRRR' (value 8) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BRRR"
},
{
"check_output": true,
"description": "Input 'BRRRR' (value 16) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRR' (value 32) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRR' (value 64) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BRRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRRR' (value 128) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BRRRRRRR"
},
{
"check_output": true,
"description": "Input 'BBB' (value 7) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'BBBB' (value 15) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BBBB"
},
{
"check_output": true,
"description": "Input 'BBBBB' (value 31) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBB' (value 63) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BBBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBBB' (value 127) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRBRBRB' (value 85) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BRBRBRB"
},
{
"check_output": true,
"description": "Input 'BRBRBRBR' (value 170) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BRBRBRBR"
},
{
"check_output": true,
"description": "Input 'BBBBBBBB' (value 255) should output 'BBBBBBBB' (value 255)",
"expected_accepted": true,
"expected_output": "BBBBBBBB",
"input": "BBBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRRRRRRRR' (value 256) should output 'BRRRRRRRR' (value 256)",
"expected_accepted": true,
"expected_output": "BRRRRRRRR",
"input": "BRRRRRRRR"
},
{
"check_output": true,
"description": "Input 'RBBRBRRBR' (value 210) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "RBBRBRRBR"
},
{
"check_output": true,
"description": "Input 'BRBBBBBB' (value 191) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BRBBBBBB"
},
{
"check_output": true,
"description": "Input 'RBRBRBRR' (value 84) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "RBRBRBRR"
},
{
"check_output": true,
"description": "Input 'BRBRBR' (value 42) should output 'BBRBBRBB' (value 219)",
"expected_accepted": true,
"expected_output": "BBRBBRBB",
"input": "BRBRBR"
}
] |
manufactoria
|
medium
|
2e729f84-4738-4f1d-b28e-6705690618a0
|
numerical_max_min
|
Numerical MAX(219, input)
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nTreat Blue as 1 and Red as 0. Output the minimum of 170 and input. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' (value 6) should output 'BBR' (value 6)",
"expected_accepted": true,
"expected_output": "BBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' (value 2) should output 'BR' (value 2)",
"expected_accepted": true,
"expected_output": "BR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'B' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RR' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BR' (value 2) should output 'BR' (value 2)",
"expected_accepted": true,
"expected_output": "BR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BRB' (value 5) should output 'BRB' (value 5)",
"expected_accepted": true,
"expected_output": "BRB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'RBRB' (value 5) should output 'BRB' (value 5)",
"expected_accepted": true,
"expected_output": "BRB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BRBRBRRR' (value 168) should output 'BRBRBRRR' (value 168)",
"expected_accepted": true,
"expected_output": "BRBRBRRR",
"input": "BRBRBRRR"
},
{
"check_output": true,
"description": "Input 'BRBRBRRB' (value 169) should output 'BRBRBRRB' (value 169)",
"expected_accepted": true,
"expected_output": "BRBRBRRB",
"input": "BRBRBRRB"
},
{
"check_output": true,
"description": "Input 'BRBRBRBR' (value 170) should output 'BRBRBRBR' (value 170)",
"expected_accepted": true,
"expected_output": "BRBRBRBR",
"input": "BRBRBRBR"
},
{
"check_output": true,
"description": "Input 'BRBRBRBB' (value 171) should output 'BRBRBRBR' (value 170)",
"expected_accepted": true,
"expected_output": "BRBRBRBR",
"input": "BRBRBRBB"
},
{
"check_output": true,
"description": "Input 'BRBRBBRR' (value 172) should output 'BRBRBRBR' (value 170)",
"expected_accepted": true,
"expected_output": "BRBRBRBR",
"input": "BRBRBBRR"
},
{
"check_output": true,
"description": "Input 'BRR' (value 4) should output 'BRR' (value 4)",
"expected_accepted": true,
"expected_output": "BRR",
"input": "BRR"
},
{
"check_output": true,
"description": "Input 'BRRR' (value 8) should output 'BRRR' (value 8)",
"expected_accepted": true,
"expected_output": "BRRR",
"input": "BRRR"
},
{
"check_output": true,
"description": "Input 'BRRRR' (value 16) should output 'BRRRR' (value 16)",
"expected_accepted": true,
"expected_output": "BRRRR",
"input": "BRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRR' (value 32) should output 'BRRRRR' (value 32)",
"expected_accepted": true,
"expected_output": "BRRRRR",
"input": "BRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRR' (value 64) should output 'BRRRRRR' (value 64)",
"expected_accepted": true,
"expected_output": "BRRRRRR",
"input": "BRRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRRR' (value 128) should output 'BRRRRRRR' (value 128)",
"expected_accepted": true,
"expected_output": "BRRRRRRR",
"input": "BRRRRRRR"
},
{
"check_output": true,
"description": "Input 'BB' (value 3) should output 'BB' (value 3)",
"expected_accepted": true,
"expected_output": "BB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'BBB' (value 7) should output 'BBB' (value 7)",
"expected_accepted": true,
"expected_output": "BBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'BBBB' (value 15) should output 'BBBB' (value 15)",
"expected_accepted": true,
"expected_output": "BBBB",
"input": "BBBB"
},
{
"check_output": true,
"description": "Input 'BBBBB' (value 31) should output 'BBBBB' (value 31)",
"expected_accepted": true,
"expected_output": "BBBBB",
"input": "BBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBB' (value 63) should output 'BBBBBB' (value 63)",
"expected_accepted": true,
"expected_output": "BBBBBB",
"input": "BBBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBBB' (value 127) should output 'BBBBBBB' (value 127)",
"expected_accepted": true,
"expected_output": "BBBBBBB",
"input": "BBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRBRBRB' (value 85) should output 'BRBRBRB' (value 85)",
"expected_accepted": true,
"expected_output": "BRBRBRB",
"input": "BRBRBRB"
},
{
"check_output": true,
"description": "Input 'BBBBBBBB' (value 255) should output 'BRBRBRBR' (value 170)",
"expected_accepted": true,
"expected_output": "BRBRBRBR",
"input": "BBBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRRRRRRRR' (value 256) should output 'BRBRBRBR' (value 170)",
"expected_accepted": true,
"expected_output": "BRBRBRBR",
"input": "BRRRRRRRR"
},
{
"check_output": true,
"description": "Input 'RBBRBRRBR' (value 210) should output 'BRBRBRBR' (value 170)",
"expected_accepted": true,
"expected_output": "BRBRBRBR",
"input": "RBBRBRRBR"
},
{
"check_output": true,
"description": "Input 'BRBBBBBB' (value 191) should output 'BRBRBRBR' (value 170)",
"expected_accepted": true,
"expected_output": "BRBRBRBR",
"input": "BRBBBBBB"
},
{
"check_output": true,
"description": "Input 'RBRBRBRR' (value 84) should output 'BRBRBRR' (value 84)",
"expected_accepted": true,
"expected_output": "BRBRBRR",
"input": "RBRBRBRR"
},
{
"check_output": true,
"description": "Input 'BRBRBR' (value 42) should output 'BRBRBR' (value 42)",
"expected_accepted": true,
"expected_output": "BRBRBR",
"input": "BRBRBR"
}
] |
manufactoria
|
medium
|
131480b9-0981-469b-aa7e-826d5e2a2096
|
numerical_max_min
|
Numerical MIN(170, input)
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nTreat Blue as 1 and Red as 0. Output the minimum of 113 and input. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' (value 6) should output 'BBR' (value 6)",
"expected_accepted": true,
"expected_output": "BBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' (value 2) should output 'BR' (value 2)",
"expected_accepted": true,
"expected_output": "BR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'B' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "B"
},
{
"check_output": true,
"description": "Input 'BRB' (value 5) should output 'BRB' (value 5)",
"expected_accepted": true,
"expected_output": "BRB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BR' (value 2) should output 'BR' (value 2)",
"expected_accepted": true,
"expected_output": "BR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BB' (value 3) should output 'BB' (value 3)",
"expected_accepted": true,
"expected_output": "BB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'RBRB' (value 5) should output 'BRB' (value 5)",
"expected_accepted": true,
"expected_output": "BRB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BBRBBBB' (value 111) should output 'BBRBBBB' (value 111)",
"expected_accepted": true,
"expected_output": "BBRBBBB",
"input": "BBRBBBB"
},
{
"check_output": true,
"description": "Input 'BBBRRRR' (value 112) should output 'BBBRRRR' (value 112)",
"expected_accepted": true,
"expected_output": "BBBRRRR",
"input": "BBBRRRR"
},
{
"check_output": true,
"description": "Input 'BBBRRRB' (value 113) should output 'BBBRRRB' (value 113)",
"expected_accepted": true,
"expected_output": "BBBRRRB",
"input": "BBBRRRB"
},
{
"check_output": true,
"description": "Input 'BBBRRBR' (value 114) should output 'BBBRRRB' (value 113)",
"expected_accepted": true,
"expected_output": "BBBRRRB",
"input": "BBBRRBR"
},
{
"check_output": true,
"description": "Input 'BBBRRBB' (value 115) should output 'BBBRRRB' (value 113)",
"expected_accepted": true,
"expected_output": "BBBRRRB",
"input": "BBBRRBB"
},
{
"check_output": true,
"description": "Input 'BRR' (value 4) should output 'BRR' (value 4)",
"expected_accepted": true,
"expected_output": "BRR",
"input": "BRR"
},
{
"check_output": true,
"description": "Input 'BRRR' (value 8) should output 'BRRR' (value 8)",
"expected_accepted": true,
"expected_output": "BRRR",
"input": "BRRR"
},
{
"check_output": true,
"description": "Input 'BRRRR' (value 16) should output 'BRRRR' (value 16)",
"expected_accepted": true,
"expected_output": "BRRRR",
"input": "BRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRR' (value 32) should output 'BRRRRR' (value 32)",
"expected_accepted": true,
"expected_output": "BRRRRR",
"input": "BRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRR' (value 64) should output 'BRRRRRR' (value 64)",
"expected_accepted": true,
"expected_output": "BRRRRRR",
"input": "BRRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRRR' (value 128) should output 'BBBRRRB' (value 113)",
"expected_accepted": true,
"expected_output": "BBBRRRB",
"input": "BRRRRRRR"
},
{
"check_output": true,
"description": "Input 'BBB' (value 7) should output 'BBB' (value 7)",
"expected_accepted": true,
"expected_output": "BBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'BBBB' (value 15) should output 'BBBB' (value 15)",
"expected_accepted": true,
"expected_output": "BBBB",
"input": "BBBB"
},
{
"check_output": true,
"description": "Input 'BBBBB' (value 31) should output 'BBBBB' (value 31)",
"expected_accepted": true,
"expected_output": "BBBBB",
"input": "BBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBB' (value 63) should output 'BBBBBB' (value 63)",
"expected_accepted": true,
"expected_output": "BBBBBB",
"input": "BBBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBBB' (value 127) should output 'BBBRRRB' (value 113)",
"expected_accepted": true,
"expected_output": "BBBRRRB",
"input": "BBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRBRBRB' (value 85) should output 'BRBRBRB' (value 85)",
"expected_accepted": true,
"expected_output": "BRBRBRB",
"input": "BRBRBRB"
},
{
"check_output": true,
"description": "Input 'BRBRBRBR' (value 170) should output 'BBBRRRB' (value 113)",
"expected_accepted": true,
"expected_output": "BBBRRRB",
"input": "BRBRBRBR"
},
{
"check_output": true,
"description": "Input 'BBBBBBBB' (value 255) should output 'BBBRRRB' (value 113)",
"expected_accepted": true,
"expected_output": "BBBRRRB",
"input": "BBBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRRRRRRRR' (value 256) should output 'BBBRRRB' (value 113)",
"expected_accepted": true,
"expected_output": "BBBRRRB",
"input": "BRRRRRRRR"
},
{
"check_output": true,
"description": "Input 'RBBRBRRBR' (value 210) should output 'BBBRRRB' (value 113)",
"expected_accepted": true,
"expected_output": "BBBRRRB",
"input": "RBBRBRRBR"
},
{
"check_output": true,
"description": "Input 'BRBBBBBB' (value 191) should output 'BBBRRRB' (value 113)",
"expected_accepted": true,
"expected_output": "BBBRRRB",
"input": "BRBBBBBB"
},
{
"check_output": true,
"description": "Input 'RBRBRBRR' (value 84) should output 'BRBRBRR' (value 84)",
"expected_accepted": true,
"expected_output": "BRBRBRR",
"input": "RBRBRBRR"
},
{
"check_output": true,
"description": "Input 'BRBRBR' (value 42) should output 'BRBRBR' (value 42)",
"expected_accepted": true,
"expected_output": "BRBRBR",
"input": "BRBRBR"
}
] |
manufactoria
|
medium
|
5227afb7-df45-4e12-bd2b-28d7696f1da8
|
numerical_max_min
|
Numerical MIN(113, input)
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nTreat Blue as 1 and Red as 0. Output the minimum of 234 and input. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' (value 6) should output 'BBR' (value 6)",
"expected_accepted": true,
"expected_output": "BBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' (value 2) should output 'BR' (value 2)",
"expected_accepted": true,
"expected_output": "BR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'B' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RR' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BR' (value 2) should output 'BR' (value 2)",
"expected_accepted": true,
"expected_output": "BR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BRB' (value 5) should output 'BRB' (value 5)",
"expected_accepted": true,
"expected_output": "BRB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BB' (value 3) should output 'BB' (value 3)",
"expected_accepted": true,
"expected_output": "BB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'RBRB' (value 5) should output 'BRB' (value 5)",
"expected_accepted": true,
"expected_output": "BRB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BBBRBRRR' (value 232) should output 'BBBRBRRR' (value 232)",
"expected_accepted": true,
"expected_output": "BBBRBRRR",
"input": "BBBRBRRR"
},
{
"check_output": true,
"description": "Input 'BBBRBRRB' (value 233) should output 'BBBRBRRB' (value 233)",
"expected_accepted": true,
"expected_output": "BBBRBRRB",
"input": "BBBRBRRB"
},
{
"check_output": true,
"description": "Input 'BBBRBRBR' (value 234) should output 'BBBRBRBR' (value 234)",
"expected_accepted": true,
"expected_output": "BBBRBRBR",
"input": "BBBRBRBR"
},
{
"check_output": true,
"description": "Input 'BBBRBRBB' (value 235) should output 'BBBRBRBR' (value 234)",
"expected_accepted": true,
"expected_output": "BBBRBRBR",
"input": "BBBRBRBB"
},
{
"check_output": true,
"description": "Input 'BBBRBBRR' (value 236) should output 'BBBRBRBR' (value 234)",
"expected_accepted": true,
"expected_output": "BBBRBRBR",
"input": "BBBRBBRR"
},
{
"check_output": true,
"description": "Input 'BRR' (value 4) should output 'BRR' (value 4)",
"expected_accepted": true,
"expected_output": "BRR",
"input": "BRR"
},
{
"check_output": true,
"description": "Input 'BRRR' (value 8) should output 'BRRR' (value 8)",
"expected_accepted": true,
"expected_output": "BRRR",
"input": "BRRR"
},
{
"check_output": true,
"description": "Input 'BRRRR' (value 16) should output 'BRRRR' (value 16)",
"expected_accepted": true,
"expected_output": "BRRRR",
"input": "BRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRR' (value 32) should output 'BRRRRR' (value 32)",
"expected_accepted": true,
"expected_output": "BRRRRR",
"input": "BRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRR' (value 64) should output 'BRRRRRR' (value 64)",
"expected_accepted": true,
"expected_output": "BRRRRRR",
"input": "BRRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRRR' (value 128) should output 'BRRRRRRR' (value 128)",
"expected_accepted": true,
"expected_output": "BRRRRRRR",
"input": "BRRRRRRR"
},
{
"check_output": true,
"description": "Input 'BBB' (value 7) should output 'BBB' (value 7)",
"expected_accepted": true,
"expected_output": "BBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'BBBB' (value 15) should output 'BBBB' (value 15)",
"expected_accepted": true,
"expected_output": "BBBB",
"input": "BBBB"
},
{
"check_output": true,
"description": "Input 'BBBBB' (value 31) should output 'BBBBB' (value 31)",
"expected_accepted": true,
"expected_output": "BBBBB",
"input": "BBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBB' (value 63) should output 'BBBBBB' (value 63)",
"expected_accepted": true,
"expected_output": "BBBBBB",
"input": "BBBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBBB' (value 127) should output 'BBBBBBB' (value 127)",
"expected_accepted": true,
"expected_output": "BBBBBBB",
"input": "BBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRBRBRB' (value 85) should output 'BRBRBRB' (value 85)",
"expected_accepted": true,
"expected_output": "BRBRBRB",
"input": "BRBRBRB"
},
{
"check_output": true,
"description": "Input 'BRBRBRBR' (value 170) should output 'BRBRBRBR' (value 170)",
"expected_accepted": true,
"expected_output": "BRBRBRBR",
"input": "BRBRBRBR"
},
{
"check_output": true,
"description": "Input 'BBBBBBBB' (value 255) should output 'BBBRBRBR' (value 234)",
"expected_accepted": true,
"expected_output": "BBBRBRBR",
"input": "BBBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRRRRRRRR' (value 256) should output 'BBBRBRBR' (value 234)",
"expected_accepted": true,
"expected_output": "BBBRBRBR",
"input": "BRRRRRRRR"
},
{
"check_output": true,
"description": "Input 'RBBRBRRBR' (value 210) should output 'BBRBRRBR' (value 210)",
"expected_accepted": true,
"expected_output": "BBRBRRBR",
"input": "RBBRBRRBR"
},
{
"check_output": true,
"description": "Input 'BRBBBBBB' (value 191) should output 'BRBBBBBB' (value 191)",
"expected_accepted": true,
"expected_output": "BRBBBBBB",
"input": "BRBBBBBB"
},
{
"check_output": true,
"description": "Input 'RBRBRBRR' (value 84) should output 'BRBRBRR' (value 84)",
"expected_accepted": true,
"expected_output": "BRBRBRR",
"input": "RBRBRBRR"
}
] |
manufactoria
|
medium
|
62db52c4-3963-49d1-9d34-5f3a70aa119e
|
numerical_max_min
|
Numerical MIN(234, input)
|
[
{
"content": "# Manufactoria Solution DSL\n\nA Domain Specific Language for describing Manufactoria puzzle solutions in text format.\n\n## Overview\n\nManufactoria is a puzzle game where you build automated factories to sort robots based on their colored tape patterns. Robots enter your factory carrying sequences of colored tape, and you must route them to the correct destinations based on the given criteria.\n\n## Game Mechanics\n\n### Robots and Tape\n- **Robots**: Each robot carries a sequence of colored tapes\n- **Tape Colors**: Primary colors are Blue (B) and Red (R), with additional Yellow (Y) and Green (G) for advanced puzzles\n- **Tape Representation**: Sequences are represented as strings (e.g., `RBRR`, `BBR`, or empty string `\"\"`)\n\n### Operations\n- **Pull**: Remove tape from the front of the robot's sequence\n- **Paint**: Add colored tape to the end of the robot's sequence\n- **Route**: Direct robots through the factory based on their current tape state\n\n### Objective (output check)\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node and meets the puzzle's acceptance criteria\n- **Rejected**: Robot is routed to the NONE node, or caught in an infinite loop, or robot reaches the END node but fails to meet the puzzle's acceptance criteria \n\n## DSL Syntax\n\n### Program Structure\n\nEvery solution must start with a `START` directive and end with an `END` directive, wrapped in ```manufactoria ...```:\n\n```manufactoria\nSTART start:\n NEXT <next_node_id>\n\n# Factory logic goes here\n\nEND end\n```\n\n### Node Types\n\n#### 1. Puller Nodes\n\nPullers remove specific colors from the front of the robot's tape sequence and route based on the current front color.\n\n**Red/Blue Puller:**\n\n```manufactoria\nPULLER_RB <node_id>:\n [R] <next_node_id> # Route and remove color if front tape is Red\n [B] <next_node_id> # Route and remove color if front tape is Blue\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither red nor blue\n```\n\n**Yellow/Green Puller:**\n\n```manufactoria\nPULLER_YG <node_id>:\n [Y] <next_node_id> # Route and remove color if front tape is Yellow\n [G] <next_node_id> # Route and remove color if front tape is Green\n [EMPTY] <next_node_id> # Route if no tape or front tape is neither yellow nor green\n```\n\n**Note**: Unspecified branches default to `NONE`, which rejects the robot.\n\n#### 2. Painter Nodes\n\nPainters add colored tape to the end of the robot's sequence and continue to the next node.\n\n```manufactoria\nPAINTER_RED <node_id>:\n NEXT <next_node_id>\n\nPAINTER_BLUE <node_id>:\n NEXT <next_node_id>\n\nPAINTER_YELLOW <node_id>:\n NEXT <next_node_id>\n\nPAINTER_GREEN <node_id>:\n NEXT <next_node_id>\n```\n\n## Syntax Rules\n\n1. **Node IDs**: Must be unique identifiers (alphanumeric characters and underscores only)\n2. **Comments**: Lines starting with `#` are comments (single-line only)\n3. **Indentation**: Use consistent spaces or tabs for route definitions\n4. **Case Sensitivity**: Colors must be uppercase (R, B, Y, G)\n5. **Termination**: \n - Robots routed to `NONE` are rejected\n - Robots routed to the END node are accepted if they meet the puzzle criteria, otherwise rejected\n6. **Code Blocks**: Final factory code should be wrapped in triple backticks with ``` markers\n\n## Example\n\nHere's a simple example that accepts robots with exactly one red tape (ending tape should be empty):\n\n```manufactoria\nSTART start:\n NEXT entry\n\nPULLER_RB entry:\n [R] end\n\nEND end\n```\n\n# Task \nYour task is to design a factory with code with following functionality:\n\nTreat Blue as 1 and Red as 0. Output the minimum of 30 and input. The input tape carries only red/blue colors.",
"role": "user"
}
] |
[
{
"check_output": true,
"description": "Input '' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": ""
},
{
"check_output": true,
"description": "Input 'R' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": "R"
},
{
"check_output": true,
"description": "Input 'RB' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "RB"
},
{
"check_output": true,
"description": "Input 'BBR' (value 6) should output 'BBR' (value 6)",
"expected_accepted": true,
"expected_output": "BBR",
"input": "BBR"
},
{
"check_output": true,
"description": "Input 'RBR' (value 2) should output 'BR' (value 2)",
"expected_accepted": true,
"expected_output": "BR",
"input": "RBR"
},
{
"check_output": true,
"description": "Input 'RRB' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "RRB"
},
{
"check_output": true,
"description": "Input 'RR' (value 0) should output '' (value 0)",
"expected_accepted": true,
"expected_output": "",
"input": "RR"
},
{
"check_output": true,
"description": "Input 'BR' (value 2) should output 'BR' (value 2)",
"expected_accepted": true,
"expected_output": "BR",
"input": "BR"
},
{
"check_output": true,
"description": "Input 'BRB' (value 5) should output 'BRB' (value 5)",
"expected_accepted": true,
"expected_output": "BRB",
"input": "BRB"
},
{
"check_output": true,
"description": "Input 'BB' (value 3) should output 'BB' (value 3)",
"expected_accepted": true,
"expected_output": "BB",
"input": "BB"
},
{
"check_output": true,
"description": "Input 'B' (value 1) should output 'B' (value 1)",
"expected_accepted": true,
"expected_output": "B",
"input": "B"
},
{
"check_output": true,
"description": "Input 'RBRB' (value 5) should output 'BRB' (value 5)",
"expected_accepted": true,
"expected_output": "BRB",
"input": "RBRB"
},
{
"check_output": true,
"description": "Input 'BBBRR' (value 28) should output 'BBBRR' (value 28)",
"expected_accepted": true,
"expected_output": "BBBRR",
"input": "BBBRR"
},
{
"check_output": true,
"description": "Input 'BBBRB' (value 29) should output 'BBBRB' (value 29)",
"expected_accepted": true,
"expected_output": "BBBRB",
"input": "BBBRB"
},
{
"check_output": true,
"description": "Input 'BBBBR' (value 30) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BBBBR"
},
{
"check_output": true,
"description": "Input 'BBBBB' (value 31) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BBBBB"
},
{
"check_output": true,
"description": "Input 'BRRRRR' (value 32) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BRRRRR"
},
{
"check_output": true,
"description": "Input 'BRR' (value 4) should output 'BRR' (value 4)",
"expected_accepted": true,
"expected_output": "BRR",
"input": "BRR"
},
{
"check_output": true,
"description": "Input 'BRRR' (value 8) should output 'BRRR' (value 8)",
"expected_accepted": true,
"expected_output": "BRRR",
"input": "BRRR"
},
{
"check_output": true,
"description": "Input 'BRRRR' (value 16) should output 'BRRRR' (value 16)",
"expected_accepted": true,
"expected_output": "BRRRR",
"input": "BRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRR' (value 64) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BRRRRRR"
},
{
"check_output": true,
"description": "Input 'BRRRRRRR' (value 128) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BRRRRRRR"
},
{
"check_output": true,
"description": "Input 'BBB' (value 7) should output 'BBB' (value 7)",
"expected_accepted": true,
"expected_output": "BBB",
"input": "BBB"
},
{
"check_output": true,
"description": "Input 'BBBB' (value 15) should output 'BBBB' (value 15)",
"expected_accepted": true,
"expected_output": "BBBB",
"input": "BBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBB' (value 63) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BBBBBB"
},
{
"check_output": true,
"description": "Input 'BBBBBBB' (value 127) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRBRBRB' (value 85) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BRBRBRB"
},
{
"check_output": true,
"description": "Input 'BRBRBRBR' (value 170) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BRBRBRBR"
},
{
"check_output": true,
"description": "Input 'BBBBBBBB' (value 255) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BBBBBBBB"
},
{
"check_output": true,
"description": "Input 'BRRRRRRRR' (value 256) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BRRRRRRRR"
},
{
"check_output": true,
"description": "Input 'RBBRBRRBR' (value 210) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "RBBRBRRBR"
},
{
"check_output": true,
"description": "Input 'BRBBBBBB' (value 191) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BRBBBBBB"
},
{
"check_output": true,
"description": "Input 'RBRBRBRR' (value 84) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "RBRBRBRR"
},
{
"check_output": true,
"description": "Input 'BRBRBR' (value 42) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BRBRBR"
},
{
"check_output": true,
"description": "Input 'BBRBBRBR' (value 218) should output 'BBBBR' (value 30)",
"expected_accepted": true,
"expected_output": "BBBBR",
"input": "BBRBBRBR"
}
] |
manufactoria
|
medium
|
a3437beb-32cd-4f05-b832-3115518923cc
|
numerical_max_min
|
Numerical MIN(30, input)
|
README.md exists but content is empty.
- Downloads last month
- 23