question stringlengths 156 786 | answer stringlengths 1 37 | metadata stringlengths 182 463 | dataset_source stringclasses 5
values |
|---|---|---|---|
There are a total of 10 courses you have to take, labeled from 0 to 9.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(9, 7), (8, 2), (7, 3), (8, 7), (1, 9), (1, 7), (2, 7), (5, 8), (9, 5), (2, 3), (6... | False | {"source_dataset": "course_schedule", "source_index": 0, "courses": [7, 3, 2, 8, 5, 6, 9, 4, 0, 1], "prerequisites": [[9, 7], [8, 2], [7, 3], [8, 7], [1, 9], [1, 7], [2, 7], [5, 8], [9, 5], [2, 3], [6, 5], [3, 7], [4, 5], [3, 1], [0, 8], [5, 3]], "solution": false, "solvable": false, "difficulty": {"num_courses": [5, 1... | course_schedule |
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 3), (0, 2), (1, 0), (3, 4), (3, 0), (4, 0), (2, 4), (2, 1)]
Return True if you... | False | {"source_dataset": "course_schedule", "source_index": 1, "courses": [0, 4, 3, 1, 2], "prerequisites": [[1, 3], [0, 2], [1, 0], [3, 4], [3, 0], [4, 0], [2, 4], [2, 1]], "solution": false, "solvable": false, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]}} | course_schedule |
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 0), (2, 5), (3, 2), (3, 6), (6, 4), (5, 4), (2, 4), (1, 4), (0, 4), (7, 6)]
Re... | True | {"source_dataset": "course_schedule", "source_index": 2, "courses": [4, 5, 0, 2, 6, 3, 7, 1], "prerequisites": [[6, 0], [2, 5], [3, 2], [3, 6], [6, 4], [5, 4], [2, 4], [1, 4], [0, 4], [7, 6]], "solution": true, "solvable": true, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]}... | course_schedule |
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 5), (3, 5), (6, 1), (4, 5), (0, 4), (3, 6), (6, 5), (2, 5)]
Return True if you... | True | {"source_dataset": "course_schedule", "source_index": 3, "courses": [5, 4, 1, 0, 2, 6, 3], "prerequisites": [[1, 5], [3, 5], [6, 1], [4, 5], [0, 4], [3, 6], [6, 5], [2, 5]], "solution": true, "solvable": true, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]}} | course_schedule |
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 1), (3, 1), (2, 4), (1, 4), (3, 0), (0, 1), (4, 3), (0, 2), (2, 1)]
Return Tru... | False | {"source_dataset": "course_schedule", "source_index": 4, "courses": [1, 4, 2, 0, 3], "prerequisites": [[4, 1], [3, 1], [2, 4], [1, 4], [3, 0], [0, 1], [4, 3], [0, 2], [2, 1]], "solution": false, "solvable": false, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]}} | course_schedule |
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 1), (0, 5), (0, 4), (3, 5), (4, 6), (1, 6), (2, 6), (5, 1)]
Return True if you... | True | {"source_dataset": "course_schedule", "source_index": 5, "courses": [6, 1, 2, 5, 4, 3, 0], "prerequisites": [[2, 1], [0, 5], [0, 4], [3, 5], [4, 6], [1, 6], [2, 6], [5, 1]], "solution": true, "solvable": true, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]}} | course_schedule |
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 6), (5, 0), (5, 3), (7, 0), (0, 1), (6, 3), (2, 7), (6, 1), (8, 7), (4, 0), (3,... | False | {"source_dataset": "course_schedule", "source_index": 6, "courses": [1, 0, 3, 7, 6, 8, 4, 2, 5], "prerequisites": [[1, 6], [5, 0], [5, 3], [7, 0], [0, 1], [6, 3], [2, 7], [6, 1], [8, 7], [4, 0], [3, 1]], "solution": false, "solvable": false, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_len... | course_schedule |
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 4), (1, 4), (4, 1), (3, 4), (1, 0), (0, 2), (3, 1), (0, 4)]
Return True if you... | False | {"source_dataset": "course_schedule", "source_index": 7, "courses": [4, 1, 0, 3, 2], "prerequisites": [[2, 4], [1, 4], [4, 1], [3, 4], [1, 0], [0, 2], [3, 1], [0, 4]], "solution": false, "solvable": false, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]}} | course_schedule |
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 0), (3, 7), (1, 0), (7, 2), (5, 6), (7, 6), (0, 6), (3, 0), (4, 5), (5, 7), (7,... | False | {"source_dataset": "course_schedule", "source_index": 8, "courses": [6, 0, 7, 3, 1, 5, 2, 4], "prerequisites": [[2, 0], [3, 7], [1, 0], [7, 2], [5, 6], [7, 6], [0, 6], [3, 0], [4, 5], [5, 7], [7, 0], [2, 3], [1, 6]], "solution": false, "solvable": false, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2... | course_schedule |
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 1), (1, 2), (5, 2), (5, 0), (1, 4), (1, 3), (4, 5), (0, 1), (0, 3), (2, 3), (4,... | False | {"source_dataset": "course_schedule", "source_index": 9, "courses": [3, 2, 0, 1, 5, 4], "prerequisites": [[4, 1], [1, 2], [5, 2], [5, 0], [1, 4], [1, 3], [4, 5], [0, 1], [0, 3], [2, 3], [4, 2], [2, 0]], "solution": false, "solvable": false, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_leng... | course_schedule |
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(1, 6), (4, 3), (4, 6), (2, 6), (5, 2), (5, 1), (3, 6), (0, 2), (3, 2)]
Return Tru... | True | {"source_dataset": "course_schedule", "source_index": 10, "courses": [6, 2, 1, 3, 4, 5, 0], "prerequisites": [[1, 6], [4, 3], [4, 6], [2, 6], [5, 2], [5, 1], [3, 6], [0, 2], [3, 2]], "solution": true, "solvable": true, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]}} | course_schedule |
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(3, 1), (5, 0), (6, 0), (1, 0), (4, 0), (6, 3), (2, 0), (8, 1), (0, 6), (7, 5), (1,... | False | {"source_dataset": "course_schedule", "source_index": 11, "courses": [0, 1, 6, 2, 8, 5, 4, 7, 3], "prerequisites": [[3, 1], [5, 0], [6, 0], [1, 0], [4, 0], [6, 3], [2, 0], [8, 1], [0, 6], [7, 5], [1, 4], [4, 5], [3, 6], [8, 2], [7, 1]], "solution": false, "solvable": false, "difficulty": {"num_courses": [5, 10], "num_p... | course_schedule |
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(5, 0), (3, 2), (2, 5), (1, 5), (3, 1), (1, 0), (4, 5)]
Return True if you can fin... | True | {"source_dataset": "course_schedule", "source_index": 12, "courses": [0, 5, 1, 2, 4, 3], "prerequisites": [[5, 0], [3, 2], [2, 5], [1, 5], [3, 1], [1, 0], [4, 5]], "solution": true, "solvable": true, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]}} | course_schedule |
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 3), (1, 4), (3, 0), (2, 3), (4, 0), (0, 2), (2, 0), (1, 2), (3, 1)]
Return Tru... | False | {"source_dataset": "course_schedule", "source_index": 13, "courses": [0, 3, 2, 4, 1], "prerequisites": [[4, 3], [1, 4], [3, 0], [2, 3], [4, 0], [0, 2], [2, 0], [1, 2], [3, 1]], "solution": false, "solvable": false, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]}} | course_schedule |
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 8), (0, 4), (3, 1), (7, 2), (5, 2), (2, 3), (8, 1), (4, 1), (6, 1), (7, 8)]
Re... | True | {"source_dataset": "course_schedule", "source_index": 14, "courses": [1, 8, 6, 3, 2, 4, 5, 7, 0], "prerequisites": [[6, 8], [0, 4], [3, 1], [7, 2], [5, 2], [2, 3], [8, 1], [4, 1], [6, 1], [7, 8]], "solution": true, "solvable": true, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3,... | course_schedule |
There are a total of 5 courses you have to take, labeled from 0 to 4.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(2, 4), (3, 1), (2, 0), (1, 2), (3, 4), (4, 0), (2, 3), (0, 4), (1, 4), (0, 3)]
Re... | False | {"source_dataset": "course_schedule", "source_index": 15, "courses": [4, 1, 3, 0, 2], "prerequisites": [[2, 4], [3, 1], [2, 0], [1, 2], [3, 4], [4, 0], [2, 3], [0, 4], [1, 4], [0, 3]], "solution": false, "solvable": false, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]}} | course_schedule |
There are a total of 9 courses you have to take, labeled from 0 to 8.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 4), (3, 0), (3, 1), (5, 2), (0, 4), (4, 2), (7, 2), (1, 0), (6, 0), (8, 7), (8,... | True | {"source_dataset": "course_schedule", "source_index": 16, "courses": [2, 4, 7, 0, 1, 6, 5, 8, 3], "prerequisites": [[6, 4], [3, 0], [3, 1], [5, 2], [0, 4], [4, 2], [7, 2], [1, 0], [6, 0], [8, 7], [8, 1], [0, 7]], "solution": true, "solvable": true, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cy... | course_schedule |
There are a total of 6 courses you have to take, labeled from 0 to 5.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 2), (5, 2), (0, 5), (5, 1), (2, 4), (3, 0), (3, 4), (3, 5), (1, 2), (4, 3)]
Re... | False | {"source_dataset": "course_schedule", "source_index": 17, "courses": [2, 1, 4, 5, 3, 0], "prerequisites": [[4, 2], [5, 2], [0, 5], [5, 1], [2, 4], [3, 0], [3, 4], [3, 5], [1, 2], [4, 3]], "solution": false, "solvable": false, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]}} | course_schedule |
There are a total of 7 courses you have to take, labeled from 0 to 6.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(6, 5), (2, 3), (5, 3), (0, 3), (1, 3), (1, 6), (4, 5), (2, 4)]
Return True if you... | True | {"source_dataset": "course_schedule", "source_index": 18, "courses": [3, 5, 0, 6, 1, 4, 2], "prerequisites": [[6, 5], [2, 3], [5, 3], [0, 3], [1, 3], [1, 6], [4, 5], [2, 4]], "solution": true, "solvable": true, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]}} | course_schedule |
There are a total of 8 courses you have to take, labeled from 0 to 7.
You are given the following list of prerequisites, where prerequisites[i] = (a_i, b_i) indicates that you must first take course b_i if you want to take course a_i:
[(4, 0), (4, 5), (7, 5), (0, 3), (6, 0), (1, 3), (2, 3), (5, 3), (2, 6), (1, 7)]
Re... | True | {"source_dataset": "course_schedule", "source_index": 19, "courses": [3, 0, 5, 6, 7, 1, 4, 2], "prerequisites": [[4, 0], [4, 5], [7, 5], [0, 3], [6, 0], [1, 3], [2, 3], [5, 3], [2, 6], [1, 7]], "solution": true, "solvable": true, "difficulty": {"num_courses": [5, 10], "num_prerequisites": [1, 2], "cycle_length": [3, 5]... | course_schedule |
John is married to Isabella. They have a child called Edward. Edward is married to Victoria.
What is Isabella to Edward? Respond only with the word that describes their relationship. | mother | {"source_dataset": "family_relationships", "source_index": 0, "person1": "Isabella", "person2": "Edward", "relationship": "mother", "family_size": 4, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Henry is married to Karen. They have a child called Sebastian. Sebastian is married to Eleanor.
What relation is Henry to Karen? Answer with a single word. | husband | {"source_dataset": "family_relationships", "source_index": 1, "person1": "Henry", "person2": "Karen", "relationship": "husband", "family_size": 4, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Liam is married to Nova. They have a child called Noah. Noah is married to Charlotte. They have a child called Patricia. Joseph is married to Lisa. They have a child called Charlotte.
What is Liam to Noah? Respond only with the word that describes their relationship. | father | {"source_dataset": "family_relationships", "source_index": 2, "person1": "Liam", "person2": "Noah", "relationship": "father", "family_size": 7, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Ethan is married to Hannah. They have a child called Edward. Edward is married to Barbara. They have children called Abigail and Owen.
What is Ethan to Edward? Respond only with the word that describes their relationship. | father | {"source_dataset": "family_relationships", "source_index": 3, "person1": "Ethan", "person2": "Edward", "relationship": "father", "family_size": 6, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Noah is married to Jennifer. They have a child called Phoenix. Phoenix is married to Sage.
What relation is Jennifer to Phoenix? Answer with a single word. | mother | {"source_dataset": "family_relationships", "source_index": 4, "person1": "Jennifer", "person2": "Phoenix", "relationship": "mother", "family_size": 4, "difficulty": {"family_size": [4, 8]}} | family_relationships |
William is married to Lucy. They have a child called Jayden. Jayden is married to Lily. They have children called Sophia and Rain.
What is Lily to William? Respond only with the word that describes their relationship. | father-in-law | {"source_dataset": "family_relationships", "source_index": 5, "person1": "Lily", "person2": "William", "relationship": "father-in-law", "family_size": 6, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Alexander is married to Sarah. They have a child called Samuel. Samuel is married to Luna. They have children called Logan and Richard. Jayden is married to Aria. They have a child called Luna.
What is Jayden to Aria? Respond only with the word that describes their relationship. | husband | {"source_dataset": "family_relationships", "source_index": 6, "person1": "Jayden", "person2": "Aria", "relationship": "husband", "family_size": 8, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Jack is married to Alice. They have a child called Joseph. Joseph is married to Mia.
What is Jack to Joseph? Respond only with the word that describes their relationship. | father | {"source_dataset": "family_relationships", "source_index": 7, "person1": "Jack", "person2": "Joseph", "relationship": "father", "family_size": 4, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Benjamin is married to Amelia. They have a child called Theodore. Theodore is married to Abigail. They have a child called Jayden. Ryder is married to Charlotte. They have a child called Abigail.
What is Theodore to Benjamin? Respond only with the word that describes their relationship. | son | {"source_dataset": "family_relationships", "source_index": 8, "person1": "Theodore", "person2": "Benjamin", "relationship": "son", "family_size": 7, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Owen is married to Aria. They have a child called Peter. Peter is married to Charlotte. They have a child called Zion.
What relation is Charlotte to Zion? Answer with a single word. | mother | {"source_dataset": "family_relationships", "source_index": 9, "person1": "Charlotte", "person2": "Zion", "relationship": "mother", "family_size": 5, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Michael is married to Zoe. They have a child called Theodore. Theodore is married to Amelia. They have children called Jennifer and Lucas.
What relation is Theodore to Amelia? Answer with a single word. | husband | {"source_dataset": "family_relationships", "source_index": 10, "person1": "Theodore", "person2": "Amelia", "relationship": "husband", "family_size": 6, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Christopher is married to Sophie. They have a child called Kai. Kai is married to Amelia. They have children called Patricia and Harry. Liam is married to Hannah. They have a child called Amelia.
What is Kai to Amelia? Respond only with the word that describes their relationship. | husband | {"source_dataset": "family_relationships", "source_index": 11, "person1": "Kai", "person2": "Amelia", "relationship": "husband", "family_size": 8, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Mason is married to Aria. They have a child called Samuel. Samuel is married to Lily. They have a child called Eleanor.
What relation is Lily to Samuel? Answer with a single word. | wife | {"source_dataset": "family_relationships", "source_index": 12, "person1": "Lily", "person2": "Samuel", "relationship": "wife", "family_size": 5, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Matthew is married to Karen. They have a child called Alexander. Alexander is married to Barbara.
What relation is Matthew to Karen? Answer with a single word. | husband | {"source_dataset": "family_relationships", "source_index": 13, "person1": "Matthew", "person2": "Karen", "relationship": "husband", "family_size": 4, "difficulty": {"family_size": [4, 8]}} | family_relationships |
James is married to Lily. They have a child called Alexander. Alexander is married to Willow. They have children called Victoria and Elizabeth. Finn is married to Nova. They have a child called Willow.
What is Alexander to Elizabeth? Respond only with the word that describes their relationship. | father | {"source_dataset": "family_relationships", "source_index": 14, "person1": "Alexander", "person2": "Elizabeth", "relationship": "father", "family_size": 8, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Harry is married to Aurora. They have a child called Atlas. Atlas is married to Patricia.
How is Aurora related to Atlas? Provide the relationship in one word. | mother | {"source_dataset": "family_relationships", "source_index": 15, "person1": "Aurora", "person2": "Atlas", "relationship": "mother", "family_size": 4, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Matthew is married to Margaret. They have a child called Robert. Robert is married to Victoria. They have children called Chloe and Ava. Finn is married to Anna. They have a child called Victoria.
How is Margaret related to Matthew? Provide the relationship in one word. | wife | {"source_dataset": "family_relationships", "source_index": 16, "person1": "Margaret", "person2": "Matthew", "relationship": "wife", "family_size": 8, "difficulty": {"family_size": [4, 8]}} | family_relationships |
David is married to Sky. They have a child called Sebastian. Sebastian is married to Patricia. They have a child called Alexander.
How is Patricia related to Alexander? Provide the relationship in one word. | mother | {"source_dataset": "family_relationships", "source_index": 17, "person1": "Patricia", "person2": "Alexander", "relationship": "mother", "family_size": 5, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Henry is married to Willow. They have a child called Charles. Charles is married to Sophia. They have children called Owen and Jennifer.
What relation is Henry to Willow? Answer with a single word. | husband | {"source_dataset": "family_relationships", "source_index": 18, "person1": "Henry", "person2": "Willow", "relationship": "husband", "family_size": 6, "difficulty": {"family_size": [4, 8]}} | family_relationships |
Daniel is married to Aria. They have a child called Alexander. Alexander is married to Emily. They have a child called Aiden. Andrew is married to Mia. They have a child called Emily.
How is Mia related to Aiden? Provide the relationship in one word. | grandmother | {"source_dataset": "family_relationships", "source_index": 19, "person1": "Mia", "person2": "Aiden", "relationship": "grandmother", "family_size": 7, "difficulty": {"family_size": [4, 8]}} | family_relationships |
You are given the following 10 x 5 binary matrix grid:
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by wate... | 0 | {"source_dataset": "largest_island", "source_index": 0, "grid": [[0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]], "solution": 0, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5... | largest_island |
You are given the following 5 x 7 binary matrix grid:
0 0 1 1 1 0 1
1 0 0 1 1 0 1
1 0 0 0 0 1 1
1 0 0 1 1 1 0
1 0 0 1 1 1 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by water.
The area of an island is th... | 10 | {"source_dataset": "largest_island", "source_index": 1, "grid": [[0, 0, 1, 1, 1, 0, 1], [1, 0, 0, 1, 1, 0, 1], [1, 0, 0, 0, 0, 1, 1], [1, 0, 0, 1, 1, 1, 0], [1, 0, 0, 1, 1, 1, 0]], "solution": 10, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5], "island_size": [0, 10]}} | largest_island |
You are given the following 8 x 9 binary matrix grid:
1 0 0 0 0 0 0 0 0
1 1 1 0 0 0 0 0 1
1 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all fo... | 6 | {"source_dataset": "largest_island", "source_index": 2, "grid": [[1, 0, 0, 0, 0, 0, 0, 0, 0], [1, 1, 1, 0, 0, 0, 0, 0, 1], [1, 1, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 1, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0]], "solution": 6, "diffic... | largest_island |
You are given the following 7 x 8 binary matrix grid:
0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0
0 1 1 0 0 0 0 0
0 1 1 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surroun... | 4 | {"source_dataset": "largest_island", "source_index": 3, "grid": [[0, 0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 1, 0, 0, 0], [0, 1, 1, 0, 0, 0, 0, 0], [0, 1, 1, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0]], "solution": 4, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_isl... | largest_island |
You are given the following 5 x 8 binary matrix grid:
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by water.
The area of an is... | 0 | {"source_dataset": "largest_island", "source_index": 4, "grid": [[0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0]], "solution": 0, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5], "island_size": [0, 10]}} | largest_island |
You are given the following 7 x 5 binary matrix grid:
0 0 0 0 0
0 0 0 0 0
0 0 1 1 1
1 1 1 1 1
1 1 1 1 0
1 1 1 0 0
0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by water.
The area of an island is th... | 15 | {"source_dataset": "largest_island", "source_index": 5, "grid": [[0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 1, 1, 1], [1, 1, 1, 1, 1], [1, 1, 1, 1, 0], [1, 1, 1, 0, 0], [0, 0, 0, 0, 0]], "solution": 15, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5], "island_size": [0, 10]}} | largest_island |
You are given the following 9 x 7 binary matrix grid:
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 1 1
0 0 0 0 1 1 0
0 0 0 0 1 1 0
0 0 0 0 0 1 0
0 0 0 0 0 1 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the gr... | 8 | {"source_dataset": "largest_island", "source_index": 6, "grid": [[0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 0, 1, 1, 0], [0, 0, 0, 0, 1, 1, 0], [0, 0, 0, 0, 0, 1, 0], [0, 0, 0, 0, 0, 1, 0]], "solution": 8, "difficulty": {"rows": [5, 10], ... | largest_island |
You are given the following 5 x 7 binary matrix grid:
0 0 1 0 0 1 1
0 0 1 1 1 1 1
0 0 0 0 1 1 1
0 0 0 0 1 1 1
0 0 0 0 0 1 1
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by water.
The area of an island is th... | 16 | {"source_dataset": "largest_island", "source_index": 7, "grid": [[0, 0, 1, 0, 0, 1, 1], [0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1]], "solution": 16, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5], "island_size": [0, 10]}} | largest_island |
You are given the following 8 x 7 binary matrix grid:
0 0 0 0 0 1 1
0 0 0 0 0 1 1
0 0 0 0 0 0 1
0 0 0 0 0 1 1
0 0 0 0 0 0 0
1 1 0 0 0 0 0
1 0 0 0 0 0 0
0 0 0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surroun... | 7 | {"source_dataset": "largest_island", "source_index": 8, "grid": [[0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 0, 0, 0, 1], [0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0]], "solution": 7, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_i... | largest_island |
You are given the following 6 x 9 binary matrix grid:
0 0 0 1 1 1 1 1 1
0 0 0 1 1 1 1 1 1
0 0 0 0 1 1 1 1 1
0 0 0 0 0 0 0 1 1
0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded ... | 19 | {"source_dataset": "largest_island", "source_index": 9, "grid": [[0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0, 0, 0]], "solution": 19, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": ... | largest_island |
You are given the following 7 x 5 binary matrix grid:
1 1 1 1 1
1 1 1 1 1
1 1 0 0 1
0 1 1 1 0
0 1 1 1 0
0 0 1 1 0
0 1 1 1 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by water.
The area of an island is th... | 24 | {"source_dataset": "largest_island", "source_index": 10, "grid": [[1, 1, 1, 1, 1], [1, 1, 1, 1, 1], [1, 1, 0, 0, 1], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 0, 1, 1, 0], [0, 1, 1, 1, 0]], "solution": 24, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5], "island_size": [0, 10]}} | largest_island |
You are given the following 9 x 6 binary matrix grid:
1 1 1 1 1 0
1 1 0 1 0 0
0 0 0 1 1 0
0 0 0 1 1 0
0 0 0 1 1 0
0 0 0 0 1 0
0 0 0 0 0 0
0 0 0 0 1 1
0 1 1 1 1 1
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded ... | 15 | {"source_dataset": "largest_island", "source_index": 11, "grid": [[1, 1, 1, 1, 1, 0], [1, 1, 0, 1, 0, 0], [0, 0, 0, 1, 1, 0], [0, 0, 0, 1, 1, 0], [0, 0, 0, 1, 1, 0], [0, 0, 0, 0, 1, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 1, 1], [0, 1, 1, 1, 1, 1]], "solution": 15, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_isl... | largest_island |
You are given the following 6 x 8 binary matrix grid:
0 0 0 0 0 0 1 1
0 0 0 0 0 1 1 1
0 0 0 0 0 1 1 1
0 0 0 1 1 1 1 0
0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by water.
T... | 13 | {"source_dataset": "largest_island", "source_index": 12, "grid": [[0, 0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1], [0, 0, 0, 1, 1, 1, 1, 0], [0, 0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0]], "solution": 13, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5], "island_s... | largest_island |
You are given the following 5 x 6 binary matrix grid:
0 0 0 0 0 0
0 0 0 0 0 0
1 1 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by water.
The area of an island is the number o... | 2 | {"source_dataset": "largest_island", "source_index": 13, "grid": [[0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0]], "solution": 2, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5], "island_size": [0, 10]}} | largest_island |
You are given the following 9 x 5 binary matrix grid:
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
1 1 1 1 0
1 1 1 0 0
1 1 1 0 1
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by water.
The are... | 10 | {"source_dataset": "largest_island", "source_index": 14, "grid": [[0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [1, 1, 1, 1, 0], [1, 1, 1, 0, 0], [1, 1, 1, 0, 1]], "solution": 10, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5], "island_size... | largest_island |
You are given the following 5 x 7 binary matrix grid:
0 0 0 0 0 0 0
0 0 0 0 0 0 0
1 0 0 0 1 1 0
1 0 0 1 1 1 1
1 0 0 1 1 1 1
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by water.
The area of an island is th... | 10 | {"source_dataset": "largest_island", "source_index": 15, "grid": [[0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 1, 1, 0], [1, 0, 0, 1, 1, 1, 1], [1, 0, 0, 1, 1, 1, 1]], "solution": 10, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5], "island_size": [0, 10]}} | largest_island |
You are given the following 9 x 6 binary matrix grid:
0 0 0 0 0 0
1 0 0 0 0 0
1 0 0 0 0 0
1 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded ... | 3 | {"source_dataset": "largest_island", "source_index": 16, "grid": [[0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0]], "solution": 3, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_isla... | largest_island |
You are given the following 6 x 5 binary matrix grid:
0 1 1 1 1
0 1 1 1 1
0 1 1 1 1
1 0 1 1 1
1 0 0 0 0
0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by water.
The area of an island is the number o... | 15 | {"source_dataset": "largest_island", "source_index": 17, "grid": [[0, 1, 1, 1, 1], [0, 1, 1, 1, 1], [0, 1, 1, 1, 1], [1, 0, 1, 1, 1], [1, 0, 0, 0, 0], [0, 0, 0, 0, 0]], "solution": 15, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5], "island_size": [0, 10]}} | largest_island |
You are given the following 7 x 7 binary matrix grid:
0 1 1 0 0 0 0
0 0 1 0 0 0 0
0 0 0 0 0 0 1
0 0 0 0 0 0 1
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by water.
... | 3 | {"source_dataset": "largest_island", "source_index": 18, "grid": [[0, 1, 1, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 1], [0, 0, 0, 0, 0, 0, 1], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0]], "solution": 3, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5], "isla... | largest_island |
You are given the following 8 x 6 binary matrix grid:
0 0 0 1 1 0
0 0 1 1 0 0
0 0 1 1 0 0
0 0 1 1 0 0
0 0 1 1 0 0
0 1 1 1 1 1
1 1 0 0 0 0
0 0 0 0 0 0
An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical).
You may assume all four edges of the grid are surrounded by water.
T... | 17 | {"source_dataset": "largest_island", "source_index": 19, "grid": [[0, 0, 0, 1, 1, 0], [0, 0, 1, 1, 0, 0], [0, 0, 1, 1, 0, 0], [0, 0, 1, 1, 0, 0], [0, 0, 1, 1, 0, 0], [0, 1, 1, 1, 1, 1], [1, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0]], "solution": 17, "difficulty": {"rows": [5, 10], "cols": [5, 10], "num_islands": [0, 5], "isla... | largest_island |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | A → A → A → A | {"source_dataset": "quantum_lock", "source_index": 0, "solution_path": ["A", "A", "A", "A"], "target_value": 8, "buttons": [{"name": "A", "type": "add", "value": 2, "active_state": "any"}, {"name": "B", "type": "add", "value": 1, "active_state": "green"}, {"name": "C", "type": "multiply", "value": 2, "active_state": "g... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | C → B → B | {"source_dataset": "quantum_lock", "source_index": 1, "solution_path": ["C", "B", "B"], "target_value": 8, "buttons": [{"name": "A", "type": "subtract", "value": 2, "active_state": "any"}, {"name": "B", "type": "multiply", "value": 2, "active_state": "any"}, {"name": "C", "type": "add", "value": 2, "active_state": "any... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | B → A → A → A → B | {"source_dataset": "quantum_lock", "source_index": 2, "solution_path": ["B", "A", "A", "A", "B"], "target_value": 27, "buttons": [{"name": "A", "type": "multiply", "value": 2, "active_state": "any"}, {"name": "B", "type": "add", "value": 3, "active_state": "any"}, {"name": "C", "type": "add", "value": 2, "active_state"... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | C → A → A → A → C | {"source_dataset": "quantum_lock", "source_index": 3, "solution_path": ["C", "A", "A", "A", "C"], "target_value": 18, "buttons": [{"name": "A", "type": "multiply", "value": 2, "active_state": "any"}, {"name": "B", "type": "subtract", "value": 2, "active_state": "green"}, {"name": "C", "type": "add", "value": 2, "active... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | C → B → C → B → C → B → C → B | {"source_dataset": "quantum_lock", "source_index": 4, "solution_path": ["C", "B", "C", "B", "C", "B", "C", "B"], "target_value": 8, "buttons": [{"name": "A", "type": "subtract", "value": 1, "active_state": "green"}, {"name": "B", "type": "add", "value": 1, "active_state": "green"}, {"name": "C", "type": "add", "value":... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | B → A → B → A → A | {"source_dataset": "quantum_lock", "source_index": 5, "solution_path": ["B", "A", "B", "A", "A"], "target_value": 24, "buttons": [{"name": "A", "type": "multiply", "value": 2, "active_state": "any"}, {"name": "B", "type": "add", "value": 2, "active_state": "any"}, {"name": "C", "type": "multiply", "value": 2, "active_s... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | A → B → A → B → A → B → A | {"source_dataset": "quantum_lock", "source_index": 6, "solution_path": ["A", "B", "A", "B", "A", "B", "A"], "target_value": 30, "buttons": [{"name": "A", "type": "add", "value": 2, "active_state": "red"}, {"name": "B", "type": "multiply", "value": 2, "active_state": "any"}, {"name": "C", "type": "add", "value": 2, "act... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | C → A → C → A → B → A → B | {"source_dataset": "quantum_lock", "source_index": 7, "solution_path": ["C", "A", "C", "A", "B", "A", "B"], "target_value": 9, "buttons": [{"name": "A", "type": "multiply", "value": 2, "active_state": "green"}, {"name": "B", "type": "subtract", "value": 1, "active_state": "any"}, {"name": "C", "type": "add", "value": 1... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | C → B → C → C | {"source_dataset": "quantum_lock", "source_index": 8, "solution_path": ["C", "B", "C", "C"], "target_value": 27, "buttons": [{"name": "A", "type": "subtract", "value": 3, "active_state": "green"}, {"name": "B", "type": "add", "value": 3, "active_state": "green"}, {"name": "C", "type": "multiply", "value": 3, "active_st... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | C → B → C → B → C → B → C | {"source_dataset": "quantum_lock", "source_index": 9, "solution_path": ["C", "B", "C", "B", "C", "B", "C"], "target_value": 14, "buttons": [{"name": "A", "type": "subtract", "value": 1, "active_state": "any"}, {"name": "B", "type": "add", "value": 1, "active_state": "green"}, {"name": "C", "type": "multiply", "value": ... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | C → A → C → A → C → A → C → A → C → B | {"source_dataset": "quantum_lock", "source_index": 10, "solution_path": ["C", "A", "C", "A", "C", "A", "C", "A", "C", "B"], "target_value": 19, "buttons": [{"name": "A", "type": "add", "value": 3, "active_state": "green"}, {"name": "B", "type": "subtract", "value": 3, "active_state": "any"}, {"name": "C", "type": "add"... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | A → A → C → A → C | {"source_dataset": "quantum_lock", "source_index": 11, "solution_path": ["A", "A", "C", "A", "C"], "target_value": 30, "buttons": [{"name": "A", "type": "add", "value": 3, "active_state": "any"}, {"name": "B", "type": "subtract", "value": 3, "active_state": "green"}, {"name": "C", "type": "multiply", "value": 2, "activ... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | C → C → B → A → C | {"source_dataset": "quantum_lock", "source_index": 12, "solution_path": ["C", "C", "B", "A", "C"], "target_value": 9, "buttons": [{"name": "A", "type": "subtract", "value": 1, "active_state": "any"}, {"name": "B", "type": "multiply", "value": 2, "active_state": "red"}, {"name": "C", "type": "add", "value": 2, "active_s... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | A → B → B → B → B | {"source_dataset": "quantum_lock", "source_index": 13, "solution_path": ["A", "B", "B", "B", "B"], "target_value": 9, "buttons": [{"name": "A", "type": "add", "value": 1, "active_state": "any"}, {"name": "B", "type": "add", "value": 2, "active_state": "any"}, {"name": "C", "type": "subtract", "value": 1, "active_state"... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | A → A → C → A → B | {"source_dataset": "quantum_lock", "source_index": 14, "solution_path": ["A", "A", "C", "A", "B"], "target_value": 28, "buttons": [{"name": "A", "type": "add", "value": 2, "active_state": "any"}, {"name": "B", "type": "multiply", "value": 2, "active_state": "any"}, {"name": "C", "type": "multiply", "value": 3, "active_... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | B → B → C | {"source_dataset": "quantum_lock", "source_index": 15, "solution_path": ["B", "B", "C"], "target_value": 8, "buttons": [{"name": "A", "type": "subtract", "value": 2, "active_state": "any"}, {"name": "B", "type": "add", "value": 2, "active_state": "any"}, {"name": "C", "type": "multiply", "value": 2, "active_state": "an... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | C → C → C → A → C → B → C → C | {"source_dataset": "quantum_lock", "source_index": 16, "solution_path": ["C", "C", "C", "A", "C", "B", "C", "C"], "target_value": 38, "buttons": [{"name": "A", "type": "multiply", "value": 3, "active_state": "green"}, {"name": "B", "type": "add", "value": 2, "active_state": "green"}, {"name": "C", "type": "add", "value... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | A → A → A → C → A → A | {"source_dataset": "quantum_lock", "source_index": 17, "solution_path": ["A", "A", "A", "C", "A", "A"], "target_value": 16, "buttons": [{"name": "A", "type": "add", "value": 2, "active_state": "any"}, {"name": "B", "type": "subtract", "value": 1, "active_state": "green"}, {"name": "C", "type": "multiply", "value": 2, "... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | A → C → C → B → B | {"source_dataset": "quantum_lock", "source_index": 18, "solution_path": ["A", "C", "C", "B", "B"], "target_value": 16, "buttons": [{"name": "A", "type": "subtract", "value": 2, "active_state": "any"}, {"name": "B", "type": "multiply", "value": 2, "active_state": "any"}, {"name": "C", "type": "add", "value": 3, "active_... | quantum_lock |
In front of you are some buttons, a light, and a number. The light will toggle between red and green whenever you press a button. Each button performs a mathematical operation to the number, but the operation may depend on the state of the light.
You must press the shortest correct sequence of buttons to reach the targ... | C → A → C → A → C → A → C → A → B | {"source_dataset": "quantum_lock", "source_index": 19, "solution_path": ["C", "A", "C", "A", "C", "A", "C", "A", "B"], "target_value": 27, "buttons": [{"name": "A", "type": "add", "value": 2, "active_state": "green"}, {"name": "B", "type": "subtract", "value": 3, "active_state": "any"}, {"name": "C", "type": "multiply"... | quantum_lock |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | up right right | {"source_dataset": "shortest_path", "source_index": 0, "matrix": [["O", "X", "X", "X", "O"], ["O", "O", "X", "X", "X"], ["O", "O", "#", "O", "O"], ["*", "X", "O", "O", "X"], ["O", "X", "X", "O", "X"]], "solution": ["up", "right", "right"], "difficulty": {"rows": [5, 8], "cols": [5, 8]}} | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | infeasible | {"source_dataset": "shortest_path", "source_index": 1, "matrix": [["#", "X", "O", "O", "O", "O", "O"], ["X", "O", "X", "O", "O", "O", "O"], ["X", "O", "O", "X", "X", "O", "O"], ["O", "O", "O", "O", "X", "X", "X"], ["O", "O", "X", "O", "O", "*", "O"]], "solution": [], "difficulty": {"rows": [5, 8], "cols": [5, 8]}} | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | infeasible | {"source_dataset": "shortest_path", "source_index": 2, "matrix": [["X", "X", "X", "X", "X"], ["X", "O", "O", "O", "X"], ["O", "#", "X", "X", "O"], ["O", "X", "X", "X", "O"], ["X", "O", "O", "X", "X"], ["O", "O", "X", "X", "X"], ["X", "O", "O", "O", "X"], ["O", "O", "O", "X", "*"]], "solution": [], "difficulty": {"rows"... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | up up left up up right | {"source_dataset": "shortest_path", "source_index": 3, "matrix": [["O", "X", "X", "X", "X", "X", "X", "X"], ["O", "X", "O", "X", "O", "O", "X", "O"], ["O", "X", "O", "O", "#", "X", "X", "O"], ["O", "X", "X", "O", "X", "X", "O", "O"], ["O", "O", "O", "O", "O", "O", "X", "O"], ["O", "X", "O", "X", "O", "O", "X", "O"], ["... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | right up up left left up up | {"source_dataset": "shortest_path", "source_index": 4, "matrix": [["X", "O", "O", "O", "#", "O", "O", "X"], ["O", "O", "X", "X", "O", "X", "X", "O"], ["O", "X", "O", "X", "O", "O", "O", "O"], ["O", "O", "X", "O", "O", "X", "O", "O"], ["O", "O", "O", "X", "X", "*", "O", "O"]], "solution": ["right", "up", "up", "left", "... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | right | {"source_dataset": "shortest_path", "source_index": 5, "matrix": [["O", "O", "X", "O", "X"], ["X", "O", "X", "X", "X"], ["O", "O", "O", "O", "O"], ["O", "X", "O", "X", "O"], ["X", "X", "O", "O", "O"], ["O", "*", "#", "O", "X"], ["X", "X", "X", "O", "X"]], "solution": ["right"], "difficulty": {"rows": [5, 8], "cols": [5... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | infeasible | {"source_dataset": "shortest_path", "source_index": 6, "matrix": [["O", "O", "O", "O", "O", "O"], ["X", "#", "O", "O", "X", "O"], ["O", "O", "O", "X", "O", "X"], ["O", "O", "X", "O", "O", "O"], ["X", "X", "X", "X", "O", "O"], ["O", "X", "O", "X", "O", "O"], ["*", "X", "X", "O", "O", "O"]], "solution": [], "difficulty":... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | down | {"source_dataset": "shortest_path", "source_index": 7, "matrix": [["O", "X", "O", "O", "X", "X", "O"], ["X", "O", "O", "O", "O", "O", "O"], ["O", "X", "X", "O", "*", "O", "X"], ["X", "O", "O", "O", "#", "O", "X"], ["O", "X", "X", "O", "X", "O", "X"]], "solution": ["down"], "difficulty": {"rows": [5, 8], "cols": [5, 8]}... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | left left up up up | {"source_dataset": "shortest_path", "source_index": 8, "matrix": [["X", "O", "O", "O", "X", "O", "X"], ["O", "O", "X", "X", "X", "X", "X"], ["O", "O", "O", "O", "X", "O", "X"], ["O", "#", "O", "O", "X", "X", "O"], ["O", "O", "X", "O", "O", "O", "X"], ["O", "O", "X", "O", "O", "O", "X"], ["O", "O", "O", "*", "O", "O", "... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | down down down down right right | {"source_dataset": "shortest_path", "source_index": 9, "matrix": [["X", "*", "O", "X", "O", "O"], ["O", "O", "O", "X", "O", "X"], ["X", "O", "X", "X", "O", "X"], ["O", "O", "X", "X", "O", "O"], ["O", "O", "O", "#", "O", "X"], ["X", "X", "X", "O", "O", "O"]], "solution": ["down", "down", "down", "down", "right", "right"... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | infeasible | {"source_dataset": "shortest_path", "source_index": 10, "matrix": [["O", "O", "O", "X", "X"], ["X", "O", "O", "O", "O"], ["O", "X", "O", "O", "X"], ["X", "O", "O", "O", "*"], ["X", "X", "O", "X", "X"], ["X", "O", "X", "#", "X"], ["O", "O", "X", "X", "O"]], "solution": [], "difficulty": {"rows": [5, 8], "cols": [5, 8]}} | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | down right right down down | {"source_dataset": "shortest_path", "source_index": 11, "matrix": [["O", "O", "O", "X", "O", "X", "O", "O"], ["O", "X", "X", "*", "X", "X", "X", "X"], ["X", "X", "O", "O", "O", "O", "O", "X"], ["X", "O", "O", "X", "O", "O", "X", "X"], ["O", "O", "O", "O", "O", "#", "X", "O"], ["X", "O", "O", "O", "O", "X", "X", "O"]], ... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | down down left down left left | {"source_dataset": "shortest_path", "source_index": 12, "matrix": [["O", "O", "O", "X", "O", "O", "X", "*"], ["O", "O", "X", "O", "O", "O", "O", "O"], ["O", "X", "X", "O", "X", "X", "O", "O"], ["X", "X", "X", "X", "#", "O", "O", "X"], ["X", "O", "O", "O", "O", "O", "X", "O"], ["X", "O", "X", "X", "X", "O", "O", "X"]], ... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | right right down down down | {"source_dataset": "shortest_path", "source_index": 13, "matrix": [["*", "O", "O", "O", "X", "X"], ["O", "O", "O", "O", "X", "O"], ["O", "O", "O", "O", "O", "X"], ["X", "O", "#", "O", "X", "X"], ["O", "O", "X", "O", "O", "X"]], "solution": ["right", "right", "down", "down", "down"], "difficulty": {"rows": [5, 8], "cols... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | right up | {"source_dataset": "shortest_path", "source_index": 14, "matrix": [["O", "X", "O", "O", "O", "X", "O", "X"], ["X", "O", "X", "O", "X", "O", "X", "O"], ["O", "X", "X", "X", "X", "X", "X", "#"], ["O", "O", "O", "O", "X", "X", "*", "O"], ["X", "O", "X", "X", "O", "O", "O", "X"]], "solution": ["right", "up"], "difficulty":... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | right up right right down | {"source_dataset": "shortest_path", "source_index": 15, "matrix": [["O", "X", "O", "O", "X", "O", "O"], ["O", "X", "O", "O", "O", "X", "O"], ["O", "O", "O", "O", "O", "O", "O"], ["*", "O", "X", "#", "O", "O", "O"], ["X", "O", "X", "O", "O", "X", "X"]], "solution": ["right", "up", "right", "right", "down"], "difficulty"... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | infeasible | {"source_dataset": "shortest_path", "source_index": 16, "matrix": [["O", "O", "X", "*", "O", "O"], ["O", "X", "O", "O", "X", "O"], ["X", "X", "O", "O", "O", "O"], ["X", "O", "O", "X", "X", "X"], ["X", "O", "X", "O", "X", "#"], ["X", "X", "O", "X", "O", "O"]], "solution": [], "difficulty": {"rows": [5, 8], "cols": [5, 8... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | up up up up up left left | {"source_dataset": "shortest_path", "source_index": 17, "matrix": [["O", "O", "#", "O", "O"], ["O", "X", "O", "X", "O"], ["O", "O", "O", "X", "O"], ["O", "O", "O", "X", "O"], ["O", "X", "X", "O", "O"], ["O", "X", "X", "O", "*"]], "solution": ["up", "up", "up", "up", "up", "left", "left"], "difficulty": {"rows": [5, 8],... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | right down down left left | {"source_dataset": "shortest_path", "source_index": 18, "matrix": [["O", "X", "O", "O", "X", "O", "O"], ["O", "O", "X", "X", "X", "O", "X"], ["O", "X", "X", "O", "*", "O", "O"], ["O", "O", "X", "X", "X", "O", "X"], ["X", "X", "O", "#", "O", "O", "X"], ["O", "X", "O", "X", "X", "O", "X"], ["O", "O", "X", "O", "X", "X", ... | shortest_path |
Your task is to find the shortest path from the start to the destination point in a grid.
The grid is represented as a matrix with the following types of cells:
- *: your starting point
- #: your destination point
- O: an open cell
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving ... | infeasible | {"source_dataset": "shortest_path", "source_index": 19, "matrix": [["O", "O", "X", "X", "O", "O"], ["X", "O", "X", "X", "O", "O"], ["*", "O", "X", "O", "X", "O"], ["X", "X", "O", "X", "O", "O"], ["O", "O", "X", "O", "X", "O"], ["X", "X", "X", "X", "X", "O"], ["O", "O", "X", "#", "X", "X"], ["O", "O", "X", "O", "O", "X"... | shortest_path |
README.md exists but content is empty.
- Downloads last month
- 7