question stringlengths 53 2.32k | answer stringlengths 1 5.65k | metadata stringlengths 73 5.85k | dataset_source stringclasses 34
values |
|---|---|---|---|
Spell this word backward (example: sun -> nus): requiz | ziuqer | {"source_dataset": "spell_backward", "source_index": 0, "word": "requiz", "word_len": 6, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): getup | puteg | {"source_dataset": "spell_backward", "source_index": 1, "word": "getup", "word_len": 5, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): palpation | noitaplap | {"source_dataset": "spell_backward", "source_index": 2, "word": "palpation", "word_len": 9, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): Karamojo | ojomaraK | {"source_dataset": "spell_backward", "source_index": 3, "word": "Karamojo", "word_len": 8, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): cicala | alacic | {"source_dataset": "spell_backward", "source_index": 4, "word": "cicala", "word_len": 6, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): calculous | suoluclac | {"source_dataset": "spell_backward", "source_index": 5, "word": "calculous", "word_len": 9, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): serigraphy | yhpargires | {"source_dataset": "spell_backward", "source_index": 6, "word": "serigraphy", "word_len": 10, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): antiae | eaitna | {"source_dataset": "spell_backward", "source_index": 7, "word": "antiae", "word_len": 6, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): gametogony | ynogotemag | {"source_dataset": "spell_backward", "source_index": 8, "word": "gametogony", "word_len": 10, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): convener | renevnoc | {"source_dataset": "spell_backward", "source_index": 9, "word": "convener", "word_len": 8, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): idealess | sselaedi | {"source_dataset": "spell_backward", "source_index": 10, "word": "idealess", "word_len": 8, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): unstout | tuotsnu | {"source_dataset": "spell_backward", "source_index": 11, "word": "unstout", "word_len": 7, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): auroral | larorua | {"source_dataset": "spell_backward", "source_index": 12, "word": "auroral", "word_len": 7, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): Hedera | aredeH | {"source_dataset": "spell_backward", "source_index": 13, "word": "Hedera", "word_len": 6, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): thrawcrook | koorcwarht | {"source_dataset": "spell_backward", "source_index": 14, "word": "thrawcrook", "word_len": 10, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): kecky | ykcek | {"source_dataset": "spell_backward", "source_index": 15, "word": "kecky", "word_len": 5, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): roquist | tsiuqor | {"source_dataset": "spell_backward", "source_index": 16, "word": "roquist", "word_len": 7, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): aglossia | aissolga | {"source_dataset": "spell_backward", "source_index": 17, "word": "aglossia", "word_len": 8, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): selfcide | edicfles | {"source_dataset": "spell_backward", "source_index": 18, "word": "selfcide", "word_len": 8, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Spell this word backward (example: sun -> nus): fearlessly | ylsselraef | {"source_dataset": "spell_backward", "source_index": 19, "word": "fearlessly", "word_len": 10, "difficulty": {"word_len": [3, 10]}} | spell_backward |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 3 1 3 9 8 0 1 2 4 | {"source_dataset": "spiral_matrix", "source_index": 0, "matrix": [[3, 1, 3], [2, 4, 9], [1, 0, 8]], "solution": [3, 1, 3, 9, 8, 0, 1, 2, 4], "n": 3, "difficulty": {"n": [2, 10]}} | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 5 7 4 2 | {"source_dataset": "spiral_matrix", "source_index": 1, "matrix": [[5, 7], [2, 4]], "solution": [5, 7, 4, 2], "n": 2, "difficulty": {"n": [2, 10]}} | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 1 9 9 5 2 9 7 3 9 4 9 8 0 3 5 8 8 2 0 6 6 1 2 8 6 6 3 1 1 5 0 7 0 4 3 1 1 4 0 4 6 5 5 1 2 7 5 5 4 7 8 4 7 4 1 0 9 5 7 3 3 2 1 0 | {"source_dataset": "spiral_matrix", "source_index": 2, "matrix": [[1, 9, 9, 5, 2, 9, 7, 3], [1, 1, 5, 0, 7, 0, 4, 9], [3, 5, 4, 7, 8, 4, 3, 4], [6, 5, 3, 3, 2, 7, 1, 9], [6, 7, 7, 0, 1, 4, 1, 8], [8, 2, 5, 9, 0, 1, 4, 0], [2, 1, 5, 5, 6, 4, 0, 3], [1, 6, 6, 0, 2, 8, 8, 5]], "solution": [1, 9, 9, 5, 2, 9, 7, 3, 9, 4, 9,... | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 5 1 5 1 5 1 4 0 4 6 7 6 3 6 1 4 0 4 0 9 2 7 1 2 2 1 1 9 4 0 0 2 5 4 6 1 | {"source_dataset": "spiral_matrix", "source_index": 3, "matrix": [[5, 1, 5, 1, 5, 1], [9, 2, 7, 1, 2, 4], [0, 2, 5, 4, 2, 0], [4, 0, 1, 6, 1, 4], [0, 0, 4, 9, 1, 6], [4, 1, 6, 3, 6, 7]], "solution": [5, 1, 5, 1, 5, 1, 4, 0, 4, 6, 7, 6, 3, 6, 1, 4, 0, 4, 0, 9, 2, 7, 1, 2, 2, 1, 1, 9, 4, 0, 0, 2, 5, 4, 6, 1], "n": 6, "di... | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 8 0 9 9 6 8 9 3 2 | {"source_dataset": "spiral_matrix", "source_index": 4, "matrix": [[8, 0, 9], [3, 2, 9], [9, 8, 6]], "solution": [8, 0, 9, 9, 6, 8, 9, 3, 2], "n": 3, "difficulty": {"n": [2, 10]}} | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 5 3 0 1 5 5 9 1 5 6 8 0 4 4 2 1 5 9 0 0 3 7 8 7 8 6 9 7 5 8 6 9 8 8 3 6 8 8 0 9 3 5 5 3 8 6 6 0 9 | {"source_dataset": "spiral_matrix", "source_index": 5, "matrix": [[5, 3, 0, 1, 5, 5, 9], [7, 8, 6, 9, 7, 5, 1], [8, 9, 3, 5, 5, 8, 5], [7, 0, 0, 9, 3, 6, 6], [3, 8, 6, 6, 8, 9, 8], [0, 8, 6, 3, 8, 8, 0], [0, 9, 5, 1, 2, 4, 4]], "solution": [5, 3, 0, 1, 5, 5, 9, 1, 5, 6, 8, 0, 4, 4, 2, 1, 5, 9, 0, 0, 3, 7, 8, 7, 8, 6, 9... | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 0 2 7 2 8 5 1 9 4 6 4 9 0 0 6 1 7 6 5 0 8 7 3 8 8 5 2 9 9 4 4 8 7 1 2 9 9 5 5 0 1 7 1 3 5 2 9 6 6 6 4 7 9 9 1 1 1 6 6 6 5 8 9 4 4 4 2 6 3 3 4 2 3 9 7 0 2 2 7 5 3 6 8 2 3 4 6 2 3 8 5 3 8 2 5 2 3 0 8 2 | {"source_dataset": "spiral_matrix", "source_index": 6, "matrix": [[0, 2, 7, 2, 8, 5, 1, 9, 4, 6], [9, 9, 5, 5, 0, 1, 7, 1, 3, 4], [2, 4, 4, 4, 2, 6, 3, 3, 5, 9], [1, 9, 2, 3, 4, 6, 2, 4, 2, 0], [7, 8, 8, 2, 3, 0, 3, 2, 9, 0], [8, 5, 6, 5, 2, 8, 8, 3, 6, 6], [4, 6, 3, 2, 8, 3, 5, 9, 6, 1], [4, 6, 5, 7, 2, 2, 0, 7, 6, 7]... | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 0 5 4 5 1 0 8 6 8 | {"source_dataset": "spiral_matrix", "source_index": 7, "matrix": [[0, 5, 4], [6, 8, 5], [8, 0, 1]], "solution": [0, 5, 4, 5, 1, 0, 8, 6, 8], "n": 3, "difficulty": {"n": [2, 10]}} | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 5 9 9 9 2 3 5 3 0 8 2 5 5 3 0 7 8 1 5 1 6 8 1 1 4 3 6 6 8 1 1 8 5 9 7 1 1 2 9 2 9 5 9 3 5 2 6 5 6 8 3 2 0 7 7 9 6 5 3 1 5 7 8 8 4 4 4 5 9 8 0 6 3 8 7 1 3 4 1 9 4 | {"source_dataset": "spiral_matrix", "source_index": 8, "matrix": [[5, 9, 9, 9, 2, 3, 5, 3, 0], [8, 5, 9, 7, 1, 1, 2, 9, 8], [1, 9, 6, 5, 3, 1, 5, 2, 2], [1, 7, 6, 3, 8, 7, 7, 9, 5], [8, 7, 0, 9, 4, 1, 8, 5, 5], [6, 0, 8, 1, 4, 3, 8, 9, 3], [6, 2, 9, 5, 4, 4, 4, 3, 0], [3, 3, 8, 6, 5, 6, 2, 5, 7], [4, 1, 1, 8, 6, 1, 5, ... | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 5 6 8 0 8 8 9 4 8 8 8 1 7 0 7 3 3 6 0 2 5 4 8 4 6 | {"source_dataset": "spiral_matrix", "source_index": 9, "matrix": [[5, 6, 8, 0, 8], [3, 3, 6, 0, 8], [7, 4, 6, 2, 9], [0, 8, 4, 5, 4], [7, 1, 8, 8, 8]], "solution": [5, 6, 8, 0, 8, 8, 9, 4, 8, 8, 8, 1, 7, 0, 7, 3, 3, 6, 0, 2, 5, 4, 8, 4, 6], "n": 5, "difficulty": {"n": [2, 10]}} | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 5 7 0 8 9 6 6 2 3 7 6 6 2 7 7 5 0 2 7 6 9 1 0 8 3 2 5 0 1 7 0 0 2 6 4 1 | {"source_dataset": "spiral_matrix", "source_index": 10, "matrix": [[5, 7, 0, 8, 9, 6], [6, 9, 1, 0, 8, 6], [7, 0, 2, 6, 3, 2], [2, 0, 1, 4, 2, 3], [0, 7, 1, 0, 5, 7], [5, 7, 7, 2, 6, 6]], "solution": [5, 7, 0, 8, 9, 6, 6, 2, 3, 7, 6, 6, 2, 7, 7, 5, 0, 2, 7, 6, 9, 1, 0, 8, 3, 2, 5, 0, 1, 7, 0, 0, 2, 6, 4, 1], "n": 6, "d... | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 3 0 5 7 8 0 0 2 3 2 0 8 2 5 7 3 4 5 5 8 5 7 2 7 2 | {"source_dataset": "spiral_matrix", "source_index": 11, "matrix": [[3, 0, 5, 7, 8], [3, 4, 5, 5, 0], [7, 7, 2, 8, 0], [5, 2, 7, 5, 2], [2, 8, 0, 2, 3]], "solution": [3, 0, 5, 7, 8, 0, 0, 2, 3, 2, 0, 8, 2, 5, 7, 3, 4, 5, 5, 8, 5, 7, 2, 7, 2], "n": 5, "difficulty": {"n": [2, 10]}} | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 6 7 3 4 8 6 7 9 8 5 3 7 0 7 3 7 | {"source_dataset": "spiral_matrix", "source_index": 12, "matrix": [[6, 7, 3, 4], [7, 0, 7, 8], [3, 7, 3, 6], [5, 8, 9, 7]], "solution": [6, 7, 3, 4, 8, 6, 7, 9, 8, 5, 3, 7, 0, 7, 3, 7], "n": 4, "difficulty": {"n": [2, 10]}} | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 3 2 4 2 7 1 1 4 5 | {"source_dataset": "spiral_matrix", "source_index": 13, "matrix": [[3, 2, 4], [4, 5, 2], [1, 1, 7]], "solution": [3, 2, 4, 2, 7, 1, 1, 4, 5], "n": 3, "difficulty": {"n": [2, 10]}} | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 0 8 5 6 7 0 9 4 3 7 7 9 9 3 0 9 5 9 3 9 2 1 0 8 4 9 3 2 8 0 0 8 5 1 7 2 0 1 5 0 6 8 5 2 6 2 0 6 3 7 4 3 2 0 8 0 8 6 3 3 1 4 1 2 8 8 8 2 5 7 2 8 7 5 9 7 9 3 3 9 7 1 2 8 4 0 6 2 0 3 2 3 9 7 0 8 8 2 4 9 | {"source_dataset": "spiral_matrix", "source_index": 14, "matrix": [[0, 8, 5, 6, 7, 0, 9, 4, 3, 7], [2, 0, 1, 5, 0, 6, 8, 5, 2, 7], [7, 2, 8, 8, 8, 2, 5, 7, 6, 9], [1, 1, 8, 4, 0, 6, 2, 2, 2, 9], [5, 4, 2, 8, 8, 2, 0, 8, 0, 3], [8, 1, 1, 0, 9, 4, 3, 7, 6, 0], [0, 3, 7, 7, 9, 3, 2, 5, 3, 9], [0, 3, 9, 3, 3, 9, 7, 9, 7, 5... | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 5 0 9 9 | {"source_dataset": "spiral_matrix", "source_index": 15, "matrix": [[5, 0], [9, 9]], "solution": [5, 0, 9, 9], "n": 2, "difficulty": {"n": [2, 10]}} | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 9 3 6 3 5 0 4 6 3 8 7 7 3 4 0 7 1 4 6 9 5 7 1 0 7 | {"source_dataset": "spiral_matrix", "source_index": 16, "matrix": [[9, 3, 6, 3, 5], [7, 1, 4, 6, 0], [0, 0, 7, 9, 4], [4, 1, 7, 5, 6], [3, 7, 7, 8, 3]], "solution": [9, 3, 6, 3, 5, 0, 4, 6, 3, 8, 7, 7, 3, 4, 0, 7, 1, 4, 6, 9, 5, 7, 1, 0, 7], "n": 5, "difficulty": {"n": [2, 10]}} | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 0 9 4 0 4 4 2 5 7 9 0 1 1 2 7 8 5 1 1 0 7 6 5 2 8 | {"source_dataset": "spiral_matrix", "source_index": 17, "matrix": [[0, 9, 4, 0, 4], [8, 5, 1, 1, 4], [7, 2, 8, 0, 2], [2, 5, 6, 7, 5], [1, 1, 0, 9, 7]], "solution": [0, 9, 4, 0, 4, 4, 2, 5, 7, 9, 0, 1, 1, 2, 7, 8, 5, 1, 1, 0, 7, 6, 5, 2, 8], "n": 5, "difficulty": {"n": [2, 10]}} | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 8 7 4 2 2 5 1 4 9 8 0 3 2 3 3 0 9 2 9 9 4 1 4 2 2 2 9 0 0 7 6 0 9 6 9 4 | {"source_dataset": "spiral_matrix", "source_index": 18, "matrix": [[8, 7, 4, 2, 2, 5], [9, 4, 1, 4, 2, 1], [9, 0, 9, 6, 2, 4], [2, 6, 4, 9, 2, 9], [9, 7, 0, 0, 9, 8], [0, 3, 3, 2, 3, 0]], "solution": [8, 7, 4, 2, 2, 5, 1, 4, 9, 8, 0, 3, 2, 3, 3, 0, 9, 2, 9, 9, 4, 1, 4, 2, 2, 2, 9, 0, 0, 7, 6, 0, 9, 6, 9, 4], "n": 6, "d... | spiral_matrix |
Given a matrix, your job is to generate a list of elements in spiral order, starting from the top-left element.
The spiral order is clockwise, starting from the top-left corner. More precisely:
- Start from the top-left corner and move right.
- Move down towards the bottom-right corner.
- Move left towards the bottom-... | 7 2 5 5 4 6 2 3 7 7 7 1 3 7 9 5 6 5 0 1 6 5 5 4 6 2 6 0 4 1 2 1 2 6 5 4 5 6 0 7 6 7 4 4 5 0 5 7 2 3 2 1 3 5 0 2 4 8 3 9 8 2 2 5 0 5 1 6 0 5 9 8 6 1 9 1 0 6 8 6 5 | {"source_dataset": "spiral_matrix", "source_index": 19, "matrix": [[7, 2, 5, 5, 4, 6, 2, 3, 7], [1, 2, 6, 5, 4, 5, 6, 0, 7], [2, 2, 4, 8, 3, 9, 8, 7, 7], [1, 0, 8, 6, 1, 9, 2, 6, 1], [4, 5, 9, 6, 5, 1, 2, 7, 3], [0, 3, 5, 8, 6, 0, 5, 4, 7], [6, 1, 0, 6, 1, 5, 0, 4, 9], [2, 2, 3, 2, 7, 5, 0, 5, 5], [6, 4, 5, 5, 6, 1, 0,... | spiral_matrix |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | ACBBBAEA | {"source_dataset": "string_insertion", "source_index": 0, "string": "ACBBBAEA", "solution": "ACBBBAEA", "string_length": 8, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | CBDCAD | {"source_dataset": "string_insertion", "source_index": 1, "string": "CBDCAD", "solution": "CBDCAD", "string_length": 6, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | EEABDBCABAEAABECDE | {"source_dataset": "string_insertion", "source_index": 2, "string": "EEABDBCABAEAABECDE", "solution": "EEABDBCABAEAABECDE", "string_length": 18, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | DDCACCAADAACA | {"source_dataset": "string_insertion", "source_index": 3, "string": "DDCACCAADAACA", "solution": "DDCACCAADAACA", "string_length": 13, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | DAEEBEB | {"source_dataset": "string_insertion", "source_index": 4, "string": "DAEEBEB", "solution": "DAEEBEB", "string_length": 7, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | ADEDECCEDDEADAAA | {"source_dataset": "string_insertion", "source_index": 5, "string": "ADEDECCEDDEADAAA", "solution": "ADEDECCEDDEADAAA", "string_length": 16, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | BEECEBDBBADBBEE | {"source_dataset": "string_insertion", "source_index": 6, "string": "BEECEBDBBADBBEE", "solution": "BEECEBDBBADBBEE", "string_length": 15, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | CDACEEA | {"source_dataset": "string_insertion", "source_index": 7, "string": "CDACEEA", "solution": "CDACEEA", "string_length": 7, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | CCBDCAECBEABCEACCBBAC | {"source_dataset": "string_insertion", "source_index": 8, "string": "CCBDCAECBEABCACCBBAC", "solution": "CCBDCAECBEABCEACCBBAC", "string_length": 20, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | EEBBBECDEDEE | {"source_dataset": "string_insertion", "source_index": 9, "string": "EEBBBECDEDEE", "solution": "EEBBBECDEDEE", "string_length": 12, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | AEDCDABBDBCDA | {"source_dataset": "string_insertion", "source_index": 10, "string": "AEDCDABBDBCDA", "solution": "AEDCDABBDBCDA", "string_length": 13, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | DEDECDAABCB | {"source_dataset": "string_insertion", "source_index": 11, "string": "DEDECDAABCB", "solution": "DEDECDAABCB", "string_length": 11, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | DECDDDBDC | {"source_dataset": "string_insertion", "source_index": 12, "string": "DECDDDBDC", "solution": "DECDDDBDC", "string_length": 9, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | BBCABCA | {"source_dataset": "string_insertion", "source_index": 13, "string": "BBCABCA", "solution": "BBCABCA", "string_length": 7, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | DECED | {"source_dataset": "string_insertion", "source_index": 14, "string": "DECED", "solution": "DECED", "string_length": 5, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | CEEABE | {"source_dataset": "string_insertion", "source_index": 15, "string": "CEEABE", "solution": "CEEABE", "string_length": 6, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | BBABDDCCCDE | {"source_dataset": "string_insertion", "source_index": 16, "string": "BBABDDCCCDE", "solution": "BBABDDCCCDE", "string_length": 11, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | ADABCAEADDDE | {"source_dataset": "string_insertion", "source_index": 17, "string": "ADABCAEADDDE", "solution": "ADABCAEADDDE", "string_length": 12, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | CEBCBDDCAABBDA | {"source_dataset": "string_insertion", "source_index": 18, "string": "CEBCBDDCAABBDA", "solution": "CEBCBDDCAABBDA", "string_length": 14, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Given a string consisting of characters A, B, C, D, and E, your job is to insert a character according to the following pattern:
1. If there is a substring ABCD in the string, insert the character A after the substring.
2. If there is a substring BCDE in the string, insert the character B after the substring.
3. If the... | BEBCCCADCCADDCBCAEAB | {"source_dataset": "string_insertion", "source_index": 19, "string": "BEBCCCADCCADDCBCAEAB", "solution": "BEBCCCADCCADDCBCAEAB", "string_length": 20, "difficulty": {"string_length": [5, 20]}} | string_insertion |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string contains an even number of 'b's (and at least one 'b'), append '... | zzbaacbab | {"source_dataset": "string_manipulation", "source_index": 0, "string": "acbaaaca", "solution": "zzbaacbab", "states": ["acbaaaca", "acbaaac", "acbaacb", "acbaacbab", "zzbaacbab"], "selected_rules": ["If the string contains an even number of 'b's (and at least one 'b'), append 'ab' at the end.", "If the string prefix is... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string suffix is 'bb', delete the last two characters.
2. If the string... | bc | {"source_dataset": "string_manipulation", "source_index": 1, "string": "bcabbc", "solution": "bc", "states": ["bcabbc", "bbc", "bc"], "selected_rules": ["If the string suffix is 'bb', delete the last two characters.", "If the string starts with 'bb', remove the second character.", "If the string ends with 'aa', replace... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string contains 'acb', replace the first occurrence with its reverse ('... | bbababcaaaccbc | {"source_dataset": "string_manipulation", "source_index": 2, "string": "cccaababaaacaaaccb", "solution": "bbababcaaaccbc", "states": ["cccaababaaacaaaccb", "cccaababaacaaaccb", "cccaababacaaaccb", "cccaababcaaaccb", "caababcaaaccb", "bbababcaaaccbc"], "selected_rules": ["If the string contains 'acb', replace the first ... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string suffix is 'ac', replace it with 'cb'.
2. If the string prefix is... | bbbabbaabaaba | {"source_dataset": "string_manipulation", "source_index": 3, "string": "bbbabbaabaaba", "solution": "bbbabbaabaaba", "states": ["bbbabbaabaaba"], "selected_rules": ["If the string suffix is 'ac', replace it with 'cb'.", "If the string prefix is 'bc', delete the first two characters and append 'aa' to the end.", "If the... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string length is greater than 15, remove the middle character.
2. If th... | baccacc | {"source_dataset": "string_manipulation", "source_index": 4, "string": "baccacc", "solution": "baccacc", "states": ["baccacc"], "selected_rules": ["If the string length is greater than 15, remove the middle character.", "If the string contains an even number of 'b's (and at least one 'b'), append 'ab' at the end.", "If... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string contains 'abc', replace the first occurrence with 'cab'.
2. If t... | cabbcbbcbbccccab | {"source_dataset": "string_manipulation", "source_index": 5, "string": "abcbcbbcbbcabcaa", "solution": "cabbcbbcbbccccab", "states": ["abcbcbbcbbcabcaa", "cabbcbbcbbcabcaa", "cabbcbbcbbccabaa", "cabbcbbcbbccabcc", "cabbcbbcbbcccabc", "cabbcbbcbbccccab"], "selected_rules": ["If the string contains 'abc', replace the fir... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string suffix is 'cc', replace it with 'b' and prepend 'a' to the start... | acccbcbaabc | {"source_dataset": "string_manipulation", "source_index": 6, "string": "acccbcacbaacabc", "solution": "acccbcbaabc", "states": ["acccbcacbaacabc", "acccbcbaacabc", "acccbcbaabc"], "selected_rules": ["If the string suffix is 'cc', replace it with 'b' and prepend 'a' to the start.", "If the string contains 'ca' (not at t... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string suffix is 'ac', replace it with 'cb'.
2. If the string contains ... | bccaab | {"source_dataset": "string_manipulation", "source_index": 7, "string": "bbabcca", "solution": "bccaab", "states": ["bbabcca", "bbcabca", "bbccaba", "bccaba", "bccaab"], "selected_rules": ["If the string suffix is 'ac', replace it with 'cb'.", "If the string contains 'abc', replace the first occurrence with 'cab'.", "If... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string prefix is 'bc', delete the first two characters and append 'aa' ... | bbcacbbacbaccaababab | {"source_dataset": "string_manipulation", "source_index": 8, "string": "bbcacbbacbaccaababba", "solution": "bbcacbbacbaccaababab", "states": ["bbcacbbacbaccaababba", "bbcacbbacbaccaababab"], "selected_rules": ["If the string prefix is 'bc', delete the first two characters and append 'aa' to the end.", "If the string en... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string contains 'ca' (not at the start), remove the first occurrence fo... | abbcbbab | {"source_dataset": "string_manipulation", "source_index": 9, "string": "ccaaacbbcbcc", "solution": "abbcbbab", "states": ["ccaaacbbcbcc", "caacbbcbcc", "cabcabcbcc", "cabbcbcc", "acabbcbb", "abbcbb", "abbcbbab"], "selected_rules": ["If the string contains 'ca' (not at the start), remove the first occurrence found after... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string prefix is 'ab', replace it with 'ca'.
2. If the string suffix is... | zzcbbbaaababbab | {"source_dataset": "string_manipulation", "source_index": 10, "string": "accbbbaaababb", "solution": "zzcbbbaaababbab", "states": ["accbbbaaababb", "accbbbaaababbab", "zzcbbbaaababbab"], "selected_rules": ["If the string prefix is 'ab', replace it with 'ca'.", "If the string suffix is 'ac', replace it with 'cb'.", "If ... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string prefix is 'ca', replace it with 'bb' and append 'c' to the end.
... | bccbccbcbca | {"source_dataset": "string_manipulation", "source_index": 11, "string": "bccbccbcbca", "solution": "bccbccbcbca", "states": ["bccbccbcbca"], "selected_rules": ["If the string prefix is 'ca', replace it with 'bb' and append 'c' to the end.", "If the string starts with 'cc', remove the first two characters.", "If the str... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string contains 'acb', replace the first occurrence with its reverse ('... | bcbbbbabb | {"source_dataset": "string_manipulation", "source_index": 12, "string": "bcbbbbabb", "solution": "bcbbbbabb", "states": ["bcbbbbabb"], "selected_rules": ["If the string contains 'acb', replace the first occurrence with its reverse ('bca').", "If the string suffix is 'cc', replace it with 'b' and prepend 'a' to the star... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string prefix is 'bc', delete the first two characters and append 'aa' ... | aba | {"source_dataset": "string_manipulation", "source_index": 13, "string": "aacbaca", "solution": "aba", "states": ["aacbaca", "abcaaca", "abaca", "aba"], "selected_rules": ["If the string prefix is 'bc', delete the first two characters and append 'aa' to the end.", "If the string starts with 'cc', remove the first two ch... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string prefix is 'aa', remove the first character.
2. If the string suf... | cbccc | {"source_dataset": "string_manipulation", "source_index": 14, "string": "bccbc", "solution": "cbccc", "states": ["bccbc", "cbcaa", "cbccc"], "selected_rules": ["If the string prefix is 'aa', remove the first character.", "If the string suffix is 'bb', delete the last two characters.", "If the string starts with 'cc', r... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string ends with 'aa', replace it with 'cc'.
2. If the string contains ... | bccaac | {"source_dataset": "string_manipulation", "source_index": 15, "string": "bccaac", "solution": "bccaac", "states": ["bccaac"], "selected_rules": ["If the string ends with 'aa', replace it with 'cc'.", "If the string contains 'bca', delete the first occurrence entirely.", "If the string ends with 'ca', remove the last ch... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string starts with 'ac', replace the first two characters with 'zz'.
2.... | zzcaaab | {"source_dataset": "string_manipulation", "source_index": 16, "string": "accaaabbbbb", "solution": "zzcaaab", "states": ["accaaabbbbb", "zzcaaabbbbb", "zzcaaabbb", "zzcaaab"], "selected_rules": ["If the string starts with 'ac', replace the first two characters with 'zz'.", "If the string ends with 'ca', remove the last... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string ends with 'aa', replace it with 'cc'.
2. If the string contains ... | zzbaaccabab | {"source_dataset": "string_manipulation", "source_index": 17, "string": "acbaabcaccab", "solution": "zzbaaccabab", "states": ["acbaabcaccab", "acbaaccab", "acbaaccabab", "zzbaaccabab"], "selected_rules": ["If the string ends with 'aa', replace it with 'cc'.", "If the string contains an even number of 'b's (and at least... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string prefix is 'aa', remove the first character.
2. If the string pre... | bcababbbaacaab | {"source_dataset": "string_manipulation", "source_index": 18, "string": "bcababbbaacaab", "solution": "bcababbbaacaab", "states": ["bcababbbaacaab"], "selected_rules": ["If the string prefix is 'aa', remove the first character.", "If the string prefix is 'ab', replace it with 'ca'.", "If the string ends with 'ca', remo... | string_manipulation |
Your job is to repeatedly transform a string according to a set of rules until no further transformations can be performed, or a state is repeated.
Evaluate the following rules in order, and apply the first applicable rule to the string:
1. If the string prefix is 'bc', delete the first two characters and append 'aa' ... | zzabbbcabbbabbbabcac | {"source_dataset": "string_manipulation", "source_index": 19, "string": "acabbbcabbbabbbabcac", "solution": "zzabbbcabbbabbbabcac", "states": ["acabbbcabbbabbbabcac", "zzabbbcabbbabbbabcac"], "selected_rules": ["If the string prefix is 'bc', delete the first two characters and append 'aa' to the end.", "If the string p... | string_manipulation |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 0 5 0 5 | {"source_dataset": "string_splitting", "source_index": 0, "states": [[5, 0, 0, 0, 0, 0], [4, 0, 0, 2, 1, 0], [3, 0, 0, 4, 2, 0], [2, 0, 0, 6, 3, 0], [1, 0, 0, 8, 4, 0], [0, 0, 0, 10, 5, 0], [0, 0, 0, 9, 4, 1], [0, 0, 0, 8, 3, 2], [0, 0, 0, 7, 2, 3], [0, 0, 0, 6, 1, 4], [0, 0, 0, 5, 0, 5]], "solution": [0, 0, 0, 5, 0, 5... | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 1 0 1 1 | {"source_dataset": "string_splitting", "source_index": 1, "states": [[0, 2, 5, 0, 0, 0], [0, 0, 5, 1, 0, 0], [0, 0, 3, 1, 1, 0], [0, 0, 1, 1, 2, 0], [0, 0, 1, 0, 1, 1]], "solution": [0, 0, 1, 0, 1, 1], "initial_machines": [0, 2, 5], "difficulty": {"initial_machines": [0, 5]}} | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 0 3 0 5 | {"source_dataset": "string_splitting", "source_index": 2, "states": [[3, 4, 4, 0, 0, 0], [2, 4, 4, 2, 1, 0], [1, 4, 4, 4, 2, 0], [0, 4, 4, 6, 3, 0], [0, 2, 4, 7, 3, 0], [0, 0, 4, 8, 3, 0], [0, 0, 2, 8, 4, 0], [0, 0, 0, 8, 5, 0], [0, 0, 0, 7, 4, 1], [0, 0, 0, 6, 3, 2], [0, 0, 0, 5, 2, 3], [0, 0, 0, 4, 1, 4], [0, 0, 0, 3... | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 0 3 0 4 | {"source_dataset": "string_splitting", "source_index": 3, "states": [[2, 3, 3, 0, 0, 0], [1, 3, 3, 2, 1, 0], [0, 3, 3, 4, 2, 0], [0, 1, 3, 5, 2, 0], [0, 1, 1, 5, 3, 0], [1, 0, 0, 5, 3, 0], [0, 0, 0, 7, 4, 0], [0, 0, 0, 6, 3, 1], [0, 0, 0, 5, 2, 2], [0, 0, 0, 4, 1, 3], [0, 0, 0, 3, 0, 4]], "solution": [0, 0, 0, 3, 0, 4]... | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 1 0 1 0 0 | {"source_dataset": "string_splitting", "source_index": 4, "states": [[0, 3, 0, 0, 0, 0], [0, 1, 0, 1, 0, 0]], "solution": [0, 1, 0, 1, 0, 0], "initial_machines": [0, 3, 0], "difficulty": {"initial_machines": [0, 5]}} | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 1 1 0 3 | {"source_dataset": "string_splitting", "source_index": 5, "states": [[2, 0, 3, 0, 0, 0], [1, 0, 3, 2, 1, 0], [0, 0, 3, 4, 2, 0], [0, 0, 1, 4, 3, 0], [0, 0, 1, 3, 2, 1], [0, 0, 1, 2, 1, 2], [0, 0, 1, 1, 0, 3]], "solution": [0, 0, 1, 1, 0, 3], "initial_machines": [2, 0, 3], "difficulty": {"initial_machines": [0, 5]}} | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 1 5 0 4 | {"source_dataset": "string_splitting", "source_index": 6, "states": [[4, 2, 1, 0, 0, 0], [3, 2, 1, 2, 1, 0], [2, 2, 1, 4, 2, 0], [1, 2, 1, 6, 3, 0], [0, 2, 1, 8, 4, 0], [0, 0, 1, 9, 4, 0], [0, 0, 1, 8, 3, 1], [0, 0, 1, 7, 2, 2], [0, 0, 1, 6, 1, 3], [0, 0, 1, 5, 0, 4]], "solution": [0, 0, 1, 5, 0, 4], "initial_machines"... | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 1 0 0 1 | {"source_dataset": "string_splitting", "source_index": 7, "states": [[0, 2, 3, 0, 0, 0], [0, 0, 3, 1, 0, 0], [0, 0, 1, 1, 1, 0], [0, 0, 1, 0, 0, 1]], "solution": [0, 0, 1, 0, 0, 1], "initial_machines": [0, 2, 3], "difficulty": {"initial_machines": [0, 5]}} | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 0 3 0 4 | {"source_dataset": "string_splitting", "source_index": 8, "states": [[3, 2, 2, 0, 0, 0], [2, 2, 2, 2, 1, 0], [1, 2, 2, 4, 2, 0], [0, 2, 2, 6, 3, 0], [0, 0, 2, 7, 3, 0], [0, 0, 0, 7, 4, 0], [0, 0, 0, 6, 3, 1], [0, 0, 0, 5, 2, 2], [0, 0, 0, 4, 1, 3], [0, 0, 0, 3, 0, 4]], "solution": [0, 0, 0, 3, 0, 4], "initial_machines"... | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 0 1 0 3 | {"source_dataset": "string_splitting", "source_index": 9, "states": [[1, 4, 4, 0, 0, 0], [0, 4, 4, 2, 1, 0], [0, 2, 4, 3, 1, 0], [0, 0, 4, 4, 1, 0], [0, 0, 2, 4, 2, 0], [0, 0, 0, 4, 3, 0], [0, 0, 0, 3, 2, 1], [0, 0, 0, 2, 1, 2], [0, 0, 0, 1, 0, 3]], "solution": [0, 0, 0, 1, 0, 3], "initial_machines": [1, 4, 4], "diffic... | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 1 0 0 4 | {"source_dataset": "string_splitting", "source_index": 10, "states": [[2, 0, 5, 0, 0, 0], [1, 0, 5, 2, 1, 0], [0, 0, 5, 4, 2, 0], [0, 0, 3, 4, 3, 0], [0, 0, 1, 4, 4, 0], [0, 0, 1, 3, 3, 1], [0, 0, 1, 2, 2, 2], [0, 0, 1, 1, 1, 3], [0, 0, 1, 0, 0, 4]], "solution": [0, 0, 1, 0, 0, 4], "initial_machines": [2, 0, 5], "diffi... | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 0 4 0 6 | {"source_dataset": "string_splitting", "source_index": 11, "states": [[4, 1, 3, 0, 0, 0], [3, 1, 3, 2, 1, 0], [2, 1, 3, 4, 2, 0], [1, 1, 3, 6, 3, 0], [0, 1, 3, 8, 4, 0], [0, 1, 1, 8, 5, 0], [1, 0, 0, 8, 5, 0], [0, 0, 0, 10, 6, 0], [0, 0, 0, 9, 5, 1], [0, 0, 0, 8, 4, 2], [0, 0, 0, 7, 3, 3], [0, 0, 0, 6, 2, 4], [0, 0, 0,... | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 1 0 0 0 3 | {"source_dataset": "string_splitting", "source_index": 12, "states": [[1, 3, 4, 0, 0, 0], [0, 3, 4, 2, 1, 0], [0, 1, 4, 3, 1, 0], [0, 1, 2, 3, 2, 0], [0, 1, 0, 3, 3, 0], [0, 1, 0, 2, 2, 1], [0, 1, 0, 1, 1, 2], [0, 1, 0, 0, 0, 3]], "solution": [0, 1, 0, 0, 0, 3], "initial_machines": [1, 3, 4], "difficulty": {"initial_ma... | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 0 1 0 1 | {"source_dataset": "string_splitting", "source_index": 13, "states": [[0, 1, 1, 0, 0, 0], [1, 0, 0, 0, 0, 0], [0, 0, 0, 2, 1, 0], [0, 0, 0, 1, 0, 1]], "solution": [0, 0, 0, 1, 0, 1], "initial_machines": [0, 1, 1], "difficulty": {"initial_machines": [0, 5]}} | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 1 3 0 5 | {"source_dataset": "string_splitting", "source_index": 14, "states": [[4, 0, 3, 0, 0, 0], [3, 0, 3, 2, 1, 0], [2, 0, 3, 4, 2, 0], [1, 0, 3, 6, 3, 0], [0, 0, 3, 8, 4, 0], [0, 0, 1, 8, 5, 0], [0, 0, 1, 7, 4, 1], [0, 0, 1, 6, 3, 2], [0, 0, 1, 5, 2, 3], [0, 0, 1, 4, 1, 4], [0, 0, 1, 3, 0, 5]], "solution": [0, 0, 1, 3, 0, 5... | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 0 0 1 1 | {"source_dataset": "string_splitting", "source_index": 15, "states": [[0, 2, 4, 0, 0, 0], [0, 0, 4, 1, 0, 0], [0, 0, 2, 1, 1, 0], [0, 0, 0, 1, 2, 0], [0, 0, 0, 0, 1, 1]], "solution": [0, 0, 0, 0, 1, 1], "initial_machines": [0, 2, 4], "difficulty": {"initial_machines": [0, 5]}} | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 0 5 0 5 | {"source_dataset": "string_splitting", "source_index": 16, "states": [[4, 1, 1, 0, 0, 0], [3, 1, 1, 2, 1, 0], [2, 1, 1, 4, 2, 0], [1, 1, 1, 6, 3, 0], [0, 1, 1, 8, 4, 0], [1, 0, 0, 8, 4, 0], [0, 0, 0, 10, 5, 0], [0, 0, 0, 9, 4, 1], [0, 0, 0, 8, 3, 2], [0, 0, 0, 7, 2, 3], [0, 0, 0, 6, 1, 4], [0, 0, 0, 5, 0, 5]], "solutio... | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 1 0 1 2 | {"source_dataset": "string_splitting", "source_index": 17, "states": [[1, 0, 5, 0, 0, 0], [0, 0, 5, 2, 1, 0], [0, 0, 3, 2, 2, 0], [0, 0, 1, 2, 3, 0], [0, 0, 1, 1, 2, 1], [0, 0, 1, 0, 1, 2]], "solution": [0, 0, 1, 0, 1, 2], "initial_machines": [1, 0, 5], "difficulty": {"initial_machines": [0, 5]}} | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 0 0 1 0 4 | {"source_dataset": "string_splitting", "source_index": 18, "states": [[2, 2, 4, 0, 0, 0], [1, 2, 4, 2, 1, 0], [0, 2, 4, 4, 2, 0], [0, 0, 4, 5, 2, 0], [0, 0, 2, 5, 3, 0], [0, 0, 0, 5, 4, 0], [0, 0, 0, 4, 3, 1], [0, 0, 0, 3, 2, 2], [0, 0, 0, 2, 1, 3], [0, 0, 0, 1, 0, 4]], "solution": [0, 0, 0, 1, 0, 4], "initial_machines... | string_splitting |
There is a dismantling engineer who has old machines A, B, and C.
He discovered that he can obtain a batch of new parts X, Y, Z through the following rules:
1. One unit of machine A can be dismanteled into two units of part X and one unit of part Y.
2. Two units of machine B can be dismanteled into one unit of part X.
... | 0 1 0 1 0 5 | {"source_dataset": "string_splitting", "source_index": 19, "states": [[3, 1, 4, 0, 0, 0], [2, 1, 4, 2, 1, 0], [1, 1, 4, 4, 2, 0], [0, 1, 4, 6, 3, 0], [0, 1, 2, 6, 4, 0], [0, 1, 0, 6, 5, 0], [0, 1, 0, 5, 4, 1], [0, 1, 0, 4, 3, 2], [0, 1, 0, 3, 2, 3], [0, 1, 0, 2, 1, 4], [0, 1, 0, 1, 0, 5]], "solution": [0, 1, 0, 1, 0, 5... | string_splitting |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.