diff_sorted_id stringclasses 105
values | problem_statement stringlengths 778 1.74k | problem_type stringclasses 11
values | problem_category stringclasses 5
values | relative_diff_score stringclasses 35
values | opt_solution stringlengths 24 474 | opt_solution_cost stringlengths 1 4 | opt_solution_compute_t stringlengths 14 20 | solution_depth stringclasses 40
values | max_successor_states stringclasses 51
values | num_vars_per_state stringclasses 47
values | is_feasible_args stringlengths 43 1.24k | is_correct_args stringlengths 43 1.26k | A*_args stringlengths 46 1.27k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
104 | In the 'taxed coin exchange' problem, you are required to choose a subset of coins from this list [18, 23, 23, 36, 27, 10, 25, 14, 6, 43, 6, 31, 5, 43, 3, 13, 16, 8, 11, 6, 39, 44, 41, 28, 12, 8, 1, 14, 22, 23, 11, 24, 37, 9, 2, 31, 27, 10, 9, 38, 37, 4, 4, 17, 18, 36, 18, 32, 3, 12, 4, 42, 8, 4, 4, 16, 30, 40, 13, 41]... | coin_exchange | subset_sum | 34 | [42, 38, 12, 23, 23, 39, 36, 18, 12, 23, 18, 10, 13, 13, 43, 36, 18, 14, 10] | 69 | 0.11116838455200195 | 19 | 60 | 60 | [[18, 23, 23, 36, 27, 10, 25, 14, 6, 43, 6, 31, 5, 43, 3, 13, 16, 8, 11, 6, 39, 44, 41, 28, 12, 8, 1, 14, 22, 23, 11, 24, 37, 9, 2, 31, 27, 10, 9, 38, 37, 4, 4, 17, 18, 36, 18, 32, 3, 12, 4, 42, 8, 4, 4, 16, 30, 40, 13, 41]] | [[18, 23, 23, 36, 27, 10, 25, 14, 6, 43, 6, 31, 5, 43, 3, 13, 16, 8, 11, 6, 39, 44, 41, 28, 12, 8, 1, 14, 22, 23, 11, 24, 37, 9, 2, 31, 27, 10, 9, 38, 37, 4, 4, 17, 18, 36, 18, 32, 3, 12, 4, 42, 8, 4, 4, 16, 30, 40, 13, 41], {"6": 4, "18": 3, "38": 1, "23": 2, "16": 8, "12": 2, "4": 2, "24": 13, "28": 17, "30": 17, "1"... | ["[18, 23, 23, 36, 27, 10, 25, 14, 6, 43, 6, 31, 5, 43, 3, 13, 16, 8, 11, 6, 39, 44, 41, 28, 12, 8, 1, 14, 22, 23, 11, 24, 37, 9, 2, 31, 27, 10, 9, 38, 37, 4, 4, 17, 18, 36, 18, 32, 3, 12, 4, 42, 8, 4, 4, 16, 30, 40, 13, 41]", "{6: 4, 18: 3, 38: 1, 23: 2, 16: 8, 12: 2, 4: 2, 24: 13, 28: 17, 30: 17, 1: 1, 9: 9, 27: 8, 1... |
104 | In the magic square problem, a 4x4 grid is filled with unique integers ranging from 36 to 92. Some numbers are already given, while others are unknown and represented as 'x'. The sums of columns must be None, 300, 191, None for columns 1 to 2 respectively, and the sums of rows must be None, 214, 240, None for rows 1 to... | magic_square | underdetermined_system | 10 | [[0, 0, 38], [0, 2, 36], [0, 3, 39], [1, 0, 41], [1, 2, 37], [1, 3, 74], [2, 0, 42], [2, 3, 76], [3, 0, 91]] | 972 | 599.0436754226685 | 9 | 36 | 16 | ["[['', '69', '', ''], ['', '62', '', ''], ['', '82', '40', ''], ['', '87', '78', '80']]", 4, 36, 92] | ["[['', '69', '', ''], ['', '62', '', ''], ['', '82', '40', ''], ['', '87', '78', '80']]", 36, 92, [1, 3], [1, 3], [300, 191], [214, 240], 249] | ["[['', '69', '', ''], ['', '62', '', ''], ['', '82', '40', ''], ['', '87', '78', '80']]", "36", "92", "[None, 300, 191, None]", "[None, 214, 240, None]", "249"] |
104 | Using the provided matrix map of a city, where numbers represent travel time in minutes (all numbers are positive integers) and 'x' marks closed workshops, find the quickest route for Ben to travel from his current workshop at index (7, 2) to his destination workshop at index (4, 14), indexing from 0. Ben's car can mov... | traffic | pathfinding | 7 | [[7, 2], [7, 3], [7, 4], [7, 5], [8, 5], [8, 6], [8, 7], [9, 7], [9, 8], [9, 9], [8, 9], [8, 10], [8, 11], [8, 12], [7, 12], [6, 12], [5, 12], [5, 13], [5, 14], [4, 14]] | 158 | 0.03071141242980957 | 20 | 4 | 4 | [[["x", "x", "7", "18", "11", "4", "9", "x", "15", "x", "x", "x", "1", "x", "x"], ["x", "x", "14", "x", "10", "x", "x", "x", "8", "x", "x", "16", "1", "x", "x"], ["17", "17", "x", "x", "x", "x", "x", "7", "6", "12", "x", "x", "x", "7", "x"], ["x", "x", "x", "x", "10", "x", "x", "18", "1", "11", "4", "x", "13", "10", "1... | [[["x", "x", "7", "18", "11", "4", "9", "x", "15", "x", "x", "x", "1", "x", "x"], ["x", "x", "14", "x", "10", "x", "x", "x", "8", "x", "x", "16", "1", "x", "x"], ["17", "17", "x", "x", "x", "x", "x", "7", "6", "12", "x", "x", "x", "7", "x"], ["x", "x", "x", "x", "10", "x", "x", "18", "1", "11", "4", "x", "13", "10", "1... | ["[['x', 'x', '7', '18', '11', '4', '9', 'x', '15', 'x', 'x', 'x', '1', 'x', 'x'], ['x', 'x', '14', 'x', '10', 'x', 'x', 'x', '8', 'x', 'x', '16', '1', 'x', 'x'], ['17', '17', 'x', 'x', 'x', 'x', 'x', '7', '6', '12', 'x', 'x', 'x', '7', 'x'], ['x', 'x', 'x', 'x', '10', 'x', 'x', '18', '1', '11', '4', 'x', '13', '10', '... |
104 | Alex is at a trampoline park with a grid of mini trampolines, arranged in a square of 15x15. Some trampolines are broken and unusable. A map of the park is provided below, with 1 indicating a broken trampoline and 0 indicating a functional one. Alex can jump to any of the eight adjacent trampolines, as long as they are... | trampoline_matrix | pathfinding | 15 | [[14, 1], [13, 1], [12, 1], [11, 2], [10, 2], [9, 2], [9, 3], [8, 3], [8, 4], [7, 5], [6, 6], [5, 6], [5, 7], [4, 7], [4, 8], [3, 9], [2, 10]] | 17 | 0.026737689971923828 | 17 | 8 | 2 | ["[[0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1], [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0], [1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1], [1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1], [0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1], [1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1... | ["[[0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1], [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0], [1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1], [1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1], [0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1], [1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1... | ["[[0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1], [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0], [1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1], [1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1], [0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1], [1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1... |
105 | In the 'taxed coin exchange' problem, you are required to choose a subset of coins from this list [26, 8, 34, 12, 20, 21, 35, 13, 28, 5, 16, 11, 24, 42, 16, 12, 34, 21, 27, 27, 20, 47, 9, 12, 38, 23, 43, 33, 26, 22, 38, 42, 20, 41, 47, 41, 24, 46, 35, 42, 9, 35, 13, 45, 24, 29, 45, 2, 41, 39, 24, 38, 39, 18, 5, 8, 36],... | coin_exchange | subset_sum | 35 | [46, 34, 16, 23, 16, 35, 41, 41, 41, 43, 42, 45, 34, 20] | 58 | 0.04893088340759277 | 14 | 57 | 57 | [[26, 8, 34, 12, 20, 21, 35, 13, 28, 5, 16, 11, 24, 42, 16, 12, 34, 21, 27, 27, 20, 47, 9, 12, 38, 23, 43, 33, 26, 22, 38, 42, 20, 41, 47, 41, 24, 46, 35, 42, 9, 35, 13, 45, 24, 29, 45, 2, 41, 39, 24, 38, 39, 18, 5, 8, 36]] | [[26, 8, 34, 12, 20, 21, 35, 13, 28, 5, 16, 11, 24, 42, 16, 12, 34, 21, 27, 27, 20, 47, 9, 12, 38, 23, 43, 33, 26, 22, 38, 42, 20, 41, 47, 41, 24, 46, 35, 42, 9, 35, 13, 45, 24, 29, 45, 2, 41, 39, 24, 38, 39, 18, 5, 8, 36], {"12": 8, "18": 6, "42": 8, "11": 9, "38": 13, "9": 9, "24": 15, "34": 1, "20": 5, "2": 2, "23":... | ["[26, 8, 34, 12, 20, 21, 35, 13, 28, 5, 16, 11, 24, 42, 16, 12, 34, 21, 27, 27, 20, 47, 9, 12, 38, 23, 43, 33, 26, 22, 38, 42, 20, 41, 47, 41, 24, 46, 35, 42, 9, 35, 13, 45, 24, 29, 45, 2, 41, 39, 24, 38, 39, 18, 5, 8, 36]", "{12: 8, 18: 6, 42: 8, 11: 9, 38: 13, 9: 9, 24: 15, 34: 1, 20: 5, 2: 2, 23: 2, 33: 12, 27: 8, ... |
105 | Using the provided matrix map of a city, where numbers represent travel time in minutes (all numbers are positive integers) and 'x' marks closed workshops, find the quickest route for Ben to travel from his current workshop at index (1, 11) to his destination workshop at index (7, 2), indexing from 0. Ben's car can mov... | traffic | pathfinding | 7 | [[1, 11], [1, 10], [1, 9], [1, 8], [1, 7], [2, 7], [3, 7], [3, 6], [3, 5], [4, 5], [4, 4], [4, 3], [5, 3], [5, 2], [6, 2], [7, 2], [8, 2], [9, 2], [10, 2], [9, 2], [8, 2], [7, 2]] | 147 | 0.028675556182861328 | 22 | 4 | 4 | [[["18", "15", "x", "x", "1", "x", "x", "5", "8", "18", "18", "2", "x", "11", "8"], ["x", "17", "x", "x", "2", "x", "16", "9", "7", "13", "16", "17", "x", "x", "x"], ["10", "x", "1", "14", "1", "10", "15", "4", "x", "x", "8", "11", "10", "x", "x"], ["19", "x", "x", "9", "8", "18", "5", "2", "12", "x", "13", "x", "x", "... | [[["18", "15", "x", "x", "1", "x", "x", "5", "8", "18", "18", "2", "x", "11", "8"], ["x", "17", "x", "x", "2", "x", "16", "9", "7", "13", "16", "17", "x", "x", "x"], ["10", "x", "1", "14", "1", "10", "15", "4", "x", "x", "8", "11", "10", "x", "x"], ["19", "x", "x", "9", "8", "18", "5", "2", "12", "x", "13", "x", "x", "... | ["[['18', '15', 'x', 'x', '1', 'x', 'x', '5', '8', '18', '18', '2', 'x', '11', '8'], ['x', '17', 'x', 'x', '2', 'x', '16', '9', '7', '13', '16', '17', 'x', 'x', 'x'], ['10', 'x', '1', '14', '1', '10', '15', '4', 'x', 'x', '8', '11', '10', 'x', 'x'], ['19', 'x', 'x', '9', '8', '18', '5', '2', '12', 'x', '13', 'x', 'x', ... |
105 | Alex is at a trampoline park with a grid of mini trampolines, arranged in a square of 15x15. Some trampolines are broken and unusable. A map of the park is provided below, with 1 indicating a broken trampoline and 0 indicating a functional one. Alex can jump to any of the eight adjacent trampolines, as long as they are... | trampoline_matrix | pathfinding | 15 | [[12, 2], [11, 3], [10, 3], [9, 3], [8, 3], [7, 3], [6, 4], [6, 5], [6, 6], [6, 7], [5, 8], [4, 9], [4, 10], [4, 11], [3, 12], [3, 13]] | 16 | 0.03443431854248047 | 16 | 8 | 2 | ["[[1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0], [1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], [0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0], [1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0], [1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0... | ["[[1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0], [1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], [0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0], [1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0], [1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0... | ["[[1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0], [1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], [0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0], [1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0], [1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.