messages
listlengths 1
1
| ground_truth
listlengths 19
30
| dataset
stringclasses 1
value | difficulty
stringclasses 1
value | id
stringlengths 36
36
| problem_family
stringclasses 3
values | name
stringlengths 11
27
|
|---|---|---|---|---|---|---|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'RYRY' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRYGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRYGYRYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGRYRYBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRYBBRYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYRBBRYRYBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRYYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGYRRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRYYRRGRYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRGRBRRYBRGRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBRRYRBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRRYRYRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRBYRYRBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBGBGBGGBGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBGRBYRYRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBRBYRRBYBR"
}
] |
manufactoria
|
easy
|
7f9b8a22-2241-48ac-9f8d-5db9a2cf92c9
|
contains_substring
|
Contains 'RYRY'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence RBYB (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBYYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYBYBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGBBRRBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRYGBGYGBYBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBYBRRRBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRGBBYBRYYRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGGBRBYYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGBRGBGBRRBBYGBRGBGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGBGGYBRGBYRGRGRGRRBBYGBGGYBRGBYRGRGRGR"
}
] |
manufactoria
|
easy
|
292746cf-e385-4907-b4c3-08f8bd678ea0
|
contains_ordered
|
Contains RBYB
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 1 r and at least 3 ys; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRYRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBGBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRYYGRRGYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYYGRRYRRGGGYRGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBYYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGGGGBBGBBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBBYGBBGGGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGBRYRYYYRYYYRYBY"
}
] |
manufactoria
|
easy
|
bd7439ca-1e85-45f1-a2ee-0d4f24846da3
|
contains_count
|
Need 1 R and 3 Ys
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 2 ys and at least 4 gs; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYYGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGYGYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGGGBYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGYGBYRGYYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGGRGGGYYGYGYGYGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBRYBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRGRYGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRBRBBRRRBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGRRBGRRBBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGYYBRGYGYRYYGYGYG"
}
] |
manufactoria
|
easy
|
08fbd006-e3a6-4898-bb2b-47ffcd07de86
|
contains_count
|
Need 2 Ys and 4 Gs
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence YRG (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYGRGYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYGYGBRRGYGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRGRYYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBRRGRYRBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGGYRBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYBGRBRRRYGYYBGRBRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGGGGBYRYYRRBRYGBYGYBGGGGBYRYYRRBRYGB"
}
] |
manufactoria
|
easy
|
f178e208-f875-4aa5-aa0b-283e49bfca82
|
contains_ordered
|
Contains YRG
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'GYB' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGBYBGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBGYRGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGYGYBGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGYRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGBGGGRGBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYGYBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGBYGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGBYGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYRGRYBBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYGRYRBYG"
}
] |
manufactoria
|
easy
|
5e1b1e20-e09b-4878-b351-051729c47c37
|
contains_substring
|
Contains 'GYB'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence RGGB (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGYGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGBRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRRGGBRGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYRBBGYGGGYGBYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBGBGBRGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYBGGRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRRBRGGGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBRRRGBGRGBBRBRRRGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYYYYBYYGRYRBRBGRYRGBYYYYYBYYGRYRBRBGRY"
}
] |
manufactoria
|
easy
|
b4691b27-3cad-4871-b80a-1a75a5389e3a
|
contains_ordered
|
Contains RGGB
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence RGYR (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGGYBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYRRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYBRBRGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBRBGRYRBBRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBYRBYRGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGRYGRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRRRGYGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYBBBYRYYRGRYYBBBYRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGRYBRGYBYRYGRYYRBRGRBGRYBRGYBYRYGRYYRB"
}
] |
manufactoria
|
easy
|
47e4a513-929f-4330-a84b-b3e1efa7333a
|
contains_ordered
|
Contains RGYR
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 1 b and at least 1 y and at least 4 gs; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGGYGGBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBYRGRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGGYGGBYBBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGGYGGYGBRYRGGBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRYBRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYGGRRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRGRGRGRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYGGBGBGRGGGGBGRB"
}
] |
manufactoria
|
easy
|
7a6e0ec5-40f3-4ab9-9c7c-414a9d66049e
|
contains_count
|
Need 1 B and 1 Y and 4 Gs
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'GYBB' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBBGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBRGBBGYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYBBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBBYGGGYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBRGYBBBYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBBYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGYRBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYGGYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGRGYYGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRYGYBRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBYYBBYGYBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRGBBYGGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBGGYBBBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYGBYRBBBBB"
}
] |
manufactoria
|
easy
|
3d17033a-9d88-4760-99ca-8df55c37a092
|
contains_substring
|
Contains 'GYBB'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 2 rs and at least 2 bs and at least 1 y; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYRBBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGBGRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBRRBYRRGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBBRBYBYRRBRBBRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGGGRGBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBGGGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGBGRGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRGGBYRYYBBGBRGGR"
}
] |
manufactoria
|
easy
|
0ff24b0e-1c0d-465b-ace8-28abc752475b
|
contains_count
|
Need 2 Rs and 2 Bs and 1 Y
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence RRBG (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRGBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBGBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYBBYRRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRRYBRGBGGRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGBGGGRRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGYBGBRRGGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGGRRBBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRGBGGGYRRGYBRGBGGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRYRGBYGBGYGYBBRBYRRGRRYRGBYGBGYGYBBRBY"
}
] |
manufactoria
|
easy
|
597048b0-53b5-42fc-9876-994cf4c3995f
|
contains_ordered
|
Contains RRBG
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence YGRR (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGBRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRRRYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRRYRYGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYYRYYGGGGGRYRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGYRRBGYGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBYGRRGYRBBYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBRYGRBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBYRBRGGYYGRGBYRBRGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRRRGYYBYGGGRGGBBYGRBYRRRGYYBYGGGRGGBB"
}
] |
manufactoria
|
easy
|
5f848ec5-f2e0-4854-bda2-d0c4fdca7562
|
contains_ordered
|
Contains YGRR
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YGRB' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRBGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRRGRBYGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBYGRBYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRBGYBYGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRYYYGRBGRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYGYRBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBBRBYYYBBRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGRGYGGGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRRYGRYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGBGBRGYBGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBRBRGYRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRYYGBRBGRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYYBGYRGBGR"
}
] |
manufactoria
|
easy
|
bf189988-0c9a-46a9-b48a-c4d6be46bbd0
|
contains_substring
|
Contains 'YGRB'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence YGYR (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGYGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGYYBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGYRYBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYYGGYYGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYBBBGBYYBBRRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRYRYGYGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRBBRRYGYGRBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYYRYGYGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRGRYBBYYGRYGRGRYBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGGYRBGGGRRRYYBBRYGRGBGGYRBGGGRRRYYBBR"
}
] |
manufactoria
|
easy
|
27eee1ea-8547-499b-8531-088d2830da40
|
contains_ordered
|
Contains YGYR
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence GBBG (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBBBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBGYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGGYGGBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGRGBRRBRBYGGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGBGBBGBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGGBBGRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGGGBBYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGGGGRYYGBGYBGGGGRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRYRYYYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGYRGRYBYYGYBRBGRYGBGGGYRGRYBYYGYBRBGRY"
}
] |
manufactoria
|
easy
|
1c01a9ff-0a07-4179-88bb-0b56552cd282
|
contains_ordered
|
Contains GBBG
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence BYGG (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGGYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBGBGBYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBRYBGRRGRBYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRGGGGBYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBRGGYBYBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYRGBYGYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGRBRGBRBYGGRGRBRGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRYBYBRYYGRBBBYRGRBYGYRYBYBRYYGRBBBYRGR"
}
] |
manufactoria
|
easy
|
43b8ba28-9d17-438a-ba43-a96df6c6eb70
|
contains_ordered
|
Contains BYGG
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YBBR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBBRBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBYRBBYBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYYYBBRYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBBRBYYBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGYRBYBBRGRYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBBYBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGRBYGGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYBGYBBYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBBBBYBBYBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGRBRBBYBGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBGRBBYRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBYBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGRYBBBRBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGYBBBBYRRG"
}
] |
manufactoria
|
easy
|
933442a7-afb1-4d27-905c-69896253946d
|
contains_substring
|
Contains 'YBBR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'BRGR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGRYYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGGRRBRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBRGRGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGRYGRBRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRYBBRGRYRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGRRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBRBGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRYRRBGRYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBYGBRYBYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBGGBRGGBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRGRBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRBRGRBYRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGBRGGRGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYBRRBGYRYY"
}
] |
manufactoria
|
easy
|
45ef67ea-d0df-41f4-8630-1ee2dcd14a97
|
contains_substring
|
Contains 'BRGR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'BBBR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBRGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBGRRRBBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBBBBRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBRBBBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYGBBBRGBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBRBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGBYBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBBBYBYBBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBGGBBBBBGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGBBBBBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBRBBBBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBGRBBBGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYGYYYGGYGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBYBBBYRBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYBGBYBYRRY"
}
] |
manufactoria
|
easy
|
8da842a7-0940-441a-af43-1c65dda95ffa
|
contains_substring
|
Contains 'BBBR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence RGYG (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGBYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYGYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYYBYRGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYYRRYYGBRYRGBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBYGBRRGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGGYGRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRYGRGYBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGRGBGGYRGGGBGRGBGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRBBYBBBYBRBYBGGRBRGGGRBBYBBBYBRBYBGGRB"
}
] |
manufactoria
|
easy
|
f7f7f593-856a-49fb-a92c-0ed99fb0cace
|
contains_ordered
|
Contains RGYG
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 3 rs and at least 2 ys and at least 1 g; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYYRGRRRYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBBRRRBYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYBYRGGYRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRYRRRYGYYRRRGRYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYBYBRRBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBRBBYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBYBRBRBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYBBGGBGYYYBYRBRG"
}
] |
manufactoria
|
easy
|
552b931a-0197-43ff-afd5-3690cdc7f973
|
contains_count
|
Need 3 Rs and 2 Ys and 1 G
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence GYRG (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGYRRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYRGBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRBGYGYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBGGGYYGRRRGGGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYYRGRYGYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYGRYGRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYGGYRYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBRRRGBBGYGRYBRRRGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGRRBBRBYRBGBBYYBGYGYRGRRBBRBYRBGBBYYB"
}
] |
manufactoria
|
easy
|
ffd3b336-15e6-453b-94c8-9b458b6d359a
|
contains_ordered
|
Contains GYRG
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'RYGR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGRRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYYBGYRYGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYGRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGRBRRRYGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRYBRYGRRRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGRYGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYYGGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGRGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBBGYYRYRBBGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGBRYGYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBYRRGYRGBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGYRGYRRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYYGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRYGYRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRRYRGBRGG"
}
] |
manufactoria
|
easy
|
9bf27dfe-48f8-4afd-b54f-300b6a56c41e
|
contains_substring
|
Contains 'RYGR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YY' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBGBYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBYGYYRYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBRGRYYRBRGRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBYYYBYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGRBBRRBBGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGYYYRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGYBYYG"
}
] |
manufactoria
|
easy
|
4c5a83e1-3c2a-44cb-8302-f401bf003dec
|
contains_substring
|
Contains 'YY'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'RRYB' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRYBGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRBBYGRRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRRYBYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRYBYRRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYRRYBRYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRYBRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYRGYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGRRRBGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGYYRRRGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBYGRRYRBYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBBYRRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRYBYRRGRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRYYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRYRYBRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRGRRYYBRR"
}
] |
manufactoria
|
easy
|
901a947c-1efc-4c64-a08d-d3119c5c83ec
|
contains_substring
|
Contains 'RRYB'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YRGB' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGBRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGGRYBYRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYGYRGBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGBGBGYRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBRYRGBGRBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRRGGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBGBYGBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGBYRYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRBYRGGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRYBGRYBRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBBBGRYRBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRGYRRGBRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBYYRRGGBYG"
}
] |
manufactoria
|
easy
|
928a5f7a-da1a-45fa-b184-db912ea9a539
|
contains_substring
|
Contains 'YRGB'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence BRRB (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRGRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRBRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRGGGBRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGYGBYRBBRRYBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGRBRBBRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGYGBRRBGGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRRBBRRYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBYRGBYRYBRBYBYRGBYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGYYYGGGGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYYBBRBRGYYGYYRRBGBRBBYYBBRBRGYYGYYRRBG"
}
] |
manufactoria
|
easy
|
166af9e6-136d-4d14-8b5b-e093e966518d
|
contains_ordered
|
Contains BRRB
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 3 rs and at least 2 gs; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGGGRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYGBRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGYGRRGGGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGRRRRGRYRRRRGRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRBYYYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRYGYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYBYBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYRBBBBYGYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGYGRBRYYRBRBGYYGG"
}
] |
manufactoria
|
easy
|
ad29807a-2505-4b19-985f-3b458287a5a1
|
contains_count
|
Need 3 Rs and 2 Gs
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'BRYB' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRYBYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYYRGBBRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBRYBBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRYBBBYBRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBRBRYBYYGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRYBRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRRYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBGRRBBBGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGRBRRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBRGBRYBYBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYYBYRBBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGYBYRBRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRYYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBGBYRYBYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGBGRBYYBBG"
}
] |
manufactoria
|
easy
|
d116f040-1370-46d9-8735-34f49817f2cb
|
contains_substring
|
Contains 'BRYB'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 2 bs and at least 1 g; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBYGGGBBBBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYGGRGBBBGBGBYGBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBYYYYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYRYRYRRRYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRYYRRYYYYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYBYRGYRBBRGGBGGB"
}
] |
manufactoria
|
easy
|
d793de96-0caa-48de-ba30-2751b178a35f
|
contains_count
|
Need 2 Bs and 1 G
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 2 bs and at least 2 gs; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBBBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBYBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBYGYYGYYBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRGGGYGGBGRGBBGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRBBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGGYRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYRRYRYRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGYYRRYYYBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYBYRRGRBGBYYBYGBY"
}
] |
manufactoria
|
easy
|
a05c150a-e40a-4fc4-b671-25445886ccde
|
contains_count
|
Need 2 Bs and 2 Gs
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence BYG (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGYBGBYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBGYYGGGGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYGBBBYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBYRGYBGYBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYRGBYYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRRYBRGRGBGGRRYBRGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGGYBYYRRBGBRGBRRBGRRGGYBYYRRBGBRGBRR"
}
] |
manufactoria
|
easy
|
4049d694-8d11-4f78-b3d4-571500d94e28
|
contains_ordered
|
Contains BYG
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YGG' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBGYBYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYYGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGBYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRBGYGGGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBRYRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGYGGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBGGYYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYRGGYRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBRBBBRBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGYYGYGYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYYBGRGRG"
}
] |
manufactoria
|
easy
|
30737ee3-8086-4bf8-9574-634151774998
|
contains_substring
|
Contains 'YGG'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'GGBR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBRBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBYYBGGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYYGGBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBRGYYGGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGGGBRYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBRGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGYBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBYGBBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRRGGBGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGGRBGGBRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYYRBGGRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYGGGBRRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGBGYBYRGR"
}
] |
manufactoria
|
easy
|
4a93cbde-476c-4694-9431-ddcc9a67bcc1
|
contains_substring
|
Contains 'GGBR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence YGRG (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGRRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRGBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRRBGYGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRYYBYGYRGBGGYRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGRGRRYGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRBGGRGYGBRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRRGYGRGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGRGBYYBGYGGBGRGBYYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRGBGBBRBRRYRRYRRYGGGBRGBGBBRBRRYRRYRR"
}
] |
manufactoria
|
easy
|
d21d6500-77ba-46b9-9cad-bae3bfb5c035
|
contains_ordered
|
Contains YGRG
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YGRG' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRGBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRYBGYGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYGRGYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRGBRRYGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGYGRGYGBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRGGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGGRRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBRYRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGYRBGYGBGYRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRBYRYGRGRBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYGRGYRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGRGYGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGRYGGRGGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYYGGGRRGBR"
}
] |
manufactoria
|
easy
|
6009e8f2-1d60-4394-afa1-2f99d671d802
|
contains_substring
|
Contains 'YGRG'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 2 ys and at least 2 gs; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYGYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRYRBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBGYGYRGGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGGGBGYGYBYGGRGYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYRBBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGBGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRBBRRBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBRBBGBRBBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRYGGGYYGBYGYBGYG"
}
] |
manufactoria
|
easy
|
5a273c64-a6c9-4148-a18e-34a7942a4cb0
|
contains_count
|
Need 2 Ys and 2 Gs
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence BRRG (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRRRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRGYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGBBBBRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRGBBRYRYRBGRYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGRGBBBRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYYYRGRRBRYYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBGBRRBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGYGGBYGBRGGRGYGGBYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRYYRRGRYGGGRRBGRBRGRGRYYRRGRYGGGRRBGR"
}
] |
manufactoria
|
easy
|
062e3435-3c42-492d-9fd8-2383127b3f40
|
contains_ordered
|
Contains BRRG
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence RBYR (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBRYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYRYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGGYRRBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBGRGYBBYBYYBBRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYYRGRRBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBGYBRYBRRBGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBGRRBYYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGBRYYYBRBRYGGBRYYYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRYBYYGYBYBYGGYRRRBRBYRYBYYGYBYBYGGYRR"
}
] |
manufactoria
|
easy
|
bbdacda4-e4a5-4c62-bc87-c02be66d8a3a
|
contains_ordered
|
Contains RBYR
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'RGR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRBYGRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRGRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRYRRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBRGRYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRBRRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYGRGYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGGRGRGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGBGRRRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYBBBYYBBYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYRRGRBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRBGGRRY"
}
] |
manufactoria
|
easy
|
5b31529f-33be-44da-88f2-14f948ecaf97
|
contains_substring
|
Contains 'RGR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'RYYY' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYYBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBBRBRYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYRYYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYYGRYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBRRBRYYYYGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBRBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYGBBBRYBYGBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRYRYYYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYBYYYYRYYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRYYYRGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGBGGGBGGGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBRRYYRYGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRRYYGYGYGB"
}
] |
manufactoria
|
easy
|
09394d97-1fc3-4d5d-a4e7-9d804c6770e2
|
contains_substring
|
Contains 'RYYY'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'GGR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYRGYYGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBYGGRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRYYGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBGGRGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRGRGYRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGBBGGGGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGRBRGGYGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYGRGGYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYBYBBYBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBBGRGRRBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGGGRRGB"
}
] |
manufactoria
|
easy
|
d6085ee1-6554-4262-9097-0e5c7c96fa91
|
contains_substring
|
Contains 'GGR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'BYR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRRBYGBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBYRYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRGYRBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBBYRBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRYBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGRBBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGBYRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRYBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYGRYBYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRGBYYRGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBBYRRRB"
}
] |
manufactoria
|
easy
|
e5dbe455-fb6b-49d8-bde1-14976d79edbc
|
contains_substring
|
Contains 'BYR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence YBGY (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGBRGRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGYYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYBBBYBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYGYYYGGBBRGRYBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRGYGBYBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYRYYGBYRYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBYYBGBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRYYRGYGYYBYBRYYRGYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRYRGBGRRRBRBRGRYYBYBYRYRGBGRRRBRBRGRY"
}
] |
manufactoria
|
easy
|
9f52a08e-fbf2-4413-809b-e37348851cdd
|
contains_ordered
|
Contains YBGY
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YGR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGRYBYGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRYGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGRYGGYGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGYGRYGYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBBRYRYYBBRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYBGRBYGBYBGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBGRGYGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRGRGYBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBYYBGRRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRYRGGRBB"
}
] |
manufactoria
|
easy
|
70cf1374-4782-416a-96f9-0b8e9b539d3b
|
contains_substring
|
Contains 'YGR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 3 rs and at least 2 bs; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBRRBBRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBRYYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBRGGGRGRBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBRBRBYRRRBBBBBRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRYYGYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRYBRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGYYGGGGGYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYGGGYRGGBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGYRRRRGGGBYYYRRB"
}
] |
manufactoria
|
easy
|
9736f9d9-53c8-45df-8eaa-ba84a2b62426
|
contains_count
|
Need 3 Rs and 2 Bs
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence BGYB (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGBYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYBGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYRRBYBGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBGGBGGYGGYBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGRYBYYBGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYYRBYGBBGYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGBBGYGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGBRYYGBBGBGRGBRYYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRYGYBYRGYRBGRBYGGBGBYRYGYBYRGYRBGRBYGG"
}
] |
manufactoria
|
easy
|
3a1a2cc8-5bdd-4332-b70b-790e33e42e9d
|
contains_ordered
|
Contains BGYB
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'GBBG' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBGRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYRGBGBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGGBBGYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBGBGBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYYBGBBGYGBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBGBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRBBBYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRBGGGRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRRGYGBGRRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBBGBGBBRBBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBYBGBBGGBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRYBGBGBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYRRYYRYRRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRBGBBGGGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBGGBRBRGBG"
}
] |
manufactoria
|
easy
|
9f1fd7e1-0bf7-4fb5-9aa5-c19902ed0d6e
|
contains_substring
|
Contains 'GBBG'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence BGBR (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGYBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBRGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYYYGRBGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBBGBRGGGBYRRRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGRBRGYBGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRBBRBGBYRBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBRBGBRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYBBGRYRBGRBBYBBGRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYYGBYBRRRYGRRGRBYBGRGYYGBYBRRRYGRRGRBY"
}
] |
manufactoria
|
easy
|
698b2d17-91df-42ab-acd6-40b550782b62
|
contains_ordered
|
Contains BGBR
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YRG' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBYBYYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGGYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRRGYRGRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRGGGYBRRGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBRRYRYBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBGRYRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYGGRYYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYBYRRGGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRYGRBGBB"
}
] |
manufactoria
|
easy
|
c2f63bae-ff4a-4f2f-a20c-3c89d7f8aa21
|
contains_substring
|
Contains 'YRG'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence BYBG (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYRBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBGYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBRRYGBYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBBBYGBYBRRBBBGRYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBBGBBBYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGGBYBRYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBGGBYBRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYGBGGRRBYGRBYGBGGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRBBBBRRBRYGRRYYBBYGYBRBBBBRRBRYGRRYYB"
}
] |
manufactoria
|
easy
|
776c01ec-6a9e-4473-a5a4-91f6431542e7
|
contains_ordered
|
Contains BYBG
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence GBRR (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBBRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRRRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBRGRRGBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYYGYBYRBBRRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBRRYRGBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRGYRRBGYRRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBRGBRGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGGBBYBBGGBRBGGBBYBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGYBRGRRRYRBRGYRYGBRBGGYBRGRRRYRBRGYRY"
}
] |
manufactoria
|
easy
|
7f83f730-a67e-4a2b-a003-b62f45546868
|
contains_ordered
|
Contains GBRR
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 1 b and at least 2 ys and at least 3 gs; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGYGBYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYYGGRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGBGGYGYYGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBYBYBYGYBYBYGGGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRRYRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRBGYGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRRRRYRGRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYYGBRGGRYRBGGBGBG"
}
] |
manufactoria
|
easy
|
8b118afd-9e31-4761-bb92-00f68fd68f88
|
contains_count
|
Need 1 B and 2 Ys and 3 Gs
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence GBGB (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRBGGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGBGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYBRYYGBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBGBBBGGGBBBYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRGBYYGBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGBGBGBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGBGBGGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRBRYBBGGBBBRRBRYBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRYYYRYYRRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRRGBYGBYGGGRGGBGGBBBYRRGBYGBYGGGRGGBG"
}
] |
manufactoria
|
easy
|
aceac2dc-314b-4eec-9438-0ff9c976c38f
|
contains_ordered
|
Contains GBGB
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence YRBY (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRYBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRBYYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBGRGYRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRYRBRRRYBBRYYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGBYBYYRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRYYBRYRYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYGYYRBYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGBYYBYGYRYRGGBYYBYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRBYYGBGYBGRGRYYGBYRYGRBYYGBGYBGRGRYYGB"
}
] |
manufactoria
|
easy
|
cdc63349-c5d9-4f66-8106-0e5bd8b07232
|
contains_ordered
|
Contains YRBY
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'RGYR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYRBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYBGRRGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYRYGRGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBBRGYRBRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYRGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRGBYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGGBBRRBGGBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRYRRRGBRYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGYRYYRGYYGYRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBRYGRBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYRYGRRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGRRGYRBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBRBGGYYRRG"
}
] |
manufactoria
|
easy
|
73cc8ef7-4f6e-42a1-a7ab-59425952b6fe
|
contains_substring
|
Contains 'RGYR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'GYGB' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYGBBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBYRBGYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGGYGBGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYGBRYGGYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGBGYGBBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYGBYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGYBGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRBGYRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYGGYGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRBRGGYGGRBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGBGYGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYBGYGBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGYGYYGBBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGGGYBGYBRR"
}
] |
manufactoria
|
easy
|
566f0ec8-fc0c-4c21-89ec-7cc27228ee24
|
contains_substring
|
Contains 'GYGB'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'GBGR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGRGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRBRYBGBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGBGRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGRGGYGBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGYRGBGRRGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGRBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRBBGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBRGYBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGRYGBYGRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRBGBGRGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYRRGBGRBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBRGBGRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGGGBYGRBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRGRBRGGRBB"
}
] |
manufactoria
|
easy
|
85e032f9-cf32-4e18-b724-e6dc0b0e3b46
|
contains_substring
|
Contains 'GBGR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence RRBR (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBRRBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBRYRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRYYRRRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRGRBRRRGRBRRYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRRBRYBRRBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBGBBRBRRYBGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRRRRBYBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGRRYBGGBRRRBGRRYBGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGYGGGYGGYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBYBRYBBBRGRRRRYBRRRGGBYBRYBBBRGRRRRYB"
}
] |
manufactoria
|
easy
|
ac498c4e-d82a-4a84-8361-d01ee436e99a
|
contains_ordered
|
Contains RRBR
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 1 b; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBGBRGBRRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRYBBBBRYBBYGYBBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYRRGGGGRRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRYGYGGGRRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBYYYGYRBBBBGGGBR"
}
] |
manufactoria
|
easy
|
a67f1372-368a-4af3-aebc-fd4b2fe4e708
|
contains_count
|
At least 1 B
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YBGR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGRBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRYRGYBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBGRYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGRBYBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGYBGRBRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRBGGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGYBBBYRGYBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYBRYGYBRYBRYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBGYBGBBBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBGRGBYGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGRGBYGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBYGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRGYRBGRGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBYYBBGGRYB"
}
] |
manufactoria
|
easy
|
8c15658b-c3b9-412b-80d0-8e8276ce94d3
|
contains_substring
|
Contains 'YBGR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 4 bs and at least 2 ys; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBYBBYYBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBYGRBBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGBBYYBBBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBBGYBYYYBGBBBYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGBBRBRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRYBGBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRGRRRGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGGGBRGRYGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBBGYYYGBYGRBBBYR"
}
] |
manufactoria
|
easy
|
c8bd6e57-d89c-41fe-843d-712d71691172
|
contains_count
|
Need 4 Bs and 2 Ys
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYYGGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBRRYRYYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYYRYYYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBBRYGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBGBGBGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRYRRYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYRRYR"
}
] |
manufactoria
|
easy
|
b4afa7a4-a783-4597-8680-63b28581309a
|
contains_substring
|
Contains 'YR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 1 r and at least 1 y and at least 3 gs; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGYRGYRYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBGBGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGGYGGRGGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYGYYYRRGGGGGGRGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBRYBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGGRBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGBBBBGBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRRBYRYGGYBGGYGYRG"
}
] |
manufactoria
|
easy
|
2479e46d-c936-457a-a626-f726d556debf
|
contains_count
|
Need 1 R and 1 Y and 3 Gs
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence BGB (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBRBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBRBRBBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGBBBGRBGGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGBRBBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRBBGBRYRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBGBBGRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBYRGRBRGBBYBYRGRBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRYRRRRRYYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGYBBRYRBGYBBGGBBBBYBGYBBRYRBGYBBGGBB"
}
] |
manufactoria
|
easy
|
c30c413e-0fa4-441f-8b80-bdeb5a686b21
|
contains_ordered
|
Contains BGB
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 2 rs and at least 2 bs and at least 2 gs; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRRGGGBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGYRBYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBRGRGYBRRYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGRBRRBBBBGGRRRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYBBRYRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYYGBBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYBRYYGYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYRBRBRYYBGGRGGRBB"
}
] |
manufactoria
|
easy
|
be5e27a8-f70e-49b2-b2d3-b42e06be568b
|
contains_count
|
Need 2 Rs and 2 Bs and 2 Gs
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 2 rs and at least 1 b and at least 1 g; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBBBGRGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRYRBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGRRRRRBYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGBRGGRGRRBGBYBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYRBYYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYYBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGRYRBGGRRYGGGRBYG"
}
] |
manufactoria
|
easy
|
624ddd3b-3fe2-4d76-aec2-695cd49820d6
|
contains_count
|
Need 2 Rs and 1 B and 1 G
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YGGB' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGBBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGBGBYGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGBBYGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGYYYGGBGRYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGBGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGGGGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYRRBYYYRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYRRYGYYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYYGBRYGGRYYGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBGGYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBGBGGYBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBRYGBGBBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYYGYGGBYG"
}
] |
manufactoria
|
easy
|
ac2b0772-db3c-4603-9077-393b73ee31bd
|
contains_substring
|
Contains 'YGGB'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence RBB (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRBBRRBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYGRYBBYGBRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBBBBYRBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGBBBRGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBBRBBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGBYYGBBRBRGGBYYGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGYYYYYGYGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGRRBBBYBGRGYRRYRRBBRGRRBBBYBGRGYRRYR"
}
] |
manufactoria
|
easy
|
4ee0920a-5f92-4343-9842-0fd4897c7fd7
|
contains_ordered
|
Contains RBB
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence BY (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGYYBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGRRBGYYYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYGYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGRRYBBRGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRGRRGRRG"
}
] |
manufactoria
|
easy
|
0d243bf7-523e-4655-bbd7-97394d72d38b
|
contains_ordered
|
Contains BY
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'BBGY' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBGYRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBBBYBBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBBGYGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBGYRYBBBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGYYRBBGYBYRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBGYBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGBGGRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBBBRBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYRBBGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRRBBGYBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGYYGBBYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBBYGBBYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRBBGGYRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGBBBYGGYRY"
}
] |
manufactoria
|
easy
|
7665f321-7f7f-4919-914c-f4f8c22a095e
|
contains_substring
|
Contains 'BBGY'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence RYYY (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRYRYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYYGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRBBRGRYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRBGYRBYBYYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBYYGBRYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYYYYRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGYRYYRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBYYGYBBRYYBYBYYGYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBGGGGGGBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBYRGRGBGRGGBGRYGRYYRRBYRGRGBGRGGBGRYG"
}
] |
manufactoria
|
easy
|
852a3e43-8930-4264-8a55-f26659ebc47b
|
contains_ordered
|
Contains RYYY
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'BG' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBGGBYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYBBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGBGGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRRRBBBRRRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBBGBYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYYRYRYRYRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBGBGGBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRBBGBG"
}
] |
manufactoria
|
easy
|
46b09c6a-924e-4bac-bbf8-df04d359c424
|
contains_substring
|
Contains 'BG'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 1 b and at least 2 ys and at least 2 gs; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGGBYBBYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBYYRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRGGGYYRBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBBYBBYGYGYYGGBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRRYBRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRYRGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRRRGRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYYGYYBYBGGYRBRGGG"
}
] |
manufactoria
|
easy
|
0e89e82e-d7b8-4317-9a94-42f03fb29739
|
contains_count
|
Need 1 B and 2 Ys and 2 Gs
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'BYRY' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRYBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRGRRBYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBYRYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRYYYRBYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBBYRYGBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRYYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBYRRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBRBGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRBBBYYRBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRGBBYRGRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRYYRYBBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBYRYBRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGBBYRYYYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYBBYRRBYBR"
}
] |
manufactoria
|
easy
|
50247f4d-5f26-4267-9133-110bc4952fe9
|
contains_substring
|
Contains 'BYRY'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'GBRB' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRBBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBBRYRGBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGGBRBBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRBRGBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBYGRGBRBBRBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRBBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRBBRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBYRRRGRBYRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYYGBGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYBGBRYYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRBRBGGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYRBRBGYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGYGBBRBRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGGRBRRGBYG"
}
] |
manufactoria
|
easy
|
81a9c23e-1499-4d63-b8c2-2096f105ca69
|
contains_substring
|
Contains 'GBRB'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 1 b and at least 1 y and at least 2 gs; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGGGBBYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRRBRYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBRBGYBGYRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBYGYBYGRBGYGYGGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYRBRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGYRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRGRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYYRGBGBRGBYBGBYRR"
}
] |
manufactoria
|
easy
|
b2b71038-fcbb-415b-b59b-d5ead8112a75
|
contains_count
|
Need 1 B and 1 Y and 2 Gs
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'GGBY' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBYRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYBGBGGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRGGBYBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBYBGGGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGYGGBYGGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBYGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRGGBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBYGGRBYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBBGGGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYGGGGBRYGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGYYBGGYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYBYBGGRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBGGGGBYRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYGGGGBRYGG"
}
] |
manufactoria
|
easy
|
e5e82ece-e2ee-409a-8487-8239300ddab1
|
contains_substring
|
Contains 'GGBY'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'RBGR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBGRBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRYGBRBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRBGRRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBGRRRRBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGRBGRYYYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRBYGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGRYRYGRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRGRRBYRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGGYRRRBGBGGYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBGRGBRGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGRGBRGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBYRBBGRGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRRYBGGBRYB"
}
] |
manufactoria
|
easy
|
948b9a54-9402-4969-a1c9-9a518dc5c429
|
contains_substring
|
Contains 'RBGR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence YBRR (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYBRRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRRGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBBYRYBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYYBBGGRYRRRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBYRRGYYBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYGRRBYGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRBRYBRGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGGRGBGGYBRBGGGRGBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGYGRGYGGRYBBYYYRYBRYRGYGRGYGGRYBBYYYR"
}
] |
manufactoria
|
easy
|
e1d440b6-b9c0-40b8-998a-32c52204ad15
|
contains_ordered
|
Contains YBRR
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence BRBG (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRRBYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBGBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRGBYBRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYYBBYRRGBBGGGGYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBBGGRBRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBGBRBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBGGBRBYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBBRRYGYGBRGYBBRRYGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRYBYYRRYRGBGGYGRBRGYYRYBYYRRYRGBGGYGR"
}
] |
manufactoria
|
easy
|
784d1165-1af0-4458-b89d-c577580e68d0
|
contains_ordered
|
Contains BRBG
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'RGRR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRRYBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGGRRRGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGGRGRRRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRRBBBRGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYYYRGRRBBGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRRGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBGBRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYBRRYYBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBGYRGRBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBRRYYRGRYBRRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBRRGRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYRRRGRYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBYBYYBBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBRRGRRRBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRRGGRBRBB"
}
] |
manufactoria
|
easy
|
c9c1052e-ff4d-45ab-b628-5e99cf0cd1ef
|
contains_substring
|
Contains 'RGRR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence GRRB (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRGRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRRBGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYYYGGGRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYYGRRYRRGBGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYRBBYGRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGBGRBRRGRGBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYGBGRRYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBRRGGBBGGRBRBRRGGBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBRYRBRRGBRGGBRBGBGRBRBRYRBRRGBRGGBRBGB"
}
] |
manufactoria
|
easy
|
a77ef950-7c46-4c8d-82d9-398daaaf9250
|
contains_ordered
|
Contains GRRB
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence RRGR (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRBGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGRGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRGYGRRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYGRGBRRGGRRYGRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGGRBGRRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGGRGRRYRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBRRRGBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBRYRGRYGRRRBBRYRGRYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYBYYBYYYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYRBRBGYYRYYYRBBRYRRRBYRBRBGYYRYYYRBBRY"
}
] |
manufactoria
|
easy
|
10e49f44-c98c-4a49-85ba-112ffc32cecb
|
contains_ordered
|
Contains RRGR
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence GRYY (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRRYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYYRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRYRGYGRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGBRRRYBYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRGYYGBGRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYBYYRGYYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRBYGRYRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYYYYYYYGGRYYYYYYYYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRRYBGGBGBGRRGYYGGRYGBRRYBGGBGBGRRGYYG"
}
] |
manufactoria
|
easy
|
9d45b051-4df9-4a39-b01e-3ff098b17614
|
contains_ordered
|
Contains GRYY
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence GRB (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRBRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYRYYGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGBGRRYBGGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBRBYYGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBYRBRGGBBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGRBGRBGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGRBBBYBGGBBGRBBBYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGRGYGRYYYRGRBGYGGGBRGRGYGRYYYRGRBGYGG"
}
] |
manufactoria
|
easy
|
28d8c313-e157-441b-b53d-57023b64d3e2
|
contains_ordered
|
Contains GRB
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'GYBG' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBGRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRRBGGGYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGGYBGBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBGYBGYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRBRGYBGBGYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBGYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYYRBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYBGRYGRYBGRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRRGBGGYGRRGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYGYBGRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRBGBYGRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBBGBYGGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYRBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYYGYYBGRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBGBYRBYGGG"
}
] |
manufactoria
|
easy
|
abcedbb6-f1a0-4a97-aa75-631b20a0ecbe
|
contains_substring
|
Contains 'GYBG'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'GBGG' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGGBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBGYGGBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBGBGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGGRYRGBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBRGBGGRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGGBGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGBRGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBBGGRBBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYBGBYGBGYBGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBGBGBGRBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGGGBGBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRBGGBGGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRRRYRYRYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRBGBGRGBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGGGBYGBGBB"
}
] |
manufactoria
|
easy
|
bc326a0a-a315-4af3-bd5e-45aed6133eff
|
contains_substring
|
Contains 'GBGG'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence RYBB (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRYRBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBBRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRYYRRYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBGRBGYYBRYBBRYGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYGBBYBRYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBBBYRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRBRYBRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYYRYRRBRYBBGYYRYRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGGGYYBRGRBBBGRRBRYBBYGGGYYBRGRBBBGRRB"
}
] |
manufactoria
|
easy
|
c9e5ede5-42bd-43eb-97fc-bff1efe76516
|
contains_ordered
|
Contains RYBB
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YRR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYBYRBYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRRGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRGYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRYYYRRRRGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYBGYBYBG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGBYYRYGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBYRRYBGBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBRRRYBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGBGBGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRGYGRRGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGYBRGRGR"
}
] |
manufactoria
|
easy
|
cdd108e6-9e7e-4bbd-b793-e5e15a028747
|
contains_substring
|
Contains 'YRR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'BBYY' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYYGYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYBYGBBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBBYYYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYYBRBBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGYRYBBYYGBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYYBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYBYYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBYBBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBGBBRBBRBGBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRGYGBBYGRGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRYRYYBBGRYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBYYYBBYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRRGRRRGGRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYBBYYYRYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYBYBYYRYGG"
}
] |
manufactoria
|
easy
|
74596aa2-eac4-4a3b-9ebe-ea4104b5c6bc
|
contains_substring
|
Contains 'BBYY'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'BRG' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YGGBYRBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBBRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRGGBBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYYBRGRYRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGRBYGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGBBRRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYGRBRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGYGRBGGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYYYYYYYYYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYYBYRGGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGBRRBGGY"
}
] |
manufactoria
|
easy
|
cfb5d52c-9cd7-492d-9315-9e5a940f5338
|
contains_substring
|
Contains 'BRG'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'RRGY' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGYGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGGBGRRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GRRRGYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGYRRRRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYBGBRRGYRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGYRGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGRBGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGYRBGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRGRRRBRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGBRRGBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGYGRRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGYYGRRYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBBBBBBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYRRRBGYBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGRBRYGBYBB"
}
] |
manufactoria
|
easy
|
5bac0543-87db-4037-aa1e-d7b39652adaf
|
contains_substring
|
Contains 'RRGY'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence BBBY (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBYBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBBYYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGBRRYBBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBBRGBBRBRGGYYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBRBYRGBBBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRYYBBBBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRYBBBYYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYBRGBBBBBBYYYBRGBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYYGBGGYBRBYBYYYYBBBYYYYGBGGYBRBYBYYYYB"
}
] |
manufactoria
|
easy
|
5bf22bee-6c1c-4690-9a9c-2c5e2b6f6440
|
contains_ordered
|
Contains BBBY
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'RGG' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGYYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRGBYBRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGYYRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGYGGRGGBGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBBGRBRYBBGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRRRRGBRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGYGGGRBGYG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RGBGGRRGB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YBYYBBBYBBYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRGRGRGBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYRBGRGYB"
}
] |
manufactoria
|
easy
|
9f7aeddc-404f-413f-925c-83092e2afdfa
|
contains_substring
|
Contains 'RGG'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the substring 'YRRR' (must be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRRGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGBRGYRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRRRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRRYBYRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBYRRRYYBRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YYRGRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBGRBYRBGRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGBRBYRYGBRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBRYRRGBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYBRRRYRYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBYRRRYYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YRGRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GBBGBBGGBBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BYRYRBRRBYR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GRYGRGRRRBY"
}
] |
manufactoria
|
easy
|
512ca740-f092-408c-ae9f-bba6dba14f54
|
contains_substring
|
Contains 'YRRR'
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 2 rs and at least 3 ys; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "Y"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "G"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYRRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYYRYYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGBYYRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YYGRGGRRRYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBRBBRYRYRYYRYYRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBBBRGR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YGGRYBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGGGGGGGGBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGYBBBBBRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYRYBGYRYRRRGYYBYB"
}
] |
manufactoria
|
easy
|
70b3dc44-6811-4833-8550-59a230c28d17
|
contains_count
|
Need 2 Rs and 3 Ys
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape contains the subsequence BGYY (does not have to be consecutive); reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BYGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGGBYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGYYBBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGRYGGBGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RRBRBBGGGYBYYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BGBYYYGBGYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GYY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGY"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RYYYGBRY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RBYYBGYRBY"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "YBYBRBGBBBGYYBYBRBGBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRRRRRRRRRRR"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBBRBGBBYRYRYBYYRYBGYGBBRBGBBYRYRYBYYRY"
}
] |
manufactoria
|
easy
|
defbc092-bd6a-4c38-bb4c-20dab81a6b33
|
contains_ordered
|
Contains BGYY
|
[
{
"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\nRoute robots to the correct destinations based on their final tape configuration and the puzzle requirements:\n- **Accepted**: Robot reaches the END node\n- **Rejected**: Robot is not routed to the END node or caught in an infinite loop. \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\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\nAccept if the tape has at least 1 r and at least 3 bs and at least 1 y; reject otherwise.",
"role": "user"
}
] |
[
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": ""
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "R"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "YB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "RRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "B"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BRBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "BBYYBBYRRB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GGRBGBYB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GBYYRYYBGYBB"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "RYYRYBBBBGYRRRRBBR"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "BGGGGBBRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBBBGRG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGGGGGGGGGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": false,
"expected_output": "",
"input": "GGBGGGGGBGGG"
},
{
"check_output": false,
"description": "",
"expected_accepted": true,
"expected_output": "",
"input": "GYBBYBRBRYYGRBGRBB"
}
] |
manufactoria
|
easy
|
cb1b8f22-cd48-4d64-b8d7-8fa08beb93c0
|
contains_count
|
Need 1 R and 3 Bs and 1 Y
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.