id
int32 | category
string | images
images list | question
string | question_text
string | answer
string | difficulty
int32 | metric_info
string | initial_state
string |
|---|---|---|---|---|---|---|---|---|
201
|
campsite
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]).\n\n### Answer Format:\n[[1, 3], [3, 1], [4, 3]]\n
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\nInitial state: {"input_grid": [["X", "T", "X", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "X", "T"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T"], ["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "T", "X", "X"]], "row_constraints": [1, 0, 2, 0, 0, 0, 1], "col_constraints": [1, 0, 2, 0, 0, 1, 0]}\nX presents empty cells, T presents trees.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]). Example answer format: [[1, 3], [3, 1], [4, 3]]
|
[[1, 1], [3, 3], [3, 6], [7, 3]]
| 4
|
{'score_function': 'campsite_evaluator'}
|
{"input_grid": [["X", "T", "X", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "X", "T"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T"], ["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "T", "X", "X"]], "row_constraints": [1, 0, 2, 0, 0, 0, 1], "col_constraints": [1, 0, 2, 0, 0, 1, 0], "reference_solution": [["C", "T", "X", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "C", "T", "X", "C", "T"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T"], ["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "C", "T", "T", "X", "X"]]}
|
|
202
|
campsite
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]).\n\n### Answer Format:\n[[1, 3], [3, 1], [4, 3]]\n
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\nInitial state: {"input_grid": [["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "T", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "X", "X"], ["X", "T", "X", "X", "X", "X", "T"], ["X", "X", "X", "X", "X", "X", "X"]], "row_constraints": [1, 1, 0, 0, 1, 1, 0], "col_constraints": [1, 0, 1, 1, 0, 0, 1]}\nX presents empty cells, T presents trees.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]). Example answer format: [[1, 3], [3, 1], [4, 3]]
|
[[1, 3], [2, 1], [5, 7], [6, 4]]
| 4
|
{'score_function': 'campsite_evaluator'}
|
{"input_grid": [["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "T", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "X", "X"], ["X", "T", "X", "X", "X", "X", "T"], ["X", "X", "X", "X", "X", "X", "X"]], "row_constraints": [1, 1, 0, 0, 1, 1, 0], "col_constraints": [1, 0, 1, 1, 0, 0, 1], "reference_solution": [["T", "X", "C", "X", "X", "X", "X"], ["C", "X", "T", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "X", "C"], ["X", "T", "X", "C", "X", "X", "T"], ["X", "X", "X", "X", "X", "X", "X"]]}
|
|
203
|
campsite
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]).\n\n### Answer Format:\n[[1, 3], [3, 1], [4, 3]]\n
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\nInitial state: {"input_grid": [["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "T", "X"], ["X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"]], "row_constraints": [2, 0, 1, 1, 0, 0, 0], "col_constraints": [0, 1, 0, 2, 0, 1, 0]}\nX presents empty cells, T presents trees.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]). Example answer format: [[1, 3], [3, 1], [4, 3]]
|
[[1, 2], [1, 4], [3, 6], [4, 4]]
| 4
|
{'score_function': 'campsite_evaluator'}
|
{"input_grid": [["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "T", "X"], ["X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"]], "row_constraints": [2, 0, 1, 1, 0, 0, 0], "col_constraints": [0, 1, 0, 2, 0, 1, 0], "reference_solution": [["T", "C", "X", "C", "X", "X", "X"], ["X", "X", "X", "T", "X", "T", "X"], ["X", "X", "X", "T", "X", "C", "X"], ["X", "X", "X", "C", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"]]}
|
|
204
|
campsite
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]).\n\n### Answer Format:\n[[1, 3], [3, 1], [4, 3]]\n
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\nInitial state: {"input_grid": [["X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "T"], ["X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "T", "X"], ["T", "X", "X", "X", "X", "X", "X"]], "row_constraints": [0, 0, 0, 2, 1, 0, 1], "col_constraints": [0, 2, 0, 1, 0, 0, 1]}\nX presents empty cells, T presents trees.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]). Example answer format: [[1, 3], [3, 1], [4, 3]]
|
[[4, 2], [4, 4], [5, 7], [7, 2]]
| 4
|
{'score_function': 'campsite_evaluator'}
|
{"input_grid": [["X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "T"], ["X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "T", "X"], ["T", "X", "X", "X", "X", "X", "X"]], "row_constraints": [0, 0, 0, 2, 1, 0, 1], "col_constraints": [0, 2, 0, 1, 0, 0, 1], "reference_solution": [["X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X"], ["T", "C", "X", "C", "X", "X", "T"], ["X", "X", "X", "T", "X", "X", "C"], ["X", "X", "X", "X", "X", "T", "X"], ["T", "C", "X", "X", "X", "X", "X"]]}
|
|
205
|
campsite
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]).\n\n### Answer Format:\n[[1, 3], [3, 1], [4, 3]]\n
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\nInitial state: {"input_grid": [["T", "X", "X", "X", "X", "X", "T", "X"], ["X", "X", "X", "T", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "T"], ["T", "X", "T", "X", "X", "T", "X", "X"]], "row_constraints": [2, 0, 0, 0, 0, 1, 1, 1], "col_constraints": [0, 1, 0, 3, 0, 1, 0, 0]}\nX presents empty cells, T presents trees.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]). Example answer format: [[1, 3], [3, 1], [4, 3]]
|
[[1, 2], [1, 4], [6, 4], [7, 6], [8, 4]]
| 5
|
{'score_function': 'campsite_evaluator'}
|
{"input_grid": [["T", "X", "X", "X", "X", "X", "T", "X"], ["X", "X", "X", "T", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "T"], ["T", "X", "T", "X", "X", "T", "X", "X"]], "row_constraints": [2, 0, 0, 0, 0, 1, 1, 1], "col_constraints": [0, 1, 0, 3, 0, 1, 0, 0], "reference_solution": [["T", "C", "X", "C", "X", "X", "T", "X"], ["X", "X", "X", "T", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "X", "X", "X"], ["T", "X", "X", "C", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "C", "X", "T"], ["T", "X", "T", "C", "X", "T", "X", "X"]]}
|
|
206
|
campsite
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]).\n\n### Answer Format:\n[[1, 3], [3, 1], [4, 3]]\n
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\nInitial state: {"input_grid": [["T", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "T", "X", "X", "X"], ["X", "T", "X", "T", "X", "T", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "X", "X", "T"], ["T", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "T", "X", "X", "X", "X", "X", "T"]], "row_constraints": [1, 0, 2, 0, 0, 1, 0, 1], "col_constraints": [0, 0, 0, 1, 2, 0, 2, 0]}\nX presents empty cells, T presents trees.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]). Example answer format: [[1, 3], [3, 1], [4, 3]]
|
[[1, 5], [3, 5], [3, 7], [6, 4], [8, 7]]
| 5
|
{'score_function': 'campsite_evaluator'}
|
{"input_grid": [["T", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "T", "X", "X", "X"], ["X", "T", "X", "T", "X", "T", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "X", "X", "T"], ["T", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "T", "X", "X", "X", "X", "X", "T"]], "row_constraints": [1, 0, 2, 0, 0, 1, 0, 1], "col_constraints": [0, 0, 0, 1, 2, 0, 2, 0], "reference_solution": [["T", "X", "X", "X", "C", "X", "X", "X"], ["X", "X", "X", "X", "T", "X", "X", "X"], ["X", "T", "X", "T", "C", "T", "C", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "T", "X", "X", "X", "T"], ["T", "X", "X", "C", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "T", "X", "X", "X", "X", "C", "T"]]}
|
|
207
|
campsite
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]).\n\n### Answer Format:\n[[1, 3], [3, 1], [4, 3]]\n
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\nInitial state: {"input_grid": [["X", "X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T", "X"], ["T", "X", "T", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "T", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"]], "row_constraints": [1, 0, 1, 1, 0, 1, 0, 1], "col_constraints": [0, 0, 0, 1, 1, 3, 0, 0]}\nX presents empty cells, T presents trees.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]). Example answer format: [[1, 3], [3, 1], [4, 3]]
|
[[1, 6], [3, 6], [4, 4], [6, 6], [8, 5]]
| 5
|
{'score_function': 'campsite_evaluator'}
|
{"input_grid": [["X", "X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T", "X"], ["T", "X", "T", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "T", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"]], "row_constraints": [1, 0, 1, 1, 0, 1, 0, 1], "col_constraints": [0, 0, 0, 1, 1, 3, 0, 0], "reference_solution": [["X", "X", "X", "X", "T", "C", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "C", "T", "X"], ["T", "X", "T", "C", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "T", "X", "X"], ["X", "X", "X", "X", "X", "C", "X", "X"], ["X", "X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "C", "X", "X", "X"]]}
|
|
208
|
campsite
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]).\n\n### Answer Format:\n[[1, 3], [3, 1], [4, 3]]\n
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\nInitial state: {"input_grid": [["X", "X", "T", "X", "X", "X", "T", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T", "X"], ["T", "X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T", "X"], ["X", "X", "T", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "T"]], "row_constraints": [0, 1, 1, 1, 0, 0, 2, 0], "col_constraints": [1, 0, 0, 0, 0, 2, 1, 1]}\nX presents empty cells, T presents trees.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]). Example answer format: [[1, 3], [3, 1], [4, 3]]
|
[[2, 7], [3, 1], [4, 6], [7, 6], [7, 8]]
| 5
|
{'score_function': 'campsite_evaluator'}
|
{"input_grid": [["X", "X", "T", "X", "X", "X", "T", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T", "X"], ["T", "X", "X", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T", "X"], ["X", "X", "T", "X", "T", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "T"]], "row_constraints": [0, 1, 1, 1, 0, 0, 2, 0], "col_constraints": [1, 0, 0, 0, 0, 2, 1, 1], "reference_solution": [["X", "X", "T", "X", "X", "X", "T", "X"], ["X", "X", "X", "X", "X", "X", "C", "X"], ["C", "X", "X", "X", "X", "X", "T", "X"], ["T", "X", "X", "X", "T", "C", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T", "X"], ["X", "X", "T", "X", "T", "C", "X", "C"], ["X", "X", "X", "X", "X", "X", "X", "T"]]}
|
|
209
|
campsite
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]).\n\n### Answer Format:\n[[1, 3], [3, 1], [4, 3]]\n
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\nInitial state: {"input_grid": [["X", "X", "X", "X", "X", "T", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "T"], ["X", "X", "T", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T", "X"], ["X", "X", "X", "T", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "T", "X", "X", "T", "X", "X"], ["T", "X", "X", "X", "X", "X", "X", "X"]], "row_constraints": [1, 0, 1, 0, 1, 0, 1, 1], "col_constraints": [1, 0, 1, 0, 0, 0, 2, 1]}\nX presents empty cells, T presents trees.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]). Example answer format: [[1, 3], [3, 1], [4, 3]]
|
[[1, 7], [3, 8], [5, 7], [7, 1], [8, 3]]
| 5
|
{'score_function': 'campsite_evaluator'}
|
{"input_grid": [["X", "X", "X", "X", "X", "T", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "T"], ["X", "X", "T", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T", "X"], ["X", "X", "X", "T", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "X", "T", "X", "X", "T", "X", "X"], ["T", "X", "X", "X", "X", "X", "X", "X"]], "row_constraints": [1, 0, 1, 0, 1, 0, 1, 1], "col_constraints": [1, 0, 1, 0, 0, 0, 2, 1], "reference_solution": [["X", "X", "X", "X", "X", "T", "C", "X"], ["X", "X", "X", "X", "X", "X", "X", "T"], ["X", "X", "T", "X", "X", "X", "X", "C"], ["X", "X", "X", "X", "X", "X", "T", "X"], ["X", "X", "X", "T", "X", "X", "C", "X"], ["X", "X", "X", "X", "X", "X", "X", "X"], ["C", "X", "T", "X", "X", "T", "X", "X"], ["T", "X", "C", "X", "X", "X", "X", "X"]]}
|
|
210
|
campsite
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]).\n\n### Answer Format:\n[[1, 3], [3, 1], [4, 3]]\n
|
Solve this Campsite puzzle by placing tents adjacent to trees while adhering to the game rules.\n### Game Rules:\n1) Each tent must be orthogonally adjacent to at least one tree (up, down, left, or right).\n2) No tents can be adjacent to each other, even diagonally.\n3) The number of tents in each row and column must match the given constraints.\n\nInitial state: {"input_grid": [["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "T", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "T", "X", "X"], ["X", "X", "T", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T", "X"], ["T", "X", "X", "T", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X", "T"], ["X", "X", "X", "X", "X", "T", "X", "X"]], "row_constraints": [0, 1, 0, 1, 1, 1, 1, 0], "col_constraints": [1, 1, 1, 0, 0, 1, 0, 1]}\nX presents empty cells, T presents trees.\n\n### Coordinate System:\nReturn the coordinates where tents should be placed as a list of [row, column] pairs using 1-based indexing (e.g., top-left is [1,1]). Example answer format: [[1, 3], [3, 1], [4, 3]]
|
[[2, 3], [4, 6], [5, 1], [6, 8], [7, 2]]
| 5
|
{'score_function': 'campsite_evaluator'}
|
{"input_grid": [["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "T", "X", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "T", "X", "X"], ["X", "X", "T", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "X", "T", "X"], ["T", "X", "X", "T", "X", "X", "X", "X"], ["T", "X", "X", "X", "X", "X", "X", "T"], ["X", "X", "X", "X", "X", "T", "X", "X"]], "row_constraints": [0, 1, 0, 1, 1, 1, 1, 0], "col_constraints": [1, 1, 1, 0, 0, 1, 0, 1], "reference_solution": [["X", "X", "X", "X", "X", "X", "X", "X"], ["X", "T", "C", "X", "X", "X", "X", "X"], ["X", "X", "X", "X", "X", "T", "X", "X"], ["X", "X", "T", "X", "X", "C", "X", "X"], ["C", "X", "X", "X", "X", "X", "T", "X"], ["T", "X", "X", "T", "X", "X", "X", "C"], ["T", "C", "X", "X", "X", "X", "X", "T"], ["X", "X", "X", "X", "X", "T", "X", "X"]]}
|
|
211
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [19, 13, 1, 18, 18] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
72
| 1
|
{'score_function': 'simple_str_match'}
|
{'heights': [19, 13, 1, 18, 18]}
|
|
212
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [13, 10, 2, 18, 2, 13, 14, 20, 13] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
104
| 1
|
{'score_function': 'simple_str_match'}
|
{'heights': [13, 10, 2, 18, 2, 13, 14, 20, 13]}
|
|
213
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [7, 15, 9, 16, 2, 6, 18, 16, 12, 17] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
120
| 1
|
{'score_function': 'simple_str_match'}
|
{'heights': [7, 15, 9, 16, 2, 6, 18, 16, 12, 17]}
|
|
214
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [16, 8, 19, 13, 8, 18, 6, 16] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
112
| 1
|
{'score_function': 'simple_str_match'}
|
{'heights': [16, 8, 19, 13, 8, 18, 6, 16]}
|
|
215
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [7, 7, 6, 10, 14, 7, 2] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
35
| 1
|
{'score_function': 'simple_str_match'}
|
{'heights': [7, 7, 6, 10, 14, 7, 2]}
|
|
216
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [16, 14, 14, 11, 10, 10] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
50
| 1
|
{'score_function': 'simple_str_match'}
|
{'heights': [16, 14, 14, 11, 10, 10]}
|
|
217
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [22, 23, 18, 30, 13, 21, 2, 16, 7, 36, 23, 19, 29, 39, 11, 34, 38, 39, 26, 29] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
464
| 2
|
{'score_function': 'simple_str_match'}
|
{'heights': [22, 23, 18, 30, 13, 21, 2, 16, 7, 36, 23, 19, 29, 39, 11, 34, 38, 39, 26, 29]}
|
|
218
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [19, 3, 38, 19, 32, 28, 10, 39, 18, 38, 33, 24, 4, 33, 3, 21] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
363
| 2
|
{'score_function': 'simple_str_match'}
|
{'heights': [19, 3, 38, 19, 32, 28, 10, 39, 18, 38, 33, 24, 4, 33, 3, 21]}
|
|
219
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [39, 11, 11, 2, 11, 2, 7, 3, 1, 13, 11, 2, 18, 27, 34, 13, 38] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
608
| 2
|
{'score_function': 'simple_str_match'}
|
{'heights': [39, 11, 11, 2, 11, 2, 7, 3, 1, 13, 11, 2, 18, 27, 34, 13, 38]}
|
|
220
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [24, 36, 9, 36, 40, 29, 9, 33, 36, 21, 14, 39, 18, 2, 15, 27, 40, 34] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
544
| 2
|
{'score_function': 'simple_str_match'}
|
{'heights': [24, 36, 9, 36, 40, 29, 9, 33, 36, 21, 14, 39, 18, 2, 15, 27, 40, 34]}
|
|
221
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [40, 28, 18, 15, 28, 33, 20, 21, 40, 16, 30, 5, 16, 20, 28, 32, 38, 28, 15] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
608
| 2
|
{'score_function': 'simple_str_match'}
|
{'heights': [40, 28, 18, 15, 28, 33, 20, 21, 40, 16, 30, 5, 16, 20, 28, 32, 38, 28, 15]}
|
|
222
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [20, 17, 39, 18, 11, 28, 21, 35, 18, 25, 12, 37, 40, 21, 10, 9, 32, 12, 39] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
624
| 2
|
{'score_function': 'simple_str_match'}
|
{'heights': [20, 17, 39, 18, 11, 28, 21, 35, 18, 25, 12, 37, 40, 21, 10, 9, 32, 12, 39]}
|
|
223
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [42, 12, 31, 21, 18, 8, 2, 2, 36, 53, 44, 3, 54, 20, 52, 52, 58, 9, 50, 12, 52, 47, 5, 36, 28, 25, 35, 22, 43, 48] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
1218
| 3
|
{'score_function': 'simple_str_match'}
|
{'heights': [42, 12, 31, 21, 18, 8, 2, 2, 36, 53, 44, 3, 54, 20, 52, 52, 58, 9, 50, 12, 52, 47, 5, 36, 28, 25, 35, 22, 43, 48]}
|
|
224
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [3, 17, 11, 17, 11, 10, 1, 36, 59, 53, 58, 11, 21, 7, 24, 46, 46, 25, 49, 15, 47, 58, 56, 45, 21, 28, 31] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
784
| 3
|
{'score_function': 'simple_str_match'}
|
{'heights': [3, 17, 11, 17, 11, 10, 1, 36, 59, 53, 58, 11, 21, 7, 24, 46, 46, 25, 49, 15, 47, 58, 56, 45, 21, 28, 31]}
|
|
225
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [60, 42, 51, 32, 18, 48, 22, 39, 36, 3, 22, 26, 24, 9, 47, 51, 27, 41, 40, 59, 47, 38, 34, 28] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
1121
| 3
|
{'score_function': 'simple_str_match'}
|
{'heights': [60, 42, 51, 32, 18, 48, 22, 39, 36, 3, 22, 26, 24, 9, 47, 51, 27, 41, 40, 59, 47, 38, 34, 28]}
|
|
226
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [28, 19, 56, 9, 6, 2, 33, 10, 34, 31, 35, 28, 41, 8, 4, 60, 17, 37, 58, 45, 47, 14, 41, 37, 57] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
1232
| 3
|
{'score_function': 'simple_str_match'}
|
{'heights': [28, 19, 56, 9, 6, 2, 33, 10, 34, 31, 35, 28, 41, 8, 4, 60, 17, 37, 58, 45, 47, 14, 41, 37, 57]}
|
|
227
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [28, 14, 48, 34, 15, 46, 7, 22, 57, 47, 24, 32, 18, 53, 31, 32, 42, 10, 22, 53] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
816
| 3
|
{'score_function': 'simple_str_match'}
|
{'heights': [28, 14, 48, 34, 15, 46, 7, 22, 57, 47, 24, 32, 18, 53, 31, 32, 42, 10, 22, 53]}
|
|
228
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [32, 21, 42, 30, 45, 22, 57, 12, 36, 31, 3, 5, 4, 51, 40, 49, 10, 58, 2, 15, 28, 45, 40, 23, 58] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
1026
| 3
|
{'score_function': 'simple_str_match'}
|
{'heights': [32, 21, 42, 30, 45, 22, 57, 12, 36, 31, 3, 5, 4, 51, 40, 49, 10, 58, 2, 15, 28, 45, 40, 23, 58]}
|
|
229
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [11, 7, 75, 6, 75, 69, 69, 52, 20, 22, 43, 23, 54, 72, 69, 80, 51, 77, 53, 57, 50, 73, 1, 52, 55, 12, 6, 32, 25, 48, 35, 16, 4, 80, 54, 52, 7, 8] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
2325
| 4
|
{'score_function': 'simple_str_match'}
|
{'heights': [11, 7, 75, 6, 75, 69, 69, 52, 20, 22, 43, 23, 54, 72, 69, 80, 51, 77, 53, 57, 50, 73, 1, 52, 55, 12, 6, 32, 25, 48, 35, 16, 4, 80, 54, 52, 7, 8]}
|
|
230
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [45, 20, 50, 3, 14, 13, 36, 64, 48, 69, 17, 51, 31, 58, 45, 68, 6, 9, 68, 15, 24, 11, 77, 55, 34, 43, 60, 10, 62, 70, 26, 24, 30, 18, 11, 21, 41, 54] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
1750
| 4
|
{'score_function': 'simple_str_match'}
|
{'heights': [45, 20, 50, 3, 14, 13, 36, 64, 48, 69, 17, 51, 31, 58, 45, 68, 6, 9, 68, 15, 24, 11, 77, 55, 34, 43, 60, 10, 62, 70, 26, 24, 30, 18, 11, 21, 41, 54]}
|
|
231
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [44, 41, 55, 27, 73, 28, 51, 31, 60, 75, 59, 22, 61, 74, 67, 80, 29, 70, 2, 9, 11, 7, 63, 41, 35, 13, 45, 63, 50, 59, 13, 67, 5, 73, 43, 2, 27, 50] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
2117
| 4
|
{'score_function': 'simple_str_match'}
|
{'heights': [44, 41, 55, 27, 73, 28, 51, 31, 60, 75, 59, 22, 61, 74, 67, 80, 29, 70, 2, 9, 11, 7, 63, 41, 35, 13, 45, 63, 50, 59, 13, 67, 5, 73, 43, 2, 27, 50]}
|
|
232
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [74, 45, 60, 47, 7, 31, 51, 70, 44, 42, 57, 30, 46, 29, 78, 51, 50, 5, 49, 33, 68, 80, 33, 43, 60, 71, 26, 78, 10, 15] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
1998
| 4
|
{'score_function': 'simple_str_match'}
|
{'heights': [74, 45, 60, 47, 7, 31, 51, 70, 44, 42, 57, 30, 46, 29, 78, 51, 50, 5, 49, 33, 68, 80, 33, 43, 60, 71, 26, 78, 10, 15]}
|
|
233
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [6, 68, 24, 17, 41, 8, 16, 57, 52, 1, 55, 9, 55, 39, 15, 13, 75, 71, 29, 66, 41, 72, 55, 70, 78, 8, 46, 33, 73, 64, 23] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
1836
| 4
|
{'score_function': 'simple_str_match'}
|
{'heights': [6, 68, 24, 17, 41, 8, 16, 57, 52, 1, 55, 9, 55, 39, 15, 13, 75, 71, 29, 66, 41, 72, 55, 70, 78, 8, 46, 33, 73, 64, 23]}
|
|
234
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [50, 38, 49, 10, 45, 14, 33, 3, 43, 69, 4, 79, 39, 33, 18, 23, 77, 68, 60, 43, 21, 62, 56, 45, 47, 25, 57, 73, 26, 51, 40, 63, 40, 36, 59, 6, 62, 15, 80] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
2133
| 4
|
{'score_function': 'simple_str_match'}
|
{'heights': [50, 38, 49, 10, 45, 14, 33, 3, 43, 69, 4, 79, 39, 33, 18, 23, 77, 68, 60, 43, 21, 62, 56, 45, 47, 25, 57, 73, 26, 51, 40, 63, 40, 36, 59, 6, 62, 15, 80]}
|
|
235
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [96, 82, 93, 16, 8, 19, 82, 52, 63, 32, 41, 67, 67, 34, 87, 62, 53, 97, 96, 61, 78, 69, 1, 60, 52, 75, 2, 8, 76, 36, 66, 84, 77, 53, 98, 96, 58, 49, 38, 4, 59, 91, 62] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
3731
| 5
|
{'score_function': 'simple_str_match'}
|
{'heights': [96, 82, 93, 16, 8, 19, 82, 52, 63, 32, 41, 67, 67, 34, 87, 62, 53, 97, 96, 61, 78, 69, 1, 60, 52, 75, 2, 8, 76, 36, 66, 84, 77, 53, 98, 96, 58, 49, 38, 4, 59, 91, 62]}
|
|
236
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [20, 46, 92, 40, 10, 47, 59, 35, 59, 54, 12, 37, 12, 5, 26, 39, 22, 80, 4, 52, 1, 88, 27, 62, 41, 49, 89, 74, 87, 19, 54, 50, 100, 12, 44, 25, 74, 35, 16, 95, 27, 64, 81, 24, 64, 82, 66, 51, 61, 71, 57, 35, 18, 89, 15, 68, 58] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
4539
| 5
|
{'score_function': 'simple_str_match'}
|
{'heights': [20, 46, 92, 40, 10, 47, 59, 35, 59, 54, 12, 37, 12, 5, 26, 39, 22, 80, 4, 52, 1, 88, 27, 62, 41, 49, 89, 74, 87, 19, 54, 50, 100, 12, 44, 25, 74, 35, 16, 95, 27, 64, 81, 24, 64, 82, 66, 51, 61, 71, 57, 35, 18, 89, 15, 68, 58]}
|
|
237
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [9, 73, 23, 94, 25, 77, 89, 70, 94, 8, 44, 45, 82, 7, 72, 1, 6, 88, 29, 53, 73, 3, 61, 94, 79, 52, 48, 56, 22, 22, 33, 48, 66, 39, 93, 85, 12, 37, 36, 100, 73, 74, 93, 81, 88, 2, 3, 37, 92, 53, 25] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
4140
| 5
|
{'score_function': 'simple_str_match'}
|
{'heights': [9, 73, 23, 94, 25, 77, 89, 70, 94, 8, 44, 45, 82, 7, 72, 1, 6, 88, 29, 53, 73, 3, 61, 94, 79, 52, 48, 56, 22, 22, 33, 48, 66, 39, 93, 85, 12, 37, 36, 100, 73, 74, 93, 81, 88, 2, 3, 37, 92, 53, 25]}
|
|
238
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [70, 60, 61, 37, 79, 18, 26, 98, 68, 33, 99, 16, 76, 55, 65, 32, 61, 85, 25, 50, 6, 7, 67, 91, 95, 6, 85, 80, 84, 9, 11, 81, 3, 28, 30, 30, 67, 10, 8, 50, 78, 35, 24, 7, 46, 97, 92, 53, 54, 75, 78, 68, 25, 75, 72, 95, 56, 18, 98, 74, 68, 78, 41, 18, 5, 76] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
4998
| 5
|
{'score_function': 'simple_str_match'}
|
{'heights': [70, 60, 61, 37, 79, 18, 26, 98, 68, 33, 99, 16, 76, 55, 65, 32, 61, 85, 25, 50, 6, 7, 67, 91, 95, 6, 85, 80, 84, 9, 11, 81, 3, 28, 30, 30, 67, 10, 8, 50, 78, 35, 24, 7, 46, 97, 92, 53, 54, 75, 78, 68, 25, 75, 72, 95, 56, 18, 98, 74, 68, 78, 41, 18, 5, 76]}
|
|
239
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [100, 65, 35, 57, 76, 4, 92, 43, 59, 58, 27, 84, 37, 99, 97, 88, 16, 81, 44, 44, 12, 89, 100, 15, 57, 19, 16, 53, 95, 58, 3, 74, 52, 3, 60, 14, 2, 25, 11, 77, 38, 62, 75, 84, 24, 46, 76, 31, 36, 93, 5, 58, 100, 41, 31, 66, 38, 34, 5, 18, 50, 87] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
5307
| 5
|
{'score_function': 'simple_str_match'}
|
{'heights': [100, 65, 35, 57, 76, 4, 92, 43, 59, 58, 27, 84, 37, 99, 97, 88, 16, 81, 44, 44, 12, 89, 100, 15, 57, 19, 16, 53, 95, 58, 3, 74, 52, 3, 60, 14, 2, 25, 11, 77, 38, 62, 75, 84, 24, 46, 76, 31, 36, 93, 5, 58, 100, 41, 31, 66, 38, 34, 5, 18, 50, 87]}
|
|
240
|
ContainerWithMostWater
|
Given a row of vertical bars where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
Given a list of non-negative integers [32, 87, 44, 55, 45, 8, 87, 30, 21, 17, 23, 69, 63, 18, 47, 83, 48, 69, 94, 59, 71, 53, 85, 56, 78, 83, 35, 18, 8, 2, 20, 12, 86, 83, 97, 76, 77, 73, 13, 94, 93, 8, 27, 85, 48, 97, 61, 45, 45, 34, 52, 44, 21, 86, 43, 98, 47, 35, 13, 22, 4, 37, 74] where consecutive bars are adjacent with no gaps between them. Pick any two bars and form the sides of a water container, with the x-axis as the base. How much water can the biggest possible container hold?
|
4698
| 5
|
{'score_function': 'simple_str_match'}
|
{'heights': [32, 87, 44, 55, 45, 8, 87, 30, 21, 17, 23, 69, 63, 18, 47, 83, 48, 69, 94, 59, 71, 53, 85, 56, 78, 83, 35, 18, 8, 2, 20, 12, 86, 83, 97, 76, 77, 73, 13, 94, 93, 8, 27, 85, 48, 97, 61, 45, 45, 34, 52, 44, 21, 86, 43, 98, 47, 35, 13, 22, 4, 37, 74]}
|
|
241
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [4, 4, 4, 4, 6, 7, 7]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
0
| 1
|
{'score_function': 'simple_str_match'}
|
{'terrain': [4, 4, 4, 4, 6, 7, 7]}
|
|
242
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [2, 2, 4, 4, 4, 4, 4, 5, 5]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
0
| 1
|
{'score_function': 'simple_str_match'}
|
{'terrain': [2, 2, 4, 4, 4, 4, 4, 5, 5]}
|
|
243
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [1, 3, 3, 2, 2, 2, 4]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
2
| 1
|
{'score_function': 'simple_str_match'}
|
{'terrain': [1, 3, 3, 2, 2, 2, 4]}
|
|
244
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [3, 3, 4, 3, 5, 5, 7, 7, 5]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
3
| 1
|
{'score_function': 'simple_str_match'}
|
{'terrain': [3, 3, 4, 3, 5, 5, 7, 7, 5]}
|
|
245
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [3, 3, 5, 7, 9, 7, 6, 6]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
1
| 1
|
{'score_function': 'simple_str_match'}
|
{'terrain': [3, 3, 5, 7, 9, 7, 6, 6]}
|
|
246
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [1, 2, 2, 3, 3, 5, 6, 6]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
0
| 1
|
{'score_function': 'simple_str_match'}
|
{'terrain': [1, 2, 2, 3, 3, 5, 6, 6]}
|
|
247
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [3, 5, 5, 5, 5, 7, 8, 8, 8, 10, 12]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
0
| 2
|
{'score_function': 'simple_str_match'}
|
{'terrain': [3, 5, 5, 5, 5, 7, 8, 8, 8, 10, 12]}
|
|
248
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [3, 3, 5, 5, 5, 3, 5, 5, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
3
| 2
|
{'score_function': 'simple_str_match'}
|
{'terrain': [3, 3, 5, 5, 5, 3, 5, 5, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4]}
|
|
249
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [2, 3, 4, 4, 4, 6, 6, 6, 7, 8]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
0
| 2
|
{'score_function': 'simple_str_match'}
|
{'terrain': [2, 3, 4, 4, 4, 6, 6, 6, 7, 8]}
|
|
250
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [1, 1, 3, 4, 4, 4, 4, 2, 4, 6, 6, 7, 8, 8, 8, 6, 8, 8, 6]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
5
| 2
|
{'score_function': 'simple_str_match'}
|
{'terrain': [1, 1, 3, 4, 4, 4, 4, 2, 4, 6, 6, 7, 8, 8, 8, 6, 8, 8, 6]}
|
|
251
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [1, 1, 3, 3, 3, 4, 6, 6, 8, 8, 6, 4, 6]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
2
| 2
|
{'score_function': 'simple_str_match'}
|
{'terrain': [1, 1, 3, 3, 3, 4, 6, 6, 8, 8, 6, 4, 6]}
|
|
252
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [2, 2, 2, 3, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 4, 6, 6]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
4
| 2
|
{'score_function': 'simple_str_match'}
|
{'terrain': [2, 2, 2, 3, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 4, 6, 6]}
|
|
253
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [16, 26, 15, 15, 34, 12, 52, 11, 39, 25, 22, 8, 44, 24, 44, 48, 48, 7, 7, 7, 45]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
12
| 3
|
{'score_function': 'simple_str_match'}
|
{'terrain': [16, 26, 15, 15, 34, 12, 52, 11, 39, 25, 22, 8, 44, 24, 44, 48, 48, 7, 7, 7, 45]}
|
|
254
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [26, 47, 57, 2, 53, 54, 57, 55, 4, 17, 3, 38, 33, 1, 1, 1, 1, 32, 17, 30, 54, 55, 38, 24, 33, 16, 31, 8, 32, 56]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
16
| 3
|
{'score_function': 'simple_str_match'}
|
{'terrain': [26, 47, 57, 2, 53, 54, 57, 55, 4, 17, 3, 38, 33, 1, 1, 1, 1, 32, 17, 30, 54, 55, 38, 24, 33, 16, 31, 8, 32, 56]}
|
|
255
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [2, 22, 28, 28, 7, 37, 30, 43, 35, 51, 35, 44, 27, 27, 60, 59, 56, 59, 20, 9, 21, 4, 25, 29, 43, 47, 12]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
17
| 3
|
{'score_function': 'simple_str_match'}
|
{'terrain': [2, 22, 28, 28, 7, 37, 30, 43, 35, 51, 35, 44, 27, 27, 60, 59, 56, 59, 20, 9, 21, 4, 25, 29, 43, 47, 12]}
|
|
256
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [45, 3, 2, 30, 30, 44, 25, 36, 22, 22, 23, 18, 14, 55, 56, 57, 56, 34, 26, 20, 43, 43, 27, 29, 22, 58]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
13
| 3
|
{'score_function': 'simple_str_match'}
|
{'terrain': [45, 3, 2, 30, 30, 44, 25, 36, 22, 22, 23, 18, 14, 55, 56, 57, 56, 34, 26, 20, 43, 43, 27, 29, 22, 58]}
|
|
257
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [32, 32, 32, 35, 56, 2, 31, 54, 47, 12, 26, 36, 56, 21, 24, 49, 38, 50, 16, 22, 31, 34]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
10
| 3
|
{'score_function': 'simple_str_match'}
|
{'terrain': [32, 32, 32, 35, 56, 2, 31, 54, 47, 12, 26, 36, 56, 21, 24, 49, 38, 50, 16, 22, 31, 34]}
|
|
258
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [25, 44, 13, 60, 51, 51, 51, 51, 15, 57, 37, 23, 13, 41, 16, 57, 8, 45, 18, 5, 46, 25]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
13
| 3
|
{'score_function': 'simple_str_match'}
|
{'terrain': [25, 44, 13, 60, 51, 51, 51, 51, 15, 57, 37, 23, 13, 41, 16, 57, 8, 45, 18, 5, 46, 25]}
|
|
259
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [66, 51, 70, 40, 22, 3, 61, 71, 27, 3, 4, 34, 6, 78, 14, 38, 48, 36, 60, 55, 26, 6, 44, 39, 11, 23, 37, 16, 28, 39, 68, 57, 50, 4, 35, 9, 9, 9]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
20
| 4
|
{'score_function': 'simple_str_match'}
|
{'terrain': [66, 51, 70, 40, 22, 3, 61, 71, 27, 3, 4, 34, 6, 78, 14, 38, 48, 36, 60, 55, 26, 6, 44, 39, 11, 23, 37, 16, 28, 39, 68, 57, 50, 4, 35, 9, 9, 9]}
|
|
260
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [9, 20, 48, 56, 73, 78, 33, 73, 3, 36, 52, 51, 72, 72, 76, 76, 35, 22, 78, 11, 23, 36, 46, 40, 78, 78, 40, 28, 66, 18, 2, 75, 19, 19, 66, 6, 6, 6, 6]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
19
| 4
|
{'score_function': 'simple_str_match'}
|
{'terrain': [9, 20, 48, 56, 73, 78, 33, 73, 3, 36, 52, 51, 72, 72, 76, 76, 35, 22, 78, 11, 23, 36, 46, 40, 78, 78, 40, 28, 66, 18, 2, 75, 19, 19, 66, 6, 6, 6, 6]}
|
|
261
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [8, 11, 39, 36, 50, 57, 48, 64, 62, 36, 46, 30, 67, 30, 5, 77, 60, 60, 60, 16, 67, 3, 54, 65, 14, 58, 69, 25, 8, 50, 62, 44, 6, 31, 7]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
21
| 4
|
{'score_function': 'simple_str_match'}
|
{'terrain': [8, 11, 39, 36, 50, 57, 48, 64, 62, 36, 46, 30, 67, 30, 5, 77, 60, 60, 60, 16, 67, 3, 54, 65, 14, 58, 69, 25, 8, 50, 62, 44, 6, 31, 7]}
|
|
262
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [23, 31, 27, 72, 50, 79, 42, 44, 4, 34, 58, 76, 76, 76, 12, 50, 59, 77, 59, 56, 72, 72, 72, 72, 23, 23, 23, 26, 43, 63, 10, 75]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
16
| 4
|
{'score_function': 'simple_str_match'}
|
{'terrain': [23, 31, 27, 72, 50, 79, 42, 44, 4, 34, 58, 76, 76, 76, 12, 50, 59, 77, 59, 56, 72, 72, 72, 72, 23, 23, 23, 26, 43, 63, 10, 75]}
|
|
263
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [80, 24, 15, 21, 51, 57, 62, 22, 68, 39, 29, 49, 74, 79, 72, 66, 66, 43, 3, 24, 14, 26, 28, 28, 28, 28, 27, 34, 57, 72, 45, 25, 66, 76, 38, 32, 53, 13, 49, 48]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
18
| 4
|
{'score_function': 'simple_str_match'}
|
{'terrain': [80, 24, 15, 21, 51, 57, 62, 22, 68, 39, 29, 49, 74, 79, 72, 66, 66, 43, 3, 24, 14, 26, 28, 28, 28, 28, 27, 34, 57, 72, 45, 25, 66, 76, 38, 32, 53, 13, 49, 48]}
|
|
264
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [64, 5, 14, 61, 71, 66, 29, 12, 12, 53, 48, 27, 59, 46, 64, 56, 42, 42, 42, 42, 80, 39, 76, 41, 32, 31, 6, 65, 49, 73, 16, 5, 30, 23, 66, 71]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
19
| 4
|
{'score_function': 'simple_str_match'}
|
{'terrain': [64, 5, 14, 61, 71, 66, 29, 12, 12, 53, 48, 27, 59, 46, 64, 56, 42, 42, 42, 42, 80, 39, 76, 41, 32, 31, 6, 65, 49, 73, 16, 5, 30, 23, 66, 71]}
|
|
265
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [3, 10, 49, 34, 44, 60, 99, 57, 70, 22, 22, 45, 65, 26, 99, 31, 58, 69, 30, 31, 52, 81, 40, 71, 58, 98, 16, 85, 62, 4, 39, 29, 40, 17, 19, 70, 57, 69, 85, 5, 47, 60, 11, 89, 23, 49, 44, 12, 6, 88, 24, 51, 51, 2, 59, 40, 100, 31, 59, 24, 81, 88, 97]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
44
| 5
|
{'score_function': 'simple_str_match'}
|
{'terrain': [3, 10, 49, 34, 44, 60, 99, 57, 70, 22, 22, 45, 65, 26, 99, 31, 58, 69, 30, 31, 52, 81, 40, 71, 58, 98, 16, 85, 62, 4, 39, 29, 40, 17, 19, 70, 57, 69, 85, 5, 47, 60, 11, 89, 23, 49, 44, 12, 6, 88, 24, 51, 51, 2, 59, 40, 100, 31, 59, 24, 81, 88, 97]}
|
|
266
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [16, 1, 75, 73, 6, 58, 27, 91, 61, 47, 82, 64, 64, 64, 64, 98, 98, 59, 69, 73, 20, 82, 44, 96, 5, 74, 46, 75, 97, 29, 19, 24, 62, 93, 75, 12, 80, 8, 29, 41, 86, 75, 18, 46, 46, 46, 46, 84, 83, 60, 50, 72, 20, 14, 10, 89, 43]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
32
| 5
|
{'score_function': 'simple_str_match'}
|
{'terrain': [16, 1, 75, 73, 6, 58, 27, 91, 61, 47, 82, 64, 64, 64, 64, 98, 98, 59, 69, 73, 20, 82, 44, 96, 5, 74, 46, 75, 97, 29, 19, 24, 62, 93, 75, 12, 80, 8, 29, 41, 86, 75, 18, 46, 46, 46, 46, 84, 83, 60, 50, 72, 20, 14, 10, 89, 43]}
|
|
267
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [88, 29, 6, 50, 100, 76, 22, 73, 60, 29, 39, 32, 83, 26, 28, 20, 65, 74, 52, 10, 6, 36, 21, 4, 34, 52, 17, 86, 68, 47, 52, 52, 82, 24, 4, 75, 46, 88, 92, 100, 56, 56, 5, 85, 49, 2, 45, 3, 19, 93, 23, 35, 53, 53, 3, 69, 69, 69, 21, 21, 86]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
35
| 5
|
{'score_function': 'simple_str_match'}
|
{'terrain': [88, 29, 6, 50, 100, 76, 22, 73, 60, 29, 39, 32, 83, 26, 28, 20, 65, 74, 52, 10, 6, 36, 21, 4, 34, 52, 17, 86, 68, 47, 52, 52, 82, 24, 4, 75, 46, 88, 92, 100, 56, 56, 5, 85, 49, 2, 45, 3, 19, 93, 23, 35, 53, 53, 3, 69, 69, 69, 21, 21, 86]}
|
|
268
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [56, 78, 40, 8, 41, 74, 55, 84, 85, 14, 12, 73, 73, 73, 93, 97, 14, 66, 34, 39, 45, 97, 64, 19, 15, 68, 68, 68, 68, 76, 67, 17, 58, 10, 76, 5, 90, 62, 95, 56, 81, 99, 8, 29, 51, 80, 6, 47, 96, 41, 8, 97, 48, 59, 39, 39, 39, 39, 11]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
31
| 5
|
{'score_function': 'simple_str_match'}
|
{'terrain': [56, 78, 40, 8, 41, 74, 55, 84, 85, 14, 12, 73, 73, 73, 93, 97, 14, 66, 34, 39, 45, 97, 64, 19, 15, 68, 68, 68, 68, 76, 67, 17, 58, 10, 76, 5, 90, 62, 95, 56, 81, 99, 8, 29, 51, 80, 6, 47, 96, 41, 8, 97, 48, 59, 39, 39, 39, 39, 11]}
|
|
269
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [15, 86, 48, 78, 100, 79, 40, 34, 87, 12, 93, 75, 41, 63, 15, 54, 4, 29, 91, 63, 85, 85, 42, 46, 1, 68, 38, 81, 44, 49, 1, 72, 78, 92, 78, 86, 29, 29, 29, 31, 61, 62, 56, 93, 24, 32, 5, 42, 23, 57, 44, 24, 48, 38, 39]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
40
| 5
|
{'score_function': 'simple_str_match'}
|
{'terrain': [15, 86, 48, 78, 100, 79, 40, 34, 87, 12, 93, 75, 41, 63, 15, 54, 4, 29, 91, 63, 85, 85, 42, 46, 1, 68, 38, 81, 44, 49, 1, 72, 78, 92, 78, 86, 29, 29, 29, 31, 61, 62, 56, 93, 24, 32, 5, 42, 23, 57, 44, 24, 48, 38, 39]}
|
|
270
|
CountHillsAndValleys
|
Here is a terrain made of bars. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
Given a terrain represented by the integer array [68, 42, 25, 80, 75, 43, 73, 28, 77, 97, 4, 97, 52, 42, 54, 29, 79, 28, 74, 98, 97, 98, 24, 38, 50, 87, 53, 70, 57, 60, 79, 24, 67, 62, 59, 21, 21, 64, 20, 59, 38, 99, 23, 81, 10, 8, 39, 5, 60, 21, 100, 83, 8, 8, 67, 53, 92, 48, 99, 91, 90, 84, 12, 32, 52, 44]. Hill: A flat or raised area where the land right before it is lower, and the land right after it is lower too. Valley: A flat or dipped area where the land right before is higher, and the land right after is higher too. Neighboring bars with the same height count as part of the same hill/valley. Calculate the sum number of hills and valleys. Please provide with an integer.
|
46
| 5
|
{'score_function': 'simple_str_match'}
|
{'terrain': [68, 42, 25, 80, 75, 43, 73, 28, 77, 97, 4, 97, 52, 42, 54, 29, 79, 28, 74, 98, 97, 98, 24, 38, 50, 87, 53, 70, 57, 60, 79, 24, 67, 62, 59, 21, 21, 64, 20, 59, 38, 99, 23, 81, 10, 8, 39, 5, 60, 21, 100, 83, 8, 8, 67, 53, 92, 48, 99, 91, 90, 84, 12, 32, 52, 44]}
|
|
271
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: CDA+FBA=GEAF Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 8, 'B': 2, 'C': 4, 'D': 5, 'E': 0, 'F': 6, 'G': 1}
| 1
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'CDA+FBA=GEAF'}
|
|
272
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: AFD+CED=BDAD Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 8, 'B': 1, 'C': 2, 'D': 0, 'E': 3, 'F': 5}
| 1
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'AFD+CED=BDAD'}
|
|
273
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: BEB+AED=ECAA Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 3, 'B': 7, 'C': 0, 'D': 6, 'E': 1}
| 1
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'BEB+AED=ECAA'}
|
|
274
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: DFA+BDF=EBFC Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 4, 'B': 7, 'C': 0, 'D': 9, 'E': 1, 'F': 6}
| 1
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'DFA+BDF=EBFC'}
|
|
275
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: CCA+FFE=EFDB Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 6, 'B': 7, 'C': 9, 'D': 2, 'E': 1, 'F': 3}
| 1
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'CCA+FFE=EFDB'}
|
|
276
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: DAB+BEA=CDCC Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 2, 'B': 9, 'C': 1, 'D': 6, 'E': 8}
| 1
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'DAB+BEA=CDCC'}
|
|
277
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: BFCH+CEGA=FFDJI Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 3, 'B': 4, 'C': 7, 'D': 6, 'E': 5, 'F': 1, 'G': 0, 'H': 9, 'I': 2, 'J': 8}
| 2
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'BFCH+CEGA=FFDJI'}
|
|
278
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: GHBG+ACDA=BGEFB Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 9, 'B': 1, 'C': 6, 'D': 5, 'E': 0, 'F': 7, 'G': 2, 'H': 4}
| 2
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'GHBG+ACDA=BGEFB'}
|
|
279
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: HBBF+CDEG=BAHBH Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 4, 'B': 1, 'C': 6, 'D': 7, 'E': 0, 'F': 5, 'G': 3, 'H': 8}
| 2
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'HBBF+CDEG=BAHBH'}
|
|
280
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: DGHG+EACD=GFDHB Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 4, 'B': 6, 'C': 0, 'D': 5, 'E': 7, 'F': 2, 'G': 1, 'H': 8}
| 2
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'DGHG+EACD=GFDHB'}
|
|
281
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: EDDA+EBAC=FDBEF Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 4, 'B': 2, 'C': 7, 'D': 0, 'E': 5, 'F': 1}
| 2
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'EDDA+EBAC=FDBEF'}
|
|
282
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: ACDB+CGGE=ADAGF Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 1, 'B': 5, 'C': 8, 'D': 0, 'E': 4, 'F': 9, 'G': 3}
| 2
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'ACDB+CGGE=ADAGF'}
|
|
283
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: CAC+GGD+CAB=BFEB Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 9, 'B': 1, 'C': 3, 'D': 7, 'E': 5, 'F': 4, 'G': 6}
| 3
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'CAC+GGD+CAB=BFEB'}
|
|
284
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: DAB+FBF+FEC=CEBC Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 9, 'B': 8, 'C': 1, 'D': 5, 'E': 0, 'F': 2}
| 3
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'DAB+FBF+FEC=CEBC'}
|
|
285
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: EBE+CBF+ABE=EEFD Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 7, 'B': 2, 'C': 3, 'D': 8, 'E': 1, 'F': 6}
| 3
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'EBE+CBF+ABE=EEFD'}
|
|
286
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: CBB+ADA+FCD=EAHG Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 3, 'B': 8, 'C': 6, 'D': 9, 'E': 1, 'F': 2, 'G': 0, 'H': 5}
| 3
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'CBB+ADA+FCD=EAHG'}
|
|
287
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: GAF+BGD+EHF=FBCE Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 4, 'B': 3, 'C': 6, 'D': 0, 'E': 2, 'F': 1, 'G': 7, 'H': 5}
| 3
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'GAF+BGD+EHF=FBCE'}
|
|
288
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: HFB+GHG+BBA=EDCD Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 0, 'B': 3, 'C': 6, 'D': 8, 'E': 1, 'F': 4, 'G': 5, 'H': 9}
| 3
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'HFB+GHG+BBA=EDCD'}
|
|
289
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: FEIG+DCEI+CHAH=FECIB Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 8, 'B': 2, 'C': 3, 'D': 5, 'E': 0, 'F': 1, 'G': 6, 'H': 9, 'I': 7}
| 4
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'FEIG+DCEI+CHAH=FECIB'}
|
|
290
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: FECF+EFEG+HAFE=DACBG Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 4, 'B': 6, 'C': 5, 'D': 1, 'E': 2, 'F': 8, 'G': 7, 'H': 3}
| 4
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'FECF+EFEG+HAFE=DACBG'}
|
|
291
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: ACCD+HDBE+CDDB=GBFAG Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 8, 'B': 7, 'C': 6, 'D': 4, 'E': 0, 'F': 5, 'G': 1, 'H': 2}
| 4
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'ACCD+HDBE+CDDB=GBFAG'}
|
|
292
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: ECBD+CHFB+FAGH=FEGHE Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 3, 'B': 6, 'C': 8, 'D': 2, 'E': 5, 'F': 1, 'G': 9, 'H': 7}
| 4
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'ECBD+CHFB+FAGH=FEGHE'}
|
|
293
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: GEDD+ACHE+BFAC=BIEDD Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 5, 'B': 1, 'C': 2, 'D': 0, 'E': 8, 'F': 7, 'G': 9, 'H': 4, 'I': 6}
| 4
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'GEDD+ACHE+BFAC=BIEDD'}
|
|
294
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: BEAD+HABC+CDHG=BGAFB Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 9, 'B': 1, 'C': 6, 'D': 5, 'E': 4, 'F': 3, 'G': 0, 'H': 2}
| 4
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'BEAD+HABC+CDHG=BGAFB'}
|
|
295
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: HAAGG+BBEAA+ABFFG=GHHGCD Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 6, 'B': 3, 'C': 2, 'D': 8, 'E': 9, 'F': 5, 'G': 1, 'H': 4}
| 5
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'HAAGG+BBEAA+ABFFG=GHHGCD'}
|
|
296
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: CDHHD+GIIEF+FIBFJ=HDEAEA Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 4, 'B': 0, 'C': 5, 'D': 9, 'E': 3, 'F': 7, 'G': 6, 'H': 1, 'I': 2, 'J': 8}
| 5
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'CDHHD+GIIEF+FIBFJ=HDEAEA'}
|
|
297
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: EBCBD+IGBFF+AIBDG=AIDHHC Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 1, 'B': 2, 'C': 0, 'D': 4, 'E': 8, 'F': 7, 'G': 9, 'H': 5, 'I': 3}
| 5
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'EBCBD+IGBFF+AIBDG=AIDHHC'}
|
|
298
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: HHGHH+DFBAB+GDHGB=EHBACH Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 7, 'B': 5, 'C': 9, 'D': 6, 'E': 1, 'F': 0, 'G': 3, 'H': 8}
| 5
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'HHGHH+DFBAB+GDHGB=EHBACH'}
|
|
299
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: FFHEH+GFAFB+DAEFC=ABBGGH Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 1, 'B': 6, 'C': 4, 'D': 5, 'E': 8, 'F': 7, 'G': 3, 'H': 2}
| 5
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'FFHEH+GFAFB+DAEFC=ABBGGH'}
|
|
300
|
CryptoMath
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nDifferent letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
Solve this cryptarithmetic puzzle, where each letter represents a unique digit (0-9).\nEquation: GHBHI+EEACH+DFEEC=CBCBHG Different letters must correspond to different values, and no leading letter can be zero.\nPlease provide your answer as a list of comma-separated "letter"=number pairs.\nExample answer format: ["A"=5,"B"=3,...,"Z"=9].
|
{'A': 1, 'B': 3, 'C': 2, 'D': 7, 'E': 8, 'F': 9, 'G': 6, 'H': 4, 'I': 0}
| 5
|
{'score_function': 'cryptomath_evaluator'}
|
{'equation': 'GHBHI+EEACH+DFEEC=CBCBHG'}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.